{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:46XDDRIPP4FOANNPXZHVQOYOIZ","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":"67dcbb9106616e60d6706f98741d8d0a0227d783ac8fc775e1668278f6bcd057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T03:30:23Z","title_canon_sha256":"517d71ee6c4bc57e92d84cb202aa2194149011c9b599e8eefe617c9c87789c72"},"schema_version":"1.0","source":{"id":"1711.10661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10661","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10661v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10661","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"46XDDRIPP4FO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"46XDDRIPP4FOANNP","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"46XDDRIP","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:fa33c0fde275a27957774a890d83eb1b3089eec55627a061bf2ca4b8bafa5eff","target":"graph","created_at":"2026-05-18T00:29:17Z","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":"A basic goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems $f\\colon(\\{0,1\\}^n)^{k}\\to\\{0,1\\}$ with $k\\gg\\log n$ parties. We study the problems of inner product and set disjointness and determine their randomized communication complexity for every $k\\geq\\log n$, showing in both cases that $\\Theta(1+\\lceil\\log n\\rceil/\\log\\lceil1+k/\\log n\\rceil)$ bits are necessary and sufficient. In particular, these problems admit constant-cost protocols if and only if the number of parties is $k\\geq n^{\\epsilon}$ for some constant $\\epsilon>0.$","authors_text":"Alexander A. Sherstov, Vladimir V. Podolskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T03:30:23Z","title":"Inner Product and Set Disjointness: Beyond Logarithmically Many Parties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10661","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:7c41badd1bcb35b9c5d034763822d088e210d3dcca770694ae818ad34fac0107","target":"record","created_at":"2026-05-18T00:29:17Z","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":"67dcbb9106616e60d6706f98741d8d0a0227d783ac8fc775e1668278f6bcd057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T03:30:23Z","title_canon_sha256":"517d71ee6c4bc57e92d84cb202aa2194149011c9b599e8eefe617c9c87789c72"},"schema_version":"1.0","source":{"id":"1711.10661","kind":"arxiv","version":1}},"canonical_sha256":"e7ae31c50f7f0ae035afbe4f583b0e467238be52aaef3e82cd6643c9297b67c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7ae31c50f7f0ae035afbe4f583b0e467238be52aaef3e82cd6643c9297b67c6","first_computed_at":"2026-05-18T00:29:17.353151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:17.353151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+NkHQBTAzvV4y8hepii3Cvbxet+BQmO7C7JNRfmHmJFtVJ1tFEI59rQKYNMWZb9hOdt9caCVSgMPW6ff9x6iDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:17.353890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c41badd1bcb35b9c5d034763822d088e210d3dcca770694ae818ad34fac0107","sha256:fa33c0fde275a27957774a890d83eb1b3089eec55627a061bf2ca4b8bafa5eff"],"state_sha256":"5d34aefa15daefc5d3b7aba7f062faaf3bb44b31fbdefb8fe724e90ff3670f70"}