{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ACEZDFKRF5HLA4YP6KFXKOBTK5","short_pith_number":"pith:ACEZDFKR","schema_version":"1.0","canonical_sha256":"00899195512f4eb0730ff28b753833577918c7e0c4cda3c1c9f357e4847412e4","source":{"kind":"arxiv","id":"1904.02077","version":5},"attestation_state":"computed","paper":{"title":"Graph based Nearest Neighbor Search: Promises and Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS","cs.MM","cs.SI"],"primary_cat":"cs.IR","authors_text":"Peng-Cheng Lin, Wan-Lei Zhao","submitted_at":"2019-04-03T16:12:55Z","abstract_excerpt":"Recently, graph based nearest neighbor search gets more and more popular on large-scale retrieval tasks. The attractiveness of this type of approaches lies in its superior performance over most of the known nearest neighbor search approaches as well as its genericness to various metrics. In this paper, the role of two strategies, namely hierarchical structure and graph diversification that are adopted as the key steps in the graph based approaches, is investigated. We find the hierarchical structure could not achieve \"much better logarithmic complexity scaling\" as it was claimed in the origina"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.02077","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-03T16:12:55Z","cross_cats_sorted":["cs.CV","cs.DS","cs.MM","cs.SI"],"title_canon_sha256":"de646fc298f873ada0c43ba96b7ba31e6bfd8c1cb61e162c36fe5f4b276ec5a2","abstract_canon_sha256":"35bf0cc54e9888cbdb41017fad1cf0a43fb8f861540400bbf01498d473e9df97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.917108Z","signature_b64":"cEyfrQC7W9ZF6sdjjyie8pLfhZUXrsJeK8Kmifkuxj+Zr2j1Kf4FD7jG3yl6uKukp8gspMHPdk4EPOsXtSjTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00899195512f4eb0730ff28b753833577918c7e0c4cda3c1c9f357e4847412e4","last_reissued_at":"2026-05-17T23:43:08.916581Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.916581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph based Nearest Neighbor Search: Promises and Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS","cs.MM","cs.SI"],"primary_cat":"cs.IR","authors_text":"Peng-Cheng Lin, Wan-Lei Zhao","submitted_at":"2019-04-03T16:12:55Z","abstract_excerpt":"Recently, graph based nearest neighbor search gets more and more popular on large-scale retrieval tasks. The attractiveness of this type of approaches lies in its superior performance over most of the known nearest neighbor search approaches as well as its genericness to various metrics. In this paper, the role of two strategies, namely hierarchical structure and graph diversification that are adopted as the key steps in the graph based approaches, is investigated. We find the hierarchical structure could not achieve \"much better logarithmic complexity scaling\" as it was claimed in the origina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02077","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.02077","created_at":"2026-05-17T23:43:08.916661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02077v5","created_at":"2026-05-17T23:43:08.916661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02077","created_at":"2026-05-17T23:43:08.916661+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACEZDFKRF5HL","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACEZDFKRF5HLA4YP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACEZDFKR","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5","json":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5.json","graph_json":"https://pith.science/api/pith-number/ACEZDFKRF5HLA4YP6KFXKOBTK5/graph.json","events_json":"https://pith.science/api/pith-number/ACEZDFKRF5HLA4YP6KFXKOBTK5/events.json","paper":"https://pith.science/paper/ACEZDFKR"},"agent_actions":{"view_html":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5","download_json":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5.json","view_paper":"https://pith.science/paper/ACEZDFKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02077&json=true","fetch_graph":"https://pith.science/api/pith-number/ACEZDFKRF5HLA4YP6KFXKOBTK5/graph.json","fetch_events":"https://pith.science/api/pith-number/ACEZDFKRF5HLA4YP6KFXKOBTK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5/action/storage_attestation","attest_author":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5/action/author_attestation","sign_citation":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5/action/citation_signature","submit_replication":"https://pith.science/pith/ACEZDFKRF5HLA4YP6KFXKOBTK5/action/replication_record"}},"created_at":"2026-05-17T23:43:08.916661+00:00","updated_at":"2026-05-17T23:43:08.916661+00:00"}