{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:46XDDRIPP4FOANNPXZHVQOYOIZ","short_pith_number":"pith:46XDDRIP","canonical_record":{"source":{"id":"1711.10661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T03:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"517d71ee6c4bc57e92d84cb202aa2194149011c9b599e8eefe617c9c87789c72","abstract_canon_sha256":"67dcbb9106616e60d6706f98741d8d0a0227d783ac8fc775e1668278f6bcd057"},"schema_version":"1.0"},"canonical_sha256":"e7ae31c50f7f0ae035afbe4f583b0e467238be52aaef3e82cd6643c9297b67c6","source":{"kind":"arxiv","id":"1711.10661","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:46XDDRIPP4FOANNPXZHVQOYOIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-29T03:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"517d71ee6c4bc57e92d84cb202aa2194149011c9b599e8eefe617c9c87789c72","abstract_canon_sha256":"67dcbb9106616e60d6706f98741d8d0a0227d783ac8fc775e1668278f6bcd057"},"schema_version":"1.0"},"canonical_sha256":"e7ae31c50f7f0ae035afbe4f583b0e467238be52aaef3e82cd6643c9297b67c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.353890Z","signature_b64":"+NkHQBTAzvV4y8hepii3Cvbxet+BQmO7C7JNRfmHmJFtVJ1tFEI59rQKYNMWZb9hOdt9caCVSgMPW6ff9x6iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7ae31c50f7f0ae035afbe4f583b0e467238be52aaef3e82cd6643c9297b67c6","last_reissued_at":"2026-05-18T00:29:17.353151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.353151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10661","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uy3ngj6UnNHabbJOB+nulGMEKBD4O1JIvdnxnj679S4CUJf9Lg6Qh8K+dNUyFqYIRxJpBbRM80tQUXFh6KdXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:10:52.274426Z"},"content_sha256":"7c41badd1bcb35b9c5d034763822d088e210d3dcca770694ae818ad34fac0107","schema_version":"1.0","event_id":"sha256:7c41badd1bcb35b9c5d034763822d088e210d3dcca770694ae818ad34fac0107"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:46XDDRIPP4FOANNPXZHVQOYOIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inner Product and Set Disjointness: Beyond Logarithmically Many Parties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov, Vladimir V. Podolskii","submitted_at":"2017-11-29T03:30:23Z","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.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10661","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/N40z4EN9YO+dzLjrECYfT3W27YOFcqgoRZNqQZUy3Pd/Ixj72+Q6Aki161oY8eNE4cMUmk/9T98lwPekj0UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:10:52.275082Z"},"content_sha256":"fa33c0fde275a27957774a890d83eb1b3089eec55627a061bf2ca4b8bafa5eff","schema_version":"1.0","event_id":"sha256:fa33c0fde275a27957774a890d83eb1b3089eec55627a061bf2ca4b8bafa5eff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/bundle.json","state_url":"https://pith.science/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T23:10:52Z","links":{"resolver":"https://pith.science/pith/46XDDRIPP4FOANNPXZHVQOYOIZ","bundle":"https://pith.science/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/bundle.json","state":"https://pith.science/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46XDDRIPP4FOANNPXZHVQOYOIZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7VKXepMZSIYpjeUAjvF4P1/C6dKclariPnFs222dFIY//fkDhEOym1wWKHCywS8mE+8/qYJV3ecA5Xm7sGKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:10:52.278120Z","bundle_sha256":"6a75382daa4be1a4632696c67836eabe1d7f1f78e3452f8cebf28b506b37c410"}}