{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UXOGRQ4AZ6VNQIKLFIVGI6UPSH","short_pith_number":"pith:UXOGRQ4A","schema_version":"1.0","canonical_sha256":"a5dc68c380cfaad8214b2a2a647a8f91f802799601d8dc644291951607874e5d","source":{"kind":"arxiv","id":"1102.1096","version":2},"attestation_state":"computed","paper":{"title":"Repeated Matching Pennies with Limited Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Lance Fortnow, Michele Budinich","submitted_at":"2011-02-05T19:46:56Z","abstract_excerpt":"We consider a repeated Matching Pennies game in which players have limited access to randomness. Playing the (unique) Nash equilibrium in this n-stage game requires n random bits. Can there be Nash equilibria that use less than n random coins?\n  Our main results are as follows: We give a full characterization of approximate equilibria, showing that, for any e in [0, 1], the game has a e-Nash equilibrium if and only if both players have (1 - e)n random coins. When players are bound to run in polynomial time, Nash equilibria can exist if and only if one-way functions exist. It is possible to tra"},"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":"1102.1096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-05T19:46:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"197c998b409934ad746d7ece7a877a20bead8afd063c00a2cf8563c740bdb300","abstract_canon_sha256":"71fabb8bdb29e382006d81d0f9dcda96b5e8b81776b9109b305932d40ad9c98d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.615996Z","signature_b64":"O0aacvhdSv47KMIZKxFUaotOy3bi0+QRGCqaN71jsDWiFX+s/2yNYHnIs8JeMGDbJE6AX2pfDiaTm2hWsmPPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5dc68c380cfaad8214b2a2a647a8f91f802799601d8dc644291951607874e5d","last_reissued_at":"2026-05-18T04:25:37.615439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.615439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeated Matching Pennies with Limited Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Lance Fortnow, Michele Budinich","submitted_at":"2011-02-05T19:46:56Z","abstract_excerpt":"We consider a repeated Matching Pennies game in which players have limited access to randomness. Playing the (unique) Nash equilibrium in this n-stage game requires n random bits. Can there be Nash equilibria that use less than n random coins?\n  Our main results are as follows: We give a full characterization of approximate equilibria, showing that, for any e in [0, 1], the game has a e-Nash equilibrium if and only if both players have (1 - e)n random coins. When players are bound to run in polynomial time, Nash equilibria can exist if and only if one-way functions exist. It is possible to tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1096","kind":"arxiv","version":2},"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":"1102.1096","created_at":"2026-05-18T04:25:37.615502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1096v2","created_at":"2026-05-18T04:25:37.615502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1096","created_at":"2026-05-18T04:25:37.615502+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXOGRQ4AZ6VN","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXOGRQ4AZ6VNQIKL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXOGRQ4A","created_at":"2026-05-18T12:26:42.757692+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/UXOGRQ4AZ6VNQIKLFIVGI6UPSH","json":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH.json","graph_json":"https://pith.science/api/pith-number/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/graph.json","events_json":"https://pith.science/api/pith-number/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/events.json","paper":"https://pith.science/paper/UXOGRQ4A"},"agent_actions":{"view_html":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH","download_json":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH.json","view_paper":"https://pith.science/paper/UXOGRQ4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1096&json=true","fetch_graph":"https://pith.science/api/pith-number/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/graph.json","fetch_events":"https://pith.science/api/pith-number/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/action/storage_attestation","attest_author":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/action/author_attestation","sign_citation":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/action/citation_signature","submit_replication":"https://pith.science/pith/UXOGRQ4AZ6VNQIKLFIVGI6UPSH/action/replication_record"}},"created_at":"2026-05-18T04:25:37.615502+00:00","updated_at":"2026-05-18T04:25:37.615502+00:00"}