{"entities":{"Q2743961":{"pageid":2754700,"ns":120,"title":"Item:Q2743961","lastrevid":83042525,"modified":"2026-05-07T05:38:53Z","type":"item","id":"Q2743961","labels":{"en":{"language":"en","value":"Average performance of a self-dual interior point algorithm for linear programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648004"}},"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":"Q2743961$C8A93FC3-6125-402E-8433-BAADCBE452E9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"22f24a4f9b4a2f5a7cd0a0773f13857d3ce17b02","datavalue":{"value":"0968.90519","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743961$18AC71EE-522E-4937-88C6-F1D33FFD23E5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"703a5a1e6a2346367c75b5c9686d051116c61614","datavalue":{"value":{"entity-type":"item","numeric-id":170436,"id":"Q170436"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743961$51E3BA10-14C6-4F98-A476-7B87103C10C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"82c3b50654a9f27d47289e3cb873a68ae4ca5fee","datavalue":{"value":{"entity-type":"item","numeric-id":278620,"id":"Q278620"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743961$257580FA-0F17-4A4A-A02C-8D0528798E8F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"796ff6540b98b3a4a57c2cf4aa26df17c883effe","datavalue":{"value":{"entity-type":"item","numeric-id":229630,"id":"Q229630"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743961$9B8CE3AF-442C-4BC7-88C1-A7EC6EC27916","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f722a9d373eb3dc93c3a37caf61c6de6dd0a5d2b","datavalue":{"value":{"entity-type":"item","numeric-id":173845,"id":"Q173845"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743961$35E087EC-D399-47E7-8314-744FE0D0A17B","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":"Q2743961$A109FF7E-E37B-4BC3-B062-63FA66E3E546","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743961$AF75B670-D826-48F1-86BA-BD08F58B8514","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743961$98854DE7-220D-4918-AA3F-5E3AE1417885","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c99294c42d7f8ff2598de2e20110681a5fa5d1e8","datavalue":{"value":"1648004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743961$D52D3881-165A-4D31-A2EA-B433C07D6474","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":"Q2743961$2B16072A-F5E1-4C6B-89A1-D878D4EDF340","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d5d945f26153ffd8eda9b60e41fe1a7f7163c333","datavalue":{"value":{"text":"Average performance of a self-dual interior point algorithm for linear programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2743961$915FF9BA-DB74-4775-B0B4-71272E1DF333","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Average performance of a self-dual interior point algorithm for linear programming","badges":[]}}}}}