{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7MQ6XBP4LGOPOITNM7JKLTYYCP","short_pith_number":"pith:7MQ6XBP4","schema_version":"1.0","canonical_sha256":"fb21eb85fc599cf7226d67d2a5cf1813e549c5eb2cc59597fe2cb44596575d65","source":{"kind":"arxiv","id":"1907.06146","version":3},"attestation_state":"computed","paper":{"title":"High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Changxu Wang, Cong Fu, Deng Cai","submitted_at":"2019-07-13T23:17:19Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) in high dimensional space is essential in database and information retrieval. Recently, there has been a surge of interest in exploring efficient graph-based indices for the ANNS problem. Among them, Navigating Spreading-out Graph (NSG) provides fine theoretical analysis and achieves state-of-the-art performance. However, we find there are several limitations with NSG: 1) NSG has no theoretical guarantee on nearest neighbor search when the query is not indexed in the database; 2) NSG is too sparse which harms the search performance. In addition, NSG s"},"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":"1907.06146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-13T23:17:19Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"29b360aad2a0067501e90bc384cf65b9d2f2f318bc0032b5d933e65de7661399","abstract_canon_sha256":"361f56859c834e80cd1fd96b767c4a76cb62cd33b2f1102d7f0552c1b43f6ed9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:08.500736Z","signature_b64":"/SOU9cwQ1mcbiJW6xRoKADwG2VaNOX6+yAu+zpE3h0y3ucl25oaDTsdKedl9zqXuAdHXEpV+7R5I0pCWgI9kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb21eb85fc599cf7226d67d2a5cf1813e549c5eb2cc59597fe2cb44596575d65","last_reissued_at":"2026-07-05T02:24:08.500393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:08.500393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Changxu Wang, Cong Fu, Deng Cai","submitted_at":"2019-07-13T23:17:19Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) in high dimensional space is essential in database and information retrieval. Recently, there has been a surge of interest in exploring efficient graph-based indices for the ANNS problem. Among them, Navigating Spreading-out Graph (NSG) provides fine theoretical analysis and achieves state-of-the-art performance. However, we find there are several limitations with NSG: 1) NSG has no theoretical guarantee on nearest neighbor search when the query is not indexed in the database; 2) NSG is too sparse which harms the search performance. In addition, NSG s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06146","kind":"arxiv","version":3},"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/1907.06146/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06146","created_at":"2026-07-05T02:24:08.500449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06146v3","created_at":"2026-07-05T02:24:08.500449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06146","created_at":"2026-07-05T02:24:08.500449+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MQ6XBP4LGOP","created_at":"2026-07-05T02:24:08.500449+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MQ6XBP4LGOPOITN","created_at":"2026-07-05T02:24:08.500449+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MQ6XBP4","created_at":"2026-07-05T02:24:08.500449+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/7MQ6XBP4LGOPOITNM7JKLTYYCP","json":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP.json","graph_json":"https://pith.science/api/pith-number/7MQ6XBP4LGOPOITNM7JKLTYYCP/graph.json","events_json":"https://pith.science/api/pith-number/7MQ6XBP4LGOPOITNM7JKLTYYCP/events.json","paper":"https://pith.science/paper/7MQ6XBP4"},"agent_actions":{"view_html":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP","download_json":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP.json","view_paper":"https://pith.science/paper/7MQ6XBP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06146&json=true","fetch_graph":"https://pith.science/api/pith-number/7MQ6XBP4LGOPOITNM7JKLTYYCP/graph.json","fetch_events":"https://pith.science/api/pith-number/7MQ6XBP4LGOPOITNM7JKLTYYCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP/action/storage_attestation","attest_author":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP/action/author_attestation","sign_citation":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP/action/citation_signature","submit_replication":"https://pith.science/pith/7MQ6XBP4LGOPOITNM7JKLTYYCP/action/replication_record"}},"created_at":"2026-07-05T02:24:08.500449+00:00","updated_at":"2026-07-05T02:24:08.500449+00:00"}