{"entities":{"Q6528295":{"pageid":14139356,"ns":120,"title":"Item:Q6528295","lastrevid":95471435,"modified":"2026-06-05T09:06:39Z","type":"item","id":"Q6528295","labels":{"en":{"language":"en","value":"Piercing independent sets in graphs without large induced matching"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$B8F76B0B-7B3E-44D1-B78A-CE1B7817D939","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"dcd960a0afada44134ddca707d1052808a90ee3f","datavalue":{"value":{"text":"Piercing independent sets in graphs without large induced matching","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6528295$573C77D9-5288-4871-9117-F053EDA813EA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"848d7b23f636f25b1364dc6894d7451fcdc55fa4","datavalue":{"value":{"entity-type":"item","numeric-id":2166276,"id":"Q2166276"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$C4581C0C-0FE1-4988-B95F-BEBFD55B26AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a467aa0e5704f4adb6058367c833b7cfb2e4dc19","datavalue":{"value":{"entity-type":"item","numeric-id":244698,"id":"Q244698"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$71F62931-AA2F-4041-87DF-8255DA9D5114","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2a83b3aaa6c9cf5fe6b74654f8aca3b44e9c3d9","datavalue":{"value":{"entity-type":"item","numeric-id":944610,"id":"Q944610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$73A88A46-B6A9-4FD4-8667-F5C18A6B033F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6b1ae2151f52dfdc20e1759df9fb293f19110899","datavalue":{"value":{"entity-type":"item","numeric-id":349066,"id":"Q349066"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$442EEA70-13BF-4606-9664-AB81F26D24BC","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6528295$7A216423-0AF6-4BEA-88BE-4A1485EB2FAB","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"8b081d0377158dc704d805b6bccb69fb57b08ba9","datavalue":{"value":"2403.19737","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6528295$CAFAC5FC-D0E4-49AF-8949-73199FF7D967","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Piercing independent sets in graphs without large induced matching (scientific article from arXiv)","badges":[]}}}}}