{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:OVNQQAK5ULS5B3IYCJOXPAU5T5","short_pith_number":"pith:OVNQQAK5","schema_version":"1.0","canonical_sha256":"755b08015da2e5d0ed18125d77829d9f7748667c3f9635ce1374daad8492f93a","source":{"kind":"arxiv","id":"0711.1639","version":3},"attestation_state":"computed","paper":{"title":"The Kolkata Paise Restaurant Problem and Resource Utilization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Anindya-Sundar Chakrabarti, Arnab Chatterjee, Bikas K. Chakrabarti, Manipushpak Mitra","submitted_at":"2007-11-11T05:46:09Z","abstract_excerpt":"We study the dynamics of the \"Kolkata Paise Restaurant problem\". The problem is the following: In each period, N agents have to choose between N restaurants. Agents have a common ranking of the restaurants. Restaurants can only serve one customer. When more than one customer arrives at the same restaurant, one customer is chosen at random and is served; the others do not get the service. We first introduce the one-shot versions of the Kolkata Paise Restaurant problem which we call one-shot KPR games. We then study the dynamics of the Kolkata Paise Restaurant problem (which is a repeated game v"},"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":"0711.1639","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2007-11-11T05:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"b7facbfff951f7b26049dfa004d172718e8025b3e312be357f5ea1638b40dd2d","abstract_canon_sha256":"d1321489157fe27eccf8b1478be02d810ce94c8e32b4df900d7927695f4a0f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:25.203982Z","signature_b64":"Ap7dK1zwiiObrPykLt5YelRRCB9HgvnaNQGr35Jysk4Kf21wGjhdivJs5ZDoGL+5cyOUJ6zo6gWU3UQenrobCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"755b08015da2e5d0ed18125d77829d9f7748667c3f9635ce1374daad8492f93a","last_reissued_at":"2026-05-18T03:55:25.203435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:25.203435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Kolkata Paise Restaurant Problem and Resource Utilization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Anindya-Sundar Chakrabarti, Arnab Chatterjee, Bikas K. Chakrabarti, Manipushpak Mitra","submitted_at":"2007-11-11T05:46:09Z","abstract_excerpt":"We study the dynamics of the \"Kolkata Paise Restaurant problem\". The problem is the following: In each period, N agents have to choose between N restaurants. Agents have a common ranking of the restaurants. Restaurants can only serve one customer. When more than one customer arrives at the same restaurant, one customer is chosen at random and is served; the others do not get the service. We first introduce the one-shot versions of the Kolkata Paise Restaurant problem which we call one-shot KPR games. We then study the dynamics of the Kolkata Paise Restaurant problem (which is a repeated game v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.1639","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0711.1639","created_at":"2026-05-18T03:55:25.203519+00:00"},{"alias_kind":"arxiv_version","alias_value":"0711.1639v3","created_at":"2026-05-18T03:55:25.203519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.1639","created_at":"2026-05-18T03:55:25.203519+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVNQQAK5ULS5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVNQQAK5ULS5B3IY","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVNQQAK5","created_at":"2026-05-18T12:25:55.427421+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/OVNQQAK5ULS5B3IYCJOXPAU5T5","json":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5.json","graph_json":"https://pith.science/api/pith-number/OVNQQAK5ULS5B3IYCJOXPAU5T5/graph.json","events_json":"https://pith.science/api/pith-number/OVNQQAK5ULS5B3IYCJOXPAU5T5/events.json","paper":"https://pith.science/paper/OVNQQAK5"},"agent_actions":{"view_html":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5","download_json":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5.json","view_paper":"https://pith.science/paper/OVNQQAK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0711.1639&json=true","fetch_graph":"https://pith.science/api/pith-number/OVNQQAK5ULS5B3IYCJOXPAU5T5/graph.json","fetch_events":"https://pith.science/api/pith-number/OVNQQAK5ULS5B3IYCJOXPAU5T5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5/action/storage_attestation","attest_author":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5/action/author_attestation","sign_citation":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5/action/citation_signature","submit_replication":"https://pith.science/pith/OVNQQAK5ULS5B3IYCJOXPAU5T5/action/replication_record"}},"created_at":"2026-05-18T03:55:25.203519+00:00","updated_at":"2026-05-18T03:55:25.203519+00:00"}