{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:7KXOHCPT4UTJTAJGMAAFWNP5OI","short_pith_number":"pith:7KXOHCPT","canonical_record":{"source":{"id":"0908.4453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-08-31T03:40:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"8a923e1f172d3c2c2b8222fe452ac8243f19e76f96542a3d0a6f095a824072c7","abstract_canon_sha256":"29f8275e9f4069e6781e86a051f4a6e7765ed346440d99efd9f32ed7ff8c09dc"},"schema_version":"1.0"},"canonical_sha256":"faaee389f3e52699812660005b35fd7212f57d72677efc8d3f8fa3c617d1e02a","source":{"kind":"arxiv","id":"0908.4453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.4453","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"0908.4453v1","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.4453","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"7KXOHCPT4UTJ","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_16","alias_value":"7KXOHCPT4UTJTAJG","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_8","alias_value":"7KXOHCPT","created_at":"2026-07-04T15:48:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:7KXOHCPT4UTJTAJGMAAFWNP5OI","target":"record","payload":{"canonical_record":{"source":{"id":"0908.4453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-08-31T03:40:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"8a923e1f172d3c2c2b8222fe452ac8243f19e76f96542a3d0a6f095a824072c7","abstract_canon_sha256":"29f8275e9f4069e6781e86a051f4a6e7765ed346440d99efd9f32ed7ff8c09dc"},"schema_version":"1.0"},"canonical_sha256":"faaee389f3e52699812660005b35fd7212f57d72677efc8d3f8fa3c617d1e02a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:48:40.456215Z","signature_b64":"EIVrRZgC61EapsZHwvNX6fWZWfbCkLZrOIWyDq48lqgXc4meUoqAkdcUjDJtDfadGvl9yEMU7y9BrR1bI7AADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faaee389f3e52699812660005b35fd7212f57d72677efc8d3f8fa3c617d1e02a","last_reissued_at":"2026-07-04T15:48:40.455837Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:48:40.455837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.4453","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-07-04T15:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivUBiESB972qjAYRiIrhfEeXMDdRSRkKdv3Oll1z1bj6lkl0yrsFwhO5RJTL3B4Tvfh2kI2ocdX6cgyMpaKTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:14:23.318293Z"},"content_sha256":"8de2854c8e6feecda7f7a2b32bcd8427d6e6f4091d319318f3573497032ff0ed","schema_version":"1.0","event_id":"sha256:8de2854c8e6feecda7f7a2b32bcd8427d6e6f4091d319318f3573497032ff0ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:7KXOHCPT4UTJTAJGMAAFWNP5OI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Hartmut Klauck, Rahul Jain, Shengyu Zhang","submitted_at":"2009-08-31T03:40:57Z","abstract_excerpt":"We show lower bounds of $\\Omega(\\sqrt{n})$ and $\\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of $\\Omega(n/8^d)$ by Leonardos and Saks and $\\Omega(n/2^{\\Omega(d\\log d)})$ by Jayram, Kopparty and Raghavendra for randomized communication complexity of read-once Boolean formulas with depth $d$. We obtain our result by \"embedding\" either the Disjointness problem or its complement in any given read-once Boolean formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.4453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0908.4453/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sk41KRhwBDtogBqcJ44SzktI3j6Oqa47Au9BYvZrGWTfrlU+kZqcrnwhQmJlazYrzDjdOikRhlAkDuhb+QwECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:14:23.318825Z"},"content_sha256":"f2ec1fc4bee3cd93ec125519a6f6b89f1c18ee3f7f8b78b0b434e2ce685d3448","schema_version":"1.0","event_id":"sha256:f2ec1fc4bee3cd93ec125519a6f6b89f1c18ee3f7f8b78b0b434e2ce685d3448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/bundle.json","state_url":"https://pith.science/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/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-08-16T21:14:23Z","links":{"resolver":"https://pith.science/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI","bundle":"https://pith.science/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/bundle.json","state":"https://pith.science/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KXOHCPT4UTJTAJGMAAFWNP5OI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7KXOHCPT4UTJTAJGMAAFWNP5OI","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":"29f8275e9f4069e6781e86a051f4a6e7765ed346440d99efd9f32ed7ff8c09dc","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-08-31T03:40:57Z","title_canon_sha256":"8a923e1f172d3c2c2b8222fe452ac8243f19e76f96542a3d0a6f095a824072c7"},"schema_version":"1.0","source":{"id":"0908.4453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.4453","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"0908.4453v1","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.4453","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"7KXOHCPT4UTJ","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_16","alias_value":"7KXOHCPT4UTJTAJG","created_at":"2026-07-04T15:48:40Z"},{"alias_kind":"pith_short_8","alias_value":"7KXOHCPT","created_at":"2026-07-04T15:48:40Z"}],"graph_snapshots":[{"event_id":"sha256:f2ec1fc4bee3cd93ec125519a6f6b89f1c18ee3f7f8b78b0b434e2ce685d3448","target":"graph","created_at":"2026-07-04T15:48:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0908.4453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show lower bounds of $\\Omega(\\sqrt{n})$ and $\\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of $\\Omega(n/8^d)$ by Leonardos and Saks and $\\Omega(n/2^{\\Omega(d\\log d)})$ by Jayram, Kopparty and Raghavendra for randomized communication complexity of read-once Boolean formulas with depth $d$. We obtain our result by \"embedding\" either the Disjointness problem or its complement in any given read-once Boolean formula.","authors_text":"Hartmut Klauck, Rahul Jain, Shengyu Zhang","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-08-31T03:40:57Z","title":"Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.4453","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:8de2854c8e6feecda7f7a2b32bcd8427d6e6f4091d319318f3573497032ff0ed","target":"record","created_at":"2026-07-04T15:48:40Z","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":"29f8275e9f4069e6781e86a051f4a6e7765ed346440d99efd9f32ed7ff8c09dc","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-08-31T03:40:57Z","title_canon_sha256":"8a923e1f172d3c2c2b8222fe452ac8243f19e76f96542a3d0a6f095a824072c7"},"schema_version":"1.0","source":{"id":"0908.4453","kind":"arxiv","version":1}},"canonical_sha256":"faaee389f3e52699812660005b35fd7212f57d72677efc8d3f8fa3c617d1e02a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faaee389f3e52699812660005b35fd7212f57d72677efc8d3f8fa3c617d1e02a","first_computed_at":"2026-07-04T15:48:40.455837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:48:40.455837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIVrRZgC61EapsZHwvNX6fWZWfbCkLZrOIWyDq48lqgXc4meUoqAkdcUjDJtDfadGvl9yEMU7y9BrR1bI7AADQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:48:40.456215Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.4453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8de2854c8e6feecda7f7a2b32bcd8427d6e6f4091d319318f3573497032ff0ed","sha256:f2ec1fc4bee3cd93ec125519a6f6b89f1c18ee3f7f8b78b0b434e2ce685d3448"],"state_sha256":"e563143e3b3e073b896c09f7d30911cdf2a2ffa42aa2ff6acccbf238066a47c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laTV4W51vN2CFmuXywe8CH6CW7UUl+uH3Ea5XIoJC+UH/UxPuLdRThO5S+MizOaP0mGoKsd2xGAHbNSaZV9sCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:14:23.324083Z","bundle_sha256":"c5b7422fd69930020f6faa2655a343b26720738fa717c1a31be3e9634224c571"}}