{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BNO434IYXYQUALOPHKEDGISKDY","short_pith_number":"pith:BNO434IY","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"},"canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","source":{"kind":"arxiv","id":"1510.04991","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04991","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04991v3","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04991","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"BNO434IYXYQU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNO434IYXYQUALOP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNO434IY","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BNO434IYXYQUALOPHKEDGISKDY","target":"record","payload":{"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"},"canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","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"},"source_kind":"arxiv","source_id":"1510.04991","source_version":3,"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-18T00:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57PPWNvW1i1gYs8gRptdWE58C+ZEevBzfUFGTV8YkHtpSvWP9UksSv+D7acAu5ArmryeVt1b/lQCPWNqsNArAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:27:02.079514Z"},"content_sha256":"9895e2a4a6c490dce07b5b3fa99487030fec0adf626da933ddb28c8ac4177932","schema_version":"1.0","event_id":"sha256:9895e2a4a6c490dce07b5b3fa99487030fec0adf626da933ddb28c8ac4177932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BNO434IYXYQUALOPHKEDGISKDY","target":"graph","payload":{"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"},"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-05-18T00:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kF/UptBWZPOyQxNotQqds4cwmlh7I4Sp1WQgK7isCRZO/0+LSbObAqXPZZMZE79bT+YTyUDMS8E30Nyz4zIuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:27:02.079971Z"},"content_sha256":"d61039595612378e97bbe10bb01294918ab24552adad3261caebed613062b821","schema_version":"1.0","event_id":"sha256:d61039595612378e97bbe10bb01294918ab24552adad3261caebed613062b821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/bundle.json","state_url":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNO434IYXYQUALOPHKEDGISKDY/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-17T16:27:02Z","links":{"resolver":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY","bundle":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/bundle.json","state":"https://pith.science/pith/BNO434IYXYQUALOPHKEDGISKDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNO434IYXYQUALOPHKEDGISKDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BNO434IYXYQUALOPHKEDGISKDY","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":"d7f1637eb4510954b0d9fd559dc1b697ad2a5e36d85eac92acffa8581815943a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-10-16T19:17:15Z","title_canon_sha256":"2c922c62261e0d394d7b7c41e0ed22b527e7c4a245e1127b435e8e58a29ba1ee"},"schema_version":"1.0","source":{"id":"1510.04991","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04991","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04991v3","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04991","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"BNO434IYXYQU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNO434IYXYQUALOP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNO434IY","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d61039595612378e97bbe10bb01294918ab24552adad3261caebed613062b821","target":"graph","created_at":"2026-05-18T00:46:08Z","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"},"paper":{"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.","authors_text":"Aviad Rubinstein","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-10-16T19:17:15Z","title":"Honest signaling in zero-sum games is hard, and lying is even harder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04991","kind":"arxiv","version":3},"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:9895e2a4a6c490dce07b5b3fa99487030fec0adf626da933ddb28c8ac4177932","target":"record","created_at":"2026-05-18T00:46:08Z","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":"d7f1637eb4510954b0d9fd559dc1b697ad2a5e36d85eac92acffa8581815943a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-10-16T19:17:15Z","title_canon_sha256":"2c922c62261e0d394d7b7c41e0ed22b527e7c4a245e1127b435e8e58a29ba1ee"},"schema_version":"1.0","source":{"id":"1510.04991","kind":"arxiv","version":3}},"canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b5dcdf118be21402dcf3a8833224a1e18323b6ab2660de66b223ba2816f83f7","first_computed_at":"2026-05-18T00:46:08.371563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:08.371563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jK2uzk17VmBssi7HdfYNlz1jMo11Mz/wu/x5Ofh+ZWhaWmx+nyKmeI3Gu14xaAlCXZvY2NSpJtFzexJz8fV9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:08.371982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04991","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9895e2a4a6c490dce07b5b3fa99487030fec0adf626da933ddb28c8ac4177932","sha256:d61039595612378e97bbe10bb01294918ab24552adad3261caebed613062b821"],"state_sha256":"090def374612a63f9fc4a00d8da448adb6ab4ecb8d9e7fabdaaf57ee152b5201"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYSlJfJY7gSxR5An7AxlAt9YYFc1Ri0qkRrDGbR/d1A6CzOYtFFUv271SWb5mtQKxWAoBB1e5284SMJA77BoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T16:27:02.084538Z","bundle_sha256":"84745944974c108d1c467e2d9fa557f6097d3d16deb32a6fbec78d0a102bfa57"}}