{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O7XK7YSGNACZH7HHYEM2EGJG2T","short_pith_number":"pith:O7XK7YSG","canonical_record":{"source":{"id":"2605.13424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:19:01Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"5a9e26fac7ebe8ee458f1a225d4223adbfffb5be915fc0730622d3fb656cecbe","abstract_canon_sha256":"18b09cfddbe37d2dc42943e4dcfde90a645396175a2a453fde7ff52e452b24a4"},"schema_version":"1.0"},"canonical_sha256":"77eeafe246680593fce7c119a21926d4d318943106d4d2216f3f343b6ae22b10","source":{"kind":"arxiv","id":"2605.13424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13424","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13424v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13424","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"O7XK7YSGNACZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"O7XK7YSGNACZH7HH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"O7XK7YSG","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O7XK7YSGNACZH7HHYEM2EGJG2T","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:19:01Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"5a9e26fac7ebe8ee458f1a225d4223adbfffb5be915fc0730622d3fb656cecbe","abstract_canon_sha256":"18b09cfddbe37d2dc42943e4dcfde90a645396175a2a453fde7ff52e452b24a4"},"schema_version":"1.0"},"canonical_sha256":"77eeafe246680593fce7c119a21926d4d318943106d4d2216f3f343b6ae22b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.293754Z","signature_b64":"sYJFfNsr9idxVu+Vr4ThCgMWpsIGOH8DjRnhjI/abYhzcoS9RMsadvqSLluV3uLYjWX2ub/Sd9kWTcku0qquAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77eeafe246680593fce7c119a21926d4d318943106d4d2216f3f343b6ae22b10","last_reissued_at":"2026-05-18T02:44:47.293217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.293217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13424","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":"k6yzi0lrtw6kVIP19pNBiDPTD003//7QsL8+T/szDrs+rTykbTyBARYsxqwq/P5eho7UrdH43Xhcih4Vak4CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:38:07.548211Z"},"content_sha256":"faeee200778061cad52b2a8750e926eb13b82fa7887eb942aa1d394b88486f1d","schema_version":"1.0","event_id":"sha256:faeee200778061cad52b2a8750e926eb13b82fa7887eb942aa1d394b88486f1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O7XK7YSGNACZH7HHYEM2EGJG2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LIFT: Last-Mile Fine-Tuning for Table Explicitation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Ashish Tiwari, Divij Khaitan","submitted_at":"2026-05-13T12:19:01Z","abstract_excerpt":"We propose last-mile fine-tuning, or Lift, a pipeline in which a pre-trained large language model extracts an initial table from unstructured clipboard text, and a fine-tuned small language model (1B-24B parameters SLM) repairs errors in the extracted table. On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points. We term this approach last-mile fine-tuning and show it al"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That errors produced by the pre-trained LLM's initial extraction are consistently repairable by the fine-tuned SLM in a manner that generalizes across the three datasets and varying input formats without the repair step introducing new systematic errors.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LIFT pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM for error repair, matching end-to-end SLM fine-tuning on TEDS while needing only 1,000 examples and gaining robustness.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f23b8d6c11ea8320e3f00e6ad9adf4cf338ce201536746634dc1daf084aaf419"},"source":{"id":"2605.13424","kind":"arxiv","version":1},"verdict":{"id":"05e591d6-1012-49ba-9a09-04023f18202e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:39:01.435928Z","strongest_claim":"On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points.","one_line_summary":"LIFT pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM for error repair, matching end-to-end SLM fine-tuning on TEDS while needing only 1,000 examples and gaining robustness.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That errors produced by the pre-trained LLM's initial extraction are consistently repairable by the fine-tuned SLM in a manner that generalizes across the three datasets and varying input formats without the repair step introducing new systematic errors.","pith_extraction_headline":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples."},"references":{"count":36,"sample":[{"doi":"","year":2023,"title":"GriTS: Grid Table Similarity Metric for Table Structure Recognition","work_id":"70ea4a27-3901-45cc-a0cc-cfd136b6faf2","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Image-Based Table Recognition: Data, Model, and Evaluation","work_id":"207f87ae-a1dc-49cd-939e-ecfba4975b98","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Optimized Table Tokenization for Table Structure Recognition","work_id":"31165aef-3b7a-4428-9a6c-c4c838594d56","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Complicated Table Structure Recognition , author=. 2019 , eprint=","work_id":"46718712-ff34-4d79-97fc-08dec8d62a72","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/2022.acl-long.180","year":2022,"title":"Text-to-Table: A New Way of Information Extraction","work_id":"ea91300b-fe92-402b-9967-9e0082b11ffe","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"6f1c2e0cfb49117e8c69f253b1906dc1f9398074fd49191f8358f059967f6007","internal_anchors":3},"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":"05e591d6-1012-49ba-9a09-04023f18202e"},"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":"0PMdttVaDkfqEb1YYyd59kQGkK6ocZexcfi1b6RsVIraTBH3dRavi1Dk46F08XU4zSH6B+6vXN0EJjZJAAtgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:38:07.549135Z"},"content_sha256":"cc01bbd2191fe5c2f554b121d6e905d39f64663cb46df5a44840b7909f3f3cfc","schema_version":"1.0","event_id":"sha256:cc01bbd2191fe5c2f554b121d6e905d39f64663cb46df5a44840b7909f3f3cfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/bundle.json","state_url":"https://pith.science/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/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-30T11:38:07Z","links":{"resolver":"https://pith.science/pith/O7XK7YSGNACZH7HHYEM2EGJG2T","bundle":"https://pith.science/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/bundle.json","state":"https://pith.science/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7XK7YSGNACZH7HHYEM2EGJG2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O7XK7YSGNACZH7HHYEM2EGJG2T","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":"18b09cfddbe37d2dc42943e4dcfde90a645396175a2a453fde7ff52e452b24a4","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:19:01Z","title_canon_sha256":"5a9e26fac7ebe8ee458f1a225d4223adbfffb5be915fc0730622d3fb656cecbe"},"schema_version":"1.0","source":{"id":"2605.13424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13424","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13424v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13424","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"O7XK7YSGNACZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"O7XK7YSGNACZH7HH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"O7XK7YSG","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:cc01bbd2191fe5c2f554b121d6e905d39f64663cb46df5a44840b7909f3f3cfc","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":"On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That errors produced by the pre-trained LLM's initial extraction are consistently repairable by the fine-tuned SLM in a manner that generalizes across the three datasets and varying input formats without the repair step introducing new systematic errors."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LIFT pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM for error repair, matching end-to-end SLM fine-tuning on TEDS while needing only 1,000 examples and gaining robustness."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples."}],"snapshot_sha256":"f23b8d6c11ea8320e3f00e6ad9adf4cf338ce201536746634dc1daf084aaf419"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose last-mile fine-tuning, or Lift, a pipeline in which a pre-trained large language model extracts an initial table from unstructured clipboard text, and a fine-tuned small language model (1B-24B parameters SLM) repairs errors in the extracted table. On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points. We term this approach last-mile fine-tuning and show it al","authors_text":"Ashish Tiwari, Divij Khaitan","cross_cats":["cs.CL"],"headline":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:19:01Z","title":"LIFT: Last-Mile Fine-Tuning for Table Explicitation"},"references":{"count":36,"internal_anchors":3,"resolved_work":36,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"GriTS: Grid Table Similarity Metric for Table Structure Recognition","work_id":"70ea4a27-3901-45cc-a0cc-cfd136b6faf2","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Image-Based Table Recognition: Data, Model, and Evaluation","work_id":"207f87ae-a1dc-49cd-939e-ecfba4975b98","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Optimized Table Tokenization for Table Structure Recognition","work_id":"31165aef-3b7a-4428-9a6c-c4c838594d56","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Complicated Table Structure Recognition , author=. 2019 , eprint=","work_id":"46718712-ff34-4d79-97fc-08dec8d62a72","year":2019},{"cited_arxiv_id":"","doi":"10.18653/v1/2022.acl-long.180","is_internal_anchor":false,"ref_index":5,"title":"Text-to-Table: A New Way of Information Extraction","work_id":"ea91300b-fe92-402b-9967-9e0082b11ffe","year":2022}],"snapshot_sha256":"6f1c2e0cfb49117e8c69f253b1906dc1f9398074fd49191f8358f059967f6007"},"source":{"id":"2605.13424","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:39:01.435928Z","id":"05e591d6-1012-49ba-9a09-04023f18202e","model_set":{"reader":"grok-4.3"},"one_line_summary":"LIFT pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM for error repair, matching end-to-end SLM fine-tuning on TEDS while needing only 1,000 examples and gaining robustness.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Last-mile fine-tuning pairs a pre-trained LLM for initial table extraction with a fine-tuned SLM that repairs errors, matching end-to-end SLM fine-tuning on TEDS while using as few as 1,000 examples.","strongest_claim":"On a benchmark of 2,596 tables from three datasets, Lift matches or exceeds end-to-end SLM fine-tuning on tree-edit-distance-based similarity (TEDS) metric while requiring as little as 1,000 training examples - where it outperforms end-to-end fine-tuning by up to 0.144 TEDS points.","weakest_assumption":"That errors produced by the pre-trained LLM's initial extraction are consistently repairable by the fine-tuned SLM in a manner that generalizes across the three datasets and varying input formats without the repair step introducing new systematic errors."}},"verdict_id":"05e591d6-1012-49ba-9a09-04023f18202e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:faeee200778061cad52b2a8750e926eb13b82fa7887eb942aa1d394b88486f1d","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":"18b09cfddbe37d2dc42943e4dcfde90a645396175a2a453fde7ff52e452b24a4","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:19:01Z","title_canon_sha256":"5a9e26fac7ebe8ee458f1a225d4223adbfffb5be915fc0730622d3fb656cecbe"},"schema_version":"1.0","source":{"id":"2605.13424","kind":"arxiv","version":1}},"canonical_sha256":"77eeafe246680593fce7c119a21926d4d318943106d4d2216f3f343b6ae22b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77eeafe246680593fce7c119a21926d4d318943106d4d2216f3f343b6ae22b10","first_computed_at":"2026-05-18T02:44:47.293217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.293217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYJFfNsr9idxVu+Vr4ThCgMWpsIGOH8DjRnhjI/abYhzcoS9RMsadvqSLluV3uLYjWX2ub/Sd9kWTcku0qquAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.293754Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faeee200778061cad52b2a8750e926eb13b82fa7887eb942aa1d394b88486f1d","sha256:cc01bbd2191fe5c2f554b121d6e905d39f64663cb46df5a44840b7909f3f3cfc"],"state_sha256":"ade9ad596f31a157710be358ff384cbc1c3d63e812331d6ffdce0711e8ed84a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHSIU7U7MfvaPVaBsle/nBhLXjZyZw5jP22BizlSIg7H32C4NtNiKT31/hRIxF/PYbP8gsF7LoTCkmpWfEPsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:38:07.555522Z","bundle_sha256":"44337f5069fde4ac3159057c865a942878800e16aa8be7988e58a0ed64fbf68d"}}