{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WARVR67NY46K7VJNG7VGNBGCAK","short_pith_number":"pith:WARVR67N","canonical_record":{"source":{"id":"2605.18351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-18T13:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"79449636cc802130fb4043ef2868d6197ea59dc37c0a505198a276cd11ab8237","abstract_canon_sha256":"72c2a49e4758a4334c8640fa4d45aff3a8d8163ee27f823d9c5326ea6e2ff723"},"schema_version":"1.0"},"canonical_sha256":"b02358fbedc73cafd52d37ea6684c20298a69738f6b75959a2e79f1287281f86","source":{"kind":"arxiv","id":"2605.18351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18351","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18351v1","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18351","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"WARVR67NY46K","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"WARVR67NY46K7VJN","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"WARVR67N","created_at":"2026-05-20T00:05:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WARVR67NY46K7VJNG7VGNBGCAK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-18T13:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"79449636cc802130fb4043ef2868d6197ea59dc37c0a505198a276cd11ab8237","abstract_canon_sha256":"72c2a49e4758a4334c8640fa4d45aff3a8d8163ee27f823d9c5326ea6e2ff723"},"schema_version":"1.0"},"canonical_sha256":"b02358fbedc73cafd52d37ea6684c20298a69738f6b75959a2e79f1287281f86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:56.572230Z","signature_b64":"xQLatynGTVS3tBdyDpTFsmmt6S6CbHiHitU0qZk1gYrhG5EXyvcPT2bhDnakGtx7Y89UJ3dNWzFQkHa8Bm+OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b02358fbedc73cafd52d37ea6684c20298a69738f6b75959a2e79f1287281f86","last_reissued_at":"2026-05-20T00:05:56.571472Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:56.571472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18351","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Th+1rvmrIvX5JGxe5oVRdRuRdztuBopkv1SN2bLvm0jCWbsNKOH//RO3NFjL4MgyUPQKVIokHCGE6+5T1djlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:22:13.130406Z"},"content_sha256":"addd0ba36b950b59299ebd49662d8f584f5424e7aac36e864435f6bc9e85f5a8","schema_version":"1.0","event_id":"sha256:addd0ba36b950b59299ebd49662d8f584f5424e7aac36e864435f6bc9e85f5a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WARVR67NY46K7VJNG7VGNBGCAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mapping the Fitness Landscape: A Structure-Guided Approach to Multi-Modal Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks.","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Meng Xiang, Pei Yan","submitted_at":"2026-05-18T13:08:02Z","abstract_excerpt":"Multimodal optimization requires finding many optima rather than merely keeping a diverse population. Yet most niching-based evolutionary algorithms rely on distances or density estimators without explicitly recovering the underlying peak--basin organization in the decision space, which can lead to pseudo-multimodality: many distinct individuals ultimately collapse into only a few basins. We introduce Chaotic Landscape-Decoding Evolution (CLDE), a decision-space-centric framework that turns multimodal search into a closed loop of decode--value--allocate--refine. CLDE injects controlled global "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"CLDE-S achieves strong peak ratio under the same evaluation budget on 20 CEC2013 functions, while CLDE-M attains competitive IGD/IGDx on DTLZ and MMMOP suites with pronounced gains on strongly multimodal problems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The k-nearest-neighbor graph combined with persistence-guided merging accurately recovers the true underlying peak-basin organization of the decision space without over-fragmentation or over-merging, as stated in the description of the decode-value-allocate-refine loop.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CLDE decodes multimodal landscapes via chaotic exploration and adaptive persistence-based basin identification to achieve higher peak ratios on CEC2013 benchmarks and competitive IGD on DTLZ/MMMOP suites.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9612ccc1002a05e80a0c5fe2b75cbe98e6d716d4632b85529659b4a9febd9162"},"source":{"id":"2605.18351","kind":"arxiv","version":1},"verdict":{"id":"e7712400-24a4-44ea-a5be-2b7a58e7eba3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:31:12.277624Z","strongest_claim":"CLDE-S achieves strong peak ratio under the same evaluation budget on 20 CEC2013 functions, while CLDE-M attains competitive IGD/IGDx on DTLZ and MMMOP suites with pronounced gains on strongly multimodal problems.","one_line_summary":"CLDE decodes multimodal landscapes via chaotic exploration and adaptive persistence-based basin identification to achieve higher peak ratios on CEC2013 benchmarks and competitive IGD on DTLZ/MMMOP suites.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The k-nearest-neighbor graph combined with persistence-guided merging accurately recovers the true underlying peak-basin organization of the decision space without over-fragmentation or over-merging, as stated in the description of the decode-value-allocate-refine loop.","pith_extraction_headline":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18351/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.402450Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:40:55.964758Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.149420Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:59.821427Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.809926Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0191dacef318619722e76717f4a0b0bbb63b5680dd3ce13c9f3d3cedaefaf62e"},"references":{"count":48,"sample":[{"doi":"","year":2010,"title":"Bilal Alatas. 2010. Chaotic harmony search algorithms.Applied mathematics and computation216, 9 (2010), 2687–2699","work_id":"e89ed7e4-5313-47fd-b856-b907a1880c8d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Riccardo Caponetto, Luigi Fortuna, Stefano Fazzino, and Maria Gabriella Xibilia","work_id":"b68fac1c-2aa4-4701-9d25-c32e9ce23143","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"IEEE transactions on evolutionary computation7, 3 (2003), 289–304","work_id":"9ef832c8-11f4-4824-a62f-6814a75f8990","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"An Introduction to","work_id":"1b7c7d71-fb85-4a90-a68c-d288344b8f6a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Weicheng Chen, Wenlong Zhang, and Weixuan Tang. 2019. A Novel Differen- tial Evolution for Multimodal Optimization.IEEE Transactions on Evolutionary Computation(2019)","work_id":"61abbf1b-b17d-4c9e-9830-76b439517a30","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"017ed04e788adc46d7b36eda615f11acf4959a13bc5ad4f7a24a69bd57345f39","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"43111703c26233a1e738944a4d558ee6fc48bb153f3ec51c77459dc1a1e3e682"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e7712400-24a4-44ea-a5be-2b7a58e7eba3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5g+h6l1xqULlpaBALjIpPHgi73pM6j6K+2+CAVp3RERH3veLbYqTAMXh4TX98UW+7j8xKma5e94ND+uoII3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:22:13.131700Z"},"content_sha256":"24847946a45a00ddeaaeb783c161660e58ca30945ce894d277d294802009a7eb","schema_version":"1.0","event_id":"sha256:24847946a45a00ddeaaeb783c161660e58ca30945ce894d277d294802009a7eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WARVR67NY46K7VJNG7VGNBGCAK/bundle.json","state_url":"https://pith.science/pith/WARVR67NY46K7VJNG7VGNBGCAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WARVR67NY46K7VJNG7VGNBGCAK/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-06-06T06:22:13Z","links":{"resolver":"https://pith.science/pith/WARVR67NY46K7VJNG7VGNBGCAK","bundle":"https://pith.science/pith/WARVR67NY46K7VJNG7VGNBGCAK/bundle.json","state":"https://pith.science/pith/WARVR67NY46K7VJNG7VGNBGCAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WARVR67NY46K7VJNG7VGNBGCAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WARVR67NY46K7VJNG7VGNBGCAK","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":"72c2a49e4758a4334c8640fa4d45aff3a8d8163ee27f823d9c5326ea6e2ff723","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-18T13:08:02Z","title_canon_sha256":"79449636cc802130fb4043ef2868d6197ea59dc37c0a505198a276cd11ab8237"},"schema_version":"1.0","source":{"id":"2605.18351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18351","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18351v1","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18351","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"WARVR67NY46K","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"WARVR67NY46K7VJN","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"WARVR67N","created_at":"2026-05-20T00:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:24847946a45a00ddeaaeb783c161660e58ca30945ce894d277d294802009a7eb","target":"graph","created_at":"2026-05-20T00:05:56Z","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":"CLDE-S achieves strong peak ratio under the same evaluation budget on 20 CEC2013 functions, while CLDE-M attains competitive IGD/IGDx on DTLZ and MMMOP suites with pronounced gains on strongly multimodal problems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The k-nearest-neighbor graph combined with persistence-guided merging accurately recovers the true underlying peak-basin organization of the decision space without over-fragmentation or over-merging, as stated in the description of the decode-value-allocate-refine loop."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CLDE decodes multimodal landscapes via chaotic exploration and adaptive persistence-based basin identification to achieve higher peak ratios on CEC2013 benchmarks and competitive IGD on DTLZ/MMMOP suites."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks."}],"snapshot_sha256":"9612ccc1002a05e80a0c5fe2b75cbe98e6d716d4632b85529659b4a9febd9162"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"43111703c26233a1e738944a4d558ee6fc48bb153f3ec51c77459dc1a1e3e682"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.402450Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:40:55.964758Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.149420Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:31:59.821427Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.809926Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18351/integrity.json","findings":[],"snapshot_sha256":"0191dacef318619722e76717f4a0b0bbb63b5680dd3ce13c9f3d3cedaefaf62e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multimodal optimization requires finding many optima rather than merely keeping a diverse population. Yet most niching-based evolutionary algorithms rely on distances or density estimators without explicitly recovering the underlying peak--basin organization in the decision space, which can lead to pseudo-multimodality: many distinct individuals ultimately collapse into only a few basins. We introduce Chaotic Landscape-Decoding Evolution (CLDE), a decision-space-centric framework that turns multimodal search into a closed loop of decode--value--allocate--refine. CLDE injects controlled global ","authors_text":"Meng Xiang, Pei Yan","cross_cats":[],"headline":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-18T13:08:02Z","title":"Mapping the Fitness Landscape: A Structure-Guided Approach to Multi-Modal Optimization"},"references":{"count":48,"internal_anchors":0,"resolved_work":48,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bilal Alatas. 2010. Chaotic harmony search algorithms.Applied mathematics and computation216, 9 (2010), 2687–2699","work_id":"e89ed7e4-5313-47fd-b856-b907a1880c8d","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Riccardo Caponetto, Luigi Fortuna, Stefano Fazzino, and Maria Gabriella Xibilia","work_id":"b68fac1c-2aa4-4701-9d25-c32e9ce23143","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"IEEE transactions on evolutionary computation7, 3 (2003), 289–304","work_id":"9ef832c8-11f4-4824-a62f-6814a75f8990","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"An Introduction to","work_id":"1b7c7d71-fb85-4a90-a68c-d288344b8f6a","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Weicheng Chen, Wenlong Zhang, and Weixuan Tang. 2019. A Novel Differen- tial Evolution for Multimodal Optimization.IEEE Transactions on Evolutionary Computation(2019)","work_id":"61abbf1b-b17d-4c9e-9830-76b439517a30","year":2019}],"snapshot_sha256":"017ed04e788adc46d7b36eda615f11acf4959a13bc5ad4f7a24a69bd57345f39"},"source":{"id":"2605.18351","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:31:12.277624Z","id":"e7712400-24a4-44ea-a5be-2b7a58e7eba3","model_set":{"reader":"grok-4.3"},"one_line_summary":"CLDE decodes multimodal landscapes via chaotic exploration and adaptive persistence-based basin identification to achieve higher peak ratios on CEC2013 benchmarks and competitive IGD on DTLZ/MMMOP suites.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Chaotic decoding and persistence-guided merging on a kNN graph recovers the basin structure of multimodal landscapes to locate more distinct peaks.","strongest_claim":"CLDE-S achieves strong peak ratio under the same evaluation budget on 20 CEC2013 functions, while CLDE-M attains competitive IGD/IGDx on DTLZ and MMMOP suites with pronounced gains on strongly multimodal problems.","weakest_assumption":"The k-nearest-neighbor graph combined with persistence-guided merging accurately recovers the true underlying peak-basin organization of the decision space without over-fragmentation or over-merging, as stated in the description of the decode-value-allocate-refine loop."}},"verdict_id":"e7712400-24a4-44ea-a5be-2b7a58e7eba3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:addd0ba36b950b59299ebd49662d8f584f5424e7aac36e864435f6bc9e85f5a8","target":"record","created_at":"2026-05-20T00:05:56Z","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":"72c2a49e4758a4334c8640fa4d45aff3a8d8163ee27f823d9c5326ea6e2ff723","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-18T13:08:02Z","title_canon_sha256":"79449636cc802130fb4043ef2868d6197ea59dc37c0a505198a276cd11ab8237"},"schema_version":"1.0","source":{"id":"2605.18351","kind":"arxiv","version":1}},"canonical_sha256":"b02358fbedc73cafd52d37ea6684c20298a69738f6b75959a2e79f1287281f86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02358fbedc73cafd52d37ea6684c20298a69738f6b75959a2e79f1287281f86","first_computed_at":"2026-05-20T00:05:56.571472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:56.571472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQLatynGTVS3tBdyDpTFsmmt6S6CbHiHitU0qZk1gYrhG5EXyvcPT2bhDnakGtx7Y89UJ3dNWzFQkHa8Bm+OCA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:56.572230Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:addd0ba36b950b59299ebd49662d8f584f5424e7aac36e864435f6bc9e85f5a8","sha256:24847946a45a00ddeaaeb783c161660e58ca30945ce894d277d294802009a7eb"],"state_sha256":"81d1838ac8cf34cdc73994b8e5d8ab0c57b49a57f44c347f6d57281ef0a010c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MeHgjHLl+MDfoLcg+kM85QBEQs5JKiSqorH6hc1gxDAvPhD0JXN3yJnH5yKjsh8tnyubHpBLZ3BMoGA9Y1/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:22:13.137445Z","bundle_sha256":"587be03785e08a69e6f8d9f0e05ffc466d625001350043e85e4c0ee43d0ac09d"}}