{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PWN2JTKCDOADJX4N7MQD5I4TYL","short_pith_number":"pith:PWN2JTKC","canonical_record":{"source":{"id":"2605.17665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T21:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"60e8076d832e0d5fd5a5f0ebeaf8b760a22cc1c381d263d60ed6ef4c55d1f39c","abstract_canon_sha256":"d64e8e8f5ea4c09749a13f769fb9da4da2d715d9a304e8ae946ea0553f91ba6b"},"schema_version":"1.0"},"canonical_sha256":"7d9ba4cd421b8034df8dfb203ea393c2d4d10aa96e8f79814d432f5706e4b0d7","source":{"kind":"arxiv","id":"2605.17665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17665","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17665v1","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17665","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"PWN2JTKCDOAD","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"PWN2JTKCDOADJX4N","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"PWN2JTKC","created_at":"2026-05-20T00:04:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PWN2JTKCDOADJX4N7MQD5I4TYL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T21:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"60e8076d832e0d5fd5a5f0ebeaf8b760a22cc1c381d263d60ed6ef4c55d1f39c","abstract_canon_sha256":"d64e8e8f5ea4c09749a13f769fb9da4da2d715d9a304e8ae946ea0553f91ba6b"},"schema_version":"1.0"},"canonical_sha256":"7d9ba4cd421b8034df8dfb203ea393c2d4d10aa96e8f79814d432f5706e4b0d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:51.663481Z","signature_b64":"mzlTulbtbEatSbCGk80tSgnxoUFGFZdYOpujyVFE2Dv//0X30KHlTFrfTPpY6kTPEWi7gsNz8Cb6h0r/6Mq9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9ba4cd421b8034df8dfb203ea393c2d4d10aa96e8f79814d432f5706e4b0d7","last_reissued_at":"2026-05-20T00:04:51.662523Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:51.662523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17665","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:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBzBYY41OHBJQQZZGJaoxbNs+QtsqEuJGMw3KAF6I0coG5QojDJblM8ro5KwZE14CVI0Q4MExGDI9FGHEkx5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:17:47.838594Z"},"content_sha256":"d801376741cc409f5548ef47699cc5e92cee724eef7f2fc8ec2ff1f3efd0d2d7","schema_version":"1.0","event_id":"sha256:d801376741cc409f5548ef47699cc5e92cee724eef7f2fc8ec2ff1f3efd0d2d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PWN2JTKCDOADJX4N7MQD5I4TYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Correlated Equilibria Beyond Normal-Form Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brian Hu Zhang, Constantinos Daskalakis, Gabriele Farina, Ioannis Anagnostides, Noah Golowich, Tuomas Sandholm","submitted_at":"2026-05-17T21:50:52Z","abstract_excerpt":"Correlated equilibria are a fundamental solution concept in game theory. However, despite decades of research, the complexity beyond games of polynomial type -- such as extensive-form games, congestion or routing games, and more broadly concave games -- has remained a major open problem, first highlighted by Papadimitriou and Roughgarden (JACM '08).\n  In this paper, we resolve several long-standing questions concerning the complexity of correlated equilibria and swap regret minimization. First, we show that computing a correlated equilibrium in concave quadratic games is as hard as computing t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping (Contr), providing the first strong evidence of intractability.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reduction establishing Contr-hardness for correlated equilibria holds specifically for the class of concave quadratic games and for the standard definition of correlated equilibrium; if the game class or equilibrium notion is altered, the hardness may not transfer (abstract statement on hardness for concave quadratic games).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a8371c91302864c45c3016503e8164751762eb0dac4a6bb32e5cddb86fb51efc"},"source":{"id":"2605.17665","kind":"arxiv","version":1},"verdict":{"id":"4f70f890-4154-4794-93af-a7884fe0c7b8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:00:40.630042Z","strongest_claim":"computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping (Contr), providing the first strong evidence of intractability.","one_line_summary":"The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reduction establishing Contr-hardness for correlated equilibria holds specifically for the class of concave quadratic games and for the standard definition of correlated equilibrium; if the game class or equilibrium notion is altered, the hardness may not transfer (abstract statement on hardness for concave quadratic games).","pith_extraction_headline":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17665/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.466277Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T22:21:57.292042Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:11:45.045809Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T21:49:44.267074Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.538321Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.454246Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6d902a798c0335e9692c02084a3e1f5cf6ff13dc7e573701386e305580d7872a"},"references":{"count":81,"sample":[{"doi":"","year":2026,"title":"First-order (coarse) correlated equilibria in non-concave games","work_id":"73856386-6014-410d-91f7-519ed9a9d49c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games","work_id":"3728253a-5016-487d-9686-4a1b70bb12bc","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Pareto-optimal algorithms for learning in games","work_id":"66bbae2d-7cd3-4c6d-a811-b00911c2bd72","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Swap regret and correlated equilibria beyond normal-form games","work_id":"86416d25-fd3e-40cf-8566-a951de74c0f5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"On the value of correlation","work_id":"5c2819a4-c587-4196-a3c0-fbdfd2e797b5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":81,"snapshot_sha256":"8e990bed3dcf7af358f6a863720bf03bfaed84247328111de487db1a70b11872","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":"4f70f890-4154-4794-93af-a7884fe0c7b8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SbwbhhFZ6AWy1bIW8pGIm/0IWsMeLiolaL9/Mswh2IT7GWwSMWL4UUjffOcNJdFWu6tgXcOOwpMZNwsFQDYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:17:47.840129Z"},"content_sha256":"9ea3716215a8752a2a2bcaaa3bb2c15c6686e27cec19eb73d5164a9f77e6b141","schema_version":"1.0","event_id":"sha256:9ea3716215a8752a2a2bcaaa3bb2c15c6686e27cec19eb73d5164a9f77e6b141"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/bundle.json","state_url":"https://pith.science/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/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-26T00:17:47Z","links":{"resolver":"https://pith.science/pith/PWN2JTKCDOADJX4N7MQD5I4TYL","bundle":"https://pith.science/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/bundle.json","state":"https://pith.science/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWN2JTKCDOADJX4N7MQD5I4TYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PWN2JTKCDOADJX4N7MQD5I4TYL","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":"d64e8e8f5ea4c09749a13f769fb9da4da2d715d9a304e8ae946ea0553f91ba6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T21:50:52Z","title_canon_sha256":"60e8076d832e0d5fd5a5f0ebeaf8b760a22cc1c381d263d60ed6ef4c55d1f39c"},"schema_version":"1.0","source":{"id":"2605.17665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17665","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17665v1","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17665","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"PWN2JTKCDOAD","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"PWN2JTKCDOADJX4N","created_at":"2026-05-20T00:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"PWN2JTKC","created_at":"2026-05-20T00:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:9ea3716215a8752a2a2bcaaa3bb2c15c6686e27cec19eb73d5164a9f77e6b141","target":"graph","created_at":"2026-05-20T00:04:51Z","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":"computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping (Contr), providing the first strong evidence of intractability."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reduction establishing Contr-hardness for correlated equilibria holds specifically for the class of concave quadratic games and for the standard definition of correlated equilibrium; if the game class or equilibrium notion is altered, the hardness may not transfer (abstract statement on hardness for concave quadratic games)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping."}],"snapshot_sha256":"a8371c91302864c45c3016503e8164751762eb0dac4a6bb32e5cddb86fb51efc"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.466277Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T22:21:57.292042Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:11:45.045809Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T21:49:44.267074Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.538321Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.454246Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17665/integrity.json","findings":[],"snapshot_sha256":"6d902a798c0335e9692c02084a3e1f5cf6ff13dc7e573701386e305580d7872a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Correlated equilibria are a fundamental solution concept in game theory. However, despite decades of research, the complexity beyond games of polynomial type -- such as extensive-form games, congestion or routing games, and more broadly concave games -- has remained a major open problem, first highlighted by Papadimitriou and Roughgarden (JACM '08).\n  In this paper, we resolve several long-standing questions concerning the complexity of correlated equilibria and swap regret minimization. First, we show that computing a correlated equilibrium in concave quadratic games is as hard as computing t","authors_text":"Brian Hu Zhang, Constantinos Daskalakis, Gabriele Farina, Ioannis Anagnostides, Noah Golowich, Tuomas Sandholm","cross_cats":[],"headline":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T21:50:52Z","title":"On the Complexity of Correlated Equilibria Beyond Normal-Form Games"},"references":{"count":81,"internal_anchors":0,"resolved_work":81,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"First-order (coarse) correlated equilibria in non-concave games","work_id":"73856386-6014-410d-91f7-519ed9a9d49c","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games","work_id":"3728253a-5016-487d-9686-4a1b70bb12bc","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Pareto-optimal algorithms for learning in games","work_id":"66bbae2d-7cd3-4c6d-a811-b00911c2bd72","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Swap regret and correlated equilibria beyond normal-form games","work_id":"86416d25-fd3e-40cf-8566-a951de74c0f5","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On the value of correlation","work_id":"5c2819a4-c587-4196-a3c0-fbdfd2e797b5","year":2008}],"snapshot_sha256":"8e990bed3dcf7af358f6a863720bf03bfaed84247328111de487db1a70b11872"},"source":{"id":"2605.17665","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:00:40.630042Z","id":"4f70f890-4154-4794-93af-a7884fe0c7b8","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping.","strongest_claim":"computing a correlated equilibrium in concave quadratic games is as hard as computing the fixed point of a contraction mapping (Contr), providing the first strong evidence of intractability.","weakest_assumption":"The reduction establishing Contr-hardness for correlated equilibria holds specifically for the class of concave quadratic games and for the standard definition of correlated equilibrium; if the game class or equilibrium notion is altered, the hardness may not transfer (abstract statement on hardness for concave quadratic games)."}},"verdict_id":"4f70f890-4154-4794-93af-a7884fe0c7b8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d801376741cc409f5548ef47699cc5e92cee724eef7f2fc8ec2ff1f3efd0d2d7","target":"record","created_at":"2026-05-20T00:04:51Z","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":"d64e8e8f5ea4c09749a13f769fb9da4da2d715d9a304e8ae946ea0553f91ba6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T21:50:52Z","title_canon_sha256":"60e8076d832e0d5fd5a5f0ebeaf8b760a22cc1c381d263d60ed6ef4c55d1f39c"},"schema_version":"1.0","source":{"id":"2605.17665","kind":"arxiv","version":1}},"canonical_sha256":"7d9ba4cd421b8034df8dfb203ea393c2d4d10aa96e8f79814d432f5706e4b0d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d9ba4cd421b8034df8dfb203ea393c2d4d10aa96e8f79814d432f5706e4b0d7","first_computed_at":"2026-05-20T00:04:51.662523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:51.662523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mzlTulbtbEatSbCGk80tSgnxoUFGFZdYOpujyVFE2Dv//0X30KHlTFrfTPpY6kTPEWi7gsNz8Cb6h0r/6Mq9Dg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:51.663481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d801376741cc409f5548ef47699cc5e92cee724eef7f2fc8ec2ff1f3efd0d2d7","sha256:9ea3716215a8752a2a2bcaaa3bb2c15c6686e27cec19eb73d5164a9f77e6b141"],"state_sha256":"d6d51318cf3b4c035f7578f9d70ede1ba2c172bdf49b1909e6bf8c4b70c5911b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuPcdJT86aFb7LYe43xOcDWuW/awdC92Up6NsVF5JfLNvNCAbXFw6aDTwWS3HWJvsZO/9ZOHB7dQJlBzlxqPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:17:47.845592Z","bundle_sha256":"8b6c9a9f19df6702e94e4dee15a15cef55d63bf294bca27da5d9225f587da90a"}}