{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XNDCSFJL3URLLURVFSH3TXINKH","short_pith_number":"pith:XNDCSFJL","schema_version":"1.0","canonical_sha256":"bb4629152bdd22b5d2352c8fb9dd0d51d201fc8434b907a99de24f5e8d4b3ce2","source":{"kind":"arxiv","id":"1011.0253","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Albert Xin Jiang, Kevin Leyton-Brown","submitted_at":"2010-11-01T05:06:59Z","abstract_excerpt":"In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm (\"Ellipsoid Against Hope\") for computing sample correlated equilibria of concisely-represented games. Recently, Stein, Parrilo and Ozdaglar showed that this algorithm can fail to find an exact correlated equilibrium, but can be easily modified to efficiently compute approximate correlated equilibria. Currently, it remains unresolved whether the algorithm can be modified to compute an exact correlated equilibrium. We show that it can, presenting a variant of the Ellipsoid Against Hope algorithm that guarant"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.0253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-01T05:06:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ca907c3aa3c80b46efd025e9bfe8f1f1d29b8d364e01a914776a3de853480f67","abstract_canon_sha256":"a6ed4d033ffb4116e05900145d906a5b234a2958e4cb40f46c5b77060fe6872c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.982503Z","signature_b64":"k99Gj80CuG8e+Qz1cU6nJdJQdmrqX7AtNrBHuqu6jKI+s9yIq9d9/HWN7CwDf/+VVEvs2ToUPJ8YdV9tgyPTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb4629152bdd22b5d2352c8fb9dd0d51d201fc8434b907a99de24f5e8d4b3ce2","last_reissued_at":"2026-05-18T02:23:37.981854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.981854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Albert Xin Jiang, Kevin Leyton-Brown","submitted_at":"2010-11-01T05:06:59Z","abstract_excerpt":"In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm (\"Ellipsoid Against Hope\") for computing sample correlated equilibria of concisely-represented games. Recently, Stein, Parrilo and Ozdaglar showed that this algorithm can fail to find an exact correlated equilibrium, but can be easily modified to efficiently compute approximate correlated equilibria. Currently, it remains unresolved whether the algorithm can be modified to compute an exact correlated equilibrium. We show that it can, presenting a variant of the Ellipsoid Against Hope algorithm that guarant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0253","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.0253","created_at":"2026-05-18T02:23:37.981946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0253v1","created_at":"2026-05-18T02:23:37.981946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0253","created_at":"2026-05-18T02:23:37.981946+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNDCSFJL3URL","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNDCSFJL3URLLURV","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNDCSFJL","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH","json":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH.json","graph_json":"https://pith.science/api/pith-number/XNDCSFJL3URLLURVFSH3TXINKH/graph.json","events_json":"https://pith.science/api/pith-number/XNDCSFJL3URLLURVFSH3TXINKH/events.json","paper":"https://pith.science/paper/XNDCSFJL"},"agent_actions":{"view_html":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH","download_json":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH.json","view_paper":"https://pith.science/paper/XNDCSFJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0253&json=true","fetch_graph":"https://pith.science/api/pith-number/XNDCSFJL3URLLURVFSH3TXINKH/graph.json","fetch_events":"https://pith.science/api/pith-number/XNDCSFJL3URLLURVFSH3TXINKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH/action/storage_attestation","attest_author":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH/action/author_attestation","sign_citation":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH/action/citation_signature","submit_replication":"https://pith.science/pith/XNDCSFJL3URLLURVFSH3TXINKH/action/replication_record"}},"created_at":"2026-05-18T02:23:37.981946+00:00","updated_at":"2026-05-18T02:23:37.981946+00:00"}