{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GQ4CCIIJLMPTOYMCXLBKRHQFSV","short_pith_number":"pith:GQ4CCIIJ","schema_version":"1.0","canonical_sha256":"34382121095b1f376182bac2a89e05955007271655decfa81a8a8ed8ba86e965","source":{"kind":"arxiv","id":"1312.3062","version":1},"attestation_state":"computed","paper":{"title":"Fast Neighborhood Graph Search using Cartesian Concatenation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Baining Guo, Gang Zeng, Jingdong Wang, Jing Wang, Rui Gan, Shipeng Li","submitted_at":"2013-12-11T08:02:29Z","abstract_excerpt":"In this paper, we propose a new data structure for approximate nearest neighbor search. This structure augments the neighborhood graph with a bridge graph. We propose to exploit Cartesian concatenation to produce a large set of vectors, called bridge vectors, from several small sets of subvectors. Each bridge vector is connected with a few reference vectors near to it, forming a bridge graph. Our approach finds nearest neighbors by simultaneously traversing the neighborhood graph and the bridge graph in the best-first strategy. The success of our approach stems from two factors: the exact near"},"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":"1312.3062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-11T08:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"d1469ec2cb6df7fb581f1fdab39c9c62d363b61c7e2d930845d94441b3ad2873","abstract_canon_sha256":"dc911ea8baadc6f40c02d82b01e5b5ce16eb47ba73f67c403e49423e0fa02fdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.601925Z","signature_b64":"7lbBL4vsW4DF9Qd6MTLPpbkWGYE54xmB9aJDTeDierAcrYbreExJZZbyRgHXxdCBou0RmEtQXzOsZrP2gi+VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34382121095b1f376182bac2a89e05955007271655decfa81a8a8ed8ba86e965","last_reissued_at":"2026-05-18T03:05:00.601455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.601455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Neighborhood Graph Search using Cartesian Concatenation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Baining Guo, Gang Zeng, Jingdong Wang, Jing Wang, Rui Gan, Shipeng Li","submitted_at":"2013-12-11T08:02:29Z","abstract_excerpt":"In this paper, we propose a new data structure for approximate nearest neighbor search. This structure augments the neighborhood graph with a bridge graph. We propose to exploit Cartesian concatenation to produce a large set of vectors, called bridge vectors, from several small sets of subvectors. Each bridge vector is connected with a few reference vectors near to it, forming a bridge graph. Our approach finds nearest neighbors by simultaneously traversing the neighborhood graph and the bridge graph in the best-first strategy. The success of our approach stems from two factors: the exact near"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3062","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":""},"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":"1312.3062","created_at":"2026-05-18T03:05:00.601539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3062v1","created_at":"2026-05-18T03:05:00.601539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3062","created_at":"2026-05-18T03:05:00.601539+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQ4CCIIJLMPT","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQ4CCIIJLMPTOYMC","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQ4CCIIJ","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV","json":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV.json","graph_json":"https://pith.science/api/pith-number/GQ4CCIIJLMPTOYMCXLBKRHQFSV/graph.json","events_json":"https://pith.science/api/pith-number/GQ4CCIIJLMPTOYMCXLBKRHQFSV/events.json","paper":"https://pith.science/paper/GQ4CCIIJ"},"agent_actions":{"view_html":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV","download_json":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV.json","view_paper":"https://pith.science/paper/GQ4CCIIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3062&json=true","fetch_graph":"https://pith.science/api/pith-number/GQ4CCIIJLMPTOYMCXLBKRHQFSV/graph.json","fetch_events":"https://pith.science/api/pith-number/GQ4CCIIJLMPTOYMCXLBKRHQFSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV/action/storage_attestation","attest_author":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV/action/author_attestation","sign_citation":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV/action/citation_signature","submit_replication":"https://pith.science/pith/GQ4CCIIJLMPTOYMCXLBKRHQFSV/action/replication_record"}},"created_at":"2026-05-18T03:05:00.601539+00:00","updated_at":"2026-05-18T03:05:00.601539+00:00"}