{"entities":{"Q113801":{"pageid":115276,"ns":120,"title":"Item:Q113801","lastrevid":59610888,"modified":"2026-04-10T13:19:03Z","type":"item","id":"Q113801","labels":{"en":{"language":"en","value":"A fast algorithm for computing distance correlation"}},"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":"Q113801$63F94ADE-C902-41E3-90EE-0EDECD52D424","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ea269db09297544776e39495a4f14dedb5a1b846","datavalue":{"value":{"time":"+2018-10-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":"Q113801$A74C5857-2BE5-4DB4-ADB3-58D661C6DA11","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"18d0dffffb771d5c123e3df75d1841963d39189a","datavalue":{"value":"1810.11332","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q113801$04624CB8-B4A9-4DB3-9B9F-B0056F765842","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"1d35dc8f85e37b4367b85ca01ffc9f04aeb2b8ab","datavalue":{"value":"stat.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q113801$FCB86439-9F11-41AA-981C-532037E894E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q113801$1B8179B3-061A-404E-BB32-F8D0FA65BBA1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a34c809fdb1921cdf05b920acc01f6dbe516d1a8","datavalue":{"value":"62H20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q113801$0CE33FCE-7572-488F-8B56-4CF3941A0464","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3f97694d44af155a68434cb72eabc6a4d5dd5227","datavalue":{"value":"68P10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q113801$1FB55FEF-919E-4CF8-A7C4-869A7BAB2940","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f9638f1e5cba8cd9a68eba9c5734dc987c94da63","datavalue":{"value":{"entity-type":"item","numeric-id":113798,"id":"Q113798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q113801$F8130CA1-35D7-4752-BE6D-4500A8BDED04","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7a868a568956c867311cb2b3f9ad29b3126d4042","datavalue":{"value":{"entity-type":"item","numeric-id":113799,"id":"Q113799"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q113801$9CA0993B-6EC5-4BE1-B928-01F9017472F3","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":"Q113801$08F25828-C327-455C-9B13-98A553D9921A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f3b69415c4637fc96ac2862d6f3fcc26fe652aba","datavalue":{"value":"10.48550/ARXIV.1810.11332","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q113801$511E89B3-3CC3-4361-A445-B3DD81467447","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A fast algorithm for computing distance correlation (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_fast_algorithm_for_computing_distance_correlation_(scientific_article_from_arXiv)"}}}}}