{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GSRUJ57AQLJWAVAXAHFGNZ3CLY","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":"db75e1f32b4c8967b1f70c26ed3bee66e560ac6231564feb1f4d6c88d2ffea34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-12T15:28:30Z","title_canon_sha256":"f7a4e6e27d92c7546ed72d25dc50b4f9a8c0adde89e0b0827533ceda3e5f89fc"},"schema_version":"1.0","source":{"id":"2605.12260","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12260","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12260v2","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12260","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"GSRUJ57AQLJW","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"GSRUJ57AQLJWAVAX","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"GSRUJ57A","created_at":"2026-05-25T02:02:16Z"}],"graph_snapshots":[{"event_id":"sha256:365f490f48cbb2c1978372e5ffb67b64b3023c5298a0f01e48e8c4cd604ce4bc","target":"graph","created_at":"2026-05-25T02:02:16Z","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":"PRISM delivers substantially higher LLM-judge accuracy than every same-protocol baseline at an order-of-magnitude smaller context budget, occupying a previously empty corner of the accuracy-context-cost frontier."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the upstream ingestion pipeline already supplies a clean graph-structured memory with typed relations and that query intent can be detected reliably enough to guide edge costing without any training or fine-tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PRISM achieves higher accuracy than baselines on long-horizon agent tasks at an order-of-magnitude smaller context budget by combining hierarchical bundle search, query-sensitive costing, evidence compression, and adaptive intent routing over structured memory."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PRISM retrieves evidence from graph-structured memory via intent-aware min-cost path selection and compression, achieving higher accuracy than baselines at an order-of-magnitude smaller context budget."}],"snapshot_sha256":"ad54ed29acd7b83bc593361aab8fe9d77d42ac04bcf0085970f1bd7e880acd18"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a2ae4e5ad51100c21a43ea3d1414d1499184a4d21ce7b0e8270e81bd84cb2191"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T14:01:25.497837Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T10:17:18.257785Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:41:58.334507Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T10:40:44.697573Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.12260/integrity.json","findings":[],"snapshot_sha256":"5dc569acb3a34337bb6f3f0f7630e8a821a4c49b019e683b96bfb95ba84cebc9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Long-horizon language agents accumulate conversation history far faster than any fixed context window can hold, making memory management critical to both answer accuracy and serving cost. Existing approaches either expand the context window without addressing what is retrieved, perform heavy ingestion-time fact extraction at substantial token cost, or rely on heuristic graph traversal that leaves both accuracy and efficiency on the table. We present PRISM, a training-free retrieval-side framework that treats long-horizon memory as a joint retrieval-and-compression problem over a graph-structur","authors_text":"Jingyi Peng, Qiuzhuang Sun, Weiting Liu, Zhongwei Wan","cross_cats":[],"headline":"PRISM retrieves evidence from graph-structured memory via intent-aware min-cost path selection and compression, achieving higher accuracy than baselines at an order-of-magnitude smaller context budget.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-12T15:28:30Z","title":"PRISM: Pareto-Efficient Retrieval over Intent-Aware Structured Memory for Long-Horizon Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.12260","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T05:04:32.670575Z","id":"f73aaf08-5fef-4c6f-9067-d5981ed346c2","model_set":{"reader":"grok-4.3"},"one_line_summary":"PRISM achieves higher accuracy than baselines on long-horizon agent tasks at an order-of-magnitude smaller context budget by combining hierarchical bundle search, query-sensitive costing, evidence compression, and adaptive intent routing over structured memory.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PRISM retrieves evidence from graph-structured memory via intent-aware min-cost path selection and compression, achieving higher accuracy than baselines at an order-of-magnitude smaller context budget.","strongest_claim":"PRISM delivers substantially higher LLM-judge accuracy than every same-protocol baseline at an order-of-magnitude smaller context budget, occupying a previously empty corner of the accuracy-context-cost frontier.","weakest_assumption":"That the upstream ingestion pipeline already supplies a clean graph-structured memory with typed relations and that query intent can be detected reliably enough to guide edge costing without any training or fine-tuning."}},"verdict_id":"f73aaf08-5fef-4c6f-9067-d5981ed346c2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ff28dd5272eab277c7a80d089d25569c8acfae7b9984f222f2edc2fb8d991eb","target":"record","created_at":"2026-05-25T02:02:16Z","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":"db75e1f32b4c8967b1f70c26ed3bee66e560ac6231564feb1f4d6c88d2ffea34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-12T15:28:30Z","title_canon_sha256":"f7a4e6e27d92c7546ed72d25dc50b4f9a8c0adde89e0b0827533ceda3e5f89fc"},"schema_version":"1.0","source":{"id":"2605.12260","kind":"arxiv","version":2}},"canonical_sha256":"34a344f7e082d360541701ca66e7625e061413d48cef33a7425c63e2968204a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a344f7e082d360541701ca66e7625e061413d48cef33a7425c63e2968204a6","first_computed_at":"2026-05-25T02:02:16.642994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:16.642994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKN9BXSki0RqzNkjs8rvUKHu6F5Nua9g5kAQXpSV7edXwSGhHc27CVeUdqkG77D+NXaSiUlpJ1zixJR/gVqUAQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:16.643541Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12260","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ff28dd5272eab277c7a80d089d25569c8acfae7b9984f222f2edc2fb8d991eb","sha256:365f490f48cbb2c1978372e5ffb67b64b3023c5298a0f01e48e8c4cd604ce4bc"],"state_sha256":"c7db73fda33c2691ad3ff2ae4ebf01c801059c6dd097199885df9062369d1a59"}