{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5MRG7SODR7CR4FMUXFWNWXIPA7","short_pith_number":"pith:5MRG7SOD","canonical_record":{"source":{"id":"2506.07186","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-08T15:11:22Z","cross_cats_sorted":[],"title_canon_sha256":"42c7952bec80e793c83bd7fcbbb5a7f21b870cbaaa9bc09c9f31f597fff1988a","abstract_canon_sha256":"3a9413daa5aeddf6bd5801b827735f6ffea7cea187f3e153a38deb1d5681c01b"},"schema_version":"1.0"},"canonical_sha256":"eb226fc9c38fc51e1594b96cdb5d0f07c5ab4ca69ec2f5fe36122192fcbe0129","source":{"kind":"arxiv","id":"2506.07186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07186","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07186v1","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07186","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"5MRG7SODR7CR","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"5MRG7SODR7CR4FMU","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"5MRG7SOD","created_at":"2026-07-05T11:18:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5MRG7SODR7CR4FMUXFWNWXIPA7","target":"record","payload":{"canonical_record":{"source":{"id":"2506.07186","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-08T15:11:22Z","cross_cats_sorted":[],"title_canon_sha256":"42c7952bec80e793c83bd7fcbbb5a7f21b870cbaaa9bc09c9f31f597fff1988a","abstract_canon_sha256":"3a9413daa5aeddf6bd5801b827735f6ffea7cea187f3e153a38deb1d5681c01b"},"schema_version":"1.0"},"canonical_sha256":"eb226fc9c38fc51e1594b96cdb5d0f07c5ab4ca69ec2f5fe36122192fcbe0129","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:03.195725Z","signature_b64":"FZcJ3Ary5k1u4CAf/0LwAXfuCoZKVGlAU+D2BgiRDQt7+GKO7kgW70xpaEZ899QvPccHr3vk2tDnFX950w02CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb226fc9c38fc51e1594b96cdb5d0f07c5ab4ca69ec2f5fe36122192fcbe0129","last_reissued_at":"2026-07-05T11:18:03.195163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:03.195163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.07186","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-07-05T11:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03n//ZRpcWz3KRgRmVljS9ocojnYQof4/5mBvNNKqZyPF8flWherxnEv2SCiHntRrNENb53rKP0+/aS4lm1VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:22:16.815336Z"},"content_sha256":"9741fb1b240e9734115af0b892764dd310a6f3e5a5a70a790b546a07868a0cd7","schema_version":"1.0","event_id":"sha256:9741fb1b240e9734115af0b892764dd310a6f3e5a5a70a790b546a07868a0cd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5MRG7SODR7CR4FMUXFWNWXIPA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Value-Set Iteration: Computing Optimal Correlated Equilibria in Infinite-Horizon Multi-Player Stochastic Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jiarui Gan, Rupak Majumdar","submitted_at":"2025-06-08T15:11:22Z","abstract_excerpt":"We study the problem of computing optimal correlated equilibria (CEs) in infinite-horizon multi-player stochastic games, where correlation signals are provided over time. In this setting, optimal CEs require history-dependent policies; this poses new representational and algorithmic challenges as the number of possible histories grows exponentially with the number of time steps. We focus on computing $(\\epsilon, \\delta)$-optimal CEs -- solutions that achieve a value within $\\epsilon$ of an optimal CE, while allowing the agents' incentive constraints to be violated by at most $\\delta$. Our main"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07186","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.07186/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfCkRXWsVwjP3tFBLWAARuWgJmzUGDPSXHtdsGB4grLqXJm/tMUvBI07K3j03Y9+JEuqY0u2w2XbSzXWWxXmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:22:16.815831Z"},"content_sha256":"70d018eb75b8671eb213a6cac67fb8fb800db04583906f44b1c46f8e28c662b6","schema_version":"1.0","event_id":"sha256:70d018eb75b8671eb213a6cac67fb8fb800db04583906f44b1c46f8e28c662b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/bundle.json","state_url":"https://pith.science/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/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-09T09:22:16Z","links":{"resolver":"https://pith.science/pith/5MRG7SODR7CR4FMUXFWNWXIPA7","bundle":"https://pith.science/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/bundle.json","state":"https://pith.science/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MRG7SODR7CR4FMUXFWNWXIPA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5MRG7SODR7CR4FMUXFWNWXIPA7","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":"3a9413daa5aeddf6bd5801b827735f6ffea7cea187f3e153a38deb1d5681c01b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-08T15:11:22Z","title_canon_sha256":"42c7952bec80e793c83bd7fcbbb5a7f21b870cbaaa9bc09c9f31f597fff1988a"},"schema_version":"1.0","source":{"id":"2506.07186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07186","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07186v1","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07186","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"5MRG7SODR7CR","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"5MRG7SODR7CR4FMU","created_at":"2026-07-05T11:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"5MRG7SOD","created_at":"2026-07-05T11:18:03Z"}],"graph_snapshots":[{"event_id":"sha256:70d018eb75b8671eb213a6cac67fb8fb800db04583906f44b1c46f8e28c662b6","target":"graph","created_at":"2026-07-05T11:18:03Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.07186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of computing optimal correlated equilibria (CEs) in infinite-horizon multi-player stochastic games, where correlation signals are provided over time. In this setting, optimal CEs require history-dependent policies; this poses new representational and algorithmic challenges as the number of possible histories grows exponentially with the number of time steps. We focus on computing $(\\epsilon, \\delta)$-optimal CEs -- solutions that achieve a value within $\\epsilon$ of an optimal CE, while allowing the agents' incentive constraints to be violated by at most $\\delta$. Our main","authors_text":"Jiarui Gan, Rupak Majumdar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-08T15:11:22Z","title":"Value-Set Iteration: Computing Optimal Correlated Equilibria in Infinite-Horizon Multi-Player Stochastic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07186","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9741fb1b240e9734115af0b892764dd310a6f3e5a5a70a790b546a07868a0cd7","target":"record","created_at":"2026-07-05T11:18:03Z","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":"3a9413daa5aeddf6bd5801b827735f6ffea7cea187f3e153a38deb1d5681c01b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-08T15:11:22Z","title_canon_sha256":"42c7952bec80e793c83bd7fcbbb5a7f21b870cbaaa9bc09c9f31f597fff1988a"},"schema_version":"1.0","source":{"id":"2506.07186","kind":"arxiv","version":1}},"canonical_sha256":"eb226fc9c38fc51e1594b96cdb5d0f07c5ab4ca69ec2f5fe36122192fcbe0129","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb226fc9c38fc51e1594b96cdb5d0f07c5ab4ca69ec2f5fe36122192fcbe0129","first_computed_at":"2026-07-05T11:18:03.195163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:03.195163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FZcJ3Ary5k1u4CAf/0LwAXfuCoZKVGlAU+D2BgiRDQt7+GKO7kgW70xpaEZ899QvPccHr3vk2tDnFX950w02CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:03.195725Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9741fb1b240e9734115af0b892764dd310a6f3e5a5a70a790b546a07868a0cd7","sha256:70d018eb75b8671eb213a6cac67fb8fb800db04583906f44b1c46f8e28c662b6"],"state_sha256":"c7720433043b3485139f20d251e9bfb482a91b7fcff584375e483b32f8b5099a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/5B0LqWFBq5l//yQQEcsOhan7loz1golmUOM6QVIaxIQXyqWj1qT0ifdNxQuUGy1RdYfdeFUhqP5Xds4tTrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:22:16.820019Z","bundle_sha256":"c25a47cf444c8b060150b0b7bb1f69ab9447d7b3a29b844848ccac6f7bb45471"}}