{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QHDEETYBOPW664E6K6GAOFLJU4","short_pith_number":"pith:QHDEETYB","canonical_record":{"source":{"id":"2407.01802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-01T20:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"915b41c9023db94c19b45d8200190b535a285f74eab586dc7be2feba104e1341","abstract_canon_sha256":"a802e9913b3a2668e0467e779f2967dcc5b441d45181a5fb3f9d345b4c702d30"},"schema_version":"1.0"},"canonical_sha256":"81c6424f0173edef709e578c071569a70f3887743a6799662c8b19fd0e7fd511","source":{"kind":"arxiv","id":"2407.01802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.01802","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2407.01802v1","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01802","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"QHDEETYBOPW6","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_16","alias_value":"QHDEETYBOPW664E6","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_8","alias_value":"QHDEETYB","created_at":"2026-07-05T08:39:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QHDEETYBOPW664E6K6GAOFLJU4","target":"record","payload":{"canonical_record":{"source":{"id":"2407.01802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-01T20:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"915b41c9023db94c19b45d8200190b535a285f74eab586dc7be2feba104e1341","abstract_canon_sha256":"a802e9913b3a2668e0467e779f2967dcc5b441d45181a5fb3f9d345b4c702d30"},"schema_version":"1.0"},"canonical_sha256":"81c6424f0173edef709e578c071569a70f3887743a6799662c8b19fd0e7fd511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:05.510816Z","signature_b64":"jYbeFCXychk6oTr1usUW0/p00vYL+T+3LRzk1SpGyCmxfP2sj4b2taE9UN7HxOkCWLDVqPFZkKq5UGJ1p90KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c6424f0173edef709e578c071569a70f3887743a6799662c8b19fd0e7fd511","last_reissued_at":"2026-07-05T08:39:05.510371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:05.510371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.01802","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-05T08:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+ANlAWrAjnJxSt3Y4D7ur/nl2qOcFCCJY+Apm6N8YOwuBGAkIbJo15nxlsD1mpBrWgE/UlvOMCwAA31+10bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:20:00.404548Z"},"content_sha256":"59e6938bb14d121c8b974c6abb10ea1a5c2257d5db81a71937514e72646bc2d6","schema_version":"1.0","event_id":"sha256:59e6938bb14d121c8b974c6abb10ea1a5c2257d5db81a71937514e72646bc2d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QHDEETYBOPW664E6K6GAOFLJU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An XOR Lemma for Deterministic Communication Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anup Rao, Siddharth Iyer","submitted_at":"2024-07-01T20:58:34Z","abstract_excerpt":"We prove a lower bound on the communication complexity of computing the $n$-fold xor of an arbitrary function $f$, in terms of the communication complexity and rank of $f$. We prove that $D(f^{\\oplus n}) \\geq n \\cdot \\Big(\\frac{\\Omega(D(f))}{\\log \\mathsf{rk}(f)} -\\log \\mathsf{rk}(f)\\Big )$, where here $D(f), D(f^{\\oplus n})$ represent the deterministic communication complexity, and $\\mathsf{rk}(f)$ is the rank of $f$. Our methods involve a new way to use information theory to reason about deterministic communication complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01802","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/2407.01802/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-05T08:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeSgdPGtaF/PXbUlBiEIYot+Q3dCLYzqzo5Zu35FwO5r02iHWz36qyISQJh5BYq1RFXK75kO7czE/lqHODBvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:20:00.405067Z"},"content_sha256":"974ddc5f4d707be116d64e2f42844d8948ed98fe0d061e9d65a9f0e606eec733","schema_version":"1.0","event_id":"sha256:974ddc5f4d707be116d64e2f42844d8948ed98fe0d061e9d65a9f0e606eec733"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHDEETYBOPW664E6K6GAOFLJU4/bundle.json","state_url":"https://pith.science/pith/QHDEETYBOPW664E6K6GAOFLJU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHDEETYBOPW664E6K6GAOFLJU4/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-22T02:20:00Z","links":{"resolver":"https://pith.science/pith/QHDEETYBOPW664E6K6GAOFLJU4","bundle":"https://pith.science/pith/QHDEETYBOPW664E6K6GAOFLJU4/bundle.json","state":"https://pith.science/pith/QHDEETYBOPW664E6K6GAOFLJU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHDEETYBOPW664E6K6GAOFLJU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QHDEETYBOPW664E6K6GAOFLJU4","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":"a802e9913b3a2668e0467e779f2967dcc5b441d45181a5fb3f9d345b4c702d30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-01T20:58:34Z","title_canon_sha256":"915b41c9023db94c19b45d8200190b535a285f74eab586dc7be2feba104e1341"},"schema_version":"1.0","source":{"id":"2407.01802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.01802","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2407.01802v1","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01802","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"QHDEETYBOPW6","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_16","alias_value":"QHDEETYBOPW664E6","created_at":"2026-07-05T08:39:05Z"},{"alias_kind":"pith_short_8","alias_value":"QHDEETYB","created_at":"2026-07-05T08:39:05Z"}],"graph_snapshots":[{"event_id":"sha256:974ddc5f4d707be116d64e2f42844d8948ed98fe0d061e9d65a9f0e606eec733","target":"graph","created_at":"2026-07-05T08:39:05Z","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/2407.01802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a lower bound on the communication complexity of computing the $n$-fold xor of an arbitrary function $f$, in terms of the communication complexity and rank of $f$. We prove that $D(f^{\\oplus n}) \\geq n \\cdot \\Big(\\frac{\\Omega(D(f))}{\\log \\mathsf{rk}(f)} -\\log \\mathsf{rk}(f)\\Big )$, where here $D(f), D(f^{\\oplus n})$ represent the deterministic communication complexity, and $\\mathsf{rk}(f)$ is the rank of $f$. Our methods involve a new way to use information theory to reason about deterministic communication complexity.","authors_text":"Anup Rao, Siddharth Iyer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-01T20:58:34Z","title":"An XOR Lemma for Deterministic Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01802","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:59e6938bb14d121c8b974c6abb10ea1a5c2257d5db81a71937514e72646bc2d6","target":"record","created_at":"2026-07-05T08:39:05Z","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":"a802e9913b3a2668e0467e779f2967dcc5b441d45181a5fb3f9d345b4c702d30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-01T20:58:34Z","title_canon_sha256":"915b41c9023db94c19b45d8200190b535a285f74eab586dc7be2feba104e1341"},"schema_version":"1.0","source":{"id":"2407.01802","kind":"arxiv","version":1}},"canonical_sha256":"81c6424f0173edef709e578c071569a70f3887743a6799662c8b19fd0e7fd511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81c6424f0173edef709e578c071569a70f3887743a6799662c8b19fd0e7fd511","first_computed_at":"2026-07-05T08:39:05.510371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:05.510371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYbeFCXychk6oTr1usUW0/p00vYL+T+3LRzk1SpGyCmxfP2sj4b2taE9UN7HxOkCWLDVqPFZkKq5UGJ1p90KAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:05.510816Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.01802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59e6938bb14d121c8b974c6abb10ea1a5c2257d5db81a71937514e72646bc2d6","sha256:974ddc5f4d707be116d64e2f42844d8948ed98fe0d061e9d65a9f0e606eec733"],"state_sha256":"cde07af1032e4898ced52f71980659bf062bc995e6079d346c46850393d0b249"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7B152d0Mx7QmgHKiAoZp6WL+L7FWTkSyDU/2nrPxMb2fMeVg4HVDfJ1r88CY0PRpMP0SLsTCm0j8yF0Fz2LoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T02:20:00.410880Z","bundle_sha256":"5f674e0275efbb63442386c68a034da15db27ed3183b119ac82d12707598259f"}}