{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7LAMRFQNYFQDVNPCMRJ5N7W2SM","short_pith_number":"pith:7LAMRFQN","canonical_record":{"source":{"id":"1202.1547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T22:20:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cddf1e5fdbee54d7bd8e73cd4accf2fd235e7e1dd63c952b283fd2ab89e9c0f0","abstract_canon_sha256":"f2c0ca93c86fc5280ab9f92f38c0832570bfc636f3f108cd3d4df12116ddc8e8"},"schema_version":"1.0"},"canonical_sha256":"fac0c8960dc1603ab5e26453d6feda931a867cdd5e0eb6acfd6ef7941fb1e7e5","source":{"kind":"arxiv","id":"1202.1547","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1547","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1547v3","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1547","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"7LAMRFQNYFQD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7LAMRFQNYFQDVNPC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7LAMRFQN","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7LAMRFQNYFQDVNPCMRJ5N7W2SM","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T22:20:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cddf1e5fdbee54d7bd8e73cd4accf2fd235e7e1dd63c952b283fd2ab89e9c0f0","abstract_canon_sha256":"f2c0ca93c86fc5280ab9f92f38c0832570bfc636f3f108cd3d4df12116ddc8e8"},"schema_version":"1.0"},"canonical_sha256":"fac0c8960dc1603ab5e26453d6feda931a867cdd5e0eb6acfd6ef7941fb1e7e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.470372Z","signature_b64":"pv4IBLrFnPEIJpjvPB4F1CGkyF0uhLot4MuGpFsurqClRGRCDibHyBemlllvRfnsbmymSEQu1dTY4436xNq6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac0c8960dc1603ab5e26453d6feda931a867cdd5e0eb6acfd6ef7941fb1e7e5","last_reissued_at":"2026-05-18T02:30:01.469951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.469951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1547","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-18T02:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+norH5Onh1JEazP5zADfHiO7TieeLML9mbXg+9De/scdIGknlyhoq3TKcW7K9iA68U1DxD2OQotaEJ5uPlABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:41:34.927732Z"},"content_sha256":"fccf82e11833311aad23881df393d71b808414d181c0b35781e5ca7160f35472","schema_version":"1.0","event_id":"sha256:fccf82e11833311aad23881df393d71b808414d181c0b35781e5ca7160f35472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7LAMRFQNYFQDVNPCMRJ5N7W2SM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nash Codes for Noisy Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Bernhard von Stengel, Penelope Hernandez","submitted_at":"2012-02-07T22:20:04Z","abstract_excerpt":"This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or \"Nash code\" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1547","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-18T02:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uEgDq010XTaYGqqXDSRN9bZtgrInNbopTy3RTxUiTFchPGg35bV610yxxt1Q4VmUPdD0SMgkzgl82Kxc6fTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:41:34.928080Z"},"content_sha256":"24dcf086f0944eabf0ebe579e728bd4ef94276cc8a56602ed05377420450a5c5","schema_version":"1.0","event_id":"sha256:24dcf086f0944eabf0ebe579e728bd4ef94276cc8a56602ed05377420450a5c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/bundle.json","state_url":"https://pith.science/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/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-06-02T22:41:34Z","links":{"resolver":"https://pith.science/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM","bundle":"https://pith.science/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/bundle.json","state":"https://pith.science/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LAMRFQNYFQDVNPCMRJ5N7W2SM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7LAMRFQNYFQDVNPCMRJ5N7W2SM","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":"f2c0ca93c86fc5280ab9f92f38c0832570bfc636f3f108cd3d4df12116ddc8e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T22:20:04Z","title_canon_sha256":"cddf1e5fdbee54d7bd8e73cd4accf2fd235e7e1dd63c952b283fd2ab89e9c0f0"},"schema_version":"1.0","source":{"id":"1202.1547","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1547","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1547v3","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1547","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"7LAMRFQNYFQD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7LAMRFQNYFQDVNPC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7LAMRFQN","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:24dcf086f0944eabf0ebe579e728bd4ef94276cc8a56602ed05377420450a5c5","target":"graph","created_at":"2026-05-18T02:30:01Z","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":"This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or \"Nash code\" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for ","authors_text":"Bernhard von Stengel, Penelope Hernandez","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T22:20:04Z","title":"Nash Codes for Noisy Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1547","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:fccf82e11833311aad23881df393d71b808414d181c0b35781e5ca7160f35472","target":"record","created_at":"2026-05-18T02:30:01Z","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":"f2c0ca93c86fc5280ab9f92f38c0832570bfc636f3f108cd3d4df12116ddc8e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T22:20:04Z","title_canon_sha256":"cddf1e5fdbee54d7bd8e73cd4accf2fd235e7e1dd63c952b283fd2ab89e9c0f0"},"schema_version":"1.0","source":{"id":"1202.1547","kind":"arxiv","version":3}},"canonical_sha256":"fac0c8960dc1603ab5e26453d6feda931a867cdd5e0eb6acfd6ef7941fb1e7e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fac0c8960dc1603ab5e26453d6feda931a867cdd5e0eb6acfd6ef7941fb1e7e5","first_computed_at":"2026-05-18T02:30:01.469951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:01.469951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pv4IBLrFnPEIJpjvPB4F1CGkyF0uhLot4MuGpFsurqClRGRCDibHyBemlllvRfnsbmymSEQu1dTY4436xNq6AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:01.470372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1547","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fccf82e11833311aad23881df393d71b808414d181c0b35781e5ca7160f35472","sha256:24dcf086f0944eabf0ebe579e728bd4ef94276cc8a56602ed05377420450a5c5"],"state_sha256":"9441bb79950943d956707e51eb28b287e23f72f5476399db6c95879244680592"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBv2V6mlPE31yVgj9dgzOC20L3/hkT6DzszeJuQkvkBn0zo+CZjvT7d5+s+at2qnFhMJvPBNmRtnYk1zYLxmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:41:34.929964Z","bundle_sha256":"6a6bd337d46d7134c8dfb44054db3f55963a2816ce527829a5c24735625e4f27"}}