{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:FNVBG2SM6GELZ5RLQBF2Y7CEJN","short_pith_number":"pith:FNVBG2SM","canonical_record":{"source":{"id":"2104.03221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-04-07T16:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"b85741abb2da4ecc9b5c59554a5680016650c80feefe1ad2115b77c9c78e450c","abstract_canon_sha256":"ba4075070608697cb59d5c770d85ba8dec4879e03a269c91137e2a3db2812099"},"schema_version":"1.0"},"canonical_sha256":"2b6a136a4cf188bcf62b804bac7c444b56d30554351a7a846bc55671a50f8980","source":{"kind":"arxiv","id":"2104.03221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.03221","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"2104.03221v1","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03221","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"FNVBG2SM6GEL","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"FNVBG2SM6GELZ5RL","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"FNVBG2SM","created_at":"2026-07-05T02:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:FNVBG2SM6GELZ5RLQBF2Y7CEJN","target":"record","payload":{"canonical_record":{"source":{"id":"2104.03221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-04-07T16:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"b85741abb2da4ecc9b5c59554a5680016650c80feefe1ad2115b77c9c78e450c","abstract_canon_sha256":"ba4075070608697cb59d5c770d85ba8dec4879e03a269c91137e2a3db2812099"},"schema_version":"1.0"},"canonical_sha256":"2b6a136a4cf188bcf62b804bac7c444b56d30554351a7a846bc55671a50f8980","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:04.128874Z","signature_b64":"yHHbytj15gD/P3u5w83i7YG3H34tpIQLxblch5fNwFZtjROdWCBXJ4YLfG4ApaIrODgp/HRepF8jwq4f9is/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6a136a4cf188bcf62b804bac7c444b56d30554351a7a846bc55671a50f8980","last_reissued_at":"2026-07-05T02:30:04.128480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:04.128480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.03221","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6tPEJPuTdVHerC0PJjchMbDsNwB0Ngf9s3Jo5RIN5JE3nWnVGUJsb26fhY8ECcnT82Tyv6JT9xjRNoYLFvHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:04:38.457547Z"},"content_sha256":"2d1e8d8315f96cf64c7fc904ee332903d3bbace3eb65cefe07c602c93bd68dfb","schema_version":"1.0","event_id":"sha256:2d1e8d8315f96cf64c7fc904ee332903d3bbace3eb65cefe07c602c93bd68dfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:FNVBG2SM6GELZ5RLQBF2Y7CEJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Reordering for Cache-Efficient Near Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Smola, Anshumali Shrivastava, Benjamin Coleman, Santiago Segarra","submitted_at":"2021-04-07T16:18:15Z","abstract_excerpt":"Graph search is one of the most successful algorithmic trends in near neighbor search. Several of the most popular and empirically successful algorithms are, at their core, a simple walk along a pruned near neighbor graph. Such algorithms consistently perform at the top of industrial speed benchmarks for applications such as embedding search. However, graph traversal applications often suffer from poor memory access patterns, and near neighbor search is no exception to this rule. Our measurements show that popular search indices such as the hierarchical navigable small-world graph (HNSW) can h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03221","kind":"arxiv","version":1},"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/2104.03221/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvt+PJ0I1bW73zI7xf1U0kFgyHwc0tGbLzvU8cDg2spfz1ERY/jhvg+2S8sThn/Jb3MA5OujtmQIFtZ9cq1cDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:04:38.457852Z"},"content_sha256":"42f1e446448d3a78c1e4052f4a7e374e13021e72bff64258608c8a34d6df14fd","schema_version":"1.0","event_id":"sha256:42f1e446448d3a78c1e4052f4a7e374e13021e72bff64258608c8a34d6df14fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/bundle.json","state_url":"https://pith.science/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T07:04:38Z","links":{"resolver":"https://pith.science/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN","bundle":"https://pith.science/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/bundle.json","state":"https://pith.science/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNVBG2SM6GELZ5RLQBF2Y7CEJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FNVBG2SM6GELZ5RLQBF2Y7CEJN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ba4075070608697cb59d5c770d85ba8dec4879e03a269c91137e2a3db2812099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-04-07T16:18:15Z","title_canon_sha256":"b85741abb2da4ecc9b5c59554a5680016650c80feefe1ad2115b77c9c78e450c"},"schema_version":"1.0","source":{"id":"2104.03221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.03221","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"2104.03221v1","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03221","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"FNVBG2SM6GEL","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"FNVBG2SM6GELZ5RL","created_at":"2026-07-05T02:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"FNVBG2SM","created_at":"2026-07-05T02:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:42f1e446448d3a78c1e4052f4a7e374e13021e72bff64258608c8a34d6df14fd","target":"graph","created_at":"2026-07-05T02:30:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.03221/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph search is one of the most successful algorithmic trends in near neighbor search. Several of the most popular and empirically successful algorithms are, at their core, a simple walk along a pruned near neighbor graph. Such algorithms consistently perform at the top of industrial speed benchmarks for applications such as embedding search. However, graph traversal applications often suffer from poor memory access patterns, and near neighbor search is no exception to this rule. Our measurements show that popular search indices such as the hierarchical navigable small-world graph (HNSW) can h","authors_text":"Alex Smola, Anshumali Shrivastava, Benjamin Coleman, Santiago Segarra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-04-07T16:18:15Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03221","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2d1e8d8315f96cf64c7fc904ee332903d3bbace3eb65cefe07c602c93bd68dfb","target":"record","created_at":"2026-07-05T02:30:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ba4075070608697cb59d5c770d85ba8dec4879e03a269c91137e2a3db2812099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-04-07T16:18:15Z","title_canon_sha256":"b85741abb2da4ecc9b5c59554a5680016650c80feefe1ad2115b77c9c78e450c"},"schema_version":"1.0","source":{"id":"2104.03221","kind":"arxiv","version":1}},"canonical_sha256":"2b6a136a4cf188bcf62b804bac7c444b56d30554351a7a846bc55671a50f8980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b6a136a4cf188bcf62b804bac7c444b56d30554351a7a846bc55671a50f8980","first_computed_at":"2026-07-05T02:30:04.128480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:04.128480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHHbytj15gD/P3u5w83i7YG3H34tpIQLxblch5fNwFZtjROdWCBXJ4YLfG4ApaIrODgp/HRepF8jwq4f9is/AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:04.128874Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.03221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d1e8d8315f96cf64c7fc904ee332903d3bbace3eb65cefe07c602c93bd68dfb","sha256:42f1e446448d3a78c1e4052f4a7e374e13021e72bff64258608c8a34d6df14fd"],"state_sha256":"d3948fa35b68878ef7ce9eec80f2dd72dd293ec0e9aecafb46a915960533469f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liNzCPdI1B1Ui51N9XM1zxtnb6ZkG2b4Am2NhN3hWsa7ldkaDPFaXGvbLWMsWbK6tDUF9TamvgZGGsGW37T4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:04:38.461189Z","bundle_sha256":"6ca5a07422e3482a62648a277f42291d1398b82ab7a991e32efd682eccbe4e78"}}