{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EGXGJTL2Z66CNKF5OVOENZSHU2","short_pith_number":"pith:EGXGJTL2","schema_version":"1.0","canonical_sha256":"21ae64cd7acfbc26a8bd755c46e647a6a8df2b0a5d9cde41d7bf327973406b23","source":{"kind":"arxiv","id":"1102.1208","version":1},"attestation_state":"computed","paper":{"title":"The hardness of Median in the synchronized bit communication model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karolina So{\\l}tys","submitted_at":"2011-02-06T22:53:32Z","abstract_excerpt":"The synchronized bit communication model, defined recently by Impagliazzo and Williams in \\emph{Communication complexity with synchronized clocks}, CCC '10, is a communication model which allows the participants to share a common clock. The main open problem posed in this paper was the following: does the synchronized bit model allow a logarithmic speed-up for all functions over the standard deterministic model of communication? We resolve this question in the negative by showing that the Median function, whose communication complexity is $O(\\log n)$, does not admit polytime synchronized bit p"},"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":"1102.1208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-06T22:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"5cc7d14dd3ae79655319a2ef1ea52b301dc3ab7849921d28eefd6f0cd480b81c","abstract_canon_sha256":"a408245f7f35216e722c1d5acb34355b9184f46fc947d422a61a1a357b2829c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.764914Z","signature_b64":"QSGN66bNahsHdSyA0amRVgzs/wfoNVVvlefJLewW8IuE0IG5Xww70Gt1V6iKjvG9gIAfpLMIsnhTWGQWZ5qsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ae64cd7acfbc26a8bd755c46e647a6a8df2b0a5d9cde41d7bf327973406b23","last_reissued_at":"2026-05-18T04:29:54.764081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.764081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The hardness of Median in the synchronized bit communication model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karolina So{\\l}tys","submitted_at":"2011-02-06T22:53:32Z","abstract_excerpt":"The synchronized bit communication model, defined recently by Impagliazzo and Williams in \\emph{Communication complexity with synchronized clocks}, CCC '10, is a communication model which allows the participants to share a common clock. The main open problem posed in this paper was the following: does the synchronized bit model allow a logarithmic speed-up for all functions over the standard deterministic model of communication? We resolve this question in the negative by showing that the Median function, whose communication complexity is $O(\\log n)$, does not admit polytime synchronized bit p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1208","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":"1102.1208","created_at":"2026-05-18T04:29:54.764234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1208v1","created_at":"2026-05-18T04:29:54.764234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1208","created_at":"2026-05-18T04:29:54.764234+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGXGJTL2Z66C","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGXGJTL2Z66CNKF5","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGXGJTL2","created_at":"2026-05-18T12:26:28.662955+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/EGXGJTL2Z66CNKF5OVOENZSHU2","json":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2.json","graph_json":"https://pith.science/api/pith-number/EGXGJTL2Z66CNKF5OVOENZSHU2/graph.json","events_json":"https://pith.science/api/pith-number/EGXGJTL2Z66CNKF5OVOENZSHU2/events.json","paper":"https://pith.science/paper/EGXGJTL2"},"agent_actions":{"view_html":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2","download_json":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2.json","view_paper":"https://pith.science/paper/EGXGJTL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1208&json=true","fetch_graph":"https://pith.science/api/pith-number/EGXGJTL2Z66CNKF5OVOENZSHU2/graph.json","fetch_events":"https://pith.science/api/pith-number/EGXGJTL2Z66CNKF5OVOENZSHU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2/action/storage_attestation","attest_author":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2/action/author_attestation","sign_citation":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2/action/citation_signature","submit_replication":"https://pith.science/pith/EGXGJTL2Z66CNKF5OVOENZSHU2/action/replication_record"}},"created_at":"2026-05-18T04:29:54.764234+00:00","updated_at":"2026-05-18T04:29:54.764234+00:00"}