{"entities":{"Q7366041":{"pageid":31543103,"ns":120,"title":"Item:Q7366041","lastrevid":108032558,"modified":"2026-10-27T14:30:44Z","type":"item","id":"Q7366041","labels":{"en":{"language":"en","value":"Treewidth and the complexity of box-constrained quadratic programs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7366041$F882AFC3-9F78-4F81-9CD2-A04867F354D8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7366041$569F22BE-1585-4377-B4A5-3AEF25A02DC3","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"dad75c7a8f8a216cce6ba0102ec0692135047aed","datavalue":{"value":"2609.35595","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7366041$95874F0B-5C4C-4915-8431-E5A1B873C97D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b7095c7b5a4d9cf73a7e24f9e445079a1c00691a","datavalue":{"value":{"entity-type":"item","numeric-id":282755,"id":"Q282755"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366041$9995F919-E2E5-4D09-B0B1-540E4F6F2F2C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"47402d1efe5be541f428327a5e391c049daba59e","datavalue":{"value":{"entity-type":"item","numeric-id":427363,"id":"Q427363"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366041$123AC2EA-FF96-4AA2-A896-6471A825B3AC","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":"Q7366041$FDB74504-46D4-4066-906E-57578BB56871","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":"Q7366041$A2609221-AA24-4C3D-A5C5-C4833DCAC4E8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Treewidth and the complexity of box-constrained quadratic programs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Treewidth_and_the_complexity_of_box-constrained_quadratic_programs"}}}}}