{"entities":{"Q7167390":{"pageid":22120083,"ns":120,"title":"Item:Q7167390","lastrevid":107269751,"modified":"2026-10-23T12:53:41Z","type":"item","id":"Q7167390","labels":{"en":{"language":"en","value":"An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7167390$33851116-D711-4AA8-98E6-9989E6B8E32B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7167390$E1934C10-2013-492B-88D6-C5AB134AA6FF","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"7a6ff9bdfc6691828530e2464725b35f91b3782d","datavalue":{"value":"2502.11814","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7167390$30B60E68-552E-47C9-82F3-BDB00F02DF1A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"73be4ba64c7186091b963690f28c70ce3e5a3792","datavalue":{"value":{"entity-type":"item","numeric-id":294013,"id":"Q294013"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7167390$F2513EAE-D5BF-4A00-9777-5725EB182D04","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"de74790d0a3d019d241f554558aadad8b04a78c3","datavalue":{"value":{"entity-type":"item","numeric-id":7167388,"id":"Q7167388"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7167390$F534AE64-5B7B-4311-8295-D20B688CD190","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7e1a181495a8734e54ea976b1c901e421b8ce2f8","datavalue":{"value":{"entity-type":"item","numeric-id":407347,"id":"Q407347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7167390$067772B3-BEDD-477C-A8A5-EE9B163A9798","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"730612c8820961be7e9d3f2cb0e42eaba400bb9c","datavalue":{"value":{"entity-type":"item","numeric-id":7167389,"id":"Q7167389"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7167390$4DB78B6D-2A57-4CF5-BF9E-113B81A9ACC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f064a948d955d6b7e7841d1eed860f21e35d85f2","datavalue":{"value":{"entity-type":"item","numeric-id":6751643,"id":"Q6751643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7167390$8EA90C80-B20D-483F-95B6-A155E3C703E6","rank":"normal"}],"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":"Q7167390$57273A7D-6D7F-405C-BD91-64E4443E0A66","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":"Q7167390$9D258EE4-6220-4E8B-8440-26F8C32A9D07","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Efficiently_Computable_Lower_Bound_for_the_Independence_Number_of_Hypergraphs"}}}}}