{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2QN7LLHCCX24ENUYREN4RLIWXL","short_pith_number":"pith:2QN7LLHC","canonical_record":{"source":{"id":"1702.01017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-02T17:37:44Z","cross_cats_sorted":["q-fin.EC"],"title_canon_sha256":"d8918a73ce6f893521b0a680b094dda26cf76d58dc248a109f33cba6456ee03f","abstract_canon_sha256":"c68c8848d11fc99fc512b6541ca4f7227e353f3e8c7aa7a40a14036b40401854"},"schema_version":"1.0"},"canonical_sha256":"d41bf5ace215f5c23698891bc8ad16baf244803acbd03ff7399d9fce0e67482a","source":{"kind":"arxiv","id":"1702.01017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01017","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01017v1","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01017","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"2QN7LLHCCX24","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QN7LLHCCX24ENUY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QN7LLHC","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2QN7LLHCCX24ENUYREN4RLIWXL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-02T17:37:44Z","cross_cats_sorted":["q-fin.EC"],"title_canon_sha256":"d8918a73ce6f893521b0a680b094dda26cf76d58dc248a109f33cba6456ee03f","abstract_canon_sha256":"c68c8848d11fc99fc512b6541ca4f7227e353f3e8c7aa7a40a14036b40401854"},"schema_version":"1.0"},"canonical_sha256":"d41bf5ace215f5c23698891bc8ad16baf244803acbd03ff7399d9fce0e67482a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:54.953256Z","signature_b64":"8oGgkGMxAyyBj6GjmH6ucl7XbpBgo8rshWXAeLwnzCbIYtj9SzzWy0gRph9kLVPb/RouSdJ4L+GVyM768ARXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d41bf5ace215f5c23698891bc8ad16baf244803acbd03ff7399d9fce0e67482a","last_reissued_at":"2026-05-18T00:43:54.952524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:54.952524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01017","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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPeZ/G91OzfyD/7NJR6vwCw0eCYre748E+XfloVsj7o8xEj0S6/BhBfs2g7PaiUi42RasamUuPjZluzCNZTJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:03:05.840989Z"},"content_sha256":"094fbf1193dc8e36f8dc9dc806b7ccdaff556e97ec066da66d569525c5dab383","schema_version":"1.0","event_id":"sha256:094fbf1193dc8e36f8dc9dc806b7ccdaff556e97ec066da66d569525c5dab383"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2QN7LLHCCX24ENUYREN4RLIWXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.EC"],"primary_cat":"cs.GT","authors_text":"Anindya S. Chakrabarti, Diptesh Ghosh","submitted_at":"2017-02-02T17:37:44Z","abstract_excerpt":"In this paper, we study a large-scale distributed coordination problem and propose efficient adaptive strategies to solve the problem. The basic problem is to allocate finite number of resources to individual agents such that there is as little congestion as possible and the fraction of unutilized resources is reduced as far as possible. In the absence of a central planner and global information, agents can employ adaptive strategies that uses only finite knowledge about the competitors. In this paper, we show that a combination of finite information sets and reinforcement learning can increas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01017","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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v671OyNOdFYKhsl6bCRYekdCiM0AgwGiPsOmfMq63au3p8ULrfrsJxk3wpDtL+MCCVQ/TC38HqnjHVzffUaCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:03:05.841391Z"},"content_sha256":"15e1576ae33f903bea2c3f74b8490527260108e7fb68d2f09e171ab9c1352042","schema_version":"1.0","event_id":"sha256:15e1576ae33f903bea2c3f74b8490527260108e7fb68d2f09e171ab9c1352042"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QN7LLHCCX24ENUYREN4RLIWXL/bundle.json","state_url":"https://pith.science/pith/2QN7LLHCCX24ENUYREN4RLIWXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QN7LLHCCX24ENUYREN4RLIWXL/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-20T03:03:05Z","links":{"resolver":"https://pith.science/pith/2QN7LLHCCX24ENUYREN4RLIWXL","bundle":"https://pith.science/pith/2QN7LLHCCX24ENUYREN4RLIWXL/bundle.json","state":"https://pith.science/pith/2QN7LLHCCX24ENUYREN4RLIWXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QN7LLHCCX24ENUYREN4RLIWXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2QN7LLHCCX24ENUYREN4RLIWXL","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":"c68c8848d11fc99fc512b6541ca4f7227e353f3e8c7aa7a40a14036b40401854","cross_cats_sorted":["q-fin.EC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-02T17:37:44Z","title_canon_sha256":"d8918a73ce6f893521b0a680b094dda26cf76d58dc248a109f33cba6456ee03f"},"schema_version":"1.0","source":{"id":"1702.01017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01017","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01017v1","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01017","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"2QN7LLHCCX24","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QN7LLHCCX24ENUY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QN7LLHC","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:15e1576ae33f903bea2c3f74b8490527260108e7fb68d2f09e171ab9c1352042","target":"graph","created_at":"2026-05-18T00:43:54Z","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 study a large-scale distributed coordination problem and propose efficient adaptive strategies to solve the problem. The basic problem is to allocate finite number of resources to individual agents such that there is as little congestion as possible and the fraction of unutilized resources is reduced as far as possible. In the absence of a central planner and global information, agents can employ adaptive strategies that uses only finite knowledge about the competitors. In this paper, we show that a combination of finite information sets and reinforcement learning can increas","authors_text":"Anindya S. Chakrabarti, Diptesh Ghosh","cross_cats":["q-fin.EC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-02T17:37:44Z","title":"Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01017","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:094fbf1193dc8e36f8dc9dc806b7ccdaff556e97ec066da66d569525c5dab383","target":"record","created_at":"2026-05-18T00:43:54Z","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":"c68c8848d11fc99fc512b6541ca4f7227e353f3e8c7aa7a40a14036b40401854","cross_cats_sorted":["q-fin.EC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-02T17:37:44Z","title_canon_sha256":"d8918a73ce6f893521b0a680b094dda26cf76d58dc248a109f33cba6456ee03f"},"schema_version":"1.0","source":{"id":"1702.01017","kind":"arxiv","version":1}},"canonical_sha256":"d41bf5ace215f5c23698891bc8ad16baf244803acbd03ff7399d9fce0e67482a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d41bf5ace215f5c23698891bc8ad16baf244803acbd03ff7399d9fce0e67482a","first_computed_at":"2026-05-18T00:43:54.952524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:54.952524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8oGgkGMxAyyBj6GjmH6ucl7XbpBgo8rshWXAeLwnzCbIYtj9SzzWy0gRph9kLVPb/RouSdJ4L+GVyM768ARXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:54.953256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:094fbf1193dc8e36f8dc9dc806b7ccdaff556e97ec066da66d569525c5dab383","sha256:15e1576ae33f903bea2c3f74b8490527260108e7fb68d2f09e171ab9c1352042"],"state_sha256":"6d826baa2075e26bd77fc0f63b2394f0ce3fcf7ed8870d458eb6ffdb2a3419e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KbX6tIRegiSl6HniFCLTeK4Mtt9qS3XjCAr73+wD5ALJVOFi4oqqjkcS8M9OqUd/uoKSbhP4x4qYszcMAmaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:03:05.843443Z","bundle_sha256":"0252b32aca63dc323351655a259b18eab93c64c616e92c6cadf9dbca00760a6f"}}