{"entities":{"Q6575180":{"pageid":14186335,"ns":120,"title":"Item:Q6575180","lastrevid":99882083,"modified":"2026-06-05T20:55:19Z","type":"item","id":"Q6575180","labels":{"en":{"language":"en","value":"On the complexity of binary polynomial optimization over acyclic hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883686"}},"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":"Q6575180$E55324EA-F577-4E10-BBD4-D9229D9E8F51","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"69d476c3757f7b2324eb9f1393ad018423d95159","datavalue":{"value":{"text":"On the complexity of binary polynomial optimization over acyclic hypergraphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575180$08B5BC48-0516-4CB9-9AA4-4B78432F1744","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"779e1f7870f34b04155169a0fe3918ea480ab533","datavalue":{"value":"10.1137/1.9781611977073.105","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575180$AC4E5580-60EF-4113-A621-92501732E58F","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":"Q6575180$528C99FC-12F7-4940-BD2F-774127453F6C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d4a7115299960fe60dadf948fe92f65fca4a2fa5","datavalue":{"value":{"entity-type":"item","numeric-id":2688465,"id":"Q2688465"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575180$77F82A00-4202-4F58-AF77-446BF1145042","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575180$E711F1EE-6602-42B5-9C38-80F982921A22","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575180$92B9C291-2378-4D9F-BA0E-19D22CD99193","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dfc2e8e87ba18582b539800f26dcb72dece6a7a0","datavalue":{"value":"7883686","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575180$4AA57C32-BF06-4FC3-9C20-72954BD3204E","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":"Q6575180$0BE9A8E8-761E-47F6-A7A6-583B2DEE736A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the complexity of binary polynomial optimization over acyclic hypergraphs (scientific article; zbMATH DE number 7883686)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_complexity_of_binary_polynomial_optimization_over_acyclic_hypergraphs_(scientific_article;_zbMATH_DE_number_7883686)"}}}}}