{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NXV3VHPWS5QN3ZXJHIEMXLAEPC","short_pith_number":"pith:NXV3VHPW","canonical_record":{"source":{"id":"2409.12186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-18T17:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"bfe67f9a7b590f08c37fd511a7c8f2c720712296685078f99374300097d706cd","abstract_canon_sha256":"a6e0411536c3f9493f8b874f7cc432d86e464549271784da23ce797908277047"},"schema_version":"1.0"},"canonical_sha256":"6debba9df69760dde6e93a08cbac0478a28bdd93e23bb5967ac13af3282b4b80","source":{"kind":"arxiv","id":"2409.12186","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12186","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12186v3","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12186","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"NXV3VHPWS5QN","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_16","alias_value":"NXV3VHPWS5QN3ZXJ","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_8","alias_value":"NXV3VHPW","created_at":"2026-07-05T09:34:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NXV3VHPWS5QN3ZXJHIEMXLAEPC","target":"record","payload":{"canonical_record":{"source":{"id":"2409.12186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-18T17:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"bfe67f9a7b590f08c37fd511a7c8f2c720712296685078f99374300097d706cd","abstract_canon_sha256":"a6e0411536c3f9493f8b874f7cc432d86e464549271784da23ce797908277047"},"schema_version":"1.0"},"canonical_sha256":"6debba9df69760dde6e93a08cbac0478a28bdd93e23bb5967ac13af3282b4b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:19.466127Z","signature_b64":"CMnHNSI4p2czfsYu2uskTZUN0N3gqahy0UauMRZLRlTZRc/O5zq94uAZqWkBaLChDHBxCwnvvoimtlFTi9zrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6debba9df69760dde6e93a08cbac0478a28bdd93e23bb5967ac13af3282b4b80","last_reissued_at":"2026-07-05T09:34:19.465629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:19.465629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.12186","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-07-05T09:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uQxCzRZ04kfWcwwmGjoQK23ETXCL93GqRzDaeYC/BnbclXH1sAJI7BtzAzGIrgT+06UjXeVNv8kcLnUUF85DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:14:20.797543Z"},"content_sha256":"e101a497157ed7c374dcf0971889c5b2b7f8eb6d7369821163cbcbadc5d9ed18","schema_version":"1.0","event_id":"sha256:e101a497157ed7c374dcf0971889c5b2b7f8eb6d7369821163cbcbadc5d9ed18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NXV3VHPWS5QN3ZXJHIEMXLAEPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qwen2.5-Coder Technical Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"An Yang, Binyuan Hui, Bowen Yu, Bo Zheng, Dayiheng Liu, Fei Huang, Jiajun Zhang, Jian Yang, Jiaxi Yang, Jingren Zhou, Junyang Lin, Kai Dang, Keming Lu, Lei Zhang, Rui Men, Shanghaoran Quan, Tianyu Liu, Xingzhang Ren, Xuancheng Ren, Yang Fan, Yibo Miao, Yichang Zhang, Yunlong Feng, Zeyu Cui","submitted_at":"2024-09-18T17:57:57Z","abstract_excerpt":"In this report, we introduce the Qwen2.5-Coder series, a significant upgrade from its predecessor, CodeQwen1.5. This series includes six models: Qwen2.5-Coder-(0.5B/1.5B/3B/7B/14B/32B). As a code-specific model, Qwen2.5-Coder is built upon the Qwen2.5 architecture and continues pretrained on a vast corpus of over 5.5 trillion tokens. Through meticulous data cleaning, scalable synthetic data generation, and balanced data mixing, Qwen2.5-Coder demonstrates impressive code generation capabilities while retaining general and math skills. These models have been evaluated on a wide range of code-rel"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"achieving state-of-the-art (SOTA) performance across more than 10 benchmarks, including code generation, completion, reasoning, and repair, consistently outperforming larger models of the same model size.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the chosen benchmarks and evaluation setups fairly measure practical code capabilities and that comparisons to other models use consistent, unbiased conditions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Qwen2.5-Coder models claim state-of-the-art results on over 10 code benchmarks, outperforming larger models of similar size.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5e56fa15f2b6d726656ac919a2482bc607706d63936af225c58b693c3da6d041"},"source":{"id":"2409.12186","kind":"arxiv","version":3},"verdict":{"id":"06705c15-370f-456a-acdc-189882554ec1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T12:28:34.514129Z","strongest_claim":"achieving state-of-the-art (SOTA) performance across more than 10 benchmarks, including code generation, completion, reasoning, and repair, consistently outperforming larger models of the same model size.","one_line_summary":"Qwen2.5-Coder models claim state-of-the-art results on over 10 code benchmarks, outperforming larger models of similar size.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the chosen benchmarks and evaluation setups fairly measure practical code capabilities and that comparisons to other models use consistent, unbiased conditions.","pith_extraction_headline":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.12186/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":42,"sample":[{"doi":"","year":null,"title":"GPT-4 Technical Report","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","ref_index":1,"cited_arxiv_id":"2303.08774","is_internal_anchor":true},{"doi":"","year":null,"title":"Santacoder: don’t reach for the stars!","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","ref_index":3,"cited_arxiv_id":"2108.07732","is_internal_anchor":true},{"doi":"","year":null,"title":"Qwen Technical Report","work_id":"bb1fd52f-6b2f-437c-9516-37bdf6eb9be8","ref_index":4,"cited_arxiv_id":"2309.16609","is_internal_anchor":true},{"doi":"","year":null,"title":"Efficient Training of Language Models to Fill in the Middle","work_id":"54afe4f8-4d93-4829-99ae-2a27143a9641","ref_index":5,"cited_arxiv_id":"2207.14255","is_internal_anchor":true}],"resolved_work":42,"snapshot_sha256":"a1e7d8bb0dab2ad8d643fb6b4d41f8f91f0e48fbdda34103c6d7290678e9f2f9","internal_anchors":22},"formal_canon":{"evidence_count":2,"snapshot_sha256":"764d79a2030d4ec711ad9ff28a8194b3e170d64cc3eb9e7ee1d595d5a1236f7e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"06705c15-370f-456a-acdc-189882554ec1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqfXPAVTkdwU81MIBdMv7ons9jyRbvhzlvnsC/4KZ8u/OGF6bL/okcSYFvHeBpEaoG3JswovVJ2W67xGfonfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:14:20.798389Z"},"content_sha256":"76d9ad7bb29af531974d9e5a52f7eae5a0012cea015a35baaa45a511bc18209d","schema_version":"1.0","event_id":"sha256:76d9ad7bb29af531974d9e5a52f7eae5a0012cea015a35baaa45a511bc18209d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/bundle.json","state_url":"https://pith.science/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/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-08-07T06:14:20Z","links":{"resolver":"https://pith.science/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC","bundle":"https://pith.science/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/bundle.json","state":"https://pith.science/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXV3VHPWS5QN3ZXJHIEMXLAEPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NXV3VHPWS5QN3ZXJHIEMXLAEPC","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":"a6e0411536c3f9493f8b874f7cc432d86e464549271784da23ce797908277047","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-18T17:57:57Z","title_canon_sha256":"bfe67f9a7b590f08c37fd511a7c8f2c720712296685078f99374300097d706cd"},"schema_version":"1.0","source":{"id":"2409.12186","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12186","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12186v3","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12186","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"NXV3VHPWS5QN","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_16","alias_value":"NXV3VHPWS5QN3ZXJ","created_at":"2026-07-05T09:34:19Z"},{"alias_kind":"pith_short_8","alias_value":"NXV3VHPW","created_at":"2026-07-05T09:34:19Z"}],"graph_snapshots":[{"event_id":"sha256:76d9ad7bb29af531974d9e5a52f7eae5a0012cea015a35baaa45a511bc18209d","target":"graph","created_at":"2026-07-05T09:34:19Z","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":"achieving state-of-the-art (SOTA) performance across more than 10 benchmarks, including code generation, completion, reasoning, and repair, consistently outperforming larger models of the same model size."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the chosen benchmarks and evaluation setups fairly measure practical code capabilities and that comparisons to other models use consistent, unbiased conditions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Qwen2.5-Coder models claim state-of-the-art results on over 10 code benchmarks, outperforming larger models of similar size."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens."}],"snapshot_sha256":"5e56fa15f2b6d726656ac919a2482bc607706d63936af225c58b693c3da6d041"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"764d79a2030d4ec711ad9ff28a8194b3e170d64cc3eb9e7ee1d595d5a1236f7e"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.12186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this report, we introduce the Qwen2.5-Coder series, a significant upgrade from its predecessor, CodeQwen1.5. This series includes six models: Qwen2.5-Coder-(0.5B/1.5B/3B/7B/14B/32B). As a code-specific model, Qwen2.5-Coder is built upon the Qwen2.5 architecture and continues pretrained on a vast corpus of over 5.5 trillion tokens. Through meticulous data cleaning, scalable synthetic data generation, and balanced data mixing, Qwen2.5-Coder demonstrates impressive code generation capabilities while retaining general and math skills. These models have been evaluated on a wide range of code-rel","authors_text":"An Yang, Binyuan Hui, Bowen Yu, Bo Zheng, Dayiheng Liu, Fei Huang, Jiajun Zhang, Jian Yang, Jiaxi Yang, Jingren Zhou, Junyang Lin, Kai Dang, Keming Lu, Lei Zhang, Rui Men, Shanghaoran Quan, Tianyu Liu, Xingzhang Ren, Xuancheng Ren, Yang Fan, Yibo Miao, Yichang Zhang, Yunlong Feng, Zeyu Cui","cross_cats":[],"headline":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report"},"references":{"count":42,"internal_anchors":22,"resolved_work":42,"sample":[{"cited_arxiv_id":"2303.08774","doi":"","is_internal_anchor":true,"ref_index":1,"title":"GPT-4 Technical Report","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Santacoder: don’t reach for the stars!","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":null},{"cited_arxiv_id":"2108.07732","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","year":2024},{"cited_arxiv_id":"2309.16609","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Qwen Technical Report","work_id":"bb1fd52f-6b2f-437c-9516-37bdf6eb9be8","year":null},{"cited_arxiv_id":"2207.14255","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Efficient Training of Language Models to Fill in the Middle","work_id":"54afe4f8-4d93-4829-99ae-2a27143a9641","year":null}],"snapshot_sha256":"a1e7d8bb0dab2ad8d643fb6b4d41f8f91f0e48fbdda34103c6d7290678e9f2f9"},"source":{"id":"2409.12186","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T12:28:34.514129Z","id":"06705c15-370f-456a-acdc-189882554ec1","model_set":{"reader":"grok-4.3"},"one_line_summary":"Qwen2.5-Coder models claim state-of-the-art results on over 10 code benchmarks, outperforming larger models of similar size.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Qwen2.5-Coder models reach state-of-the-art code performance across sizes by continued pretraining on over 5.5 trillion tokens.","strongest_claim":"achieving state-of-the-art (SOTA) performance across more than 10 benchmarks, including code generation, completion, reasoning, and repair, consistently outperforming larger models of the same model size.","weakest_assumption":"That the chosen benchmarks and evaluation setups fairly measure practical code capabilities and that comparisons to other models use consistent, unbiased conditions."}},"verdict_id":"06705c15-370f-456a-acdc-189882554ec1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e101a497157ed7c374dcf0971889c5b2b7f8eb6d7369821163cbcbadc5d9ed18","target":"record","created_at":"2026-07-05T09:34:19Z","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":"a6e0411536c3f9493f8b874f7cc432d86e464549271784da23ce797908277047","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-18T17:57:57Z","title_canon_sha256":"bfe67f9a7b590f08c37fd511a7c8f2c720712296685078f99374300097d706cd"},"schema_version":"1.0","source":{"id":"2409.12186","kind":"arxiv","version":3}},"canonical_sha256":"6debba9df69760dde6e93a08cbac0478a28bdd93e23bb5967ac13af3282b4b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6debba9df69760dde6e93a08cbac0478a28bdd93e23bb5967ac13af3282b4b80","first_computed_at":"2026-07-05T09:34:19.465629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:34:19.465629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMnHNSI4p2czfsYu2uskTZUN0N3gqahy0UauMRZLRlTZRc/O5zq94uAZqWkBaLChDHBxCwnvvoimtlFTi9zrCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:34:19.466127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.12186","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e101a497157ed7c374dcf0971889c5b2b7f8eb6d7369821163cbcbadc5d9ed18","sha256:76d9ad7bb29af531974d9e5a52f7eae5a0012cea015a35baaa45a511bc18209d"],"state_sha256":"a07055ef1e3c2635dce688e2dbb15f643ee9f82d7bcf7dcc381e4cb73ae516f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74q/T0ugSCxYUdME36ffk2E4chP5Ca7raNxSDiw8o98q/JJfzpQAHHMRi94rJwRHaE77tnIzmQz4FidbWMtqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:14:20.804540Z","bundle_sha256":"d5d4212afb588724108549653e26cc3ed102c5ef3ce9451642ecd3126b9f653a"}}