{"entities":{"Q2743981":{"pageid":2754720,"ns":120,"title":"Item:Q2743981","lastrevid":83042555,"modified":"2026-05-07T05:38:54Z","type":"item","id":"Q2743981","labels":{"en":{"language":"en","value":"Polynomial time weak approximation algorithms for quadratic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648022"}},"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":"Q2743981$231E86C3-0662-4850-8722-72AB64382811","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0eab0ff5c3c8dbd8fd1394e029d96a9f289824fa","datavalue":{"value":"0968.90503","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743981$FA1B6E56-357A-4465-87C8-8BE96418C284","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a12c476678ac830de6d391e0b3f53860587b6e09","datavalue":{"value":{"time":"+2001-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2743981$349C91AB-1EBA-450F-8F5B-CEE192559784","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743981$3568AE33-4D02-4472-AF54-1F188B4A34F0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2c64a5ecabf8611d4905f22c247945308d7ffd14","datavalue":{"value":"1648022","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743981$D5E7DB26-2BE9-4E81-8E64-C8C4E33E101F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"19314e3717055044c35e04dfd4d786bc91a8affd","datavalue":{"value":{"entity-type":"item","numeric-id":687093,"id":"Q687093"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743981$6C10C9EF-DCB0-4AA4-B77B-D0390B42E3BD","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":"Q2743981$3563270B-D241-4538-98FF-C20B3A4F30C7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a9933497f18d5a79f9b13250de88b19190ba3742","datavalue":{"value":{"text":"Polynomial time weak approximation algorithms for quadratic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2743981$D22485C2-2BE5-493C-9464-5C813C1B66EC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Polynomial time weak approximation algorithms for quadratic programming","badges":[]}}}}}