{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4GUFWIFEIQKFGINYNM2BU56G6Q","short_pith_number":"pith:4GUFWIFE","canonical_record":{"source":{"id":"2401.11324","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-20T21:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"9adbdc5b4a135be5d2b5eb0a0106c18fd5b087918a1e17bcd0c18c0835eeac73","abstract_canon_sha256":"bec1e6724587bb5275b0810475b18fe2d2b3e49b392e31f19ee4efdba4dd00fd"},"schema_version":"1.0"},"canonical_sha256":"e1a85b20a444145321b86b341a77c6f4280ca56c934de434f52154d38fbee0d7","source":{"kind":"arxiv","id":"2401.11324","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11324","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11324v4","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11324","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_12","alias_value":"4GUFWIFEIQKF","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GUFWIFEIQKFGINY","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GUFWIFE","created_at":"2026-07-05T10:48:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4GUFWIFEIQKFGINYNM2BU56G6Q","target":"record","payload":{"canonical_record":{"source":{"id":"2401.11324","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-20T21:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"9adbdc5b4a135be5d2b5eb0a0106c18fd5b087918a1e17bcd0c18c0835eeac73","abstract_canon_sha256":"bec1e6724587bb5275b0810475b18fe2d2b3e49b392e31f19ee4efdba4dd00fd"},"schema_version":"1.0"},"canonical_sha256":"e1a85b20a444145321b86b341a77c6f4280ca56c934de434f52154d38fbee0d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:14.318870Z","signature_b64":"zlMCN4PkH7cRuCFC7P+nmJaX+iTQ7Wq4sGM5H+t2FDjb4XvOwnWRmKZSElMmQ7aOc87evUgnqrZYqrgby3QQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a85b20a444145321b86b341a77c6f4280ca56c934de434f52154d38fbee0d7","last_reissued_at":"2026-07-05T10:48:14.318458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:14.318458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.11324","source_version":4,"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-05T10:48:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGYgr677ZNCADhmemsFvk5uR/mh+eFu8E9+9/39S/gNd7UmnHxrBkymazKm9Om+Bhmtl3SP4EyEKb+ZvfTDoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:10:36.705996Z"},"content_sha256":"1f062b6213d7e332e6ac1b414fca2befab931eaac91539c6cae320428500fe94","schema_version":"1.0","event_id":"sha256:1f062b6213d7e332e6ac1b414fca2befab931eaac91539c6cae320428500fe94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4GUFWIFEIQKFGINYNM2BU56G6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Harsha Vardhan Simhadri, Jyothi Vedurada, Karthik V., Saim Khan, Somesh Singh","submitted_at":"2024-01-20T21:09:19Z","abstract_excerpt":"Approximate Nearest Neighbour Search (ANNS) is a subroutine in algorithms routinely employed in information retrieval, pattern recognition, data mining, image processing, and beyond. Recent works have established that graph-based ANNS algorithms are practically more efficient than the other methods proposed in the literature. The growing volume and dimensionality of data necessitates designing scalable techniques for ANNS. To this end, the prior art has explored parallelising graph-based ANNS on GPU, leveraging its massive parallelism. The current state-of-the-art GPU-based ANNS algorithms eit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11324","kind":"arxiv","version":4},"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/2401.11324/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-05T10:48:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7Skf4TwITr8Zbf+lYcXTkjOJC5RnBXBl4Ycr5FiEPGP0VjiyMa2t5mivDCgHknkWToi1nxhD5IaGpN2DjlIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:10:36.706372Z"},"content_sha256":"ccef1355b839e1eee2444b526f5e53219e616a7e52ce0611b3dac7c231fec20d","schema_version":"1.0","event_id":"sha256:ccef1355b839e1eee2444b526f5e53219e616a7e52ce0611b3dac7c231fec20d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/bundle.json","state_url":"https://pith.science/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/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-07-07T11:10:36Z","links":{"resolver":"https://pith.science/pith/4GUFWIFEIQKFGINYNM2BU56G6Q","bundle":"https://pith.science/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/bundle.json","state":"https://pith.science/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GUFWIFEIQKFGINYNM2BU56G6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4GUFWIFEIQKFGINYNM2BU56G6Q","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":"bec1e6724587bb5275b0810475b18fe2d2b3e49b392e31f19ee4efdba4dd00fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-20T21:09:19Z","title_canon_sha256":"9adbdc5b4a135be5d2b5eb0a0106c18fd5b087918a1e17bcd0c18c0835eeac73"},"schema_version":"1.0","source":{"id":"2401.11324","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11324","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11324v4","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11324","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_12","alias_value":"4GUFWIFEIQKF","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GUFWIFEIQKFGINY","created_at":"2026-07-05T10:48:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GUFWIFE","created_at":"2026-07-05T10:48:14Z"}],"graph_snapshots":[{"event_id":"sha256:ccef1355b839e1eee2444b526f5e53219e616a7e52ce0611b3dac7c231fec20d","target":"graph","created_at":"2026-07-05T10:48:14Z","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/2401.11324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate Nearest Neighbour Search (ANNS) is a subroutine in algorithms routinely employed in information retrieval, pattern recognition, data mining, image processing, and beyond. Recent works have established that graph-based ANNS algorithms are practically more efficient than the other methods proposed in the literature. The growing volume and dimensionality of data necessitates designing scalable techniques for ANNS. To this end, the prior art has explored parallelising graph-based ANNS on GPU, leveraging its massive parallelism. The current state-of-the-art GPU-based ANNS algorithms eit","authors_text":"Harsha Vardhan Simhadri, Jyothi Vedurada, Karthik V., Saim Khan, Somesh Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-20T21:09:19Z","title":"BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11324","kind":"arxiv","version":4},"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:1f062b6213d7e332e6ac1b414fca2befab931eaac91539c6cae320428500fe94","target":"record","created_at":"2026-07-05T10:48:14Z","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":"bec1e6724587bb5275b0810475b18fe2d2b3e49b392e31f19ee4efdba4dd00fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-20T21:09:19Z","title_canon_sha256":"9adbdc5b4a135be5d2b5eb0a0106c18fd5b087918a1e17bcd0c18c0835eeac73"},"schema_version":"1.0","source":{"id":"2401.11324","kind":"arxiv","version":4}},"canonical_sha256":"e1a85b20a444145321b86b341a77c6f4280ca56c934de434f52154d38fbee0d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a85b20a444145321b86b341a77c6f4280ca56c934de434f52154d38fbee0d7","first_computed_at":"2026-07-05T10:48:14.318458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:48:14.318458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlMCN4PkH7cRuCFC7P+nmJaX+iTQ7Wq4sGM5H+t2FDjb4XvOwnWRmKZSElMmQ7aOc87evUgnqrZYqrgby3QQCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:48:14.318870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11324","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f062b6213d7e332e6ac1b414fca2befab931eaac91539c6cae320428500fe94","sha256:ccef1355b839e1eee2444b526f5e53219e616a7e52ce0611b3dac7c231fec20d"],"state_sha256":"2ecdd94632306deda782490bae8fea8ae7eec941d88c61d4e7469a57060bc7cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESGryew7tSz4tOMIJkDhW08uBUL3ShiHpVMvIVstUFf20pH6Ckt2bAgpx81d19PP9q8jLExMMVquGsyWxENFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:10:36.708262Z","bundle_sha256":"e7afbd36d68ca81ae09b3009c5fc3ad7665de093b7c6a9ac18efb5bbb9c4b435"}}