{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XPUL4ZDGNS3POEYC27VXSJXZGD","short_pith_number":"pith:XPUL4ZDG","schema_version":"1.0","canonical_sha256":"bbe8be64666cb6f71302d7eb7926f930d656d62cd6dc906bf21e7100f0f4d0b5","source":{"kind":"arxiv","id":"2606.11789","version":1},"attestation_state":"computed","paper":{"title":"Efficient Graph Indexing for Interval-Aware Vector Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daiyin Wang, Guoren Wang, Kaiwen Xue, Qi Zhang, Ronghua Li, Siyuan Liang, Xubin Li, Ziqi Yin","submitted_at":"2026-06-10T08:21:52Z","abstract_excerpt":"Interval-aware Approximate Nearest Neighbor (ANN) search arises in applications where each object is associated with a numeric value or interval, and queries must satisfy both vector-similarity and interval constraints. Existing methods are typically tailored to a single query semantics, such as interval-filtered ANN search, and therefore require multiple specialized indexes to support diverse workloads, leading to substantial indexing and memory overhead. To address this limitation, we propose the Unified Interval-aware Relative Neighborhood Graph (URNG), a unified graph framework for interva"},"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":"2606.11789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-06-10T08:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"40d7aeb8fb9f8260f4be378e4d099e3258038a5b86354c81f5b1507530eac8c1","abstract_canon_sha256":"dafb3cdc95e3e384c9c2994a873304e599997aa0161c45ab5851a9dc76be58b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:07.895262Z","signature_b64":"zsSyZRlrnINpLq9397UxkRvU3smpTL91QC1cVy7En9gjmx/WKJBzgBq7VAeRg0fPFpsrQ9Oe0Bu93Eq0wHEvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbe8be64666cb6f71302d7eb7926f930d656d62cd6dc906bf21e7100f0f4d0b5","last_reissued_at":"2026-06-11T01:10:07.894429Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:07.894429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph Indexing for Interval-Aware Vector Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daiyin Wang, Guoren Wang, Kaiwen Xue, Qi Zhang, Ronghua Li, Siyuan Liang, Xubin Li, Ziqi Yin","submitted_at":"2026-06-10T08:21:52Z","abstract_excerpt":"Interval-aware Approximate Nearest Neighbor (ANN) search arises in applications where each object is associated with a numeric value or interval, and queries must satisfy both vector-similarity and interval constraints. Existing methods are typically tailored to a single query semantics, such as interval-filtered ANN search, and therefore require multiple specialized indexes to support diverse workloads, leading to substantial indexing and memory overhead. To address this limitation, we propose the Unified Interval-aware Relative Neighborhood Graph (URNG), a unified graph framework for interva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11789","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/2606.11789/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":"2606.11789","created_at":"2026-06-11T01:10:07.894560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11789v1","created_at":"2026-06-11T01:10:07.894560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11789","created_at":"2026-06-11T01:10:07.894560+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPUL4ZDGNS3P","created_at":"2026-06-11T01:10:07.894560+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPUL4ZDGNS3POEYC","created_at":"2026-06-11T01:10:07.894560+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPUL4ZDG","created_at":"2026-06-11T01:10:07.894560+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/XPUL4ZDGNS3POEYC27VXSJXZGD","json":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD.json","graph_json":"https://pith.science/api/pith-number/XPUL4ZDGNS3POEYC27VXSJXZGD/graph.json","events_json":"https://pith.science/api/pith-number/XPUL4ZDGNS3POEYC27VXSJXZGD/events.json","paper":"https://pith.science/paper/XPUL4ZDG"},"agent_actions":{"view_html":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD","download_json":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD.json","view_paper":"https://pith.science/paper/XPUL4ZDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11789&json=true","fetch_graph":"https://pith.science/api/pith-number/XPUL4ZDGNS3POEYC27VXSJXZGD/graph.json","fetch_events":"https://pith.science/api/pith-number/XPUL4ZDGNS3POEYC27VXSJXZGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD/action/storage_attestation","attest_author":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD/action/author_attestation","sign_citation":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD/action/citation_signature","submit_replication":"https://pith.science/pith/XPUL4ZDGNS3POEYC27VXSJXZGD/action/replication_record"}},"created_at":"2026-06-11T01:10:07.894560+00:00","updated_at":"2026-06-11T01:10:07.894560+00:00"}