{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KDWKB6GV4WTBUY2R322MMGISW6","short_pith_number":"pith:KDWKB6GV","schema_version":"1.0","canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","source":{"kind":"arxiv","id":"1301.4269","version":2},"attestation_state":"computed","paper":{"title":"One-Round Multi-Party Communication Complexity of Distinguishing Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alex J. Malozemoff, Daniel Apon, Jonathan Katz","submitted_at":"2013-01-17T23:15:27Z","abstract_excerpt":"We consider an instance of the following problem: Parties P_1,..., P_k each receive an input x_i, and a coordinator (distinct from each of these parties) wishes to compute f(x_1,..., x_k) for some predicate f. We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum communication complexity needed to compute f, possibly with bounded error?\n  We prove tight bounds on the one-round communication complexity when f corresponds to the promise problem of distinguishing sums (name"},"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":"1301.4269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-17T23:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"e27e1acbbcca072ba28b239fec314393b481fd5376f0ac61cb7990d8eb4e07b7","abstract_canon_sha256":"2b4f4506f00020f97736bb475fb0f9d2b82153e0430d04373f5565dc86d05f1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:03.720917Z","signature_b64":"A8EfYZNza3/VONzFkb3yONwzfukKo3JqdaU85gaklFGz7h1Qx5QK5T3Ab9jNR/i3QluvegNuuSgh1wJL3fVdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","last_reissued_at":"2026-05-18T03:36:03.720426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:03.720426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Round Multi-Party Communication Complexity of Distinguishing Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alex J. Malozemoff, Daniel Apon, Jonathan Katz","submitted_at":"2013-01-17T23:15:27Z","abstract_excerpt":"We consider an instance of the following problem: Parties P_1,..., P_k each receive an input x_i, and a coordinator (distinct from each of these parties) wishes to compute f(x_1,..., x_k) for some predicate f. We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum communication complexity needed to compute f, possibly with bounded error?\n  We prove tight bounds on the one-round communication complexity when f corresponds to the promise problem of distinguishing sums (name"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4269","kind":"arxiv","version":2},"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":"1301.4269","created_at":"2026-05-18T03:36:03.720508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4269v2","created_at":"2026-05-18T03:36:03.720508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4269","created_at":"2026-05-18T03:36:03.720508+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDWKB6GV4WTB","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDWKB6GV4WTBUY2R","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDWKB6GV","created_at":"2026-05-18T12:27:49.015174+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/KDWKB6GV4WTBUY2R322MMGISW6","json":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6.json","graph_json":"https://pith.science/api/pith-number/KDWKB6GV4WTBUY2R322MMGISW6/graph.json","events_json":"https://pith.science/api/pith-number/KDWKB6GV4WTBUY2R322MMGISW6/events.json","paper":"https://pith.science/paper/KDWKB6GV"},"agent_actions":{"view_html":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6","download_json":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6.json","view_paper":"https://pith.science/paper/KDWKB6GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4269&json=true","fetch_graph":"https://pith.science/api/pith-number/KDWKB6GV4WTBUY2R322MMGISW6/graph.json","fetch_events":"https://pith.science/api/pith-number/KDWKB6GV4WTBUY2R322MMGISW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/action/storage_attestation","attest_author":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/action/author_attestation","sign_citation":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/action/citation_signature","submit_replication":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/action/replication_record"}},"created_at":"2026-05-18T03:36:03.720508+00:00","updated_at":"2026-05-18T03:36:03.720508+00:00"}