{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TYLLPEIA44JRNV6YQSOKFUOULL","short_pith_number":"pith:TYLLPEIA","schema_version":"1.0","canonical_sha256":"9e16b79100e71316d7d8849ca2d1d45ae9a1274b2c30b05cc29b334efb39b710","source":{"kind":"arxiv","id":"1106.2065","version":1},"attestation_state":"computed","paper":{"title":"Oblivious Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benny Sudakov, Eli Gafni, Nati Linial, Uriel Feige, Yakov Babichenko, Yehuda Afek","submitted_at":"2011-06-10T14:11:33Z","abstract_excerpt":"Communication is a crucial ingredient in every kind of collaborative work. But what is the least possible amount of communication required for a given task? We formalize this question by introducing a new framework for distributed computation, called {\\em oblivious protocols}.\n  We investigate the power of this model by considering two concrete examples, the {\\em musical chairs} task $MC(n,m)$ and the well-known {\\em Renaming} problem. The $MC(n,m)$ game is played by $n$ players (processors) with $m$ chairs. Players can {\\em occupy} chairs, and the game terminates as soon as each player occupi"},"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":"1106.2065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-10T14:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"134e3aa9b1a3cc4f7bfdb21ef092c4a4d868b9982a4d8c42f80f2dc9a60c43e7","abstract_canon_sha256":"574b8b52d7eb4369445498fe503a0e2f62466c8b7958e13d87c3035bb62a527d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.980405Z","signature_b64":"XrilWZOXwtaxkbKjN6RLFzxhQrm8dC+EEAG5/2nUVkl8tc/kRcxR0ATJKOO1QIg5tp4gOM55wtn8MNJpZebQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e16b79100e71316d7d8849ca2d1d45ae9a1274b2c30b05cc29b334efb39b710","last_reissued_at":"2026-05-18T02:21:43.979981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.979981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oblivious Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benny Sudakov, Eli Gafni, Nati Linial, Uriel Feige, Yakov Babichenko, Yehuda Afek","submitted_at":"2011-06-10T14:11:33Z","abstract_excerpt":"Communication is a crucial ingredient in every kind of collaborative work. But what is the least possible amount of communication required for a given task? We formalize this question by introducing a new framework for distributed computation, called {\\em oblivious protocols}.\n  We investigate the power of this model by considering two concrete examples, the {\\em musical chairs} task $MC(n,m)$ and the well-known {\\em Renaming} problem. The $MC(n,m)$ game is played by $n$ players (processors) with $m$ chairs. Players can {\\em occupy} chairs, and the game terminates as soon as each player occupi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2065","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":"1106.2065","created_at":"2026-05-18T02:21:43.980047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2065v1","created_at":"2026-05-18T02:21:43.980047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2065","created_at":"2026-05-18T02:21:43.980047+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYLLPEIA44JR","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYLLPEIA44JRNV6Y","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYLLPEIA","created_at":"2026-05-18T12:26:42.757692+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/TYLLPEIA44JRNV6YQSOKFUOULL","json":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL.json","graph_json":"https://pith.science/api/pith-number/TYLLPEIA44JRNV6YQSOKFUOULL/graph.json","events_json":"https://pith.science/api/pith-number/TYLLPEIA44JRNV6YQSOKFUOULL/events.json","paper":"https://pith.science/paper/TYLLPEIA"},"agent_actions":{"view_html":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL","download_json":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL.json","view_paper":"https://pith.science/paper/TYLLPEIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2065&json=true","fetch_graph":"https://pith.science/api/pith-number/TYLLPEIA44JRNV6YQSOKFUOULL/graph.json","fetch_events":"https://pith.science/api/pith-number/TYLLPEIA44JRNV6YQSOKFUOULL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL/action/storage_attestation","attest_author":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL/action/author_attestation","sign_citation":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL/action/citation_signature","submit_replication":"https://pith.science/pith/TYLLPEIA44JRNV6YQSOKFUOULL/action/replication_record"}},"created_at":"2026-05-18T02:21:43.980047+00:00","updated_at":"2026-05-18T02:21:43.980047+00:00"}