{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DCDPKVRXTDIYEJSDLF7FJSWYFP","short_pith_number":"pith:DCDPKVRX","canonical_record":{"source":{"id":"2304.08354","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-04-17T15:16:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4cc0b63cd7974af7923f4c96d284caa7265f6d56a40398ea3cf20a4d8d82977c","abstract_canon_sha256":"b52d902d9c90a4c8075368c709429af6c316cb03eae703881a1705641afc0d71"},"schema_version":"1.0"},"canonical_sha256":"1886f5563798d1822643597e54cad82bc3209fdbb2bc6bc31a5549acfed333f8","source":{"kind":"arxiv","id":"2304.08354","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.08354","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"arxiv_version","alias_value":"2304.08354v3","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08354","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"pith_short_12","alias_value":"DCDPKVRXTDIY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"DCDPKVRXTDIYEJSD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"DCDPKVRX","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DCDPKVRXTDIYEJSDLF7FJSWYFP","target":"record","payload":{"canonical_record":{"source":{"id":"2304.08354","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-04-17T15:16:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4cc0b63cd7974af7923f4c96d284caa7265f6d56a40398ea3cf20a4d8d82977c","abstract_canon_sha256":"b52d902d9c90a4c8075368c709429af6c316cb03eae703881a1705641afc0d71"},"schema_version":"1.0"},"canonical_sha256":"1886f5563798d1822643597e54cad82bc3209fdbb2bc6bc31a5549acfed333f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:47.771106Z","signature_b64":"wERVRdxRjQWUd71xk3CHAJx9YWicdwVE/zxR+loXJOxPYH2QBwEjQFmsER6Uvo2bv7CM11ibdVXF0vGEKtyKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1886f5563798d1822643597e54cad82bc3209fdbb2bc6bc31a5549acfed333f8","last_reissued_at":"2026-05-17T23:38:47.770663Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:47.770663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.08354","source_version":3,"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-17T23:38:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIDYQlS12BWaYBhnrZfTPq+91UIDzgI7PxChzfF71fifAdTuTQ6G/Ky1YDYBJPs87vtdKoinJm8SfONOJqaRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:18:08.203871Z"},"content_sha256":"652d65cb80e4a9732c15142298500d23a99bffebe95a63033e438208aa3a36be","schema_version":"1.0","event_id":"sha256:652d65cb80e4a9732c15142298500d23a99bffebe95a63033e438208aa3a36be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DCDPKVRXTDIYEJSDLF7FJSWYFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tool Learning with Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Bokai Xu, Bowen Li, Chaojun Xiao, Cheng Qian, Cheng Yang, Chi Han, Dahai Li, Ganqu Cui, Heng Ji, Huadong Wang, Jason Phang, Jing Yi, Junxi Yan, Kunlun Zhu, Lan Yan, Maosong Sun, Ning Ding, Runchu Tian, Shengding Hu, Shihao Liang, Tongshuang Wu, Weilin Zhao, Weize Chen, Xian Sun, Xin Cong, Xingyu Shen, Xu Han, Yankai Lin, Yaxi Lu, Yining Ye, Yi Ren Fung, Yufei Huang, Yujia Qin, Yusheng Su, Yuxiang Huang, Yuzhang Zhu, Zheni Zeng, Zhenning Dai, Zhen Zhang, Zhiyuan Liu, Ziwei Tang","submitted_at":"2023-04-17T15:16:10Z","abstract_excerpt":"Humans possess an extraordinary ability to create and utilize tools, allowing them to overcome physical limitations and explore new frontiers. With the advent of foundation models, AI systems have the potential to be equally adept in tool use as humans. This paradigm, i.e., tool learning with foundation models, combines the strengths of specialized tools and foundation models to achieve enhanced accuracy, efficiency, and automation in problem-solving. Despite its immense potential, there is still a lack of a comprehensive understanding of key challenges, opportunities, and future endeavors in "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We formulate a general tool learning framework: starting from understanding the user instruction, models should learn to decompose a complex task into several subtasks, dynamically adjust their plan through reasoning, and effectively conquer each sub-task by selecting appropriate tools.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That foundation models can be effectively trained and prompted to follow the proposed decomposition-reasoning-tool-selection process at scale, and that experiments with 18 tools sufficiently demonstrate this potential without detailed methodology or baselines in the provided abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper reviews tool learning research, formulates a framework for foundation models to decompose tasks and use tools via reasoning, and demonstrates current models' capabilities through experiments with 18 tools.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2412f454c51c015c229cdaef3fa08076e1d5dcf308cdec892680976007bb2803"},"source":{"id":"2304.08354","kind":"arxiv","version":3},"verdict":{"id":"76c29493-1ce1-47ce-afe6-d4bb816605b2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T13:06:29.151925Z","strongest_claim":"We formulate a general tool learning framework: starting from understanding the user instruction, models should learn to decompose a complex task into several subtasks, dynamically adjust their plan through reasoning, and effectively conquer each sub-task by selecting appropriate tools.","one_line_summary":"The paper reviews tool learning research, formulates a framework for foundation models to decompose tasks and use tools via reasoning, and demonstrates current models' capabilities through experiments with 18 tools.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That foundation models can be effectively trained and prompted to follow the proposed decomposition-reasoning-tool-selection process at scale, and that experiments with 18 tools sufficiently demonstrate this potential without detailed methodology or baselines in the provided abstract.","pith_extraction_headline":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step."},"references":{"count":15,"sample":[{"doi":"","year":1909,"title":"Fine-Tuning Language Models from Human Preferences","work_id":"4f54aad1-f3b6-404f-b9c7-e21ba0a33b99","ref_index":1,"cited_arxiv_id":"1909.08593","is_internal_anchor":true},{"doi":"","year":null,"title":"tag: Banana Pie Recipes, type: recipe","work_id":"abd865bc-8225-4696-acd2-fc6af90a5d5d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"tag: Custard and Cream Pies, type: recipes","work_id":"2877694b-2a06-413f-931b-047c242b2b73","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"tag: Mexican, type: recipe","work_id":"d40f9801-993b-43de-9ff6-aa34deda402c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"tag: No-Bake Pie Recipes, type: recipe","work_id":"e2faeb4d-3fca-4306-b929-aef0dad68d4f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"24703edc8d3e872b858f72cbee6240e4252a22edc057853df73efb236884d513","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ae5a9e33860fd411e5c291e032aa4599bc12d2abf4dc592ca4250f7429a5eb51"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"76c29493-1ce1-47ce-afe6-d4bb816605b2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrM1BwxWToETthasw0mzpS5A9AEyk4kZwAu3E1vLIyGGPDhnTk+rcj5wOE3tU9UiGOIAZ/qbbadYSPy98lazAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:18:08.204925Z"},"content_sha256":"a84fdbeb76bbeef2e4397cce46f50180d07ddb9d6204ac464f1471186bd36ae8","schema_version":"1.0","event_id":"sha256:a84fdbeb76bbeef2e4397cce46f50180d07ddb9d6204ac464f1471186bd36ae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/bundle.json","state_url":"https://pith.science/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/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-25T15:18:08Z","links":{"resolver":"https://pith.science/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP","bundle":"https://pith.science/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/bundle.json","state":"https://pith.science/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCDPKVRXTDIYEJSDLF7FJSWYFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DCDPKVRXTDIYEJSDLF7FJSWYFP","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":"b52d902d9c90a4c8075368c709429af6c316cb03eae703881a1705641afc0d71","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-04-17T15:16:10Z","title_canon_sha256":"4cc0b63cd7974af7923f4c96d284caa7265f6d56a40398ea3cf20a4d8d82977c"},"schema_version":"1.0","source":{"id":"2304.08354","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.08354","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"arxiv_version","alias_value":"2304.08354v3","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08354","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"pith_short_12","alias_value":"DCDPKVRXTDIY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"DCDPKVRXTDIYEJSD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"DCDPKVRX","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:a84fdbeb76bbeef2e4397cce46f50180d07ddb9d6204ac464f1471186bd36ae8","target":"graph","created_at":"2026-05-17T23:38: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":"We formulate a general tool learning framework: starting from understanding the user instruction, models should learn to decompose a complex task into several subtasks, dynamically adjust their plan through reasoning, and effectively conquer each sub-task by selecting appropriate tools."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That foundation models can be effectively trained and prompted to follow the proposed decomposition-reasoning-tool-selection process at scale, and that experiments with 18 tools sufficiently demonstrate this potential without detailed methodology or baselines in the provided abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper reviews tool learning research, formulates a framework for foundation models to decompose tasks and use tools via reasoning, and demonstrates current models' capabilities through experiments with 18 tools."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step."}],"snapshot_sha256":"2412f454c51c015c229cdaef3fa08076e1d5dcf308cdec892680976007bb2803"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ae5a9e33860fd411e5c291e032aa4599bc12d2abf4dc592ca4250f7429a5eb51"},"paper":{"abstract_excerpt":"Humans possess an extraordinary ability to create and utilize tools, allowing them to overcome physical limitations and explore new frontiers. With the advent of foundation models, AI systems have the potential to be equally adept in tool use as humans. This paradigm, i.e., tool learning with foundation models, combines the strengths of specialized tools and foundation models to achieve enhanced accuracy, efficiency, and automation in problem-solving. Despite its immense potential, there is still a lack of a comprehensive understanding of key challenges, opportunities, and future endeavors in ","authors_text":"Bokai Xu, Bowen Li, Chaojun Xiao, Cheng Qian, Cheng Yang, Chi Han, Dahai Li, Ganqu Cui, Heng Ji, Huadong Wang, Jason Phang, Jing Yi, Junxi Yan, Kunlun Zhu, Lan Yan, Maosong Sun, Ning Ding, Runchu Tian, Shengding Hu, Shihao Liang, Tongshuang Wu, Weilin Zhao, Weize Chen, Xian Sun, Xin Cong, Xingyu Shen, Xu Han, Yankai Lin, Yaxi Lu, Yining Ye, Yi Ren Fung, Yufei Huang, Yujia Qin, Yusheng Su, Yuxiang Huang, Yuzhang Zhu, Zheni Zeng, Zhenning Dai, Zhen Zhang, Zhiyuan Liu, Ziwei Tang","cross_cats":["cs.AI","cs.LG"],"headline":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-04-17T15:16:10Z","title":"Tool Learning with Foundation Models"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"1909.08593","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Fine-Tuning Language Models from Human Preferences","work_id":"4f54aad1-f3b6-404f-b9c7-e21ba0a33b99","year":1909},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"tag: Banana Pie Recipes, type: recipe","work_id":"abd865bc-8225-4696-acd2-fc6af90a5d5d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"tag: Custard and Cream Pies, type: recipes","work_id":"2877694b-2a06-413f-931b-047c242b2b73","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"tag: Mexican, type: recipe","work_id":"d40f9801-993b-43de-9ff6-aa34deda402c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"tag: No-Bake Pie Recipes, type: recipe","work_id":"e2faeb4d-3fca-4306-b929-aef0dad68d4f","year":null}],"snapshot_sha256":"24703edc8d3e872b858f72cbee6240e4252a22edc057853df73efb236884d513"},"source":{"id":"2304.08354","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T13:06:29.151925Z","id":"76c29493-1ce1-47ce-afe6-d4bb816605b2","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper reviews tool learning research, formulates a framework for foundation models to decompose tasks and use tools via reasoning, and demonstrates current models' capabilities through experiments with 18 tools.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Foundation models learn tool use by decomposing tasks into subtasks, reasoning to adjust plans, and selecting the right tools for each step.","strongest_claim":"We formulate a general tool learning framework: starting from understanding the user instruction, models should learn to decompose a complex task into several subtasks, dynamically adjust their plan through reasoning, and effectively conquer each sub-task by selecting appropriate tools.","weakest_assumption":"That foundation models can be effectively trained and prompted to follow the proposed decomposition-reasoning-tool-selection process at scale, and that experiments with 18 tools sufficiently demonstrate this potential without detailed methodology or baselines in the provided abstract."}},"verdict_id":"76c29493-1ce1-47ce-afe6-d4bb816605b2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:652d65cb80e4a9732c15142298500d23a99bffebe95a63033e438208aa3a36be","target":"record","created_at":"2026-05-17T23:38: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":"b52d902d9c90a4c8075368c709429af6c316cb03eae703881a1705641afc0d71","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-04-17T15:16:10Z","title_canon_sha256":"4cc0b63cd7974af7923f4c96d284caa7265f6d56a40398ea3cf20a4d8d82977c"},"schema_version":"1.0","source":{"id":"2304.08354","kind":"arxiv","version":3}},"canonical_sha256":"1886f5563798d1822643597e54cad82bc3209fdbb2bc6bc31a5549acfed333f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1886f5563798d1822643597e54cad82bc3209fdbb2bc6bc31a5549acfed333f8","first_computed_at":"2026-05-17T23:38:47.770663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:47.770663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wERVRdxRjQWUd71xk3CHAJx9YWicdwVE/zxR+loXJOxPYH2QBwEjQFmsER6Uvo2bv7CM11ibdVXF0vGEKtyKAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:47.771106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.08354","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:652d65cb80e4a9732c15142298500d23a99bffebe95a63033e438208aa3a36be","sha256:a84fdbeb76bbeef2e4397cce46f50180d07ddb9d6204ac464f1471186bd36ae8"],"state_sha256":"e05e6c929a3ef12dbbdb8e7997859bbcab121b97c93ca46ba52a236ee36a414c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EuPW/QCYuEnHR4Fe6Kie2bPt1BH7knJoUhep/lMjsN/nVVEuBuiwYry7PazWxovZ/LCv7gn9paYK3liX2FPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:18:08.210044Z","bundle_sha256":"b3f1a200e12aaeb8712d5d760787cdef655c352d8edebd2dae7f7110c29f1421"}}