{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7AV3Z75RPIXR36FRW3NLM56BYQ","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":"ee84895498ee252f016a917436ae2433135e7aa9cf76c33864dfddd12c53d817","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-13T08:10:53Z","title_canon_sha256":"525300392b4a6ea3c78f4cf87153668afcfe02e94c03c41f2b275e8ed29923ce"},"schema_version":"1.0","source":{"id":"2606.28361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28361","created_at":"2026-06-30T00:15:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28361v1","created_at":"2026-06-30T00:15:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28361","created_at":"2026-06-30T00:15:11Z"},{"alias_kind":"pith_short_12","alias_value":"7AV3Z75RPIXR","created_at":"2026-06-30T00:15:11Z"},{"alias_kind":"pith_short_16","alias_value":"7AV3Z75RPIXR36FR","created_at":"2026-06-30T00:15:11Z"},{"alias_kind":"pith_short_8","alias_value":"7AV3Z75R","created_at":"2026-06-30T00:15:11Z"}],"graph_snapshots":[{"event_id":"sha256:d4fecaa9707ae68c318be99ee1ad5f585d2b8c73fb647834c872c433c4825a2b","target":"graph","created_at":"2026-06-30T00:15:11Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-step retrieval-augmented generation (RAG) has been widely deployed as LLM-powered web services for complex question answering, where iterative retrieval-reasoning rounds deliver strong multi-hop accuracy. However, this paradigm causes historical documents and reasoning traces to accumulate across rounds, inflating cumulative input tokens approximately as $O(N^2)$ with progressively increasing noise density. In API-based service architectures, such growth directly amplifies per-request billing cost, network payload, and response latency. Existing compression approaches rely on pretrained ","authors_text":"Kuan Yan, Tian Wang, Weijia Jia, Zhiqing Tang","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-13T08:10:53Z","title":"ConCise: Training-Free Conclusion-Chain State Compression for Cost-Efficient Multi-Step RAG Services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28361","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8fa647df589c9ed5f3bc420defc8a8b56a2bfcdbf46c54cb015cc03e5b8174fd","target":"record","created_at":"2026-06-30T00:15:11Z","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":"ee84895498ee252f016a917436ae2433135e7aa9cf76c33864dfddd12c53d817","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-13T08:10:53Z","title_canon_sha256":"525300392b4a6ea3c78f4cf87153668afcfe02e94c03c41f2b275e8ed29923ce"},"schema_version":"1.0","source":{"id":"2606.28361","kind":"arxiv","version":1}},"canonical_sha256":"f82bbcffb17a2f1df8b1b6dab677c1c432031926582680cd47ab2882ac93dcfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f82bbcffb17a2f1df8b1b6dab677c1c432031926582680cd47ab2882ac93dcfd","first_computed_at":"2026-06-30T00:15:11.987653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T00:15:11.987653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e2yAy71bfh9Bi3pwSIOvnm72tH671nApSY/CXIpsN0epTBvn43bncvQbv2N7TNS0szTGLaVK1PbqkJLXJnfSDQ==","signature_status":"signed_v1","signed_at":"2026-06-30T00:15:11.988012Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fa647df589c9ed5f3bc420defc8a8b56a2bfcdbf46c54cb015cc03e5b8174fd","sha256:d4fecaa9707ae68c318be99ee1ad5f585d2b8c73fb647834c872c433c4825a2b"],"state_sha256":"05c3d296483e5defeb49a248ffdb3aa5eae671eac894e4f45894d4199e384e3d"}