{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LVBZQLEGD47QUXRIS7SOLN6IHY","short_pith_number":"pith:LVBZQLEG","canonical_record":{"source":{"id":"2501.12599","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-22T02:48:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e63d7c258f175da54893893f85e4209f5102e589ed31e0b559f8897b668e24e8","abstract_canon_sha256":"44a0930c9f4d9d4750ef8d5ec73c65b866a4ba63df992e090b991a1266e093f1"},"schema_version":"1.0"},"canonical_sha256":"5d43982c861f3f0a5e2897e4e5b7c83e369cdbf8bd1c8729c2892cd0b9e1281c","source":{"kind":"arxiv","id":"2501.12599","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12599","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12599v4","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12599","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"LVBZQLEGD47Q","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"LVBZQLEGD47QUXRI","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"LVBZQLEG","created_at":"2026-07-05T11:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LVBZQLEGD47QUXRIS7SOLN6IHY","target":"record","payload":{"canonical_record":{"source":{"id":"2501.12599","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-22T02:48:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e63d7c258f175da54893893f85e4209f5102e589ed31e0b559f8897b668e24e8","abstract_canon_sha256":"44a0930c9f4d9d4750ef8d5ec73c65b866a4ba63df992e090b991a1266e093f1"},"schema_version":"1.0"},"canonical_sha256":"5d43982c861f3f0a5e2897e4e5b7c83e369cdbf8bd1c8729c2892cd0b9e1281c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:26.942824Z","signature_b64":"H7SYkfYpp/mxV2NX8hmf05cWHLKok+oV82MY45X1vjMfJYTWg0Bc5peFAXPbaOSjE7bTD+XANWoO5hhtQWDEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d43982c861f3f0a5e2897e4e5b7c83e369cdbf8bd1c8729c2892cd0b9e1281c","last_reissued_at":"2026-07-05T11:14:26.942266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:26.942266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.12599","source_version":4,"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-05T11:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqZrYYFWNi04Z7vlgnoEQzVhqAwMObnbv+x5f2q/ck2boDZ2F0/rx3g5VPAS7zxW2im4OLWSoMOEc9vKbKPCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:47:06.451761Z"},"content_sha256":"8ea0eed63a99993e342f1b86c4914fd7be17cba083f8b9a8bafaf9665e7d30d3","schema_version":"1.0","event_id":"sha256:8ea0eed63a99993e342f1b86c4914fd7be17cba083f8b9a8bafaf9665e7d30d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LVBZQLEGD47QUXRIS7SOLN6IHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks.","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Angang Du, Bofei Gao, Bowei Xing, Changjiu Jiang, Cheng Chen, Cheng Li, Chenjun Xiao, Chenzhuang Du, Chonghua Liao, Chuning Tang, Congcong Wang, Dehao Zhang, Enming Yuan, Enzhe Lu, Fengxiang Tang, Flood Sung, Guangda Wei, Guokun Lai, Haiqing Guo, Han Zhu, Hao Ding, Hao Hu, Haotian Yao, Haotian Zhao, Hao Yang, Haoyu Lu, Haoze Li, Hao Zhang, Haozhen Yu, Hongcheng Gao, Huabin Zheng, Huan Yuan, Jia Chen, Jianhang Guo, Jianlin Su, Jianzhou Wang, Jie Zhao, Jingyuan Liu, Jin Zhang, Junjie Yan, Junyan Wu, Kimi Team, Lidong Shi, Ling Ye, Longhui Yu, Mengnan Dong, Neo Zhang, Ningchen Ma, Qiwei Pan, Qucheng Gong, Shaowei Liu, Shengling Ma, Shupeng Wei, Sihan Cao, Siying Huang, Tao Jiang, Weihao Gao, Weimin Xiong, Weiran He, Weixiao Huang, Weixin Xu, Wenhao Wu, Wenyang He, Xianghui Wei, Xianqing Jia, Xingzhe Wu, Xinran Xu, Xinxing Zu, Xinyu Zhou, Xuehai Pan, Yang Li, Yangyang Hu, Yangyang Liu, Yanru Chen, Y. Charles, Yejie Wang, Yibo Liu, Yidao Qin, Yifeng Liu, Ying Yang, Yiping Bao, Yulun Du, Yuxin Wu, Yuzhi Wang, Zaida Zhou, Zhaoji Wang, Zhaowei Li, Zheng Zhang, Zhen Zhu, Zhexu Wang, Zhilin Yang, Zhiqi Huang, Zihao Huang, Ziyao Xu, Zonghan Yang, Zongyu Lin","submitted_at":"2025-01-22T02:48:14Z","abstract_excerpt":"Language model pretraining with next token prediction has proved effective for scaling compute but is limited to the amount of available training data. Scaling reinforcement learning (RL) unlocks a new axis for the continued improvement of artificial intelligence, with the promise that large language models (LLMs) can scale their training data by learning to explore with rewards. However, prior published work has not produced competitive results. In light of this, we report on the training practice of Kimi k1.5, our latest multi-modal LLM trained with RL, including its RL training techniques, "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"our system achieves state-of-the-art reasoning performance across multiple benchmarks and modalities -- e.g., 77.5 on AIME, 96.2 on MATH 500, 94-th percentile on Codeforces, 74.9 on MathVista -- matching OpenAI's o1. Moreover, we present effective long2short methods that use long-CoT techniques to improve short-CoT models, yielding state-of-the-art short-CoT reasoning results -- e.g., 60.8 on AIME, 94.6 on MATH500, 47.3 on LiveCodeBench.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the benchmark scores reflect genuine capability gains from the described RL techniques rather than undisclosed differences in model scale, data quality, or evaluation protocols, and that the simple framework generalizes beyond the specific training runs reported.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Kimi k1.5 scales RL for LLMs with long context and policy optimization to match o1-level performance and introduces long2short distillation for strong short-CoT results.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"38584827400dcd066eb5eb637eaa700ef916d9ddc99ea299070de7bf19813994"},"source":{"id":"2501.12599","kind":"arxiv","version":4},"verdict":{"id":"f460e787-8e8b-4077-8e1b-8f8b3a506639","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:54:36.796260Z","strongest_claim":"our system achieves state-of-the-art reasoning performance across multiple benchmarks and modalities -- e.g., 77.5 on AIME, 96.2 on MATH 500, 94-th percentile on Codeforces, 74.9 on MathVista -- matching OpenAI's o1. Moreover, we present effective long2short methods that use long-CoT techniques to improve short-CoT models, yielding state-of-the-art short-CoT reasoning results -- e.g., 60.8 on AIME, 94.6 on MATH500, 47.3 on LiveCodeBench.","one_line_summary":"Kimi k1.5 scales RL for LLMs with long context and policy optimization to match o1-level performance and introduces long2short distillation for strong short-CoT results.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the benchmark scores reflect genuine capability gains from the described RL techniques rather than undisclosed differences in model scale, data quality, or evaluation protocols, and that the simple framework generalizes beyond the specific training runs reported.","pith_extraction_headline":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.12599/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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":"f460e787-8e8b-4077-8e1b-8f8b3a506639"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z6rKjRy9WuYrji6fDeaJHN/EBQYz5P/FQpOqjO0gmZ1FCWWlf0p8n2ot71Jw8z+o93V31CtDnV5oJruNhhCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:47:06.452292Z"},"content_sha256":"8e911bbe2e22334d23278b182d9b75917cb6ed51872a83694f4e369f5a6752a0","schema_version":"1.0","event_id":"sha256:8e911bbe2e22334d23278b182d9b75917cb6ed51872a83694f4e369f5a6752a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/bundle.json","state_url":"https://pith.science/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/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-04T02:47:06Z","links":{"resolver":"https://pith.science/pith/LVBZQLEGD47QUXRIS7SOLN6IHY","bundle":"https://pith.science/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/bundle.json","state":"https://pith.science/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVBZQLEGD47QUXRIS7SOLN6IHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LVBZQLEGD47QUXRIS7SOLN6IHY","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":"44a0930c9f4d9d4750ef8d5ec73c65b866a4ba63df992e090b991a1266e093f1","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-22T02:48:14Z","title_canon_sha256":"e63d7c258f175da54893893f85e4209f5102e589ed31e0b559f8897b668e24e8"},"schema_version":"1.0","source":{"id":"2501.12599","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12599","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12599v4","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12599","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"LVBZQLEGD47Q","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"LVBZQLEGD47QUXRI","created_at":"2026-07-05T11:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"LVBZQLEG","created_at":"2026-07-05T11:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:8e911bbe2e22334d23278b182d9b75917cb6ed51872a83694f4e369f5a6752a0","target":"graph","created_at":"2026-07-05T11:14:26Z","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":"our system achieves state-of-the-art reasoning performance across multiple benchmarks and modalities -- e.g., 77.5 on AIME, 96.2 on MATH 500, 94-th percentile on Codeforces, 74.9 on MathVista -- matching OpenAI's o1. Moreover, we present effective long2short methods that use long-CoT techniques to improve short-CoT models, yielding state-of-the-art short-CoT reasoning results -- e.g., 60.8 on AIME, 94.6 on MATH500, 47.3 on LiveCodeBench."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the benchmark scores reflect genuine capability gains from the described RL techniques rather than undisclosed differences in model scale, data quality, or evaluation protocols, and that the simple framework generalizes beyond the specific training runs reported."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Kimi k1.5 scales RL for LLMs with long context and policy optimization to match o1-level performance and introduces long2short distillation for strong short-CoT results."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks."}],"snapshot_sha256":"38584827400dcd066eb5eb637eaa700ef916d9ddc99ea299070de7bf19813994"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.12599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Language model pretraining with next token prediction has proved effective for scaling compute but is limited to the amount of available training data. Scaling reinforcement learning (RL) unlocks a new axis for the continued improvement of artificial intelligence, with the promise that large language models (LLMs) can scale their training data by learning to explore with rewards. However, prior published work has not produced competitive results. In light of this, we report on the training practice of Kimi k1.5, our latest multi-modal LLM trained with RL, including its RL training techniques, ","authors_text":"Angang Du, Bofei Gao, Bowei Xing, Changjiu Jiang, Cheng Chen, Cheng Li, Chenjun Xiao, Chenzhuang Du, Chonghua Liao, Chuning Tang, Congcong Wang, Dehao Zhang, Enming Yuan, Enzhe Lu, Fengxiang Tang, Flood Sung, Guangda Wei, Guokun Lai, Haiqing Guo, Han Zhu, Hao Ding, Hao Hu, Haotian Yao, Haotian Zhao, Hao Yang, Haoyu Lu, Haoze Li, Hao Zhang, Haozhen Yu, Hongcheng Gao, Huabin Zheng, Huan Yuan, Jia Chen, Jianhang Guo, Jianlin Su, Jianzhou Wang, Jie Zhao, Jingyuan Liu, Jin Zhang, Junjie Yan, Junyan Wu, Kimi Team, Lidong Shi, Ling Ye, Longhui Yu, Mengnan Dong, Neo Zhang, Ningchen Ma, Qiwei Pan, Qucheng Gong, Shaowei Liu, Shengling Ma, Shupeng Wei, Sihan Cao, Siying Huang, Tao Jiang, Weihao Gao, Weimin Xiong, Weiran He, Weixiao Huang, Weixin Xu, Wenhao Wu, Wenyang He, Xianghui Wei, Xianqing Jia, Xingzhe Wu, Xinran Xu, Xinxing Zu, Xinyu Zhou, Xuehai Pan, Yang Li, Yangyang Hu, Yangyang Liu, Yanru Chen, Y. Charles, Yejie Wang, Yibo Liu, Yidao Qin, Yifeng Liu, Ying Yang, Yiping Bao, Yulun Du, Yuxin Wu, Yuzhi Wang, Zaida Zhou, Zhaoji Wang, Zhaowei Li, Zheng Zhang, Zhen Zhu, Zhexu Wang, Zhilin Yang, Zhiqi Huang, Zihao Huang, Ziyao Xu, Zonghan Yang, Zongyu Lin","cross_cats":["cs.LG"],"headline":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12599","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-10T17:54:36.796260Z","id":"f460e787-8e8b-4077-8e1b-8f8b3a506639","model_set":{"reader":"grok-4.3"},"one_line_summary":"Kimi k1.5 scales RL for LLMs with long context and policy optimization to match o1-level performance and introduces long2short distillation for strong short-CoT results.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Scaling reinforcement learning with long context and policy optimization lets LLMs match top reasoning performance on math and code benchmarks.","strongest_claim":"our system achieves state-of-the-art reasoning performance across multiple benchmarks and modalities -- e.g., 77.5 on AIME, 96.2 on MATH 500, 94-th percentile on Codeforces, 74.9 on MathVista -- matching OpenAI's o1. Moreover, we present effective long2short methods that use long-CoT techniques to improve short-CoT models, yielding state-of-the-art short-CoT reasoning results -- e.g., 60.8 on AIME, 94.6 on MATH500, 47.3 on LiveCodeBench.","weakest_assumption":"That the benchmark scores reflect genuine capability gains from the described RL techniques rather than undisclosed differences in model scale, data quality, or evaluation protocols, and that the simple framework generalizes beyond the specific training runs reported."}},"verdict_id":"f460e787-8e8b-4077-8e1b-8f8b3a506639"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ea0eed63a99993e342f1b86c4914fd7be17cba083f8b9a8bafaf9665e7d30d3","target":"record","created_at":"2026-07-05T11:14:26Z","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":"44a0930c9f4d9d4750ef8d5ec73c65b866a4ba63df992e090b991a1266e093f1","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-22T02:48:14Z","title_canon_sha256":"e63d7c258f175da54893893f85e4209f5102e589ed31e0b559f8897b668e24e8"},"schema_version":"1.0","source":{"id":"2501.12599","kind":"arxiv","version":4}},"canonical_sha256":"5d43982c861f3f0a5e2897e4e5b7c83e369cdbf8bd1c8729c2892cd0b9e1281c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d43982c861f3f0a5e2897e4e5b7c83e369cdbf8bd1c8729c2892cd0b9e1281c","first_computed_at":"2026-07-05T11:14:26.942266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:26.942266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H7SYkfYpp/mxV2NX8hmf05cWHLKok+oV82MY45X1vjMfJYTWg0Bc5peFAXPbaOSjE7bTD+XANWoO5hhtQWDEDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:26.942824Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12599","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea0eed63a99993e342f1b86c4914fd7be17cba083f8b9a8bafaf9665e7d30d3","sha256:8e911bbe2e22334d23278b182d9b75917cb6ed51872a83694f4e369f5a6752a0"],"state_sha256":"721fe77cbe612fd03c64024de729fe4c0bfac6f9945b8ca189f82571dd8c26f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61ZlxoLYlxh9/jMstDsWToEOsIfWdltWX0rj1rj0L8bbULtnacr6BT6xktb4bGwN+XjDPthJbI6pGI2uFA55Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:47:06.455329Z","bundle_sha256":"f3fb33c9ef57c0cc1804293d681bfc912136004ce9360440da178c4dfb9cffe5"}}