{"entities":{"Q116246":{"pageid":117721,"ns":120,"title":"Item:Q116246","lastrevid":84687665,"modified":"2026-05-29T08:55:23Z","type":"item","id":"Q116246","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"}},"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":"Q116246$8733CF1F-F5C6-4BA5-BA3A-A2DF9F1CDB23","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8d1d792ed87a1ed972cee9acec003b26cdd731e6","datavalue":{"value":{"entity-type":"item","numeric-id":65470,"id":"Q65470"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q116246$B5B3E44E-3F3B-4226-B6DC-775A66FF6847","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"d8b79f80d987ff4a11bd1c7e49b3ba5c4b5d575d","datavalue":{"value":"42","type":"string"},"datatype":"string"},"type":"statement","id":"Q116246$88A57320-AA08-46CF-B88A-134CB9B96D7D","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"133c4f1f6faefb140213d67b06b427618fdbf331","datavalue":{"value":"4","type":"string"},"datatype":"string"},"type":"statement","id":"Q116246$36572282-52DA-4977-ABC4-01F188E4141F","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"5f05ee99e7ece3bc47ad5be0e445cc6b41e9fe34","datavalue":{"value":"824-836","type":"string"},"datatype":"string"},"type":"statement","id":"Q116246$BBC72600-68F4-45E1-ADD7-33F06BDF9C66","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ae93340bb7a022b561aa0e536e029632aaf17ce","datavalue":{"value":{"time":"+2020-04-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q116246$67785E3A-C84F-4091-AED0-B65F4347B464","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0ffe8d6807cc52ac818181b7393717733520b32b","datavalue":{"value":{"entity-type":"item","numeric-id":116244,"id":"Q116244"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q116246$22401AE2-C9EE-4C57-B80A-68AD3A93D7D4","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"8003c2c55e563aa9367a237d51621b0e7b7a43f9","datavalue":{"value":"Q90852425","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q116246$388D3902-2C56-4BC7-A1AC-46D0CAC13327","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":"Q116246$BFE2A109-53CF-4624-B9C3-3DE011C559EE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8680b19a4d5380a6d608a4d6a9899364f804700f","datavalue":{"value":"10.1109/TPAMI.2018.2889473","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q116246$81897579-1221-4890-8FEC-2F33009AE260","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"42af15809c0c096197a8ff36c94041aa3bdd122b","datavalue":{"value":"D. A. Yashunin","type":"string"},"datatype":"string"},"type":"statement","id":"Q116246$0D9D1B15-A456-4B1D-B664-82D6502A4DBF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_and_Robust_Approximate_Nearest_Neighbor_Search_Using_Hierarchical_Navigable_Small_World_Graphs"}}}}}