{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUCEV4QXB5MDNN5N634QHXJH7L","short_pith_number":"pith:RUCEV4QX","schema_version":"1.0","canonical_sha256":"8d044af2170f5836b7adf6f903dd27faf6a13ea9afe9a2cea63ca564c8a6f302","source":{"kind":"arxiv","id":"1508.05189","version":1},"attestation_state":"computed","paper":{"title":"Correlation in Hard Distributions in Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Dmitry Gavinsky, Hartmut Klauck, Ralph C. Bottesch","submitted_at":"2015-08-21T07:05:39Z","abstract_excerpt":"We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family of complexity measures that interpolates between the two previously studied extreme cases: the (standard) randomised communication complexity and the case of distributional complexity under product distributions.\n  We give a tight characterisation of the randomised complexity of Disjointness under distributions with mutual information $k$, showing that it is $\\Theta(\\sqrt{n(k+1)})$ for all $0\\leq k\\leq n$. This smooth"},"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":"1508.05189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T07:05:39Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3f966475a087e4891f3d812990b1d3581e08bf8988d090c438dd4ab5ec91e1dc","abstract_canon_sha256":"1eb7ab75d876a43837993df18ad16c26a000e7e30d44801e00ca087bd847bad6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:54.134182Z","signature_b64":"+hNcdzAe4k1hWbGwCqtWFL484y7QbIsiZdlw8VOKWxFxYHv/7Dhv7KM+jdvw2y+prOmLW1DIfGTTpQF8R7dOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d044af2170f5836b7adf6f903dd27faf6a13ea9afe9a2cea63ca564c8a6f302","last_reissued_at":"2026-05-18T01:34:54.133523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:54.133523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation in Hard Distributions in Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Dmitry Gavinsky, Hartmut Klauck, Ralph C. Bottesch","submitted_at":"2015-08-21T07:05:39Z","abstract_excerpt":"We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family of complexity measures that interpolates between the two previously studied extreme cases: the (standard) randomised communication complexity and the case of distributional complexity under product distributions.\n  We give a tight characterisation of the randomised complexity of Disjointness under distributions with mutual information $k$, showing that it is $\\Theta(\\sqrt{n(k+1)})$ for all $0\\leq k\\leq n$. This smooth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05189","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":"1508.05189","created_at":"2026-05-18T01:34:54.133621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05189v1","created_at":"2026-05-18T01:34:54.133621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05189","created_at":"2026-05-18T01:34:54.133621+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUCEV4QXB5MD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUCEV4QXB5MDNN5N","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUCEV4QX","created_at":"2026-05-18T12:29:39.896362+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/RUCEV4QXB5MDNN5N634QHXJH7L","json":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L.json","graph_json":"https://pith.science/api/pith-number/RUCEV4QXB5MDNN5N634QHXJH7L/graph.json","events_json":"https://pith.science/api/pith-number/RUCEV4QXB5MDNN5N634QHXJH7L/events.json","paper":"https://pith.science/paper/RUCEV4QX"},"agent_actions":{"view_html":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L","download_json":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L.json","view_paper":"https://pith.science/paper/RUCEV4QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05189&json=true","fetch_graph":"https://pith.science/api/pith-number/RUCEV4QXB5MDNN5N634QHXJH7L/graph.json","fetch_events":"https://pith.science/api/pith-number/RUCEV4QXB5MDNN5N634QHXJH7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L/action/storage_attestation","attest_author":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L/action/author_attestation","sign_citation":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L/action/citation_signature","submit_replication":"https://pith.science/pith/RUCEV4QXB5MDNN5N634QHXJH7L/action/replication_record"}},"created_at":"2026-05-18T01:34:54.133621+00:00","updated_at":"2026-05-18T01:34:54.133621+00:00"}