{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TK4LO3NGWX5J6VA5JY2AYQGUBP","short_pith_number":"pith:TK4LO3NG","canonical_record":{"source":{"id":"2605.13624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T14:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"61f8de49c2e00490fb4934f8208abb32b14da80a7bfce437216991120b0d12d4","abstract_canon_sha256":"48e1f9ac67988d091c2669cc306f4528c6ac1f3d1076171e3f288b1e22fb06ef"},"schema_version":"1.0"},"canonical_sha256":"9ab8b76da6b5fa9f541d4e340c40d40bdbbc0a78bf8f8e2129aebb6cc19ff358","source":{"kind":"arxiv","id":"2605.13624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13624","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13624v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13624","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"TK4LO3NGWX5J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TK4LO3NGWX5J6VA5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TK4LO3NG","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TK4LO3NGWX5J6VA5JY2AYQGUBP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T14:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"61f8de49c2e00490fb4934f8208abb32b14da80a7bfce437216991120b0d12d4","abstract_canon_sha256":"48e1f9ac67988d091c2669cc306f4528c6ac1f3d1076171e3f288b1e22fb06ef"},"schema_version":"1.0"},"canonical_sha256":"9ab8b76da6b5fa9f541d4e340c40d40bdbbc0a78bf8f8e2129aebb6cc19ff358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.842142Z","signature_b64":"yeHZWk5PuKXfR5yIXlpbUUcq4mbHnhDE0F+V9rpliwZTbs2LZxsL61qX6GR2Gvpg0lg0WkDUkAM9/Xzs8fnSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab8b76da6b5fa9f541d4e340c40d40bdbbc0a78bf8f8e2129aebb6cc19ff358","last_reissued_at":"2026-05-18T02:44:17.841674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.841674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13624","source_version":1,"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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15qWO6sVn54kIGhfASf14nUiwxzS2Xu+Xtp2i2vJaXfcO4UIl+zG+FjynhUXDbZjbhHWaUgd+x3dctx4c1WtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:57:40.709701Z"},"content_sha256":"2bf8124f668a77d2cfb405818570fe46c2111c2b2a885f819677c12319ab6113","schema_version":"1.0","event_id":"sha256:2bf8124f668a77d2cfb405818570fe46c2111c2b2a885f819677c12319ab6113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TK4LO3NGWX5J6VA5JY2AYQGUBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edit-level Majority Voting Mitigates Over-Correction in LLM-based Grammatical Error Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Takumi Goto, Taro Watanabe, Yusuke Sakai","submitted_at":"2026-05-13T14:52:15Z","abstract_excerpt":"Grammatical error correction using large language models often suffers from the over-correction issue. To mitigate this, we propose a training-free inference method that performs edit-level majority voting over multiple candidates generated by a single model, without requiring model modifications or additional training. Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used. We release two r"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That generating multiple candidates from a single LLM and applying majority voting at the edit level will reliably mitigate over-correction, assuming sufficient diversity among candidates and a well-defined notion of individual edits.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Edit-level majority voting on multiple LLM-generated candidates reduces over-correction in grammatical error correction and outperforms greedy and MBR decoding on nine multilingual benchmarks while remaining stable to prompt variations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6d6e08457161232a6fbe2e2ded59c6774ae196971eba51d8c6b7d82ea8d464ee"},"source":{"id":"2605.13624","kind":"arxiv","version":1},"verdict":{"id":"15782e9a-1942-4074-be2b-c668d648f18c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:55:17.732370Z","strongest_claim":"Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used.","one_line_summary":"Edit-level majority voting on multiple LLM-generated candidates reduces over-correction in grammatical error correction and outperforms greedy and MBR decoding on nine multilingual benchmarks while remaining stable to prompt variations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That generating multiple candidates from a single LLM and applying majority voting at the edit level will reliably mitigate over-correction, assuming sufficient diversity among candidates and a well-defined notion of individual edits.","pith_extraction_headline":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction."},"references":{"count":61,"sample":[{"doi":"10.18653/v1/d19-1435","year":2019,"title":"Abhijeet Awasthi, Sunita Sarawagi, Rasna Goyal, Sabyasachi Ghosh, and Vihari Piratla. 2019. https://doi.org/10.18653/v1/D19-1435 Parallel iterative edit models for local sequence transduction . In Pro","work_id":"888cf88f-fcda-469c-9fb0-3e50806f937f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/w18-6111","year":2018,"title":"Adriane Boyd. 2018. https://doi.org/10.18653/v1/W18-6111 Using W ikipedia edits in low resource grammatical error correction . In Proceedings of the 2018 EMNLP Workshop W- NUT : The 4th Workshop on No","work_id":"9ea39a12-0dc0-4100-877d-b782515eee8a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/w19-4406","year":2019,"title":"In: Proceedings of the Fourteenth Workshop on Innovative Use of NLP for Building Educational Applications","work_id":"51b8b3f6-f752-4daf-854b-77b6ddcb0ce5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/p17-1074","year":2017,"title":"Christopher Bryant, Mariano Felice, and Ted Briscoe. 2017. https://doi.org/10.18653/v1/P17-1074 Automatic annotation and evaluation of error types for grammatical error correction . In Proceedings of ","work_id":"40e16e5c-880b-4c2c-9e36-827ee3b4ea85","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Bin Cao, Kai Jiang, Fayu Pan, Chenlei Bao, and Jing Fan. 2024. https://aclanthology.org/2024.lrec-main.772/ Improving grammatical error correction by correction acceptability discrimination . In Proce","work_id":"e50d24ac-7f56-4d15-91da-11667b91fdf7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"9f464c3e2756fc641a0241eb8117a82d2d7821d72edc861f47538f362258962b","internal_anchors":5},"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":"15782e9a-1942-4074-be2b-c668d648f18c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMi3Bwi9xT420J0n4KwJJWOQZQx8n2WwbMar5B/FXLflKgOACTIhPA6tUfNPuYusVb2IvOWGBd+NNc5OO4kIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:57:40.710523Z"},"content_sha256":"e2f557429379814dc4ab7fadbfe17f2395513c75fe913411d3f1242582603e17","schema_version":"1.0","event_id":"sha256:e2f557429379814dc4ab7fadbfe17f2395513c75fe913411d3f1242582603e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/bundle.json","state_url":"https://pith.science/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/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-27T04:57:40Z","links":{"resolver":"https://pith.science/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP","bundle":"https://pith.science/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/bundle.json","state":"https://pith.science/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TK4LO3NGWX5J6VA5JY2AYQGUBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TK4LO3NGWX5J6VA5JY2AYQGUBP","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":"48e1f9ac67988d091c2669cc306f4528c6ac1f3d1076171e3f288b1e22fb06ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T14:52:15Z","title_canon_sha256":"61f8de49c2e00490fb4934f8208abb32b14da80a7bfce437216991120b0d12d4"},"schema_version":"1.0","source":{"id":"2605.13624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13624","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13624v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13624","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"TK4LO3NGWX5J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TK4LO3NGWX5J6VA5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TK4LO3NG","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e2f557429379814dc4ab7fadbfe17f2395513c75fe913411d3f1242582603e17","target":"graph","created_at":"2026-05-18T02:44:17Z","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":"Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That generating multiple candidates from a single LLM and applying majority voting at the edit level will reliably mitigate over-correction, assuming sufficient diversity among candidates and a well-defined notion of individual edits."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Edit-level majority voting on multiple LLM-generated candidates reduces over-correction in grammatical error correction and outperforms greedy and MBR decoding on nine multilingual benchmarks while remaining stable to prompt variations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction."}],"snapshot_sha256":"6d6e08457161232a6fbe2e2ded59c6774ae196971eba51d8c6b7d82ea8d464ee"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Grammatical error correction using large language models often suffers from the over-correction issue. To mitigate this, we propose a training-free inference method that performs edit-level majority voting over multiple candidates generated by a single model, without requiring model modifications or additional training. Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used. We release two r","authors_text":"Takumi Goto, Taro Watanabe, Yusuke Sakai","cross_cats":[],"headline":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T14:52:15Z","title":"Edit-level Majority Voting Mitigates Over-Correction in LLM-based Grammatical Error Correction"},"references":{"count":61,"internal_anchors":5,"resolved_work":61,"sample":[{"cited_arxiv_id":"","doi":"10.18653/v1/d19-1435","is_internal_anchor":false,"ref_index":1,"title":"Abhijeet Awasthi, Sunita Sarawagi, Rasna Goyal, Sabyasachi Ghosh, and Vihari Piratla. 2019. https://doi.org/10.18653/v1/D19-1435 Parallel iterative edit models for local sequence transduction . In Pro","work_id":"888cf88f-fcda-469c-9fb0-3e50806f937f","year":2019},{"cited_arxiv_id":"","doi":"10.18653/v1/w18-6111","is_internal_anchor":false,"ref_index":2,"title":"Adriane Boyd. 2018. https://doi.org/10.18653/v1/W18-6111 Using W ikipedia edits in low resource grammatical error correction . In Proceedings of the 2018 EMNLP Workshop W- NUT : The 4th Workshop on No","work_id":"9ea39a12-0dc0-4100-877d-b782515eee8a","year":2018},{"cited_arxiv_id":"","doi":"10.18653/v1/w19-4406","is_internal_anchor":false,"ref_index":3,"title":"In: Proceedings of the Fourteenth Workshop on Innovative Use of NLP for Building Educational Applications","work_id":"51b8b3f6-f752-4daf-854b-77b6ddcb0ce5","year":2019},{"cited_arxiv_id":"","doi":"10.18653/v1/p17-1074","is_internal_anchor":false,"ref_index":4,"title":"Christopher Bryant, Mariano Felice, and Ted Briscoe. 2017. https://doi.org/10.18653/v1/P17-1074 Automatic annotation and evaluation of error types for grammatical error correction . In Proceedings of ","work_id":"40e16e5c-880b-4c2c-9e36-827ee3b4ea85","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bin Cao, Kai Jiang, Fayu Pan, Chenlei Bao, and Jing Fan. 2024. https://aclanthology.org/2024.lrec-main.772/ Improving grammatical error correction by correction acceptability discrimination . In Proce","work_id":"e50d24ac-7f56-4d15-91da-11667b91fdf7","year":2024}],"snapshot_sha256":"9f464c3e2756fc641a0241eb8117a82d2d7821d72edc861f47538f362258962b"},"source":{"id":"2605.13624","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:55:17.732370Z","id":"15782e9a-1942-4074-be2b-c668d648f18c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Edit-level majority voting on multiple LLM-generated candidates reduces over-correction in grammatical error correction and outperforms greedy and MBR decoding on nine multilingual benchmarks while remaining stable to prompt variations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Edit-level majority voting over multiple LLM candidates reduces over-correction in grammatical error correction.","strongest_claim":"Across nine benchmarks covering English, Czech, German, Ukrainian, Korean, Hindi, and Romanian, the proposed method outperforms both greedy and MBR decoding in most cases. Moreover, it yields stable correction quality regardless of the instruction prompts used.","weakest_assumption":"That generating multiple candidates from a single LLM and applying majority voting at the edit level will reliably mitigate over-correction, assuming sufficient diversity among candidates and a well-defined notion of individual edits."}},"verdict_id":"15782e9a-1942-4074-be2b-c668d648f18c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2bf8124f668a77d2cfb405818570fe46c2111c2b2a885f819677c12319ab6113","target":"record","created_at":"2026-05-18T02:44:17Z","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":"48e1f9ac67988d091c2669cc306f4528c6ac1f3d1076171e3f288b1e22fb06ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T14:52:15Z","title_canon_sha256":"61f8de49c2e00490fb4934f8208abb32b14da80a7bfce437216991120b0d12d4"},"schema_version":"1.0","source":{"id":"2605.13624","kind":"arxiv","version":1}},"canonical_sha256":"9ab8b76da6b5fa9f541d4e340c40d40bdbbc0a78bf8f8e2129aebb6cc19ff358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ab8b76da6b5fa9f541d4e340c40d40bdbbc0a78bf8f8e2129aebb6cc19ff358","first_computed_at":"2026-05-18T02:44:17.841674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.841674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yeHZWk5PuKXfR5yIXlpbUUcq4mbHnhDE0F+V9rpliwZTbs2LZxsL61qX6GR2Gvpg0lg0WkDUkAM9/Xzs8fnSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.842142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bf8124f668a77d2cfb405818570fe46c2111c2b2a885f819677c12319ab6113","sha256:e2f557429379814dc4ab7fadbfe17f2395513c75fe913411d3f1242582603e17"],"state_sha256":"0ac8a2e6a6a216a2439bbf7bbfeff68bac3e91ffddbcf8ab4fd773cb2e6dff29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xz3e9a5qGH2Lv3lsS0JZ6hIRCasarKZXL4KLZX+YKx/vDsC/Bf008JleOmp67E1eNMRo6tU7aZwqD4LiX8x/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:57:40.714382Z","bundle_sha256":"97511ecd5fb1a49e92440d521e1d87583c2b79cb34b4c4c5356760ed5593e972"}}