{"entities":{"Q6408613":{"pageid":13541751,"ns":120,"title":"Item:Q6408613","lastrevid":59092497,"modified":"2026-04-07T12:47:19Z","type":"item","id":"Q6408613","labels":{"en":{"language":"en","value":"Quadratic Programming with Sparsity Constraints via Polynomial Roots"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900544029"}},"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":"Q6408613$DC3E8775-09E9-447F-852D-AD888A9B3CA2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6dd8b30b5bf7fb652000b321c0e0ccd4dba80689","datavalue":{"value":{"time":"+2022-08-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6408613$6066CE34-6B3F-4164-B5F2-865FF7CB740B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"137f66fab6cb724980216070dd9e61a2fa519d6f","datavalue":{"value":{"entity-type":"item","numeric-id":2071538,"id":"Q2071538"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6408613$8E7B9F4B-D1F5-4551-A873-377B2C03D360","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6408613$25A3353B-1190-4C18-8789-013789C582A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d3ce5250a6517c02f298c3acf900ebb5a0c531cb","datavalue":{"value":"90C23","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6408613$1FBEE1DA-DBC9-4435-9095-DE3F322CDC8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"db482a841c11f0ca4464248aaa92efa1a30883e5","datavalue":{"value":"14P05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6408613$FC9F8DAE-5763-4BE3-B5F0-B7609B6BAC2F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4408318d5749f18ef0e8a6aefac66ce39dd12886","datavalue":{"value":"900544029","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6408613$9283455D-59B5-430D-A69B-410958317630","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":"Q6408613$9C8978D1-0BF3-4D4B-B4AE-B35CED7ECB98","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"596f955dae8639cb7f56f4cf56bb7a5094ddcfec","datavalue":{"value":"https://github.com/ootks/sparse_qcqps","type":"string"},"datatype":"url"},"type":"statement","id":"Q6408613$E20CB94A-4ED2-47B0-9363-EC157B2E38D3","rank":"normal","references":[{"hash":"2694fa6ae39bba226ea49c07b407a1fa16bd04b5","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"70be4dc0208c348b949223224404bdc37b1c6ebb","datavalue":{"value":"https://paperswithcode.com/paper/quadratic-programming-with-sparsity","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6408613","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6408613"}}}}}