{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:F3TJPWBZ4J2Y2KQMKSEN7VI4DG","short_pith_number":"pith:F3TJPWBZ","canonical_record":{"source":{"id":"2403.01797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T07:37:09Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b0b965dcb86a0b953768a1acba0e4b3c2c8ba2c3433bdc36709fd233b28778a3","abstract_canon_sha256":"1b63c24cf75137b2bccba6c800ea75aeb82648949bc75bc8f76040ac79e3442a"},"schema_version":"1.0"},"canonical_sha256":"2ee697d839e2758d2a0c5488dfd51c19b0934aa8395ed92056099b3a36626bb6","source":{"kind":"arxiv","id":"2403.01797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01797","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01797v1","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01797","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"F3TJPWBZ4J2Y","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_16","alias_value":"F3TJPWBZ4J2Y2KQM","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_8","alias_value":"F3TJPWBZ","created_at":"2026-07-05T07:51:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:F3TJPWBZ4J2Y2KQMKSEN7VI4DG","target":"record","payload":{"canonical_record":{"source":{"id":"2403.01797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T07:37:09Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b0b965dcb86a0b953768a1acba0e4b3c2c8ba2c3433bdc36709fd233b28778a3","abstract_canon_sha256":"1b63c24cf75137b2bccba6c800ea75aeb82648949bc75bc8f76040ac79e3442a"},"schema_version":"1.0"},"canonical_sha256":"2ee697d839e2758d2a0c5488dfd51c19b0934aa8395ed92056099b3a36626bb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:51.954405Z","signature_b64":"h23xX/0pyfiUqQAToZKF3tgiFZSJIDFcEx+uigPhP0h5QgMquYzDk7xwSJSkfP6X/gmsIJ67fld9LtLb0DfGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee697d839e2758d2a0c5488dfd51c19b0934aa8395ed92056099b3a36626bb6","last_reissued_at":"2026-07-05T07:51:51.953881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:51.953881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.01797","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-05T07:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnlfR2YyXVoOMTIgBpoJGjA5R3XNiCu7B1+VBoGpK4jKcdkPhRNjW6jdv9I1QzI81CF6+Gx6YFV6+ffkLskACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:12:34.373140Z"},"content_sha256":"e0d4fd606feb961e1728d51c1cffd688e695c8eae11fd97fd007ab7d9da000c1","schema_version":"1.0","event_id":"sha256:e0d4fd606feb961e1728d51c1cffd688e695c8eae11fd97fd007ab7d9da000c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:F3TJPWBZ4J2Y2KQMKSEN7VI4DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Jakub Lacki, Lars Gottesb\\\"uren, Laxman Dhulipala, Rajesh Jayaram","submitted_at":"2024-03-04T07:37:09Z","abstract_excerpt":"We consider the fundamental problem of decomposing a large-scale approximate nearest neighbor search (ANNS) problem into smaller sub-problems. The goal is to partition the input points into neighborhood-preserving shards, so that the nearest neighbors of any point are contained in only a few shards. When a query arrives, a routing algorithm is used to identify the shards which should be searched for its nearest neighbors. This approach forms the backbone of distributed ANNS, where the dataset is so large that it must be split across multiple machines.\n  In this paper, we design simple and high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01797","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/2403.01797/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-05T07:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bngLb63ESv78XOrNCb2j524LiRaQKns4/3nzOqwSE8Ugrsa7rhzVjOQDNiiiPOswJAcCNrmkJMTWxcq9ehZWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:12:34.373734Z"},"content_sha256":"b5a5541dc932a225a95c068c82db574b7137722f9886d45f3b5ed2e0798095c0","schema_version":"1.0","event_id":"sha256:b5a5541dc932a225a95c068c82db574b7137722f9886d45f3b5ed2e0798095c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/bundle.json","state_url":"https://pith.science/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/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-09T04:12:34Z","links":{"resolver":"https://pith.science/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG","bundle":"https://pith.science/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/bundle.json","state":"https://pith.science/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3TJPWBZ4J2Y2KQMKSEN7VI4DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:F3TJPWBZ4J2Y2KQMKSEN7VI4DG","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":"1b63c24cf75137b2bccba6c800ea75aeb82648949bc75bc8f76040ac79e3442a","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T07:37:09Z","title_canon_sha256":"b0b965dcb86a0b953768a1acba0e4b3c2c8ba2c3433bdc36709fd233b28778a3"},"schema_version":"1.0","source":{"id":"2403.01797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01797","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01797v1","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01797","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"F3TJPWBZ4J2Y","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_16","alias_value":"F3TJPWBZ4J2Y2KQM","created_at":"2026-07-05T07:51:51Z"},{"alias_kind":"pith_short_8","alias_value":"F3TJPWBZ","created_at":"2026-07-05T07:51:51Z"}],"graph_snapshots":[{"event_id":"sha256:b5a5541dc932a225a95c068c82db574b7137722f9886d45f3b5ed2e0798095c0","target":"graph","created_at":"2026-07-05T07:51:51Z","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/2403.01797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the fundamental problem of decomposing a large-scale approximate nearest neighbor search (ANNS) problem into smaller sub-problems. The goal is to partition the input points into neighborhood-preserving shards, so that the nearest neighbors of any point are contained in only a few shards. When a query arrives, a routing algorithm is used to identify the shards which should be searched for its nearest neighbors. This approach forms the backbone of distributed ANNS, where the dataset is so large that it must be split across multiple machines.\n  In this paper, we design simple and high","authors_text":"Jakub Lacki, Lars Gottesb\\\"uren, Laxman Dhulipala, Rajesh Jayaram","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T07:37:09Z","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01797","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:e0d4fd606feb961e1728d51c1cffd688e695c8eae11fd97fd007ab7d9da000c1","target":"record","created_at":"2026-07-05T07:51:51Z","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":"1b63c24cf75137b2bccba6c800ea75aeb82648949bc75bc8f76040ac79e3442a","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T07:37:09Z","title_canon_sha256":"b0b965dcb86a0b953768a1acba0e4b3c2c8ba2c3433bdc36709fd233b28778a3"},"schema_version":"1.0","source":{"id":"2403.01797","kind":"arxiv","version":1}},"canonical_sha256":"2ee697d839e2758d2a0c5488dfd51c19b0934aa8395ed92056099b3a36626bb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ee697d839e2758d2a0c5488dfd51c19b0934aa8395ed92056099b3a36626bb6","first_computed_at":"2026-07-05T07:51:51.953881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:51.953881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h23xX/0pyfiUqQAToZKF3tgiFZSJIDFcEx+uigPhP0h5QgMquYzDk7xwSJSkfP6X/gmsIJ67fld9LtLb0DfGDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:51.954405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.01797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0d4fd606feb961e1728d51c1cffd688e695c8eae11fd97fd007ab7d9da000c1","sha256:b5a5541dc932a225a95c068c82db574b7137722f9886d45f3b5ed2e0798095c0"],"state_sha256":"f17745d7fc6841be606ff8ca0c9972701e47b9338249a5e5c748b789447153e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYVp7uRNZfaTtlIRypp5Va9reAjgs8VwaDGmWG73QrUXLU9J/wQEQZiB+5CBwEaWdYflWknhKyw7pHbTvcYTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:12:34.377484Z","bundle_sha256":"f70cece7d88308cc602239880c203fbf4d95be39fa7681e294eda1714fd9c3e1"}}