{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QPLRUL2PBTLYZJDYLFMC7KZVXD","short_pith_number":"pith:QPLRUL2P","schema_version":"1.0","canonical_sha256":"83d71a2f4f0cd78ca47859582fab35b8ea3c36102a48ae18799170fd672f5f46","source":{"kind":"arxiv","id":"2506.23397","version":1},"attestation_state":"computed","paper":{"title":"NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Gaurav Sehgal, Semih Salihoglu","submitted_at":"2025-06-29T21:16:07Z","abstract_excerpt":"There is an increasing demand for extending existing DBMSs with vector indices so that they become unified systems capable of supporting modern predictive applications, which require joint querying of vector embeddings together with the structured properties and connections of objects. We present NaviX, a native vector index for graph DBMSs (GDBMSs) that has two main design goals. First, we aim to implement a disk-based vector index that leverages the core storage and query-processing capabilities of the underlying GDBMS. To this end, NaviX is built on the Hierarchical Navigable Small-World (H"},"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":"2506.23397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-29T21:16:07Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1b2144448c00fe28553a6b6eef8088c496a88a8079c5d997ac2e2d8fb9de67c9","abstract_canon_sha256":"6db86df55d142b4f11ac4e0267cbdf10b22c68a382b2f9569c131fba58a1397e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:20.965242Z","signature_b64":"w2w6UFYKJpjaYmk+Rpp2JnkpuLTwph1V3jeCJ3KP2ZAe0Ml72V61FzD1MaQwTRQlEhvUm6wjeERtdGTdU660Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d71a2f4f0cd78ca47859582fab35b8ea3c36102a48ae18799170fd672f5f46","last_reissued_at":"2026-07-05T11:29:20.964728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:20.964728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Gaurav Sehgal, Semih Salihoglu","submitted_at":"2025-06-29T21:16:07Z","abstract_excerpt":"There is an increasing demand for extending existing DBMSs with vector indices so that they become unified systems capable of supporting modern predictive applications, which require joint querying of vector embeddings together with the structured properties and connections of objects. We present NaviX, a native vector index for graph DBMSs (GDBMSs) that has two main design goals. First, we aim to implement a disk-based vector index that leverages the core storage and query-processing capabilities of the underlying GDBMS. To this end, NaviX is built on the Hierarchical Navigable Small-World (H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23397","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23397/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":"2506.23397","created_at":"2026-07-05T11:29:20.964793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23397v1","created_at":"2026-07-05T11:29:20.964793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23397","created_at":"2026-07-05T11:29:20.964793+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPLRUL2PBTLY","created_at":"2026-07-05T11:29:20.964793+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPLRUL2PBTLYZJDY","created_at":"2026-07-05T11:29:20.964793+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPLRUL2P","created_at":"2026-07-05T11:29:20.964793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00734","citing_title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD","json":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD.json","graph_json":"https://pith.science/api/pith-number/QPLRUL2PBTLYZJDYLFMC7KZVXD/graph.json","events_json":"https://pith.science/api/pith-number/QPLRUL2PBTLYZJDYLFMC7KZVXD/events.json","paper":"https://pith.science/paper/QPLRUL2P"},"agent_actions":{"view_html":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD","download_json":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD.json","view_paper":"https://pith.science/paper/QPLRUL2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23397&json=true","fetch_graph":"https://pith.science/api/pith-number/QPLRUL2PBTLYZJDYLFMC7KZVXD/graph.json","fetch_events":"https://pith.science/api/pith-number/QPLRUL2PBTLYZJDYLFMC7KZVXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD/action/storage_attestation","attest_author":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD/action/author_attestation","sign_citation":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD/action/citation_signature","submit_replication":"https://pith.science/pith/QPLRUL2PBTLYZJDYLFMC7KZVXD/action/replication_record"}},"created_at":"2026-07-05T11:29:20.964793+00:00","updated_at":"2026-07-05T11:29:20.964793+00:00"}