{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BV5GX5H3M4DBHRYAYUMYIQPZCS","short_pith_number":"pith:BV5GX5H3","schema_version":"1.0","canonical_sha256":"0d7a6bf4fb670613c700c5198441f9148625a85bd1cb4fe895388bf3c4c207a0","source":{"kind":"arxiv","id":"2412.01940","version":3},"attestation_state":"computed","paper":{"title":"Down with the Hierarchy: The 'H' in HNSW Stands for \"Hubs\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.LG","authors_text":"Benjamin Coleman, Blaise Munyampirwa, Vihan Lakshman","submitted_at":"2024-12-02T20:04:06Z","abstract_excerpt":"Driven by recent breakthrough advances in neural representation learning, approximate near-neighbor (ANN) search over vector embeddings has emerged as a critical computational workload. With the introduction of the seminal Hierarchical Navigable Small World (HNSW) algorithm, graph-based indexes have established themselves as the overwhelmingly dominant paradigm for efficient and scalable ANN search. As the name suggests, HNSW searches a layered hierarchical graph to quickly identify neighborhoods of similar points to a given query vector. But is this hierarchy even necessary? A rigorous experi"},"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":"2412.01940","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-02T20:04:06Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"21363f588b6467b287afbd667a38bab39febddaba292482676842cb5f945696f","abstract_canon_sha256":"a4688e2a2fc933ea1847d87635a474c6b42c0487e4144d3a10e80ad564df6fd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:25.865047Z","signature_b64":"WACH5F6XY1X7W7sLCjQks2hkGb6bYePdTf/UrFnNLqDbk9jumPrR8eYvOvBpy4S8Bj1nIqZ9OUISy7Z2qfhvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7a6bf4fb670613c700c5198441f9148625a85bd1cb4fe895388bf3c4c207a0","last_reissued_at":"2026-07-05T11:31:25.864661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:25.864661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Down with the Hierarchy: The 'H' in HNSW Stands for \"Hubs\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.LG","authors_text":"Benjamin Coleman, Blaise Munyampirwa, Vihan Lakshman","submitted_at":"2024-12-02T20:04:06Z","abstract_excerpt":"Driven by recent breakthrough advances in neural representation learning, approximate near-neighbor (ANN) search over vector embeddings has emerged as a critical computational workload. With the introduction of the seminal Hierarchical Navigable Small World (HNSW) algorithm, graph-based indexes have established themselves as the overwhelmingly dominant paradigm for efficient and scalable ANN search. As the name suggests, HNSW searches a layered hierarchical graph to quickly identify neighborhoods of similar points to a given query vector. But is this hierarchy even necessary? A rigorous experi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01940","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.01940/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.01940","created_at":"2026-07-05T11:31:25.864716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.01940v3","created_at":"2026-07-05T11:31:25.864716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01940","created_at":"2026-07-05T11:31:25.864716+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV5GX5H3M4DB","created_at":"2026-07-05T11:31:25.864716+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV5GX5H3M4DBHRYA","created_at":"2026-07-05T11:31:25.864716+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV5GX5H3","created_at":"2026-07-05T11:31:25.864716+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05434","citing_title":"Artifact Sharing for Information Retrieval Research","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS","json":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS.json","graph_json":"https://pith.science/api/pith-number/BV5GX5H3M4DBHRYAYUMYIQPZCS/graph.json","events_json":"https://pith.science/api/pith-number/BV5GX5H3M4DBHRYAYUMYIQPZCS/events.json","paper":"https://pith.science/paper/BV5GX5H3"},"agent_actions":{"view_html":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS","download_json":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS.json","view_paper":"https://pith.science/paper/BV5GX5H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.01940&json=true","fetch_graph":"https://pith.science/api/pith-number/BV5GX5H3M4DBHRYAYUMYIQPZCS/graph.json","fetch_events":"https://pith.science/api/pith-number/BV5GX5H3M4DBHRYAYUMYIQPZCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS/action/storage_attestation","attest_author":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS/action/author_attestation","sign_citation":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS/action/citation_signature","submit_replication":"https://pith.science/pith/BV5GX5H3M4DBHRYAYUMYIQPZCS/action/replication_record"}},"created_at":"2026-07-05T11:31:25.864716+00:00","updated_at":"2026-07-05T11:31:25.864716+00:00"}