{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BWBQZCZVL75NPEY6KSJYGN7526","short_pith_number":"pith:BWBQZCZV","canonical_record":{"source":{"id":"1608.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"fca34b5beccfa1c00e656ae00121b965bb89fc9fab8d6b6fa973462f4646043b","abstract_canon_sha256":"727a9b9f8a2811b6a176534f05a91c2b33aa5587e8fb5c9ab3c3b4589967089b"},"schema_version":"1.0"},"canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","source":{"kind":"arxiv","id":"1608.00213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00213","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00213v1","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00213","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"pith_short_12","alias_value":"BWBQZCZVL75N","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWBQZCZVL75NPEY6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWBQZCZV","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BWBQZCZVL75NPEY6KSJYGN7526","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"fca34b5beccfa1c00e656ae00121b965bb89fc9fab8d6b6fa973462f4646043b","abstract_canon_sha256":"727a9b9f8a2811b6a176534f05a91c2b33aa5587e8fb5c9ab3c3b4589967089b"},"schema_version":"1.0"},"canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:19.957704Z","signature_b64":"KICZCFLXIPaJQi78SHsSGQiJg+5Sy0ZSnaCsfszJ+NG8cvXSJG80wi4GvuC9dRW4OB/yZNkoqGxYIqOxHE2SBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","last_reissued_at":"2026-05-18T00:54:19.957354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:19.957354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00213","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-18T00:54:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MfuLrgqb/9ExV8Qe5PDCyVY6cdPAJAlKEmai4Uesy0rEY5Cadr58c4N7Y+8ZMv9xX2Eb7xwsV37zkLGXhdeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:15:17.353554Z"},"content_sha256":"b67d5a2ac83c8ae3b10cd9aa409eb36f0d887bfa535c8ad201bad8d22962552e","schema_version":"1.0","event_id":"sha256:b67d5a2ac83c8ae3b10cd9aa409eb36f0d887bfa535c8ad201bad8d22962552e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BWBQZCZVL75NPEY6KSJYGN7526","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-organization in a distributed coordination game through heuristic rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.EC","authors_text":"A. S. Chakrabarti, D. Ghosh, S. Agarwal","submitted_at":"2016-07-31T12:48:01Z","abstract_excerpt":"In this paper we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, $N$ agents play a coordination game repeatedly which has exactly $N$ Nash equilibria and all of the equilibria are equally preferred by the agents. The problem is to select one equilibrium out of $N$ possible equilibria in the least number of attempts. We propose a number of heuristic rules based on reinforcement learning to solve the coordination problem. We see th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00213","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-18T00:54:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68d92wum9MRIuWuMHx2Xn/IPJc4TtLOyb9qcDlzaqh/T/VUOPfbFcZDX7adPQBIEyi2kw6mur0z5O2i3f6P9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:15:17.353908Z"},"content_sha256":"eafd516a6b04905a0e313b64713fdba55b47ee406ce0100a2434bc67f6862a0e","schema_version":"1.0","event_id":"sha256:eafd516a6b04905a0e313b64713fdba55b47ee406ce0100a2434bc67f6862a0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/bundle.json","state_url":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWBQZCZVL75NPEY6KSJYGN7526/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-02T03:15:17Z","links":{"resolver":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526","bundle":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/bundle.json","state":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWBQZCZVL75NPEY6KSJYGN7526/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BWBQZCZVL75NPEY6KSJYGN7526","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":"727a9b9f8a2811b6a176534f05a91c2b33aa5587e8fb5c9ab3c3b4589967089b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","title_canon_sha256":"fca34b5beccfa1c00e656ae00121b965bb89fc9fab8d6b6fa973462f4646043b"},"schema_version":"1.0","source":{"id":"1608.00213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00213","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00213v1","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00213","created_at":"2026-05-18T00:54:19Z"},{"alias_kind":"pith_short_12","alias_value":"BWBQZCZVL75N","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWBQZCZVL75NPEY6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWBQZCZV","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:eafd516a6b04905a0e313b64713fdba55b47ee406ce0100a2434bc67f6862a0e","target":"graph","created_at":"2026-05-18T00:54:19Z","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":"In this paper we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, $N$ agents play a coordination game repeatedly which has exactly $N$ Nash equilibria and all of the equilibria are equally preferred by the agents. The problem is to select one equilibrium out of $N$ possible equilibria in the least number of attempts. We propose a number of heuristic rules based on reinforcement learning to solve the coordination problem. We see th","authors_text":"A. S. Chakrabarti, D. Ghosh, S. Agarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","title":"Self-organization in a distributed coordination game through heuristic rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00213","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:b67d5a2ac83c8ae3b10cd9aa409eb36f0d887bfa535c8ad201bad8d22962552e","target":"record","created_at":"2026-05-18T00:54:19Z","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":"727a9b9f8a2811b6a176534f05a91c2b33aa5587e8fb5c9ab3c3b4589967089b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","title_canon_sha256":"fca34b5beccfa1c00e656ae00121b965bb89fc9fab8d6b6fa973462f4646043b"},"schema_version":"1.0","source":{"id":"1608.00213","kind":"arxiv","version":1}},"canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","first_computed_at":"2026-05-18T00:54:19.957354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:19.957354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KICZCFLXIPaJQi78SHsSGQiJg+5Sy0ZSnaCsfszJ+NG8cvXSJG80wi4GvuC9dRW4OB/yZNkoqGxYIqOxHE2SBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:19.957704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b67d5a2ac83c8ae3b10cd9aa409eb36f0d887bfa535c8ad201bad8d22962552e","sha256:eafd516a6b04905a0e313b64713fdba55b47ee406ce0100a2434bc67f6862a0e"],"state_sha256":"e59a686d01b111d2aabbc2f8c60c3c1dd36f74406be81b0c2659312bc8c2b53a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgWrqJ1iX5ObSWq2Ba6oL/F+Xa+gt3mJoOSC1G7BgVQqEJO0XgZIwqbzO2gBDxVAOxY/TIz2nBlpN1kzvaKUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:15:17.355899Z","bundle_sha256":"29dc5541379f2ea389e90aa582f51e748282a6280d477affbfc55dc16ae4b715"}}