{"entities":{"Q150668":{"pageid":152205,"ns":120,"title":"Item:Q150668","lastrevid":84773822,"modified":"2026-06-01T14:05:14Z","type":"item","id":"Q150668","labels":{"en":{"language":"en","value":"Near-linear time approximation algorithms for optimal transport via   Sinkhorn iteration"}},"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":"Q150668$BFF623AC-4433-4723-A4EB-AB764C8D6A72","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"874105a40b51aabcb626af7bccf0e9b797ad98cd","datavalue":{"value":{"time":"+2017-05-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q150668$796BB2EF-8FE8-49D3-BB33-F7FEDF95E255","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"e89ce0efbfea9e341cdc49255dc78c2b6ac7beae","datavalue":{"value":"1705.09634","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q150668$A03BC0FA-455E-458A-8F7D-A6B9109966AB","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q150668$F3332B89-92F7-4ED4-A6A0-2B90CF58F170","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"2f2e57240622252e683460d1060f02c9996da311","datavalue":{"value":"stat.ML","type":"string"},"datatype":"string"},"type":"statement","id":"Q150668$2247F628-5F4B-489D-BCE2-2EEAD5E9A912","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":"Q150668$62BD4ED0-1C7E-4EA3-BB86-BC0385E70C5B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6959514a8f418f07ece223befc67c3d3865801d1","datavalue":{"value":"10.48550/ARXIV.1705.09634","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q150668$22215E48-DD88-47D0-AB26-5D6D22B8A0AB","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"8bfa8eedfa7527809d79f5c8153e49c2c71a5c38","datavalue":{"value":"Jason Altschuler","type":"string"},"datatype":"string"},"type":"statement","id":"Q150668$AA511F19-782D-4CEA-972E-BA7D53A953B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"cefe6382d7f6d9e3e84c48b45894e0090c54d110","datavalue":{"value":"Jonathan Weed","type":"string"},"datatype":"string"},"type":"statement","id":"Q150668$6CD2831E-59C2-42C8-B8A2-33854014BEF6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"23b9fa9971c824d0d6cf395fad92ca38a62cbdbc","datavalue":{"value":"Philippe Rigollet","type":"string"},"datatype":"string"},"type":"statement","id":"Q150668$CD8BE605-5D8E-4218-A8B9-D2322D72BC74","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Near-linear_time_approximation_algorithms_for_optimal_transport_via_Sinkhorn_iteration"}}}}}