{"entities":{"Q6509026":{"pageid":14087984,"ns":120,"title":"Item:Q6509026","lastrevid":103460777,"modified":"2026-06-06T07:24:58Z","type":"item","id":"Q6509026","labels":{"en":{"language":"en","value":"An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6509026$F851FECB-9279-416B-8D0F-E3ED63950DC4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"67ae84fd5cf73a1452850eca6d2c53d42fa43929","datavalue":{"value":{"text":"An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6509026$F150C4B4-1756-40B0-A5EA-8D885F2779C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b13c9491b3b4b4fc1f582fb0b09b2db4d791349a","datavalue":{"value":{"entity-type":"item","numeric-id":2066198,"id":"Q2066198"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6509026$900A0CF5-85D5-4D5E-A09D-03678A9F4E4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"272b68836de69243c23f65c8e872767a4754ffb0","datavalue":{"value":{"entity-type":"item","numeric-id":717128,"id":"Q717128"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6509026$777FA7D6-A12E-49C8-BB7C-5FC12D86B540","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ac3edbc9a781214f87fc7c9c04c2c17e13b7ca7","datavalue":{"value":"90C51","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6509026$BA566F44-5DC5-4F50-88E4-0D5ED5A95D3D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6509026$A3A0B685-1CD3-4C53-90AF-4926BDD9BA92","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6509026$02939048-2CEF-4614-BF78-84BCA7DA1DDD","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":"Q6509026$6C09FBE0-8471-4827-B639-CED6D13AE934","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7b6f9b440a1ba376debea58f8f13e1f69e5e1114","datavalue":{"value":"10.1007/S10589-024-00561-Z","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6509026$5F5A4E6B-DBE6-4509-B72B-412966385E32","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"23a491fb7b1633424ad9f22e97fbee1fa3115dd0","datavalue":{"value":"2303.01666","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6509026$BF9EEA16-45E7-4B93-90FA-3905718D16D6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_infeasible_interior-point_arc-search_method_with_Nesterov%27s_restarting_strategy_for_linear_programming_problems"}}}}}