{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BNO434IYXYQUALOPHKEDGISKDY","short_pith_number":"pith:BNO434IY","schema_version":"1.0","canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","source":{"kind":"arxiv","id":"1510.04991","version":3},"attestation_state":"computed","paper":{"title":"Honest signaling in zero-sum games is hard, and lying is even harder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein","submitted_at":"2015-10-16T19:17:15Z","abstract_excerpt":"We prove that, assuming the exponential time hypothesis, finding an \\epsilon-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time. This is tight by [Cheng et al., FOCS'15] and resolves an open question of [Dughmi, FOCS'14]. We also prove that finding a multiplicative approximation is NP-hard.\n  We also introduce a new model where a dishonest signaler may publicly commit to use one scheme, but post signals according to a different scheme. For this model, we prove that even finding a (1-2^{-n})-approximately optimal scheme is NP-hard."},"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":"1510.04991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-10-16T19:17:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2c922c62261e0d394d7b7c41e0ed22b527e7c4a245e1127b435e8e58a29ba1ee","abstract_canon_sha256":"d7f1637eb4510954b0d9fd559dc1b697ad2a5e36d85eac92acffa8581815943a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:08.371982Z","signature_b64":"jK2uzk17VmBssi7HdfYNlz1jMo11Mz/wu/x5Ofh+ZWhaWmx+nyKmeI3Gu14xaAlCXZvY2NSpJtFzexJz8fV9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","last_reissued_at":"2026-05-18T00:46:08.371563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:08.371563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Honest signaling in zero-sum games is hard, and lying is even harder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein","submitted_at":"2015-10-16T19:17:15Z","abstract_excerpt":"We prove that, assuming the exponential time hypothesis, finding an \\epsilon-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time. This is tight by [Cheng et al., FOCS'15] and resolves an open question of [Dughmi, FOCS'14]. We also prove that finding a multiplicative approximation is NP-hard.\n  We also introduce a new model where a dishonest signaler may publicly commit to use one scheme, but post signals according to a different scheme. For this model, we prove that even finding a (1-2^{-n})-approximately optimal scheme is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04991","kind":"arxiv","version":3},"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":"1510.04991","created_at":"2026-05-18T00:46:08.371634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04991v3","created_at":"2026-05-18T00:46:08.371634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04991","created_at":"2026-05-18T00:46:08.371634+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNO434IYXYQU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNO434IYXYQUALOP","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNO434IY","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.10620","citing_title":"Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY","json":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY.json","graph_json":"https://pith.science/api/pith-number/BNO434IYXYQUALOPHKEDGISKDY/graph.json","events_json":"https://pith.science/api/pith-number/BNO434IYXYQUALOPHKEDGISKDY/events.json","paper":"https://pith.science/paper/BNO434IY"},"agent_actions":{"view_html":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY","download_json":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY.json","view_paper":"https://pith.science/paper/BNO434IY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04991&json=true","fetch_graph":"https://pith.science/api/pith-number/BNO434IYXYQUALOPHKEDGISKDY/graph.json","fetch_events":"https://pith.science/api/pith-number/BNO434IYXYQUALOPHKEDGISKDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/action/storage_attestation","attest_author":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/action/author_attestation","sign_citation":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/action/citation_signature","submit_replication":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/action/replication_record"}},"created_at":"2026-05-18T00:46:08.371634+00:00","updated_at":"2026-05-18T00:46:08.371634+00:00"}