{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HZLVOKH7EAK254VOF576YYGXW7","short_pith_number":"pith:HZLVOKH7","canonical_record":{"source":{"id":"2604.18170","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-20T12:29:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9b4be4b275a6cf057ef9a4ec5952bbc2cc1c7a90023db06737844ca715b4c59c","abstract_canon_sha256":"17efdecb043b41135baa5d878e21bba3cc2c4eb3506bb483e6ebee44fb024037"},"schema_version":"1.0"},"canonical_sha256":"3e575728ff2015aef2ae2f7fec60d7b7ee979e05424cc372baf19e2173d4b17d","source":{"kind":"arxiv","id":"2604.18170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.18170","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2604.18170v2","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.18170","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"HZLVOKH7EAK2","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"HZLVOKH7EAK254VO","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"HZLVOKH7","created_at":"2026-05-26T01:03:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HZLVOKH7EAK254VOF576YYGXW7","target":"record","payload":{"canonical_record":{"source":{"id":"2604.18170","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-20T12:29:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9b4be4b275a6cf057ef9a4ec5952bbc2cc1c7a90023db06737844ca715b4c59c","abstract_canon_sha256":"17efdecb043b41135baa5d878e21bba3cc2c4eb3506bb483e6ebee44fb024037"},"schema_version":"1.0"},"canonical_sha256":"3e575728ff2015aef2ae2f7fec60d7b7ee979e05424cc372baf19e2173d4b17d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:30.636267Z","signature_b64":"NzVMTCtXpSJUuBIloJG29e4I4hFNXQZXPHgnO6cVKkqgcG06RP2lIC4YfJ4buAe1+oA6MFrhWd8/yR8q195MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e575728ff2015aef2ae2f7fec60d7b7ee979e05424cc372baf19e2173d4b17d","last_reissued_at":"2026-05-26T01:03:30.635377Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:30.635377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.18170","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMN70Qg07KVO1bHfe9p/jd2JucOxYwpgLl9ZImNOEI1AqZOyuVavMVeVL/PvRtjF29u3wauJ5K4sKpgkEe5XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:53:19.969501Z"},"content_sha256":"6b4e82955291d59a89b79d669e18733fc92193af3ad3e29decd3ee2bb939e613","schema_version":"1.0","event_id":"sha256:6b4e82955291d59a89b79d669e18733fc92193af3ad3e29decd3ee2bb939e613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HZLVOKH7EAK254VOF576YYGXW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Copy-as-Decode: Grammar-Constrained Parallel Prefill for LLM Editing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration.","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ziyang Liu","submitted_at":"2026-04-20T12:29:53Z","abstract_excerpt":"LLMs edit text and code by autoregressively regenerating the full output, even when most tokens appear verbatim in the input. We study Copy-as-Decode, a decoding-layer mechanism that recasts edit generation as structured decoding over a two-primitive grammar: <copy lines=\"i-j\"/> references an input line range, <gen>...</gen> emits new content. A token-level FSM guarantees syntactic validity, and a serving-layer primitive updates the KV cache for each copy span via a single parallel-prefill forward rather than $N$ autoregressive steps -- sharing the parallel-forward kernel of speculative decodi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Composed with the empirical kernel over each corpus's span histogram this yields a closed-form wall-clock bound of 29.0× / 3.4× / 4.2× (13.0× pooled). A token-level extension reaches 91–99% coverage with 4.5×–6.5× floors. Oracle programs round-trip through the deterministic resolver on all 482 cases.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That accurate copy spans (line ranges or token ranges) can be selected at inference time; the mechanism itself is shown to be lossless under perfect spans, but the perturbation study demonstrates that off-by-one noise drops pooled EM from 100% to 15.48%.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding over copy and generate primitives, delivering closed-form upper-bound speedups of 13x pooled on editing benchmarks via parallel prefill without any training.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"73aa632e692e94de4f206ab5879156f2ad6a9bc36d86ac04c139bd8719379209"},"source":{"id":"2604.18170","kind":"arxiv","version":2},"verdict":{"id":"fa474098-3e7f-4046-ba9c-550153645f5a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T04:39:45.471296Z","strongest_claim":"Composed with the empirical kernel over each corpus's span histogram this yields a closed-form wall-clock bound of 29.0× / 3.4× / 4.2× (13.0× pooled). A token-level extension reaches 91–99% coverage with 4.5×–6.5× floors. Oracle programs round-trip through the deterministic resolver on all 482 cases.","one_line_summary":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding over copy and generate primitives, delivering closed-form upper-bound speedups of 13x pooled on editing benchmarks via parallel prefill without any training.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That accurate copy spans (line ranges or token ranges) can be selected at inference time; the mechanism itself is shown to be lossless under perfect spans, but the perturbation study demonstrates that off-by-one noise drops pooled EM from 100% to 15.48%.","pith_extraction_headline":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.18170/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T04:23:33.036863Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3cb60e181265e535f4938e09e63f59a14ae664f672bd51866968784e56ee9621"},"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"},"verdict_id":"fa474098-3e7f-4046-ba9c-550153645f5a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/106bL79QCd2j+jCCb+rP19EymDI7CcFtyVLo1XIAMIULMPfYEQTKt3R5gsYxgX5r/9cHkU1qJ73e1+6KRCoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:53:19.970525Z"},"content_sha256":"893843111e17bf8bc6388adf2ded86b57e029c13b79933d968bcdd996cb47424","schema_version":"1.0","event_id":"sha256:893843111e17bf8bc6388adf2ded86b57e029c13b79933d968bcdd996cb47424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZLVOKH7EAK254VOF576YYGXW7/bundle.json","state_url":"https://pith.science/pith/HZLVOKH7EAK254VOF576YYGXW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZLVOKH7EAK254VOF576YYGXW7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T07:53:19Z","links":{"resolver":"https://pith.science/pith/HZLVOKH7EAK254VOF576YYGXW7","bundle":"https://pith.science/pith/HZLVOKH7EAK254VOF576YYGXW7/bundle.json","state":"https://pith.science/pith/HZLVOKH7EAK254VOF576YYGXW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZLVOKH7EAK254VOF576YYGXW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HZLVOKH7EAK254VOF576YYGXW7","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":"17efdecb043b41135baa5d878e21bba3cc2c4eb3506bb483e6ebee44fb024037","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-20T12:29:53Z","title_canon_sha256":"9b4be4b275a6cf057ef9a4ec5952bbc2cc1c7a90023db06737844ca715b4c59c"},"schema_version":"1.0","source":{"id":"2604.18170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.18170","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2604.18170v2","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.18170","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"HZLVOKH7EAK2","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"HZLVOKH7EAK254VO","created_at":"2026-05-26T01:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"HZLVOKH7","created_at":"2026-05-26T01:03:30Z"}],"graph_snapshots":[{"event_id":"sha256:893843111e17bf8bc6388adf2ded86b57e029c13b79933d968bcdd996cb47424","target":"graph","created_at":"2026-05-26T01:03:30Z","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":"Composed with the empirical kernel over each corpus's span histogram this yields a closed-form wall-clock bound of 29.0× / 3.4× / 4.2× (13.0× pooled). A token-level extension reaches 91–99% coverage with 4.5×–6.5× floors. Oracle programs round-trip through the deterministic resolver on all 482 cases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That accurate copy spans (line ranges or token ranges) can be selected at inference time; the mechanism itself is shown to be lossless under perfect spans, but the perturbation study demonstrates that off-by-one noise drops pooled EM from 100% to 15.48%."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding over copy and generate primitives, delivering closed-form upper-bound speedups of 13x pooled on editing benchmarks via parallel prefill without any training."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration."}],"snapshot_sha256":"73aa632e692e94de4f206ab5879156f2ad6a9bc36d86ac04c139bd8719379209"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T04:23:33.036863Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.18170/integrity.json","findings":[],"snapshot_sha256":"3cb60e181265e535f4938e09e63f59a14ae664f672bd51866968784e56ee9621","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"LLMs edit text and code by autoregressively regenerating the full output, even when most tokens appear verbatim in the input. We study Copy-as-Decode, a decoding-layer mechanism that recasts edit generation as structured decoding over a two-primitive grammar: <copy lines=\"i-j\"/> references an input line range, <gen>...</gen> emits new content. A token-level FSM guarantees syntactic validity, and a serving-layer primitive updates the KV cache for each copy span via a single parallel-prefill forward rather than $N$ autoregressive steps -- sharing the parallel-forward kernel of speculative decodi","authors_text":"Ziyang Liu","cross_cats":["cs.AI"],"headline":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-20T12:29:53Z","title":"Copy-as-Decode: Grammar-Constrained Parallel Prefill for LLM Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.18170","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T04:39:45.471296Z","id":"fa474098-3e7f-4046-ba9c-550153645f5a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding over copy and generate primitives, delivering closed-form upper-bound speedups of 13x pooled on editing benchmarks via parallel prefill without any training.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Copy-as-Decode recasts LLM editing as grammar-constrained decoding that copies input spans via single-step parallel prefill instead of full autoregressive regeneration.","strongest_claim":"Composed with the empirical kernel over each corpus's span histogram this yields a closed-form wall-clock bound of 29.0× / 3.4× / 4.2× (13.0× pooled). A token-level extension reaches 91–99% coverage with 4.5×–6.5× floors. Oracle programs round-trip through the deterministic resolver on all 482 cases.","weakest_assumption":"That accurate copy spans (line ranges or token ranges) can be selected at inference time; the mechanism itself is shown to be lossless under perfect spans, but the perturbation study demonstrates that off-by-one noise drops pooled EM from 100% to 15.48%."}},"verdict_id":"fa474098-3e7f-4046-ba9c-550153645f5a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6b4e82955291d59a89b79d669e18733fc92193af3ad3e29decd3ee2bb939e613","target":"record","created_at":"2026-05-26T01:03:30Z","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":"17efdecb043b41135baa5d878e21bba3cc2c4eb3506bb483e6ebee44fb024037","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-20T12:29:53Z","title_canon_sha256":"9b4be4b275a6cf057ef9a4ec5952bbc2cc1c7a90023db06737844ca715b4c59c"},"schema_version":"1.0","source":{"id":"2604.18170","kind":"arxiv","version":2}},"canonical_sha256":"3e575728ff2015aef2ae2f7fec60d7b7ee979e05424cc372baf19e2173d4b17d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e575728ff2015aef2ae2f7fec60d7b7ee979e05424cc372baf19e2173d4b17d","first_computed_at":"2026-05-26T01:03:30.635377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:30.635377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NzVMTCtXpSJUuBIloJG29e4I4hFNXQZXPHgnO6cVKkqgcG06RP2lIC4YfJ4buAe1+oA6MFrhWd8/yR8q195MAg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:30.636267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.18170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b4e82955291d59a89b79d669e18733fc92193af3ad3e29decd3ee2bb939e613","sha256:893843111e17bf8bc6388adf2ded86b57e029c13b79933d968bcdd996cb47424"],"state_sha256":"3809eae7043afc102d1ee9bf1de73f3a32226f79c4ae5849fd03bcfe5a3a9eea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScwVO5KtSLnziRfCoJjNG70h88bDR4SIIDABr3e3gjQSyp/FCOdQJiLuVJ8ORgBIC/LFTDCFgmvwBo9sVLF7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:53:19.974725Z","bundle_sha256":"24d24393551365133c6e8df89fe2dc6eb638eb5bb53db578c543a453487d9c4b"}}