{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KDWKB6GV4WTBUY2R322MMGISW6","short_pith_number":"pith:KDWKB6GV","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"},"canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","source":{"kind":"arxiv","id":"1301.4269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4269","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4269v2","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4269","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"KDWKB6GV4WTB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDWKB6GV4WTBUY2R","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDWKB6GV","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KDWKB6GV4WTBUY2R322MMGISW6","target":"record","payload":{"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"},"canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","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"},"source_kind":"arxiv","source_id":"1301.4269","source_version":2,"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-18T03:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2sViYnusYsRjPzNlFIEjBGrhhZtK3t8U7O739F2bg37y+UFO28EFYBulv8VN+5VSJBsrW8ezE2KzIrAaMaWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:08:43.580437Z"},"content_sha256":"721b2b6537d1d2ffa764441d823878958932ea3a3e2231a79902665b92a75b78","schema_version":"1.0","event_id":"sha256:721b2b6537d1d2ffa764441d823878958932ea3a3e2231a79902665b92a75b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KDWKB6GV4WTBUY2R322MMGISW6","target":"graph","payload":{"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"},"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-18T03:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNam8j+HnakA/WczfWedXW0/oRnH1TDJ0R06pY7glzofXoUYyKe/FE2an62jeGoOj34HnOjeU7Ao7hBGN8HmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:08:43.581091Z"},"content_sha256":"6caf3093d28ad0724acca25fbe19ebc59f06f6a59219177b90dc6011b42c0267","schema_version":"1.0","event_id":"sha256:6caf3093d28ad0724acca25fbe19ebc59f06f6a59219177b90dc6011b42c0267"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/bundle.json","state_url":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDWKB6GV4WTBUY2R322MMGISW6/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-06T20:08:43Z","links":{"resolver":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6","bundle":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/bundle.json","state":"https://pith.science/pith/KDWKB6GV4WTBUY2R322MMGISW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDWKB6GV4WTBUY2R322MMGISW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KDWKB6GV4WTBUY2R322MMGISW6","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":"2b4f4506f00020f97736bb475fb0f9d2b82153e0430d04373f5565dc86d05f1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-17T23:15:27Z","title_canon_sha256":"e27e1acbbcca072ba28b239fec314393b481fd5376f0ac61cb7990d8eb4e07b7"},"schema_version":"1.0","source":{"id":"1301.4269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4269","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4269v2","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4269","created_at":"2026-05-18T03:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"KDWKB6GV4WTB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDWKB6GV4WTBUY2R","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDWKB6GV","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:6caf3093d28ad0724acca25fbe19ebc59f06f6a59219177b90dc6011b42c0267","target":"graph","created_at":"2026-05-18T03:36:03Z","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":"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","authors_text":"Alex J. Malozemoff, Daniel Apon, Jonathan Katz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-17T23:15:27Z","title":"One-Round Multi-Party Communication Complexity of Distinguishing Sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4269","kind":"arxiv","version":2},"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:721b2b6537d1d2ffa764441d823878958932ea3a3e2231a79902665b92a75b78","target":"record","created_at":"2026-05-18T03:36:03Z","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":"2b4f4506f00020f97736bb475fb0f9d2b82153e0430d04373f5565dc86d05f1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-17T23:15:27Z","title_canon_sha256":"e27e1acbbcca072ba28b239fec314393b481fd5376f0ac61cb7990d8eb4e07b7"},"schema_version":"1.0","source":{"id":"1301.4269","kind":"arxiv","version":2}},"canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50eca0f8d5e5a61a6351deb4c61912b79d987fd9802ec838715b55f350b92fc8","first_computed_at":"2026-05-18T03:36:03.720426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:03.720426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A8EfYZNza3/VONzFkb3yONwzfukKo3JqdaU85gaklFGz7h1Qx5QK5T3Ab9jNR/i3QluvegNuuSgh1wJL3fVdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:03.720917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:721b2b6537d1d2ffa764441d823878958932ea3a3e2231a79902665b92a75b78","sha256:6caf3093d28ad0724acca25fbe19ebc59f06f6a59219177b90dc6011b42c0267"],"state_sha256":"7ab61943ac64a493b70e9152e43b4c9d65b524ed52c6bdb3b3d66512fa52b19a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vk8NncxhWeuCGn0puwQY2t+OyICUybuAmcMSd1naT0a4PGGO22iXIguUY1pYwwSznR0EeINm2Cfgyap3krURDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:08:43.586357Z","bundle_sha256":"de3db735beb9c5fc96885f28da272348aaf61f184decba0e2a6d0a1c6b0f9286"}}