{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DUWQXHB7QUGTPIPMQYMDXZJXCM","short_pith_number":"pith:DUWQXHB7","canonical_record":{"source":{"id":"1506.02936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-09T14:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"e054215ecdbdb618624a1074cca381ee4d144d52a28859c3b2381f3dc31f850c","abstract_canon_sha256":"868e237507869d86fafcda2063b87875c7908679f801aaab3f3fcbb07dbe34ab"},"schema_version":"1.0"},"canonical_sha256":"1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566","source":{"kind":"arxiv","id":"1506.02936","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02936","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02936v3","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02936","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"DUWQXHB7QUGT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUWQXHB7QUGTPIPM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUWQXHB7","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DUWQXHB7QUGTPIPMQYMDXZJXCM","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-09T14:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"e054215ecdbdb618624a1074cca381ee4d144d52a28859c3b2381f3dc31f850c","abstract_canon_sha256":"868e237507869d86fafcda2063b87875c7908679f801aaab3f3fcbb07dbe34ab"},"schema_version":"1.0"},"canonical_sha256":"1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:47.119914Z","signature_b64":"vZ6ZTa3eVxgdasUnvDpHMhCOIJw0C8/386cJv6MooXbGB43jD5jv49O5f+Rger1ZVQKWLjOgRbleVxwfZl3FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566","last_reissued_at":"2026-05-18T01:37:47.119527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:47.119527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02936","source_version":3,"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-18T01:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vSQAf941nJoSV3XLOpgRF2f0cwmacbh61N4TMlRBeaFPfcxeHwdOMXWOVI46yj/pqsgDWvbfXfp6vxC8qmnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:32:03.827105Z"},"content_sha256":"1f4ecad262076aaa548a4becb291ab26625d60628f089b8f96d99a67f1158af2","schema_version":"1.0","event_id":"sha256:1f4ecad262076aaa548a4becb291ab26625d60628f089b8f96d99a67f1158af2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DUWQXHB7QUGTPIPMQYMDXZJXCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Penghui Yao","submitted_at":"2015-06-09T14:42:20Z","abstract_excerpt":"In this note, we study the relation between the parity decision tree complexity of a boolean function $f$, denoted by $\\mathrm{D}_{\\oplus}(f)$, and the $k$-party number-in-hand multiparty communication complexity of the XOR functions $F(x_1,\\ldots, x_k)= f(x_1\\oplus\\cdots\\oplus x_k)$, denoted by $\\mathrm{CC}^{(k)}(F)$. It is known that $\\mathrm{CC}^{(k)}(F)\\leq k\\cdot\\mathrm{D}_{\\oplus}(f)$ because the players can simulate the parity decision tree that computes $f$. In this note, we show that \\[\\mathrm{D}_{\\oplus}(f)\\leq O\\big(\\mathrm{CC}^{(4)}(F)^5\\big).\\] Our main tool is a recent result fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02936","kind":"arxiv","version":3},"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-18T01:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvLrKezadLlUHTpZ3hsMDTrP3EmluZetAPJg+1gvvDqJpttQXAt3SpDb6QRMdhmhwmiM07ptgFpo5Q5SQnrPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:32:03.827703Z"},"content_sha256":"2d19c3f62f4be89b5cd922dbf6f7079c3a5508a84faf358f135f7c3b25ec6386","schema_version":"1.0","event_id":"sha256:2d19c3f62f4be89b5cd922dbf6f7079c3a5508a84faf358f135f7c3b25ec6386"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/bundle.json","state_url":"https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/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-05-22T02:32:03Z","links":{"resolver":"https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM","bundle":"https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/bundle.json","state":"https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DUWQXHB7QUGTPIPMQYMDXZJXCM","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":"868e237507869d86fafcda2063b87875c7908679f801aaab3f3fcbb07dbe34ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-09T14:42:20Z","title_canon_sha256":"e054215ecdbdb618624a1074cca381ee4d144d52a28859c3b2381f3dc31f850c"},"schema_version":"1.0","source":{"id":"1506.02936","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02936","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02936v3","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02936","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"DUWQXHB7QUGT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUWQXHB7QUGTPIPM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUWQXHB7","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2d19c3f62f4be89b5cd922dbf6f7079c3a5508a84faf358f135f7c3b25ec6386","target":"graph","created_at":"2026-05-18T01:37:47Z","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":"In this note, we study the relation between the parity decision tree complexity of a boolean function $f$, denoted by $\\mathrm{D}_{\\oplus}(f)$, and the $k$-party number-in-hand multiparty communication complexity of the XOR functions $F(x_1,\\ldots, x_k)= f(x_1\\oplus\\cdots\\oplus x_k)$, denoted by $\\mathrm{CC}^{(k)}(F)$. It is known that $\\mathrm{CC}^{(k)}(F)\\leq k\\cdot\\mathrm{D}_{\\oplus}(f)$ because the players can simulate the parity decision tree that computes $f$. In this note, we show that \\[\\mathrm{D}_{\\oplus}(f)\\leq O\\big(\\mathrm{CC}^{(4)}(F)^5\\big).\\] Our main tool is a recent result fro","authors_text":"Penghui Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-09T14:42:20Z","title":"Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02936","kind":"arxiv","version":3},"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:1f4ecad262076aaa548a4becb291ab26625d60628f089b8f96d99a67f1158af2","target":"record","created_at":"2026-05-18T01:37:47Z","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":"868e237507869d86fafcda2063b87875c7908679f801aaab3f3fcbb07dbe34ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-09T14:42:20Z","title_canon_sha256":"e054215ecdbdb618624a1074cca381ee4d144d52a28859c3b2381f3dc31f850c"},"schema_version":"1.0","source":{"id":"1506.02936","kind":"arxiv","version":3}},"canonical_sha256":"1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566","first_computed_at":"2026-05-18T01:37:47.119527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:47.119527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZ6ZTa3eVxgdasUnvDpHMhCOIJw0C8/386cJv6MooXbGB43jD5jv49O5f+Rger1ZVQKWLjOgRbleVxwfZl3FBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:47.119914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02936","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f4ecad262076aaa548a4becb291ab26625d60628f089b8f96d99a67f1158af2","sha256:2d19c3f62f4be89b5cd922dbf6f7079c3a5508a84faf358f135f7c3b25ec6386"],"state_sha256":"fc04dd42c78bc7a0bcb41f3614a9bc6aee7af451772b681b828d479b609f3d45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+WgqXsj/GktjvmfEyiEAJaiGbD+7aDt5jmx98HlyF/BfcJMVPnQTtIESdcFw6qxQm0CsxoT1J2sV1o+QTiOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:32:03.830831Z","bundle_sha256":"a95af99727543be1ac0ab3add5372496c70515e737d62797aefabdf2b56c18b2"}}