{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C35LZ4J2AVHFUUYKT6OCRRFURH","short_pith_number":"pith:C35LZ4J2","canonical_record":{"source":{"id":"1103.5818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-30T04:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"1f8c29aff4c905142cad1441ce1143543088509ab9ed28de384000e7358c6e31","abstract_canon_sha256":"ba24254f21fed8659159be7be7c759960116b0c74eac1bb766be2959b6a77415"},"schema_version":"1.0"},"canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","source":{"kind":"arxiv","id":"1103.5818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5818","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5818v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5818","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"C35LZ4J2AVHF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C35LZ4J2AVHFUUYK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C35LZ4J2","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C35LZ4J2AVHFUUYKT6OCRRFURH","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-30T04:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"1f8c29aff4c905142cad1441ce1143543088509ab9ed28de384000e7358c6e31","abstract_canon_sha256":"ba24254f21fed8659159be7be7c759960116b0c74eac1bb766be2959b6a77415"},"schema_version":"1.0"},"canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:27.526016Z","signature_b64":"P+Ok9EfmeFONyMSxD6LK1msnzEbgsBstahd/29nmXQYgpifQXN0dIwk/O0hLtNQbIFi7igSN1j5q3O9TzM1wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","last_reissued_at":"2026-05-18T04:25:27.525342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:27.525342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5818","source_version":1,"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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySQewPcg/lw5hcQlpBHeyq1Dms+ppcIISX3IJBIlMAC9qLZgYC+EDq8QzJsGAj1DmSpAnWopC5Va+d9ofyelDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:17:06.734086Z"},"content_sha256":"fd5bc57751992286fab0a2ce6076874e4eec15d505e99cb412af0120fa15c4c2","schema_version":"1.0","event_id":"sha256:fd5bc57751992286fab0a2ce6076874e4eec15d505e99cb412af0120fa15c4c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C35LZ4J2AVHFUUYKT6OCRRFURH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement learning in signaling game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Brian Skyrms, Pierre Tarr\\`es, Yilei Hu","submitted_at":"2011-03-30T04:48:20Z","abstract_excerpt":"We consider a signaling game originally introduced by Skyrms, which models how two interacting players learn to signal each other and thus create a common language. The first rigorous analysis was done by Argiento, Pemantle, Skyrms and Volkov (2009) with 2 states, 2 signals and 2 acts. We study the case of M_1 states, M_2 signals and M_1 acts for general M_1, M_2. We prove that the expected payoff increases in average and thus converges a.s., and that a limit bipartite graph emerges, such that no signal-state correspondence is associated to both a synonym and an informational bottleneck. Final"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5818","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"},"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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idDjQGTPUIAaLQ6L+VE9W8TCPDw3qKsPm1lh9hs9Iif7fibA+Q1pjXp8H0S1RyXB1SO0rhRE+rSp0P8zRgJoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:17:06.734439Z"},"content_sha256":"fae1eeb4dc3cc3a2eefc4412c533c6f90e7c052a34bf7658ad33de61361d9825","schema_version":"1.0","event_id":"sha256:fae1eeb4dc3cc3a2eefc4412c533c6f90e7c052a34bf7658ad33de61361d9825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/bundle.json","state_url":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/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-03T17:17:06Z","links":{"resolver":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH","bundle":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/bundle.json","state":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C35LZ4J2AVHFUUYKT6OCRRFURH","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":"ba24254f21fed8659159be7be7c759960116b0c74eac1bb766be2959b6a77415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-30T04:48:20Z","title_canon_sha256":"1f8c29aff4c905142cad1441ce1143543088509ab9ed28de384000e7358c6e31"},"schema_version":"1.0","source":{"id":"1103.5818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5818","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5818v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5818","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"C35LZ4J2AVHF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C35LZ4J2AVHFUUYK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C35LZ4J2","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:fae1eeb4dc3cc3a2eefc4412c533c6f90e7c052a34bf7658ad33de61361d9825","target":"graph","created_at":"2026-05-18T04:25:27Z","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 consider a signaling game originally introduced by Skyrms, which models how two interacting players learn to signal each other and thus create a common language. The first rigorous analysis was done by Argiento, Pemantle, Skyrms and Volkov (2009) with 2 states, 2 signals and 2 acts. We study the case of M_1 states, M_2 signals and M_1 acts for general M_1, M_2. We prove that the expected payoff increases in average and thus converges a.s., and that a limit bipartite graph emerges, such that no signal-state correspondence is associated to both a synonym and an informational bottleneck. Final","authors_text":"Brian Skyrms, Pierre Tarr\\`es, Yilei Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-30T04:48:20Z","title":"Reinforcement learning in signaling game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5818","kind":"arxiv","version":1},"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:fd5bc57751992286fab0a2ce6076874e4eec15d505e99cb412af0120fa15c4c2","target":"record","created_at":"2026-05-18T04:25:27Z","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":"ba24254f21fed8659159be7be7c759960116b0c74eac1bb766be2959b6a77415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-30T04:48:20Z","title_canon_sha256":"1f8c29aff4c905142cad1441ce1143543088509ab9ed28de384000e7358c6e31"},"schema_version":"1.0","source":{"id":"1103.5818","kind":"arxiv","version":1}},"canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","first_computed_at":"2026-05-18T04:25:27.525342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:27.525342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P+Ok9EfmeFONyMSxD6LK1msnzEbgsBstahd/29nmXQYgpifQXN0dIwk/O0hLtNQbIFi7igSN1j5q3O9TzM1wCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:27.526016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd5bc57751992286fab0a2ce6076874e4eec15d505e99cb412af0120fa15c4c2","sha256:fae1eeb4dc3cc3a2eefc4412c533c6f90e7c052a34bf7658ad33de61361d9825"],"state_sha256":"c0c27ff581bc9b30548f9a7f38e4b1f86b76350ebb495bb62e5ae6cf8bb75cb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ1QAkHML6QgPEt9NIZsUGsTI0j7DYpZG0Js0a8+v87s4x/RY9olj1tYUOrdBXuXogdbvZPpQylgQGMrDMtFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:17:06.736391Z","bundle_sha256":"4b3eefed2b481c9848fe9ccb64b6655465c36825077ea8f2450e57defccaa07d"}}