{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UPB5KTAER4VCIYWRAQ3O2GBPVN","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":"a2b2a224be799d2bce02a990856247766c134d23d041406a3e05abd7def736bf","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T18:30:10Z","title_canon_sha256":"dc1cd9acdd686b8d6baf0493ac9b4e3410154f5cdcb68409f3a2a67753ed7832"},"schema_version":"1.0","source":{"id":"2605.15315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15315","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15315v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15315","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"UPB5KTAER4VC","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPB5KTAER4VCIYWR","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPB5KTAE","created_at":"2026-05-20T00:00:52Z"}],"graph_snapshots":[{"event_id":"sha256:0c5d2e6f25a204718b03b3b227a1bc1b80f1e1118bf2490ac219abd2b734837a","target":"graph","created_at":"2026-05-20T00:00:52Z","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":"LaMR wins 12 of 16 head-to-head multi-turn comparisons, saves up to 31% more tokens on multi-turn agent tasks, and improves Exact Match by up to +3.5 on single-turn tasks while frequently matching or outperforming unpruned full-context baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That labels derived via AST-based program analysis can reliably supervise the two separate rubrics and denoise the original binary teacher labels without introducing systematic biases or missing key relevance patterns."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LaMR decomposes code context pruning into two rubrics using dedicated CRFs, a mixture-of-experts gate, and AST-derived labels to filter noise and often match or beat full-context baselines on coding benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LaMR decomposes code relevance into separate semantic and dependency models to prune agent context without losing performance."}],"snapshot_sha256":"200ebb1c0855093c09ee348c6313f6de850fdde668c80228b44ae9c667965550"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"393696fd61ba8ac2bb7b3c6e97015ee1162d2a4450b201de15c35290296779a9"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.309801Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:25:54.332398Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.214444Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.771841Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15315/integrity.json","findings":[],"snapshot_sha256":"7907df9dd82ca0198095a2c516c860d04f5b3b78bc2e08d29729de6f6326b4b5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"LLM-powered coding agents spend the majority of their token budget reading repository files, yet much of the retrieved code is irrelevant to the task at hand. Existing learned pruners compress this context with a single-objective sequence labeler, collapsing all facets of code relevance into one score and one transition matrix. We show that this formulation creates a modeling bottleneck: a single CRF transition prior must serve heterogeneous retention patterns, including contiguous semantic spans and sparse structural support lines. We propose LaMR (Latent Multi-Rubric), a structured pruning f","authors_text":"Ana S. Carreon-Rascon, Feiyang Cai, Feng Luo, Huayu Li, Jingjing Wang, Wenhui Zhu, Xiwen Chen, Xuanzhao Dong, ZhengXiao He","cross_cats":["cs.CL"],"headline":"LaMR decomposes code relevance into separate semantic and dependency models to prune agent context without losing performance.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T18:30:10Z","title":"Context Pruning for Coding Agents via Multi-Rubric Latent Reasoning"},"references":{"count":37,"internal_anchors":6,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"SWE-agent: Agent-computer interfaces enable automated soft- ware engineering","work_id":"74ced3fc-504e-4314-9303-e05f30382daf","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Xu, Xiangru Tang, Mingchen Zhuge, Jiayi Pan, Yueqi Song, Bowen Li, Jaskirat Singh, Hoang H","work_id":"ce730d6f-f432-475a-ae20-27e7efdedd21","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Agentless: Demystifying LLM-based Software Engineering Agents","work_id":"8dd8a499-9154-4e7d-a3f5-622b4d20cfce","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Swe-pruner: Self-adaptive context pruning for coding agents, 2026","work_id":"fde1eb79-75cd-4429-9efc-334285e55812","year":2026},{"cited_arxiv_id":"2307.03172","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Lost in the Middle: How Language Models Use Long Contexts","work_id":"37c05e13-4a24-44f8-a1c4-da1bbe7223aa","year":2023}],"snapshot_sha256":"fcf9acfe91caac1963c6887bc90d81d4e1ecfa62c8b92a2b21d30b1a7ac28e06"},"source":{"id":"2605.15315","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:10:33.628957Z","id":"2055da72-8cf0-4eba-90d2-fa2d3521f8bb","model_set":{"reader":"grok-4.3"},"one_line_summary":"LaMR decomposes code context pruning into two rubrics using dedicated CRFs, a mixture-of-experts gate, and AST-derived labels to filter noise and often match or beat full-context baselines on coding benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LaMR decomposes code relevance into separate semantic and dependency models to prune agent context without losing performance.","strongest_claim":"LaMR wins 12 of 16 head-to-head multi-turn comparisons, saves up to 31% more tokens on multi-turn agent tasks, and improves Exact Match by up to +3.5 on single-turn tasks while frequently matching or outperforming unpruned full-context baselines.","weakest_assumption":"That labels derived via AST-based program analysis can reliably supervise the two separate rubrics and denoise the original binary teacher labels without introducing systematic biases or missing key relevance patterns."}},"verdict_id":"2055da72-8cf0-4eba-90d2-fa2d3521f8bb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4557eb5cecf90ad7a5ec886f78a7c24a439a6d3d1662081bfb7be52d20b39d19","target":"record","created_at":"2026-05-20T00:00:52Z","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":"a2b2a224be799d2bce02a990856247766c134d23d041406a3e05abd7def736bf","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T18:30:10Z","title_canon_sha256":"dc1cd9acdd686b8d6baf0493ac9b4e3410154f5cdcb68409f3a2a67753ed7832"},"schema_version":"1.0","source":{"id":"2605.15315","kind":"arxiv","version":1}},"canonical_sha256":"a3c3d54c048f2a2462d10436ed182fab5d0ba1860084bf571833cf1504279fb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3c3d54c048f2a2462d10436ed182fab5d0ba1860084bf571833cf1504279fb4","first_computed_at":"2026-05-20T00:00:52.292856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:52.292856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ihBpqdH9aaobZQ3HZyxBgsYcLkPYwqv1B0BqtBoWP55n+/H9Q22v5iTblbOGdTd8Fwkl1E0gNuUyk6Y3DqOYCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:52.293649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4557eb5cecf90ad7a5ec886f78a7c24a439a6d3d1662081bfb7be52d20b39d19","sha256:0c5d2e6f25a204718b03b3b227a1bc1b80f1e1118bf2490ac219abd2b734837a"],"state_sha256":"7bcb4dcd968044dc1dc620dc0562ba84a8cad7386b23d33fedd3fd971c1c2a96"}