{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ACMGMVZCZCGRDFBZJ7XUIYR7BF","short_pith_number":"pith:ACMGMVZC","schema_version":"1.0","canonical_sha256":"0098665722c88d1194394fef44623f094d744d72fd4296b7a3054b497fe469d9","source":{"kind":"arxiv","id":"1804.09996","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.09996","created_at":"2026-05-18T00:14:06.089722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09996v2","created_at":"2026-05-18T00:14:06.089722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09996","created_at":"2026-05-18T00:14:06.089722+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACMGMVZCZCGR","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACMGMVZCZCGRDFBZ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACMGMVZC","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05479","citing_title":"Practical Design and Benchmarking of Generative AI Applications for Surgical Billing and Coding","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF","json":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF.json","graph_json":"https://pith.science/api/pith-number/ACMGMVZCZCGRDFBZJ7XUIYR7BF/graph.json","events_json":"https://pith.science/api/pith-number/ACMGMVZCZCGRDFBZJ7XUIYR7BF/events.json","paper":"https://pith.science/paper/ACMGMVZC"},"agent_actions":{"view_html":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF","download_json":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF.json","view_paper":"https://pith.science/paper/ACMGMVZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09996&json=true","fetch_graph":"https://pith.science/api/pith-number/ACMGMVZCZCGRDFBZJ7XUIYR7BF/graph.json","fetch_events":"https://pith.science/api/pith-number/ACMGMVZCZCGRDFBZJ7XUIYR7BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/action/storage_attestation","attest_author":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/action/author_attestation","sign_citation":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/action/citation_signature","submit_replication":"https://pith.science/pith/ACMGMVZCZCGRDFBZJ7XUIYR7BF/action/replication_record"}},"created_at":"2026-05-18T00:14:06.089722+00:00","updated_at":"2026-05-18T00:14:06.089722+00:00"}