{"entities":{"Q7071289":{"pageid":21827157,"ns":120,"title":"Item:Q7071289","lastrevid":106397975,"modified":"2026-10-22T11:18:14Z","type":"item","id":"Q7071289","labels":{"en":{"language":"en","value":"On hypergraph cliques and polynomial programming"}},"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":"Q7071289$DC59A290-D62B-46DE-879F-8BA1825EBB31","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5e75219c8cee2bb66a30bc1eac77b3f1fe83abf5","datavalue":{"value":{"time":"+2013-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":"Q7071289$62080B48-8FA1-492D-B3E9-64A11A8D6353","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f88e37caec1e4b769f402bebd233747eb09bb7c6","datavalue":{"value":"1312.6973","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7071289$F383CF5B-5E57-4527-BEEA-CAC6A06B6862","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e8804bddf99c35196b9591364dd3f2f384044f56","datavalue":{"value":{"entity-type":"item","numeric-id":272801,"id":"Q272801"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7071289$116AB469-5DA4-4272-A8BD-4F4415444C9B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"710a180755857dbcb451ea2f740500cb57b6456a","datavalue":{"value":{"entity-type":"item","numeric-id":326972,"id":"Q326972"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7071289$49727862-E8DB-4670-82B7-F93265F3B145","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c6bda6b9e4e12216d9e9c312cc36ed58f9df1b73","datavalue":{"value":{"entity-type":"item","numeric-id":1126222,"id":"Q1126222"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7071289$F67699EE-378E-49D1-BDEF-F87D41D04060","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c76402894fbdb29ea18242f30748d63a500b2366","datavalue":{"value":{"entity-type":"item","numeric-id":221634,"id":"Q221634"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7071289$F9EFDB73-4018-4901-912D-5BCC1B27D422","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":"Q7071289$24FB20FE-2897-4A90-9AAA-2F55DDF1215F","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":"Q7071289$ED7F1A0D-EB49-49A5-980A-960584E5BFED","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On hypergraph cliques and polynomial programming (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_hypergraph_cliques_and_polynomial_programming_(scientific_article_from_arXiv)"}}}}}