{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TDRLG2TV6DMZ7NYDMFACPCTNIG","short_pith_number":"pith:TDRLG2TV","schema_version":"1.0","canonical_sha256":"98e2b36a75f0d99fb7036140278a6d41a2cc194a5c5d15ef7e5a3170de1e6c99","source":{"kind":"arxiv","id":"2606.07218","version":1},"attestation_state":"computed","paper":{"title":"HKVM-RAG: Key-Value-Separated Hypergraph Evidence Organization for Multi-Hop RAG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Mingyu Zhang, Ying Ma","submitted_at":"2026-06-05T12:31:13Z","abstract_excerpt":"Multi-hop RAG poses a data-engineering problem beyond passage matching: under fixed retrieval budgets, a system must organize retrieved text into evidence units that expose answer chains. Dense retrievers score passages independently, while graph-based memories make associations explicit but often rely on pairwise or entity-centered keys that fragment multi-hop evidence. We present HKVM-RAG, a key-value-separated evidence-organization layer. It assembles answer-path hyperedges from cached passage-level LLM evidence tuples and uses them as retrieval keys, while retaining passage text as answer "},"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.07218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-06-05T12:31:13Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"52fc893f584a46ea9220c01f7a4d189ead3c32384eeb3b492a007775fc04bc02","abstract_canon_sha256":"645e762fc58113a655f85b89bfda24877dd428fe05d90399c7b0ab3b60ab5a5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:53.893037Z","signature_b64":"gEu/7TJC0OCfIkcKctPaG8Oi5voz9zldNokxlTSOxBoPNaZ/9qp7a7HKKMwH/M/QPANP32PSmRfFBBH16SETBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98e2b36a75f0d99fb7036140278a6d41a2cc194a5c5d15ef7e5a3170de1e6c99","last_reissued_at":"2026-06-08T01:04:53.891984Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:53.891984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HKVM-RAG: Key-Value-Separated Hypergraph Evidence Organization for Multi-Hop RAG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Mingyu Zhang, Ying Ma","submitted_at":"2026-06-05T12:31:13Z","abstract_excerpt":"Multi-hop RAG poses a data-engineering problem beyond passage matching: under fixed retrieval budgets, a system must organize retrieved text into evidence units that expose answer chains. Dense retrievers score passages independently, while graph-based memories make associations explicit but often rely on pairwise or entity-centered keys that fragment multi-hop evidence. We present HKVM-RAG, a key-value-separated evidence-organization layer. It assembles answer-path hyperedges from cached passage-level LLM evidence tuples and uses them as retrieval keys, while retaining passage text as answer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07218","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.07218/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.07218","created_at":"2026-06-08T01:04:53.892144+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07218v1","created_at":"2026-06-08T01:04:53.892144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07218","created_at":"2026-06-08T01:04:53.892144+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDRLG2TV6DMZ","created_at":"2026-06-08T01:04:53.892144+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDRLG2TV6DMZ7NYD","created_at":"2026-06-08T01:04:53.892144+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDRLG2TV","created_at":"2026-06-08T01:04:53.892144+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/TDRLG2TV6DMZ7NYDMFACPCTNIG","json":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG.json","graph_json":"https://pith.science/api/pith-number/TDRLG2TV6DMZ7NYDMFACPCTNIG/graph.json","events_json":"https://pith.science/api/pith-number/TDRLG2TV6DMZ7NYDMFACPCTNIG/events.json","paper":"https://pith.science/paper/TDRLG2TV"},"agent_actions":{"view_html":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG","download_json":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG.json","view_paper":"https://pith.science/paper/TDRLG2TV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07218&json=true","fetch_graph":"https://pith.science/api/pith-number/TDRLG2TV6DMZ7NYDMFACPCTNIG/graph.json","fetch_events":"https://pith.science/api/pith-number/TDRLG2TV6DMZ7NYDMFACPCTNIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG/action/storage_attestation","attest_author":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG/action/author_attestation","sign_citation":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG/action/citation_signature","submit_replication":"https://pith.science/pith/TDRLG2TV6DMZ7NYDMFACPCTNIG/action/replication_record"}},"created_at":"2026-06-08T01:04:53.892144+00:00","updated_at":"2026-06-08T01:04:53.892144+00:00"}