{"entities":{"Q6512629":{"pageid":14091588,"ns":120,"title":"Item:Q6512629","lastrevid":99711398,"modified":"2026-06-05T20:33:15Z","type":"item","id":"Q6512629","labels":{"en":{"language":"en","value":"A Riemannian optimization method to compute the nearest singular pencil"}},"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":"Q6512629$185A8D63-38B6-4A4D-BD16-3CEBA5F08A3A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5528f474797c7acdefc1919b7874205f6543fc57","datavalue":{"value":{"text":"A Riemannian optimization method to compute the nearest singular pencil","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6512629$4E4798BB-DD37-4199-8403-C973B180DCD9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"78dec9d9daa0ff8d2043f695b8157fd2c593890e","datavalue":{"value":{"entity-type":"item","numeric-id":245838,"id":"Q245838"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512629$D3043E09-8A15-4ADF-A5DB-3D3F8BE77092","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"609f79bf6090cd48ed482efa9f452db968e62dff","datavalue":{"value":{"entity-type":"item","numeric-id":329305,"id":"Q329305"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512629$ECCD66B9-C619-4D54-979E-CB12FDADA408","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fc5c2c86a492fe33141908da57aa6b90d44cd5d5","datavalue":{"value":{"entity-type":"item","numeric-id":6094746,"id":"Q6094746"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512629$2E2F930C-707E-4449-9FEF-F0FDFFBBBB94","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":"Q6512629$94F13448-0000-4FE9-BF11-ECFD74048012","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"966ea56d0c3d56e05257993a9654d80060902e3e","datavalue":{"value":"2308.12781","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6512629$7A17E43F-345A-456B-A0AE-5C4C9157EC86","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"16de5bef923d31549b1dcf46251aac1b3b9019ba","datavalue":{"value":"https://github.com/nymanlauri/nearest-singular","type":"string"},"datatype":"url"},"type":"statement","id":"Q6512629$CDBC983C-8BE3-4014-ADA6-491CBD33BD8A","rank":"normal","references":[{"hash":"9f162b520554844d38cd716f73de82acd7371fc5","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"4d5cbeba6ccf7c3eb1c6679cfba88836cbd5f09e","datavalue":{"value":"https://paperswithcode.com/paper/a-riemannian-optimization-method-to-compute","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":"A Riemannian optimization method to compute the nearest singular pencil (scientific article from arXiv)","badges":[]}}}}}