{"entities":{"Q6522449":{"pageid":14101411,"ns":120,"title":"Item:Q6522449","lastrevid":103565537,"modified":"2026-06-06T07:38:06Z","type":"item","id":"Q6522449","labels":{"en":{"language":"en","value":"A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format"}},"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":"Q6522449$37E2ABA2-737D-4057-993A-F27ABDB366F6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4b0f370e07f49bf02b16f65bd5c16b97dc302b55","datavalue":{"value":{"text":"A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6522449$C55E881D-6A08-4295-8F4A-BDCBB8FAAD3B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d6d2fc1d4b7d2be882a63d52809da05b7f828413","datavalue":{"value":{"entity-type":"item","numeric-id":6178882,"id":"Q6178882"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522449$34F9D913-7BF0-4732-B67A-6E722E7AB07F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"14163a0bf0916ba13f945d26e3c374813f32fcdd","datavalue":{"value":{"entity-type":"item","numeric-id":209106,"id":"Q209106"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522449$8A077B9C-A5EB-451B-8EC3-8FB67E02F869","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":"Q6522449$6A3B13DC-23A7-4F09-A43C-0E3A0EFA89C4","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"88d02866e84871888b679a13e7921269fc873f9f","datavalue":{"value":"2402.12182","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6522449$76EF3A7E-E28C-491A-A2FB-6843BBDC6FFB","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"72e5673bb5acb2a2fb66198fe0873ea1001c9f84","datavalue":{"value":"https://github.com/charlottevermeylen/rram_tt_completion","type":"string"},"datatype":"url"},"type":"statement","id":"Q6522449$6C500275-45B3-4F50-8ECF-12FB404F37A9","rank":"normal","references":[{"hash":"6c0953b82def834ed814da4e40b299ef97ad7233","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"953cd888322a42ccdb5433f0ed5d54848bcac387","datavalue":{"value":"https://paperswithcode.com/paper/a-riemannian-rank-adaptive-method-for-higher","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 rank-adaptive method for higher-order tensor completion in the tensor-train format","badges":[]}}}}}