{"entities":{"Q116248":{"pageid":117723,"ns":120,"title":"Item:Q116248","lastrevid":84687677,"modified":"2026-05-29T08:55:28Z","type":"item","id":"Q116248","labels":{"en":{"language":"en","value":"Efficient and robust approximate nearest neighbor search using   Hierarchical Navigable Small World graphs"}},"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":"Q116248$5909595C-C09B-4AF7-88FA-97D2A28A0F5B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a93cdc2fd4c07fd027466bbd383632dc6ccce51b","datavalue":{"value":{"time":"+2016-03-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q116248$3493061B-2C2D-4E00-817D-FF0C5E38D50A","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"a5e6cac9d095ae24785a09fb350797ed6f7613b1","datavalue":{"value":"1603.09320","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q116248$87A4006C-21BA-412C-A7AE-30D11410F481","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$80AB5BAA-52F7-4ECC-982A-0C6CB5A732F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"50f1ac61b421408b412f2653765ee4793914974f","datavalue":{"value":"cs.CV","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$4BB8AA57-5065-4674-BE93-82876837738B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"57faaaaa7519be78ec2f922e8f04a83b8f48ae91","datavalue":{"value":"cs.IR","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$14885E69-9D5A-49E3-B7A4-1E52F88A6E96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"df064fdb64597abc3d81f8d6e11b9d2b079a7eda","datavalue":{"value":"cs.SI","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$9CBEBFF3-D7A8-4D28-A86F-19985B954D39","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":"Q116248$9AD2B311-DC23-4CBF-967C-6B1F4BB27762","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2e9facc8b282a089768828816286a95b372a360b","datavalue":{"value":"10.48550/ARXIV.1603.09320","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q116248$57D3699D-A354-4E10-B109-A6370B838BB3","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"42af15809c0c096197a8ff36c94041aa3bdd122b","datavalue":{"value":"D. A. Yashunin","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$86414A26-3665-4FEB-8A1D-DEF39D0BEA67","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"8edb7c2e18e6e4dc1801f6b5de5fc0b5f35f4977","datavalue":{"value":"Yu. A. Malkov","type":"string"},"datatype":"string"},"type":"statement","id":"Q116248$17ECA8C2-64C2-4A85-98B1-FDB00E529947","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","badges":[]}}}}}