{"entities":{"Q6527906":{"pageid":14138967,"ns":120,"title":"Item:Q6527906","lastrevid":95461664,"modified":"2026-06-05T09:05:36Z","type":"item","id":"Q6527906","labels":{"en":{"language":"en","value":"An inexact infeasible arc-search interior-point method 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":"Q6527906$68100289-6322-4E64-B1E3-49CEEE700E19","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c67f0888aefd8241c55fc4fc29fe8ffa7f98ea38","datavalue":{"value":{"text":"An inexact infeasible arc-search interior-point method for linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6527906$2ADA44DF-7007-45A4-8352-3FFFC3BE0CC3","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":"Q6527906$73BFF5C7-3251-481C-98E6-24FEB573CFCA","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":"Q6527906$ADC7CD9B-D712-44A6-B749-48DDE79DB195","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ac3edbc9a781214f87fc7c9c04c2c17e13b7ca7","datavalue":{"value":"90C51","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6527906$64D1BA52-7823-4B05-B2AE-81F6F022957F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6527906$5F300E11-18BA-48CB-A40A-A0698CCBBE10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6527906$05029DF2-675B-4BBD-BF68-C6313DFB8594","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":"Q6527906$A5071729-D09E-4239-8C05-5C3AAE079A41","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"b87a745b756a606c7cbe620c0f7dba7fc08c0f53","datavalue":{"value":"2403.18155","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6527906$B47AC56E-7830-44F9-A48E-BB9A8AC8E7AF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An inexact infeasible arc-search interior-point method for linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_inexact_infeasible_arc-search_interior-point_method_for_linear_programming_problems"}}}}}