{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ACMGMVZCZCGRDFBZJ7XUIYR7BF","short_pith_number":"pith:ACMGMVZC","canonical_record":{"source":{"id":"1804.09996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T11:24:42Z","cross_cats_sorted":["cs.DB","cs.DS","cs.IR"],"title_canon_sha256":"d9c0922651f67b6e4320705cec41a5b89ac4d9e2dbc6df85ee2bac385ba19990","abstract_canon_sha256":"ba645305a29dee1b7c25f5ffe8ae8f98fd4c0eb602ed789ae368428a0c67a9a5"},"schema_version":"1.0"},"canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","source":{"kind":"arxiv","id":"1804.09996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09996","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09996v2","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09996","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"ACMGMVZCZCGR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACMGMVZCZCGRDFBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACMGMVZC","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ACMGMVZCZCGRDFBZJ7XUIYR7BF","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T11:24:42Z","cross_cats_sorted":["cs.DB","cs.DS","cs.IR"],"title_canon_sha256":"d9c0922651f67b6e4320705cec41a5b89ac4d9e2dbc6df85ee2bac385ba19990","abstract_canon_sha256":"ba645305a29dee1b7c25f5ffe8ae8f98fd4c0eb602ed789ae368428a0c67a9a5"},"schema_version":"1.0"},"canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:06.090238Z","signature_b64":"qC0MIVncjWrNHcim9W7AgxZh7chrhnXdFlJCHu/tK+pp2KQ9tIpwbMX+OoHgha/MDcl4V4eTH835Pk0N9au/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","last_reissued_at":"2026-05-18T00:14:06.089621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:06.089621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09996","source_version":2,"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-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Daa19ZPCYQONIAAKCd16Rehr9HZE4O0O+YLlQgLoDLZW0qHrMsFp8ha7+B9xHAT1OAeOVxAtwFEp9+aC6eO7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T02:52:21.901511Z"},"content_sha256":"22143f14342d57f935a5da0927e84ab1b19623635eeb4e53c772b3713c843b1c","schema_version":"1.0","event_id":"sha256:22143f14342d57f935a5da0927e84ab1b19623635eeb4e53c772b3713c843b1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ACMGMVZCZCGRDFBZJ7XUIYR7BF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link and code: Fast indexing with graphs and compact regression codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.IR"],"primary_cat":"cs.CV","authors_text":"Alexandre Sablayrolles, Herv\\'e J\\'egou, Matthijs Douze","submitted_at":"2018-04-26T11:24:42Z","abstract_excerpt":"Similarity search approaches based on graph walks have recently attained outstanding speed-accuracy trade-offs, taking aside the memory requirements. In this paper, we revisit these approaches by considering, additionally, the memory constraint required to index billions of images on a single server. This leads us to propose a method based both on graph traversal and compact representations. We encode the indexed vectors using quantization and exploit the graph structure to refine the similarity estimation.\n  In essence, our method takes the best of these two worlds: the search strategy is bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09996","kind":"arxiv","version":2},"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"},"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-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l26Yg4LYA589znMpupBdAA0v53ybh21jW2DPBvvO0U8JTP2e3/llhualKBdTcwiCB+GNKc0F7ZHHtqwtQXisDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T02:52:21.901849Z"},"content_sha256":"041720b8ca74950c9e4dd049278f1871785ed045a70465898c308b2033b2afb0","schema_version":"1.0","event_id":"sha256:041720b8ca74950c9e4dd049278f1871785ed045a70465898c308b2033b2afb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/bundle.json","state_url":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/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-22T02:52:21Z","links":{"resolver":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF","bundle":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/bundle.json","state":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ACMGMVZCZCGRDFBZJ7XUIYR7BF","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":"ba645305a29dee1b7c25f5ffe8ae8f98fd4c0eb602ed789ae368428a0c67a9a5","cross_cats_sorted":["cs.DB","cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T11:24:42Z","title_canon_sha256":"d9c0922651f67b6e4320705cec41a5b89ac4d9e2dbc6df85ee2bac385ba19990"},"schema_version":"1.0","source":{"id":"1804.09996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09996","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09996v2","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09996","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"ACMGMVZCZCGR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACMGMVZCZCGRDFBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACMGMVZC","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:041720b8ca74950c9e4dd049278f1871785ed045a70465898c308b2033b2afb0","target":"graph","created_at":"2026-05-18T00:14:06Z","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"},"paper":{"abstract_excerpt":"Similarity search approaches based on graph walks have recently attained outstanding speed-accuracy trade-offs, taking aside the memory requirements. In this paper, we revisit these approaches by considering, additionally, the memory constraint required to index billions of images on a single server. This leads us to propose a method based both on graph traversal and compact representations. We encode the indexed vectors using quantization and exploit the graph structure to refine the similarity estimation.\n  In essence, our method takes the best of these two worlds: the search strategy is bas","authors_text":"Alexandre Sablayrolles, Herv\\'e J\\'egou, Matthijs Douze","cross_cats":["cs.DB","cs.DS","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T11:24:42Z","title":"Link and code: Fast indexing with graphs and compact regression codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09996","kind":"arxiv","version":2},"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:22143f14342d57f935a5da0927e84ab1b19623635eeb4e53c772b3713c843b1c","target":"record","created_at":"2026-05-18T00:14:06Z","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":"ba645305a29dee1b7c25f5ffe8ae8f98fd4c0eb602ed789ae368428a0c67a9a5","cross_cats_sorted":["cs.DB","cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T11:24:42Z","title_canon_sha256":"d9c0922651f67b6e4320705cec41a5b89ac4d9e2dbc6df85ee2bac385ba19990"},"schema_version":"1.0","source":{"id":"1804.09996","kind":"arxiv","version":2}},"canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","first_computed_at":"2026-05-18T00:14:06.089621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:06.089621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qC0MIVncjWrNHcim9W7AgxZh7chrhnXdFlJCHu/tK+pp2KQ9tIpwbMX+OoHgha/MDcl4V4eTH835Pk0N9au/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:06.090238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22143f14342d57f935a5da0927e84ab1b19623635eeb4e53c772b3713c843b1c","sha256:041720b8ca74950c9e4dd049278f1871785ed045a70465898c308b2033b2afb0"],"state_sha256":"a00d87bd67e95775477cf80481ec119111a079b8dea369a79d474fdfc4166574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFPCqFc1siYK8pYXmTwTxcjKXfmjgikQDVctdBz8IyCFx200VWk2j8G2+13Qje1kDBnPHWSokwhw4IQZC8s7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T02:52:21.903862Z","bundle_sha256":"85fe9eb359c139cfd11c45c01ccab1838e75cbb98fee67baa0a96c74f076d4ef"}}