{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPJSK6XBEKHDSMT5M5QBLS677G","short_pith_number":"pith:EPJSK6XB","schema_version":"1.0","canonical_sha256":"23d3257ae1228e39327d676015cbdff9875fd0dcafe25c65356fdf03399a5235","source":{"kind":"arxiv","id":"1810.07355","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Daisuke Miyazaki, Masajiro Iwasaki","submitted_at":"2018-10-17T02:22:34Z","abstract_excerpt":"Searching for high-dimensional vector data with high accuracy is an inevitable search technology for various types of data. Graph-based indexes are known to reduce the query time for high-dimensional data. To further improve the query time by using graphs, we focused on the indegrees and outdegrees of graphs. While a sufficient number of incoming edges (indegrees) are indispensable for increasing search accuracy, an excessive number of outgoing edges (outdegrees) should be suppressed so as to not increase the query time. Therefore, we propose three degree-adjustment methods: static degree adju"},"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":"1810.07355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-17T02:22:34Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"0bdaa04f2f333d25b405fc16a8bf060fd406faddc6fbc7f8b86c2e2c15b3c11a","abstract_canon_sha256":"7854c2d33815604d9b0b67d38f32a4a33010f7cdbc152683952403628a3aef74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:58.746128Z","signature_b64":"o4BdAW/iYxd1RctxlUwO+/8QP6qnYfK+wCOBV54FT1kpXOe5Xj/1xZFvydatQAmG+90zUgZS9IMSAuA8LJQuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d3257ae1228e39327d676015cbdff9875fd0dcafe25c65356fdf03399a5235","last_reissued_at":"2026-05-18T00:02:58.745394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:58.745394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Daisuke Miyazaki, Masajiro Iwasaki","submitted_at":"2018-10-17T02:22:34Z","abstract_excerpt":"Searching for high-dimensional vector data with high accuracy is an inevitable search technology for various types of data. Graph-based indexes are known to reduce the query time for high-dimensional data. To further improve the query time by using graphs, we focused on the indegrees and outdegrees of graphs. While a sufficient number of incoming edges (indegrees) are indispensable for increasing search accuracy, an excessive number of outgoing edges (outdegrees) should be suppressed so as to not increase the query time. Therefore, we propose three degree-adjustment methods: static degree adju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07355","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":"1810.07355","created_at":"2026-05-18T00:02:58.745497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07355v1","created_at":"2026-05-18T00:02:58.745497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07355","created_at":"2026-05-18T00:02:58.745497+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPJSK6XBEKHD","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPJSK6XBEKHDSMT5","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPJSK6XB","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.12211","citing_title":"PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2505.17152","citing_title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11274","citing_title":"Mycelium-Index: A Streaming Approximate Nearest Neighbor Index with Myelial Edge Decay, Traffic-Driven Reinforcement, and Adaptive Living Hierarchy","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27315","citing_title":"Cross-lingual Comparison of Research Funding Projects with Multilingual Sentence-BERT: Evidence from KAKENHI, NIH, NSF, and UKRI","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G","json":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G.json","graph_json":"https://pith.science/api/pith-number/EPJSK6XBEKHDSMT5M5QBLS677G/graph.json","events_json":"https://pith.science/api/pith-number/EPJSK6XBEKHDSMT5M5QBLS677G/events.json","paper":"https://pith.science/paper/EPJSK6XB"},"agent_actions":{"view_html":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G","download_json":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G.json","view_paper":"https://pith.science/paper/EPJSK6XB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07355&json=true","fetch_graph":"https://pith.science/api/pith-number/EPJSK6XBEKHDSMT5M5QBLS677G/graph.json","fetch_events":"https://pith.science/api/pith-number/EPJSK6XBEKHDSMT5M5QBLS677G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G/action/storage_attestation","attest_author":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G/action/author_attestation","sign_citation":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G/action/citation_signature","submit_replication":"https://pith.science/pith/EPJSK6XBEKHDSMT5M5QBLS677G/action/replication_record"}},"created_at":"2026-05-18T00:02:58.745497+00:00","updated_at":"2026-05-18T00:02:58.745497+00:00"}