{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JPFVERVPP227NRW7IOZEYKWBYT","short_pith_number":"pith:JPFVERVP","canonical_record":{"source":{"id":"2605.15221","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T06:33:06Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"405e377103930fc743f407ef7936ac8bbbd034df49937660257abb639beda96b","abstract_canon_sha256":"b5319c43efe5140779b2ac4cfed0b33089f138b114c12753bd962c47f17e5909"},"schema_version":"1.0"},"canonical_sha256":"4bcb5246af7eb5f6c6df43b24c2ac1c4edfc8a657be360285890297ecaa8abee","source":{"kind":"arxiv","id":"2605.15221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15221","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15221v1","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15221","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"JPFVERVPP227","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_16","alias_value":"JPFVERVPP227NRW7","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_8","alias_value":"JPFVERVP","created_at":"2026-05-20T00:00:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JPFVERVPP227NRW7IOZEYKWBYT","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15221","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T06:33:06Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"405e377103930fc743f407ef7936ac8bbbd034df49937660257abb639beda96b","abstract_canon_sha256":"b5319c43efe5140779b2ac4cfed0b33089f138b114c12753bd962c47f17e5909"},"schema_version":"1.0"},"canonical_sha256":"4bcb5246af7eb5f6c6df43b24c2ac1c4edfc8a657be360285890297ecaa8abee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:46.969242Z","signature_b64":"mh2GD3a+ZTEMEAnGojuIk2rmMtMqbZd0qrJf6tlSeScyClEttByAqWPPV6y8kGKodNhs6v+ENHQJr9IDWdc/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bcb5246af7eb5f6c6df43b24c2ac1c4edfc8a657be360285890297ecaa8abee","last_reissued_at":"2026-05-20T00:00:46.968684Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:46.968684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15221","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-20T00:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLuxu1TJ34fRj75drlxKZWuNGxSL11lQIg6waUTbNL9eHSADQmdLEXlJ/MtqCSgH0x+gNkHAa2f/whcSPLx0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:15.989078Z"},"content_sha256":"1035e125e8a3044cc0a8d57ff2ae360a943c5c86872f886139b5021f0595615b","schema_version":"1.0","event_id":"sha256:1035e125e8a3044cc0a8d57ff2ae360a943c5c86872f886139b5021f0595615b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JPFVERVPP227NRW7IOZEYKWBYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Harness Engineering for Algorithm Discovery with Coding Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.SE","authors_text":"Masafumi Oyamada, Taro Yano, Yoichi Ishibashi","submitted_at":"2026-05-13T06:33:06Z","abstract_excerpt":"AlphaEvolve and FunSearch have demonstrated the potential of combining large language models (LLMs) with evolutionary search for automated algorithm discovery. However, discovery success is shaped not only by model capability but also significantly by the design of the execution infrastructure, i.e., the harness. This paper investigates effective harness design through three questions: under a fixed token budget, is it better to produce many algorithms with brief thought or fewer algorithms with deeper thought? How should the harness handle evaluation hacks, where generated programs exploit th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Generating fewer algorithms while thinking more deeply about each one achieved higher scores. That is, scaling the quality of each individual is more budget-efficient than scaling the number of evolutionary generations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That results observed on the single Circle Packing benchmark under one fixed token budget generalize to other algorithm-discovery tasks and different resource constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Under fixed token budget on Circle Packing, deeper per-candidate reasoning beats generating more shallow candidates, and capable models produce evaluation hacks at higher rates.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dd561e3166f84dc3ea0ef8f5fde159676a3d0b858bb9f3d7c557ef96f09c216c"},"source":{"id":"2605.15221","kind":"arxiv","version":1},"verdict":{"id":"7b6c27ac-fe12-4e31-bc12-c7de2ea5ca44","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:03:48.825161Z","strongest_claim":"Generating fewer algorithms while thinking more deeply about each one achieved higher scores. That is, scaling the quality of each individual is more budget-efficient than scaling the number of evolutionary generations.","one_line_summary":"Under fixed token budget on Circle Packing, deeper per-candidate reasoning beats generating more shallow candidates, and capable models produce evaluation hacks at higher rates.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That results observed on the single Circle Packing benchmark under one fixed token budget generalize to other algorithm-discovery tasks and different resource constraints.","pith_extraction_headline":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15221/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T20:21:57.513893Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.823498Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:10:16.441491Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.836262Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e42593d6d6ce5c75c8ddf66d6e0082875e7641044ffde48c49f01716d155d1bf"},"references":{"count":26,"sample":[{"doi":"","year":2025,"title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","work_id":"76a0f850-d490-4e4f-ab98-8d25df82cd23","ref_index":1,"cited_arxiv_id":"2506.13131","is_internal_anchor":true},{"doi":"","year":2024,"title":"Mathematical discoveries from program search with large language models , journal =","work_id":"99f40505-4b28-448f-abe4-f4b1dd4d51d3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"arXiv preprint arXiv:2206.08896 , year=","work_id":"d378af55-0b14-4700-a7aa-ec83a2226580","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Forty-first International Conference on Machine Learning,","work_id":"62b99f4d-f1e5-4b70-a840-83864aad1ca5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Haoran Ye and Jiarui Wang and Zhiguang Cao and Federico Berto and Chuanbo Hua and Haeyeon Kim and Jinkyoo Park and Guojie Song , title =. Advances in Neural Information Processing Systems 38: Annual C","work_id":"8fa2f99c-f314-4c90-936f-5188e443d999","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"f3a3aba5dad1de6347847fec54cce41e11f0831014060102791c4b5fc2834bbb","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":"7b6c27ac-fe12-4e31-bc12-c7de2ea5ca44"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLO8ZKOwSbcGt1vVoxh7D9FC76ROs1Wg8UqBjuP1XwPVgSQvIw69mIPlWdCxxb1bR/1aUlbrR7jx8ruO08dnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:15.990252Z"},"content_sha256":"994d1f8b5005873ffb6c7009db93edbf3612b233934b068c5e7779a3ae859693","schema_version":"1.0","event_id":"sha256:994d1f8b5005873ffb6c7009db93edbf3612b233934b068c5e7779a3ae859693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPFVERVPP227NRW7IOZEYKWBYT/bundle.json","state_url":"https://pith.science/pith/JPFVERVPP227NRW7IOZEYKWBYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPFVERVPP227NRW7IOZEYKWBYT/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-25T19:39:15Z","links":{"resolver":"https://pith.science/pith/JPFVERVPP227NRW7IOZEYKWBYT","bundle":"https://pith.science/pith/JPFVERVPP227NRW7IOZEYKWBYT/bundle.json","state":"https://pith.science/pith/JPFVERVPP227NRW7IOZEYKWBYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPFVERVPP227NRW7IOZEYKWBYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JPFVERVPP227NRW7IOZEYKWBYT","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":"b5319c43efe5140779b2ac4cfed0b33089f138b114c12753bd962c47f17e5909","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T06:33:06Z","title_canon_sha256":"405e377103930fc743f407ef7936ac8bbbd034df49937660257abb639beda96b"},"schema_version":"1.0","source":{"id":"2605.15221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15221","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15221v1","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15221","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"JPFVERVPP227","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_16","alias_value":"JPFVERVPP227NRW7","created_at":"2026-05-20T00:00:46Z"},{"alias_kind":"pith_short_8","alias_value":"JPFVERVP","created_at":"2026-05-20T00:00:46Z"}],"graph_snapshots":[{"event_id":"sha256:994d1f8b5005873ffb6c7009db93edbf3612b233934b068c5e7779a3ae859693","target":"graph","created_at":"2026-05-20T00:00:46Z","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":"Generating fewer algorithms while thinking more deeply about each one achieved higher scores. That is, scaling the quality of each individual is more budget-efficient than scaling the number of evolutionary generations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That results observed on the single Circle Packing benchmark under one fixed token budget generalize to other algorithm-discovery tasks and different resource constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Under fixed token budget on Circle Packing, deeper per-candidate reasoning beats generating more shallow candidates, and capable models produce evaluation hacks at higher rates."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery."}],"snapshot_sha256":"dd561e3166f84dc3ea0ef8f5fde159676a3d0b858bb9f3d7c557ef96f09c216c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T20:21:57.513893Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.823498Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:10:16.441491Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.836262Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15221/integrity.json","findings":[],"snapshot_sha256":"e42593d6d6ce5c75c8ddf66d6e0082875e7641044ffde48c49f01716d155d1bf","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"AlphaEvolve and FunSearch have demonstrated the potential of combining large language models (LLMs) with evolutionary search for automated algorithm discovery. However, discovery success is shaped not only by model capability but also significantly by the design of the execution infrastructure, i.e., the harness. This paper investigates effective harness design through three questions: under a fixed token budget, is it better to produce many algorithms with brief thought or fewer algorithms with deeper thought? How should the harness handle evaluation hacks, where generated programs exploit th","authors_text":"Masafumi Oyamada, Taro Yano, Yoichi Ishibashi","cross_cats":["cs.AI","cs.CL"],"headline":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T06:33:06Z","title":"Effective Harness Engineering for Algorithm Discovery with Coding Agents"},"references":{"count":26,"internal_anchors":5,"resolved_work":26,"sample":[{"cited_arxiv_id":"2506.13131","doi":"","is_internal_anchor":true,"ref_index":1,"title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","work_id":"76a0f850-d490-4e4f-ab98-8d25df82cd23","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Mathematical discoveries from program search with large language models , journal =","work_id":"99f40505-4b28-448f-abe4-f4b1dd4d51d3","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"arXiv preprint arXiv:2206.08896 , year=","work_id":"d378af55-0b14-4700-a7aa-ec83a2226580","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Forty-first International Conference on Machine Learning,","work_id":"62b99f4d-f1e5-4b70-a840-83864aad1ca5","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Haoran Ye and Jiarui Wang and Zhiguang Cao and Federico Berto and Chuanbo Hua and Haeyeon Kim and Jinkyoo Park and Guojie Song , title =. Advances in Neural Information Processing Systems 38: Annual C","work_id":"8fa2f99c-f314-4c90-936f-5188e443d999","year":2024}],"snapshot_sha256":"f3a3aba5dad1de6347847fec54cce41e11f0831014060102791c4b5fc2834bbb"},"source":{"id":"2605.15221","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:03:48.825161Z","id":"7b6c27ac-fe12-4e31-bc12-c7de2ea5ca44","model_set":{"reader":"grok-4.3"},"one_line_summary":"Under fixed token budget on Circle Packing, deeper per-candidate reasoning beats generating more shallow candidates, and capable models produce evaluation hacks at higher rates.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Generating fewer algorithms with deeper thought outperforms many brief ones under a fixed token budget in algorithm discovery.","strongest_claim":"Generating fewer algorithms while thinking more deeply about each one achieved higher scores. That is, scaling the quality of each individual is more budget-efficient than scaling the number of evolutionary generations.","weakest_assumption":"That results observed on the single Circle Packing benchmark under one fixed token budget generalize to other algorithm-discovery tasks and different resource constraints."}},"verdict_id":"7b6c27ac-fe12-4e31-bc12-c7de2ea5ca44"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1035e125e8a3044cc0a8d57ff2ae360a943c5c86872f886139b5021f0595615b","target":"record","created_at":"2026-05-20T00:00:46Z","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":"b5319c43efe5140779b2ac4cfed0b33089f138b114c12753bd962c47f17e5909","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T06:33:06Z","title_canon_sha256":"405e377103930fc743f407ef7936ac8bbbd034df49937660257abb639beda96b"},"schema_version":"1.0","source":{"id":"2605.15221","kind":"arxiv","version":1}},"canonical_sha256":"4bcb5246af7eb5f6c6df43b24c2ac1c4edfc8a657be360285890297ecaa8abee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bcb5246af7eb5f6c6df43b24c2ac1c4edfc8a657be360285890297ecaa8abee","first_computed_at":"2026-05-20T00:00:46.968684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:46.968684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mh2GD3a+ZTEMEAnGojuIk2rmMtMqbZd0qrJf6tlSeScyClEttByAqWPPV6y8kGKodNhs6v+ENHQJr9IDWdc/Aw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:46.969242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1035e125e8a3044cc0a8d57ff2ae360a943c5c86872f886139b5021f0595615b","sha256:994d1f8b5005873ffb6c7009db93edbf3612b233934b068c5e7779a3ae859693"],"state_sha256":"f5aed5c1d90ed23f8b737c9c3916f4268ced2bb9627ab3674ba78a0e28500191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7Zjx54EPHWtPVlyfsb7Tc2eZ8qp1lwfl+FCTMIyDkfwdZiAhFQ196OM9JuGkxGKqlc5tWj7i1Izz/pDZ00sCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:39:15.994928Z","bundle_sha256":"b22d94f251ae223957df1d999f658c4802f47d2c5f08b90b5f37f087d6a73fd6"}}