{"entities":{"Q7202911":{"pageid":22245953,"ns":120,"title":"Item:Q7202911","lastrevid":107544047,"modified":"2026-10-27T10:36:41Z","type":"item","id":"Q7202911","labels":{"en":{"language":"en","value":"Nearly tight bounds for MaxCut in 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":"Q7202911$ECEA412A-9F2D-4EBC-9C4A-8920E49E093C","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":"Q7202911$2859E30F-904E-4D08-93D7-3CCC2B4485AA","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"41eaaebb2686165d489ea1f7f97c2b1383d81cc3","datavalue":{"value":"2511.08501","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7202911$52C53630-9CC7-4733-A335-D8ACF70F02FA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4549607f9598a2209f1e745f5691629fe55012b0","datavalue":{"value":{"entity-type":"item","numeric-id":2001981,"id":"Q2001981"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7202911$49B7FD72-FDF7-4756-B95E-3DBE484F8AF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"89a15e54014e3266113a9c83aad53854d039de9c","datavalue":{"value":{"entity-type":"item","numeric-id":2092401,"id":"Q2092401"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7202911$7304A3E2-AAC3-4915-8D6D-ACD4A263821E","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":"Q7202911$C46D6765-9C47-4FB7-A81E-3922320C3403","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":"Q7202911$C55C20E3-E282-4734-A3A0-1B96E765FA0D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Nearly tight bounds for MaxCut in hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Nearly_tight_bounds_for_MaxCut_in_hypergraphs"}}}}}