{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7B4TUBCFVCJXBMQE2N7FXOBNLJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9ea225cee9456a4e22355808e6595436f1a65c8b87dece04d8c408643500d5ef","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-08T20:47:51Z","title_canon_sha256":"67ad143d51c707671336c52ca0a6480f29861590138a96e5f0c7e8941d4accee"},"schema_version":"1.0","source":{"id":"2604.07590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.07590","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2604.07590v2","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07590","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"7B4TUBCFVCJX","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"7B4TUBCFVCJXBMQE","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"7B4TUBCF","created_at":"2026-06-12T01:09:27Z"}],"graph_snapshots":[{"event_id":"sha256:abe049254fe8435a925fb7703c8c370545dba637923e68dd541b19eea10f2d29","target":"graph","created_at":"2026-06-12T01:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The DCD architecture enables progressive restriction of both retrieval and generation scopes through hierarchical decomposition and multi-stage routing based on structured model outputs, improving robustness, factual accuracy, and answer relevance in applied RAG scenarios on heterogeneous corpora."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the hierarchical domain-collection-document decomposition and the multi-stage routing decisions derived from structured model outputs will reliably reduce scope without introducing new failure modes or excessive manual domain engineering on real heterogeneous data."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DCD introduces a domain-oriented hierarchical decomposition and staged routing workflow that restricts retrieval and generation scopes progressively to improve robustness and factual accuracy in RAG on complex, multi-source queries."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The DCD architecture uses hierarchical domain-collection-document decomposition and multi-stage routing to progressively restrict retrieval and generation scopes in RAG systems."}],"snapshot_sha256":"a066e6d7d01908e540152f15e93a4e44d1cf55a3a29d53a715d712761782578f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.07590/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Retrieval-Augmented Generation (RAG) is widely used to ground large language models in external knowledge sources. However, when applied to heterogeneous corpora and multi-step queries, Naive RAG pipelines often degrade in quality due to flat knowledge representations and the absence of explicit workflows. In this work, we introduce DCD (Domain-Collection-Document), a domain-oriented design to structure knowledge and control query processing in RAG systems without modifying the underlying language model. The proposed approach relies on a hierarchical decomposition of the information space and ","authors_text":"Igor Reshetnikov, Maksim Maksimov, Nikita Belov, Nikita Miteyko, Valerii Kovalskii","cross_cats":["cs.AI"],"headline":"The DCD architecture uses hierarchical domain-collection-document decomposition and multi-stage routing to progressively restrict retrieval and generation scopes in RAG systems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-08T20:47:51Z","title":"DCD: Domain-Oriented Design for Controlled Retrieval-Augmented Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.07590","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T16:58:00.833676Z","id":"2c2ee343-d979-457b-8a24-425253aa5e8a","model_set":{"reader":"grok-4.3"},"one_line_summary":"DCD introduces a domain-oriented hierarchical decomposition and staged routing workflow that restricts retrieval and generation scopes progressively to improve robustness and factual accuracy in RAG on complex, multi-source queries.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The DCD architecture uses hierarchical domain-collection-document decomposition and multi-stage routing to progressively restrict retrieval and generation scopes in RAG systems.","strongest_claim":"The DCD architecture enables progressive restriction of both retrieval and generation scopes through hierarchical decomposition and multi-stage routing based on structured model outputs, improving robustness, factual accuracy, and answer relevance in applied RAG scenarios on heterogeneous corpora.","weakest_assumption":"That the hierarchical domain-collection-document decomposition and the multi-stage routing decisions derived from structured model outputs will reliably reduce scope without introducing new failure modes or excessive manual domain engineering on real heterogeneous data."}},"verdict_id":"2c2ee343-d979-457b-8a24-425253aa5e8a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf6ef8910e337e1ca16c66816f9770e5f4ae812a415ab114add699878da4cadd","target":"record","created_at":"2026-06-12T01:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9ea225cee9456a4e22355808e6595436f1a65c8b87dece04d8c408643500d5ef","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-08T20:47:51Z","title_canon_sha256":"67ad143d51c707671336c52ca0a6480f29861590138a96e5f0c7e8941d4accee"},"schema_version":"1.0","source":{"id":"2604.07590","kind":"arxiv","version":2}},"canonical_sha256":"f8793a0445a89370b204d37e5bb82d5a5005a5d50bcd3695ef821225c4ff686f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8793a0445a89370b204d37e5bb82d5a5005a5d50bcd3695ef821225c4ff686f","first_computed_at":"2026-06-12T01:09:27.508358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:27.508358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CYPdVTOQBreMifd0VX/yuRWrBjlRVd2Sf9bPGO92dwQiyylcYydehC/0vetwUHv2QUg1sc09iRAZN9XWLcNyDw==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:27.508844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.07590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf6ef8910e337e1ca16c66816f9770e5f4ae812a415ab114add699878da4cadd","sha256:abe049254fe8435a925fb7703c8c370545dba637923e68dd541b19eea10f2d29"],"state_sha256":"1ba1cbd2badb41df340906f2764274e24a3da47cc5c268d8e79fad77a7a000b3"}