{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7PBBOKTZPXTU6HEZLUCKYIMYWL","short_pith_number":"pith:7PBBOKTZ","canonical_record":{"source":{"id":"2604.26782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-29T15:13:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"df71af87e72d2025923ba0672ee4b86635162aaaf94ca29b95bcb3bae9dfe3e9","abstract_canon_sha256":"9a462aea1012266cdf571736ed3fbc3f1a766c755e7eee7b4d73b106e4c23d0e"},"schema_version":"1.0"},"canonical_sha256":"fbc2172a797de74f1c995d04ac2198b2c16171cfbe052e927399565f2559cf46","source":{"kind":"arxiv","id":"2604.26782","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26782","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26782v2","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26782","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"7PBBOKTZPXTU","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_16","alias_value":"7PBBOKTZPXTU6HEZ","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_8","alias_value":"7PBBOKTZ","created_at":"2026-05-20T00:00:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7PBBOKTZPXTU6HEZLUCKYIMYWL","target":"record","payload":{"canonical_record":{"source":{"id":"2604.26782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-29T15:13:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"df71af87e72d2025923ba0672ee4b86635162aaaf94ca29b95bcb3bae9dfe3e9","abstract_canon_sha256":"9a462aea1012266cdf571736ed3fbc3f1a766c755e7eee7b4d73b106e4c23d0e"},"schema_version":"1.0"},"canonical_sha256":"fbc2172a797de74f1c995d04ac2198b2c16171cfbe052e927399565f2559cf46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:39.756308Z","signature_b64":"/9LvdnW4CwAdRyakr/ba5VKRvnkOuRz4AZVgI1XHRByAHQd31ai68GNQ7mbSZfVmtWoe9NA7RZLLn8Ipo/oPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbc2172a797de74f1c995d04ac2198b2c16171cfbe052e927399565f2559cf46","last_reissued_at":"2026-05-20T00:00:39.755670Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:39.755670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.26782","source_version":2,"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgm6yoUievBslJH/c3EKyLKKIHqROtnXDTmARrBs0u4j/yTGVYRihV8g7oE3UP90gNIsRdPrj55YqcEnlcOOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:35.953626Z"},"content_sha256":"35d6fbb83cc6ca53f8526c7c0a008d7f6164ba2670a107b3908d0991279052c4","schema_version":"1.0","event_id":"sha256:35d6fbb83cc6ca53f8526c7c0a008d7f6164ba2670a107b3908d0991279052c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7PBBOKTZPXTU6HEZLUCKYIMYWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Policy Iteration for High-Dimensional Mean-Field Games with Regenerative Reformulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hui Zhang, Shuixin Fang, Shupeng Wang, Tao Zhou, Zhen Wu","submitted_at":"2026-04-29T15:13:23Z","abstract_excerpt":"This paper develops a deep policy iteration method for high-dimensional finite-horizon mean-field games (MFG). We reformulate the game as a regenerative problem with deterministic cycles, which allows policy evaluation (PE), policy improvement (PI), and population measure estimation to be carried out cycle by cycle. Within this formulation, we approximate the population measure by a particle system and update it using a one-step random mapping induced by the Euler-Maruyama discretization of the state dynamics. This update transports a mini-batch of particles from one cycle to the next, avoidin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting method is efficient and scalable in high dimensions, as it avoids the direct solution of the coupled Hamilton-Jacobi-Bellman and Fokker-Planck system, the full simulation of trajectories to estimate the population measure, the explicit computation of conditional expectations in policy evaluation, and pointwise optimization in policy improvement. Numerical experiments demonstrate that the proposed method effectively handles dimensions up to 10,000.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The mean-field game can be reformulated as a regenerative problem with deterministic cycles such that policy evaluation, policy improvement, and population measure estimation can be accurately performed cycle by cycle using particle approximations updated via one-step random mappings from Euler-Maruyama discretization.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A deep policy iteration method reformulates finite-horizon mean-field games as regenerative problems with deterministic cycles, using particle systems and one-step updates to handle dimensions up to 10,000 efficiently.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3751a41e951992045a24d9f85c9416f711c2a85efa31b7c283347c8a43f1b722"},"source":{"id":"2604.26782","kind":"arxiv","version":2},"verdict":{"id":"aa3cc875-f2df-44fe-93f1-66378fc914b1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:10:15.247911Z","strongest_claim":"The resulting method is efficient and scalable in high dimensions, as it avoids the direct solution of the coupled Hamilton-Jacobi-Bellman and Fokker-Planck system, the full simulation of trajectories to estimate the population measure, the explicit computation of conditional expectations in policy evaluation, and pointwise optimization in policy improvement. Numerical experiments demonstrate that the proposed method effectively handles dimensions up to 10,000.","one_line_summary":"A deep policy iteration method reformulates finite-horizon mean-field games as regenerative problems with deterministic cycles, using particle systems and one-step updates to handle dimensions up to 10,000 efficiently.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The mean-field game can be reformulated as a regenerative problem with deterministic cycles such that policy evaluation, policy improvement, and population measure estimation can be accurately performed cycle by cycle using particle approximations updated via one-step random mappings from Euler-Maruyama discretization.","pith_extraction_headline":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26782/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T19:46:11.840067Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7737687603cb6c4e8faeef4bd9785182cb85428135197c49edf8eb19c718abed"},"references":{"count":54,"sample":[{"doi":"","year":2019,"title":"Mean field games for modeling crowd motion","work_id":"72dda695-b284-47ca-9e9e-180775f3b046","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Extensions of the deep Galerkin method.Appl","work_id":"74f2a0f0-bccc-4694-94a7-d5c3aa540850","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"A maximum principle for SDEs of mean-field type.Appl","work_id":"de9e66b8-457f-4e6c-a129-33f6525842d0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"SpringerBriefs in Mathematics","work_id":"4e3a7245-c2dc-46c9-8f4b-826231ee96e6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Mean field control and mean field game models with several populations.Minimax Theory Appl., 3(2):173–209, 2018","work_id":"ea37bd87-8d5f-446b-ac85-d90443de9f4e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":54,"snapshot_sha256":"1bc1b0837a84084de91a84ada64d0e8778cb3924d6331b08edccc13f7e6cae80","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3fb0e3f6c12c73c64be84c0add178da1d1f4c06d25cb41a24d39c8327b30a2d1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"aa3cc875-f2df-44fe-93f1-66378fc914b1"},"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vr6asWoXPvklVfU4DcMrJU1KHhLqrXt2Ot/MKf1t+aGDvR2iWt3HKiWfqmtA+RE1VM4DadbdVtHqkLI8pQMDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:35.954742Z"},"content_sha256":"7d3ada59c7e77d5f879faeaa3d6c75492a0bcd4d19010dd35ceb55aed9b610cd","schema_version":"1.0","event_id":"sha256:7d3ada59c7e77d5f879faeaa3d6c75492a0bcd4d19010dd35ceb55aed9b610cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/bundle.json","state_url":"https://pith.science/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/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-27T15:46:35Z","links":{"resolver":"https://pith.science/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL","bundle":"https://pith.science/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/bundle.json","state":"https://pith.science/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PBBOKTZPXTU6HEZLUCKYIMYWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7PBBOKTZPXTU6HEZLUCKYIMYWL","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":"9a462aea1012266cdf571736ed3fbc3f1a766c755e7eee7b4d73b106e4c23d0e","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-29T15:13:23Z","title_canon_sha256":"df71af87e72d2025923ba0672ee4b86635162aaaf94ca29b95bcb3bae9dfe3e9"},"schema_version":"1.0","source":{"id":"2604.26782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26782","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26782v2","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26782","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"7PBBOKTZPXTU","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_16","alias_value":"7PBBOKTZPXTU6HEZ","created_at":"2026-05-20T00:00:39Z"},{"alias_kind":"pith_short_8","alias_value":"7PBBOKTZ","created_at":"2026-05-20T00:00:39Z"}],"graph_snapshots":[{"event_id":"sha256:7d3ada59c7e77d5f879faeaa3d6c75492a0bcd4d19010dd35ceb55aed9b610cd","target":"graph","created_at":"2026-05-20T00:00:39Z","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":"The resulting method is efficient and scalable in high dimensions, as it avoids the direct solution of the coupled Hamilton-Jacobi-Bellman and Fokker-Planck system, the full simulation of trajectories to estimate the population measure, the explicit computation of conditional expectations in policy evaluation, and pointwise optimization in policy improvement. Numerical experiments demonstrate that the proposed method effectively handles dimensions up to 10,000."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The mean-field game can be reformulated as a regenerative problem with deterministic cycles such that policy evaluation, policy improvement, and population measure estimation can be accurately performed cycle by cycle using particle approximations updated via one-step random mappings from Euler-Maruyama discretization."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A deep policy iteration method reformulates finite-horizon mean-field games as regenerative problems with deterministic cycles, using particle systems and one-step updates to handle dimensions up to 10,000 efficiently."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000."}],"snapshot_sha256":"3751a41e951992045a24d9f85c9416f711c2a85efa31b7c283347c8a43f1b722"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3fb0e3f6c12c73c64be84c0add178da1d1f4c06d25cb41a24d39c8327b30a2d1"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:46:11.840067Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.26782/integrity.json","findings":[],"snapshot_sha256":"7737687603cb6c4e8faeef4bd9785182cb85428135197c49edf8eb19c718abed","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper develops a deep policy iteration method for high-dimensional finite-horizon mean-field games (MFG). We reformulate the game as a regenerative problem with deterministic cycles, which allows policy evaluation (PE), policy improvement (PI), and population measure estimation to be carried out cycle by cycle. Within this formulation, we approximate the population measure by a particle system and update it using a one-step random mapping induced by the Euler-Maruyama discretization of the state dynamics. This update transports a mini-batch of particles from one cycle to the next, avoidin","authors_text":"Hui Zhang, Shuixin Fang, Shupeng Wang, Tao Zhou, Zhen Wu","cross_cats":["cs.NA"],"headline":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-29T15:13:23Z","title":"Deep Policy Iteration for High-Dimensional Mean-Field Games with Regenerative Reformulation"},"references":{"count":54,"internal_anchors":0,"resolved_work":54,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Mean field games for modeling crowd motion","work_id":"72dda695-b284-47ca-9e9e-180775f3b046","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Extensions of the deep Galerkin method.Appl","work_id":"74f2a0f0-bccc-4694-94a7-d5c3aa540850","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A maximum principle for SDEs of mean-field type.Appl","work_id":"de9e66b8-457f-4e6c-a129-33f6525842d0","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"SpringerBriefs in Mathematics","work_id":"4e3a7245-c2dc-46c9-8f4b-826231ee96e6","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Mean field control and mean field game models with several populations.Minimax Theory Appl., 3(2):173–209, 2018","work_id":"ea37bd87-8d5f-446b-ac85-d90443de9f4e","year":2018}],"snapshot_sha256":"1bc1b0837a84084de91a84ada64d0e8778cb3924d6331b08edccc13f7e6cae80"},"source":{"id":"2604.26782","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-19T17:10:15.247911Z","id":"aa3cc875-f2df-44fe-93f1-66378fc914b1","model_set":{"reader":"grok-4.3"},"one_line_summary":"A deep policy iteration method reformulates finite-horizon mean-field games as regenerative problems with deterministic cycles, using particle systems and one-step updates to handle dimensions up to 10,000 efficiently.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"By reformulating mean-field games into regenerative problems with deterministic cycles, deep policy iteration becomes efficient and scalable in dimensions up to 10,000.","strongest_claim":"The resulting method is efficient and scalable in high dimensions, as it avoids the direct solution of the coupled Hamilton-Jacobi-Bellman and Fokker-Planck system, the full simulation of trajectories to estimate the population measure, the explicit computation of conditional expectations in policy evaluation, and pointwise optimization in policy improvement. Numerical experiments demonstrate that the proposed method effectively handles dimensions up to 10,000.","weakest_assumption":"The mean-field game can be reformulated as a regenerative problem with deterministic cycles such that policy evaluation, policy improvement, and population measure estimation can be accurately performed cycle by cycle using particle approximations updated via one-step random mappings from Euler-Maruyama discretization."}},"verdict_id":"aa3cc875-f2df-44fe-93f1-66378fc914b1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35d6fbb83cc6ca53f8526c7c0a008d7f6164ba2670a107b3908d0991279052c4","target":"record","created_at":"2026-05-20T00:00:39Z","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":"9a462aea1012266cdf571736ed3fbc3f1a766c755e7eee7b4d73b106e4c23d0e","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-29T15:13:23Z","title_canon_sha256":"df71af87e72d2025923ba0672ee4b86635162aaaf94ca29b95bcb3bae9dfe3e9"},"schema_version":"1.0","source":{"id":"2604.26782","kind":"arxiv","version":2}},"canonical_sha256":"fbc2172a797de74f1c995d04ac2198b2c16171cfbe052e927399565f2559cf46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbc2172a797de74f1c995d04ac2198b2c16171cfbe052e927399565f2559cf46","first_computed_at":"2026-05-20T00:00:39.755670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:39.755670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/9LvdnW4CwAdRyakr/ba5VKRvnkOuRz4AZVgI1XHRByAHQd31ai68GNQ7mbSZfVmtWoe9NA7RZLLn8Ipo/oPBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:39.756308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d6fbb83cc6ca53f8526c7c0a008d7f6164ba2670a107b3908d0991279052c4","sha256:7d3ada59c7e77d5f879faeaa3d6c75492a0bcd4d19010dd35ceb55aed9b610cd"],"state_sha256":"283ab9a05476ce1f7320c19553df6aec4c25e972b6bef5b9a8b3afc2b4c9c1d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SbA9n3hx6WlPfnhFeaIfQ+YlGDQYckkpMVzS8wteDQMfEWpuuL1WX816ABX27x1XzoU1hiF176M/Moy4R5yAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:46:35.958585Z","bundle_sha256":"07ea2b248eeb17f96ff36cce10cac5df5cbcd3d2bc0449c200c1bc2097b89d4c"}}