{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MT7WG7D53RYAIFYLJRKF6PV3O7","short_pith_number":"pith:MT7WG7D5","canonical_record":{"source":{"id":"2605.13405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"10000b5d09405667967c5c43b9627937f3e43d26401cdc3cb30fd1c9741306ab","abstract_canon_sha256":"94ea31b292acf63c6846c1dde73b4d1eac980cee696388925b18d4db710c3abf"},"schema_version":"1.0"},"canonical_sha256":"64ff637c7ddc7004170b4c545f3ebb77d0c1f00b74fe6ffd1c8e65085cfdb7c3","source":{"kind":"arxiv","id":"2605.13405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13405","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13405v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13405","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"MT7WG7D53RYA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MT7WG7D53RYAIFYL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MT7WG7D5","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MT7WG7D53RYAIFYLJRKF6PV3O7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"10000b5d09405667967c5c43b9627937f3e43d26401cdc3cb30fd1c9741306ab","abstract_canon_sha256":"94ea31b292acf63c6846c1dde73b4d1eac980cee696388925b18d4db710c3abf"},"schema_version":"1.0"},"canonical_sha256":"64ff637c7ddc7004170b4c545f3ebb77d0c1f00b74fe6ffd1c8e65085cfdb7c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.534678Z","signature_b64":"whK4GBFVFhrq0vojVEi21rUhiu8KGLP4ckBNDT0MDbyhWNqM4LAGXCxayCFALEcwkSwed8FpOX0Q24pFA5GZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ff637c7ddc7004170b4c545f3ebb77d0c1f00b74fe6ffd1c8e65085cfdb7c3","last_reissued_at":"2026-05-18T02:44:47.534177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.534177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13405","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":"GziW6nBA14aa3zUn+ntwG4bPR+8MkeqS6uFJFoYcnKcLH4sUaSdP5rjHTWJjv2cIny5c0T4a1gg1OJD0JTNRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:09:54.844672Z"},"content_sha256":"0eec3c66e3cf99c18bacec80bafea7e6575516b3446f9af43bc89ec21c247672","schema_version":"1.0","event_id":"sha256:0eec3c66e3cf99c18bacec80bafea7e6575516b3446f9af43bc89ec21c247672"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MT7WG7D53RYAIFYLJRKF6PV3O7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When is Warmstarting Effective for Scaling Language Models?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Klein, Frank Hutter, Herilalaina Rakotoarison, Johannes Hog, Josif Grabocka, Maciej Janowski, Neeratyoy Mallik","submitted_at":"2026-05-13T12:00:11Z","abstract_excerpt":"Model growth from a given checkpoint aims to accelerate training of a larger model, offering potential resource savings. Despite recent interest, warmstarting has seen limited practical adoption in large-scale training. We attribute this to two underexplored factors: (1) an overemphasis on preserving the smaller model's performance at initialization, which constrains operator design for new architectures, and (2) insufficient analysis of how growth interacts with hyperparameters and scaling behavior, compounded by inconsistent growth factors across the literature.\n  We show that preserving the"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"a 2× growth factor is the most reliable in yielding convergence speedups, with gains most pronounced under 20 tokens/parameter budgets and diminishing as budget increases. We empirically identify an upper bound on the growth factor g beyond which training from scratch is more efficient.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The observed upper bound on growth factor and the superiority of simple growth operators generalize beyond the tested dense MLPs and dense language models to other architectures and training regimes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A 2x growth factor in model warmstarting yields reliable training speedups for language models under 20 tokens/parameter budgets, with an empirical upper bound on effective growth factors.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"082258a78b66aaf00e85276e8d678407b42b3ad9624c5fc231a5664ddb2b43bd"},"source":{"id":"2605.13405","kind":"arxiv","version":1},"verdict":{"id":"3d77555c-0111-47c2-b939-ff6ddf8f8068","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:56:06.105936Z","strongest_claim":"a 2× growth factor is the most reliable in yielding convergence speedups, with gains most pronounced under 20 tokens/parameter budgets and diminishing as budget increases. We empirically identify an upper bound on the growth factor g beyond which training from scratch is more efficient.","one_line_summary":"A 2x growth factor in model warmstarting yields reliable training speedups for language models under 20 tokens/parameter budgets, with an empirical upper bound on effective growth factors.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The observed upper bound on growth factor and the superiority of simple growth operators generalize beyond the tested dense MLPs and dense language models to other architectures and training regimes.","pith_extraction_headline":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it."},"references":{"count":38,"sample":[{"doi":"","year":null,"title":"S. Bergsma, B. C. Zhang, N. Dey, S. Muhammad, G. Gosal, and J. Hestness. Scaling with collapse: Efficient and predictable training of llm families.arXiv preprint arXiv:2509.25087,","work_id":"a7caf177-64bd-4bbb-9f0d-cf67cf518292","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1901,"title":"T. Brown, B. Mann, N. Ryder, M. Subbiah, J. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-V oss, G. Krueger, T. Henighan, R. Child, A. Ramesh, D. Ziegler,","work_id":"f34fe3d3-0ff9-4661-bc74-3a8d1b5e66bf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","work_id":"28ea1282-d657-4c61-a83c-f1249be6d6b1","ref_index":3,"cited_arxiv_id":"1803.05457","is_internal_anchor":true},{"doi":"","year":null,"title":"N. Dey, S. Bergsma, and J. Hestness. Sparse maximal update parameterization: A holistic approach to sparse training dynamics.arXiv preprint arXiv:2405.15743,","work_id":"63fecd0e-9c7d-4315-9fd8-1e277c222876","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Don’t be lazy: CompleteP enables compute- efficient deep transformers, January 2026","work_id":"85f11780-ed20-4881-8d31-bb0834b58027","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"835df0c1f71a8c29ddf94b59b4621230cdee2bbd6060d83d3825516313b2297b","internal_anchors":8},"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":"3d77555c-0111-47c2-b939-ff6ddf8f8068"},"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":"cUbuE3i8z2sPH/BS9zINKxcYszhhtJYdqwuFJhXYfabuO6+Z70YcNAhzRdvaTmJ4yOcSqO7Eyxkck1Ach3WhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:09:54.845623Z"},"content_sha256":"0cd7f9a64835f62d08ca1d9af003038395a955b7a66955d9c8e4e01a08590d74","schema_version":"1.0","event_id":"sha256:0cd7f9a64835f62d08ca1d9af003038395a955b7a66955d9c8e4e01a08590d74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/bundle.json","state_url":"https://pith.science/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/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-25T11:09:54Z","links":{"resolver":"https://pith.science/pith/MT7WG7D53RYAIFYLJRKF6PV3O7","bundle":"https://pith.science/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/bundle.json","state":"https://pith.science/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MT7WG7D53RYAIFYLJRKF6PV3O7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MT7WG7D53RYAIFYLJRKF6PV3O7","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":"94ea31b292acf63c6846c1dde73b4d1eac980cee696388925b18d4db710c3abf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:00:11Z","title_canon_sha256":"10000b5d09405667967c5c43b9627937f3e43d26401cdc3cb30fd1c9741306ab"},"schema_version":"1.0","source":{"id":"2605.13405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13405","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13405v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13405","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"MT7WG7D53RYA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MT7WG7D53RYAIFYL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MT7WG7D5","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0cd7f9a64835f62d08ca1d9af003038395a955b7a66955d9c8e4e01a08590d74","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":"a 2× growth factor is the most reliable in yielding convergence speedups, with gains most pronounced under 20 tokens/parameter budgets and diminishing as budget increases. We empirically identify an upper bound on the growth factor g beyond which training from scratch is more efficient."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The observed upper bound on growth factor and the superiority of simple growth operators generalize beyond the tested dense MLPs and dense language models to other architectures and training regimes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A 2x growth factor in model warmstarting yields reliable training speedups for language models under 20 tokens/parameter budgets, with an empirical upper bound on effective growth factors."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it."}],"snapshot_sha256":"082258a78b66aaf00e85276e8d678407b42b3ad9624c5fc231a5664ddb2b43bd"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Model growth from a given checkpoint aims to accelerate training of a larger model, offering potential resource savings. Despite recent interest, warmstarting has seen limited practical adoption in large-scale training. We attribute this to two underexplored factors: (1) an overemphasis on preserving the smaller model's performance at initialization, which constrains operator design for new architectures, and (2) insufficient analysis of how growth interacts with hyperparameters and scaling behavior, compounded by inconsistent growth factors across the literature.\n  We show that preserving the","authors_text":"Aaron Klein, Frank Hutter, Herilalaina Rakotoarison, Johannes Hog, Josif Grabocka, Maciej Janowski, Neeratyoy Mallik","cross_cats":[],"headline":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:00:11Z","title":"When is Warmstarting Effective for Scaling Language Models?"},"references":{"count":38,"internal_anchors":8,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"S. Bergsma, B. C. Zhang, N. Dey, S. Muhammad, G. Gosal, and J. Hestness. Scaling with collapse: Efficient and predictable training of llm families.arXiv preprint arXiv:2509.25087,","work_id":"a7caf177-64bd-4bbb-9f0d-cf67cf518292","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"T. Brown, B. Mann, N. Ryder, M. Subbiah, J. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-V oss, G. Krueger, T. Henighan, R. Child, A. Ramesh, D. Ziegler,","work_id":"f34fe3d3-0ff9-4661-bc74-3a8d1b5e66bf","year":1901},{"cited_arxiv_id":"1803.05457","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","work_id":"28ea1282-d657-4c61-a83c-f1249be6d6b1","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"N. Dey, S. Bergsma, and J. Hestness. Sparse maximal update parameterization: A holistic approach to sparse training dynamics.arXiv preprint arXiv:2405.15743,","work_id":"63fecd0e-9c7d-4315-9fd8-1e277c222876","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Don’t be lazy: CompleteP enables compute- efficient deep transformers, January 2026","work_id":"85f11780-ed20-4881-8d31-bb0834b58027","year":null}],"snapshot_sha256":"835df0c1f71a8c29ddf94b59b4621230cdee2bbd6060d83d3825516313b2297b"},"source":{"id":"2605.13405","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:56:06.105936Z","id":"3d77555c-0111-47c2-b939-ff6ddf8f8068","model_set":{"reader":"grok-4.3"},"one_line_summary":"A 2x growth factor in model warmstarting yields reliable training speedups for language models under 20 tokens/parameter budgets, with an empirical upper bound on effective growth factors.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A 2x growth factor from smaller checkpoints reliably speeds language model convergence, but an upper bound on growth factor makes training from scratch more efficient beyond it.","strongest_claim":"a 2× growth factor is the most reliable in yielding convergence speedups, with gains most pronounced under 20 tokens/parameter budgets and diminishing as budget increases. We empirically identify an upper bound on the growth factor g beyond which training from scratch is more efficient.","weakest_assumption":"The observed upper bound on growth factor and the superiority of simple growth operators generalize beyond the tested dense MLPs and dense language models to other architectures and training regimes."}},"verdict_id":"3d77555c-0111-47c2-b939-ff6ddf8f8068"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0eec3c66e3cf99c18bacec80bafea7e6575516b3446f9af43bc89ec21c247672","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":"94ea31b292acf63c6846c1dde73b4d1eac980cee696388925b18d4db710c3abf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:00:11Z","title_canon_sha256":"10000b5d09405667967c5c43b9627937f3e43d26401cdc3cb30fd1c9741306ab"},"schema_version":"1.0","source":{"id":"2605.13405","kind":"arxiv","version":1}},"canonical_sha256":"64ff637c7ddc7004170b4c545f3ebb77d0c1f00b74fe6ffd1c8e65085cfdb7c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64ff637c7ddc7004170b4c545f3ebb77d0c1f00b74fe6ffd1c8e65085cfdb7c3","first_computed_at":"2026-05-18T02:44:47.534177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.534177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whK4GBFVFhrq0vojVEi21rUhiu8KGLP4ckBNDT0MDbyhWNqM4LAGXCxayCFALEcwkSwed8FpOX0Q24pFA5GZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.534678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eec3c66e3cf99c18bacec80bafea7e6575516b3446f9af43bc89ec21c247672","sha256:0cd7f9a64835f62d08ca1d9af003038395a955b7a66955d9c8e4e01a08590d74"],"state_sha256":"bde92d1500c14a600cc6689a7e1b4acc9fffb100a2e6ee854182f173e43e42be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFGlgtbPgJu0XpS3G0Ype1pgoBOpRQ54LU8ZfTSk2ey+B16Gv1qvl3yFj+27oNqvHvORCOJS0nVo3/x2QwBYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:09:54.850387Z","bundle_sha256":"40b344408f9f46b3ef3ceffd1bc344304d8a3bc478ca9448ada8c008fc8d69ef"}}