{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WYQWO77DNXZRWH2GZXBOZJMNNS","short_pith_number":"pith:WYQWO77D","canonical_record":{"source":{"id":"2605.13373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T11:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"61239da1604aa1d52a774821fa098d5e5613f472da5c15cb049ab35e32716c21","abstract_canon_sha256":"1756df113789681676cfe85ce64e1757ad9fc0106825210a078e8136a0442093"},"schema_version":"1.0"},"canonical_sha256":"b621677fe36df31b1f46cdc2eca58d6c9b0fb446a02c8885a67c7e672ec2773b","source":{"kind":"arxiv","id":"2605.13373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13373","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13373v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13373","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"WYQWO77DNXZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WYQWO77DNXZRWH2G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WYQWO77D","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WYQWO77DNXZRWH2GZXBOZJMNNS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T11:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"61239da1604aa1d52a774821fa098d5e5613f472da5c15cb049ab35e32716c21","abstract_canon_sha256":"1756df113789681676cfe85ce64e1757ad9fc0106825210a078e8136a0442093"},"schema_version":"1.0"},"canonical_sha256":"b621677fe36df31b1f46cdc2eca58d6c9b0fb446a02c8885a67c7e672ec2773b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.944907Z","signature_b64":"EM/BqaEvz7mQaX4RPjRTDML6S8sZUsoqfs6oheC9xXxJ/Oyigo8yo00mRV1VKvqf1CKT7MZYz6XXZpa+HDc7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b621677fe36df31b1f46cdc2eca58d6c9b0fb446a02c8885a67c7e672ec2773b","last_reissued_at":"2026-05-18T02:44:47.944465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.944465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13373","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZ6b9buGfW10ZFLJbhGl4rzMmY8YVDudwJaiKpmeAFV/F3wLb/CzjY3mWAue3TCBajukndN+nBn3g2UOufc3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:48:50.052538Z"},"content_sha256":"e5884002940e888d5abe3aa6c24a96da79ec04f484ed58906ee92e0cc14b74f1","schema_version":"1.0","event_id":"sha256:e5884002940e888d5abe3aa6c24a96da79ec04f484ed58906ee92e0cc14b74f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WYQWO77DNXZRWH2GZXBOZJMNNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Pre-trained Encoder-Decoder Transformers for Sequence-to-Sequence Constituent Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cristina Outeiri\\~no Cid, Daniel Fern\\'andez-Gonz\\'alez","submitted_at":"2026-05-13T11:28:56Z","abstract_excerpt":"To achieve deep natural language understanding, syntactic constituent parsing plays a crucial role and is widely required by many artificial intelligence systems for processing both text and speech. A recent approach involves using standard sequence-to-sequence models to handle constituent parsing as a machine translation problem, moving away from traditional task-specific parsers. These models are typically initialized with pre-trained encoder-only language models like BERT or RoBERTa. However, the use of pre-trained encoder-decoder language models for constituency parsing has not been thorou"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our results demonstrate that our approach outperforms all prior sequence-to-sequence models and performs competitively with leading task-specific constituent parsers on continuous constituent parsing.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That standard fine-tuning of encoder-decoder models on linearized trees is sufficient to capture the full syntactic structure without additional task-specific mechanisms or architectural changes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Pre-trained encoder-decoder transformers fine-tuned for sequence-to-sequence constituent parsing outperform prior seq2seq models and compete with specialized parsers on continuous treebanks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7f91b8c5c0cc883d676bb24b0b3b6ae3cbe93e4adefac0b6a4cbcd6cd748e604"},"source":{"id":"2605.13373","kind":"arxiv","version":1},"verdict":{"id":"f934572b-21b2-4149-b8a0-cd11a7de4353","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:53:57.933858Z","strongest_claim":"Our results demonstrate that our approach outperforms all prior sequence-to-sequence models and performs competitively with leading task-specific constituent parsers on continuous constituent parsing.","one_line_summary":"Pre-trained encoder-decoder transformers fine-tuned for sequence-to-sequence constituent parsing outperform prior seq2seq models and compete with specialized parsers on continuous treebanks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That standard fine-tuning of encoder-decoder models on linearized trees is sufficient to capture the full syntactic structure without additional task-specific mechanisms or architectural changes.","pith_extraction_headline":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data."},"references":{"count":62,"sample":[{"doi":"10.18653/v1/d18-1037","year":2018,"title":"J. G¯ u, H. S. Shavarani, A. Sarkar, Top-down tree structured decoding with syntactic connections for neural machine translation and parsing, in: Proceedings of the 2018 Conference on Empirical Method","work_id":"d9e01bc1-378c-426e-9306-87d3e715ef23","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"X. Wang, H. Pham, P. Yin, G. Neubig, A tree-based decoder for neu- ral machine translation, in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Association for ","work_id":"c22def47-2ae9-4c55-94b0-fa9f6fdbfcdd","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"A. Currey, K. Heafield, Incorporating source syntax into transformer- based neural machine translation, in: Proceedings of the Fourth Con- ference on Machine Translation (Volume 1: Research Papers), A","work_id":"1d6e7d82-2803-40e2-bc29-3535685caeac","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.2174/2666255813999200922142212","year":2022,"title":"D. Bouras, M. Amroune, H. Bendjenna, I. Bendib, Improving fine- grained opinion mining approach with a deep constituency tree-long short term memory network and word embedding, Recent Advances in Comp","work_id":"b1390ea3-5358-49d3-b7a5-0d395d3eb6b9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/2020.acl-main.341","year":2020,"title":"Sentibert: A transferable transformer-based architecture for composi- tional sentiment semantics","work_id":"d5f43344-7028-4c72-821d-11336fcce8e1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":62,"snapshot_sha256":"8bdea998f3343ad16bb7c02726f675fbea3dd4f37c7629aa6641c6adf32b1e07","internal_anchors":2},"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":"f934572b-21b2-4149-b8a0-cd11a7de4353"},"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Toz3u2UCGY9T+8mxD+M2s2AglsYtiOPSnhZGNH9h3b1QsnWZqPHpcrtztmwSri3rhLtG88GWHu4VtIk4QnMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:48:50.053697Z"},"content_sha256":"d153dfac9569841bfd4adca5e1ddec48e6c7a21c4fa20c31c8dc48f4dbd26a68","schema_version":"1.0","event_id":"sha256:d153dfac9569841bfd4adca5e1ddec48e6c7a21c4fa20c31c8dc48f4dbd26a68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/bundle.json","state_url":"https://pith.science/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/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-06-07T14:48:50Z","links":{"resolver":"https://pith.science/pith/WYQWO77DNXZRWH2GZXBOZJMNNS","bundle":"https://pith.science/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/bundle.json","state":"https://pith.science/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYQWO77DNXZRWH2GZXBOZJMNNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WYQWO77DNXZRWH2GZXBOZJMNNS","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":"1756df113789681676cfe85ce64e1757ad9fc0106825210a078e8136a0442093","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T11:28:56Z","title_canon_sha256":"61239da1604aa1d52a774821fa098d5e5613f472da5c15cb049ab35e32716c21"},"schema_version":"1.0","source":{"id":"2605.13373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13373","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13373v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13373","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"WYQWO77DNXZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WYQWO77DNXZRWH2G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WYQWO77D","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d153dfac9569841bfd4adca5e1ddec48e6c7a21c4fa20c31c8dc48f4dbd26a68","target":"graph","created_at":"2026-05-18T02:44:47Z","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":"Our results demonstrate that our approach outperforms all prior sequence-to-sequence models and performs competitively with leading task-specific constituent parsers on continuous constituent parsing."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That standard fine-tuning of encoder-decoder models on linearized trees is sufficient to capture the full syntactic structure without additional task-specific mechanisms or architectural changes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Pre-trained encoder-decoder transformers fine-tuned for sequence-to-sequence constituent parsing outperform prior seq2seq models and compete with specialized parsers on continuous treebanks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data."}],"snapshot_sha256":"7f91b8c5c0cc883d676bb24b0b3b6ae3cbe93e4adefac0b6a4cbcd6cd748e604"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"To achieve deep natural language understanding, syntactic constituent parsing plays a crucial role and is widely required by many artificial intelligence systems for processing both text and speech. A recent approach involves using standard sequence-to-sequence models to handle constituent parsing as a machine translation problem, moving away from traditional task-specific parsers. These models are typically initialized with pre-trained encoder-only language models like BERT or RoBERTa. However, the use of pre-trained encoder-decoder language models for constituency parsing has not been thorou","authors_text":"Cristina Outeiri\\~no Cid, Daniel Fern\\'andez-Gonz\\'alez","cross_cats":[],"headline":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T11:28:56Z","title":"Exploiting Pre-trained Encoder-Decoder Transformers for Sequence-to-Sequence Constituent Parsing"},"references":{"count":62,"internal_anchors":2,"resolved_work":62,"sample":[{"cited_arxiv_id":"","doi":"10.18653/v1/d18-1037","is_internal_anchor":false,"ref_index":1,"title":"J. G¯ u, H. S. Shavarani, A. Sarkar, Top-down tree structured decoding with syntactic connections for neural machine translation and parsing, in: Proceedings of the 2018 Conference on Empirical Method","work_id":"d9e01bc1-378c-426e-9306-87d3e715ef23","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"X. Wang, H. Pham, P. Yin, G. Neubig, A tree-based decoder for neu- ral machine translation, in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Association for ","work_id":"c22def47-2ae9-4c55-94b0-fa9f6fdbfcdd","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A. Currey, K. Heafield, Incorporating source syntax into transformer- based neural machine translation, in: Proceedings of the Fourth Con- ference on Machine Translation (Volume 1: Research Papers), A","work_id":"1d6e7d82-2803-40e2-bc29-3535685caeac","year":2019},{"cited_arxiv_id":"","doi":"10.2174/2666255813999200922142212","is_internal_anchor":false,"ref_index":4,"title":"D. Bouras, M. Amroune, H. Bendjenna, I. Bendib, Improving fine- grained opinion mining approach with a deep constituency tree-long short term memory network and word embedding, Recent Advances in Comp","work_id":"b1390ea3-5358-49d3-b7a5-0d395d3eb6b9","year":2022},{"cited_arxiv_id":"","doi":"10.18653/v1/2020.acl-main.341","is_internal_anchor":false,"ref_index":5,"title":"Sentibert: A transferable transformer-based architecture for composi- tional sentiment semantics","work_id":"d5f43344-7028-4c72-821d-11336fcce8e1","year":2020}],"snapshot_sha256":"8bdea998f3343ad16bb7c02726f675fbea3dd4f37c7629aa6641c6adf32b1e07"},"source":{"id":"2605.13373","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:53:57.933858Z","id":"f934572b-21b2-4149-b8a0-cd11a7de4353","model_set":{"reader":"grok-4.3"},"one_line_summary":"Pre-trained encoder-decoder transformers fine-tuned for sequence-to-sequence constituent parsing outperform prior seq2seq models and compete with specialized parsers on continuous treebanks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Pre-trained encoder-decoder models like BART and T5, when fine-tuned to output linearized parse trees, outperform earlier sequence-to-sequence parsers and compete with specialized constituent parsers on continuous data.","strongest_claim":"Our results demonstrate that our approach outperforms all prior sequence-to-sequence models and performs competitively with leading task-specific constituent parsers on continuous constituent parsing.","weakest_assumption":"That standard fine-tuning of encoder-decoder models on linearized trees is sufficient to capture the full syntactic structure without additional task-specific mechanisms or architectural changes."}},"verdict_id":"f934572b-21b2-4149-b8a0-cd11a7de4353"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5884002940e888d5abe3aa6c24a96da79ec04f484ed58906ee92e0cc14b74f1","target":"record","created_at":"2026-05-18T02:44:47Z","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":"1756df113789681676cfe85ce64e1757ad9fc0106825210a078e8136a0442093","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T11:28:56Z","title_canon_sha256":"61239da1604aa1d52a774821fa098d5e5613f472da5c15cb049ab35e32716c21"},"schema_version":"1.0","source":{"id":"2605.13373","kind":"arxiv","version":1}},"canonical_sha256":"b621677fe36df31b1f46cdc2eca58d6c9b0fb446a02c8885a67c7e672ec2773b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b621677fe36df31b1f46cdc2eca58d6c9b0fb446a02c8885a67c7e672ec2773b","first_computed_at":"2026-05-18T02:44:47.944465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.944465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EM/BqaEvz7mQaX4RPjRTDML6S8sZUsoqfs6oheC9xXxJ/Oyigo8yo00mRV1VKvqf1CKT7MZYz6XXZpa+HDc7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.944907Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5884002940e888d5abe3aa6c24a96da79ec04f484ed58906ee92e0cc14b74f1","sha256:d153dfac9569841bfd4adca5e1ddec48e6c7a21c4fa20c31c8dc48f4dbd26a68"],"state_sha256":"15810bcd51b152ee4269dc6afb2983efaaf40d08d199a472cd453dde6fc3f6ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pQYZLN6UMWOQ2sNh6lWHJ+XDX/HL9tvXMpT7CbaC/puwmaGBB8rnx61gNx+W2x2TykBMu4JFGC1bPBd49IrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:48:50.062261Z","bundle_sha256":"5e6b2457f1f975dfd8b5c1ac613293c069d1cc9640e821876814bedc4efebccd"}}