{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C35LZ4J2AVHFUUYKT6OCRRFURH","short_pith_number":"pith:C35LZ4J2","schema_version":"1.0","canonical_sha256":"16fabcf13a054e5a530a9f9c28c4b489d3d20041fc75493295f6a857981f868d","source":{"kind":"arxiv","id":"1103.5818","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5818","created_at":"2026-05-18T04:25:27.525440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5818v1","created_at":"2026-05-18T04:25:27.525440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5818","created_at":"2026-05-18T04:25:27.525440+00:00"},{"alias_kind":"pith_short_12","alias_value":"C35LZ4J2AVHF","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C35LZ4J2AVHFUUYK","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C35LZ4J2","created_at":"2026-05-18T12:26:24.575870+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/C35LZ4J2AVHFUUYKT6OCRRFURH","json":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH.json","graph_json":"https://pith.science/api/pith-number/C35LZ4J2AVHFUUYKT6OCRRFURH/graph.json","events_json":"https://pith.science/api/pith-number/C35LZ4J2AVHFUUYKT6OCRRFURH/events.json","paper":"https://pith.science/paper/C35LZ4J2"},"agent_actions":{"view_html":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH","download_json":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH.json","view_paper":"https://pith.science/paper/C35LZ4J2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5818&json=true","fetch_graph":"https://pith.science/api/pith-number/C35LZ4J2AVHFUUYKT6OCRRFURH/graph.json","fetch_events":"https://pith.science/api/pith-number/C35LZ4J2AVHFUUYKT6OCRRFURH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/action/storage_attestation","attest_author":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/action/author_attestation","sign_citation":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/action/citation_signature","submit_replication":"https://pith.science/pith/C35LZ4J2AVHFUUYKT6OCRRFURH/action/replication_record"}},"created_at":"2026-05-18T04:25:27.525440+00:00","updated_at":"2026-05-18T04:25:27.525440+00:00"}