{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GNLHAT5YG3J7NTWDUSOHFZ4J7S","short_pith_number":"pith:GNLHAT5Y","canonical_record":{"source":{"id":"1307.6738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-25T13:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a11f02acc00344a5cffde51e5c91c1693ae337b6c47b0eec3c1cd24a0dc88c4","abstract_canon_sha256":"c6b29d8a0da338fa6595ac94b636375e3cc6fe0fdf1a7533e26f1b741ff3fdf9"},"schema_version":"1.0"},"canonical_sha256":"3356704fb836d3f6cec3a49c72e789fca33e9a418f80fc02cdf679b399aa9e9f","source":{"kind":"arxiv","id":"1307.6738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6738","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6738v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6738","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"GNLHAT5YG3J7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNLHAT5YG3J7NTWD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNLHAT5Y","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GNLHAT5YG3J7NTWDUSOHFZ4J7S","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-25T13:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a11f02acc00344a5cffde51e5c91c1693ae337b6c47b0eec3c1cd24a0dc88c4","abstract_canon_sha256":"c6b29d8a0da338fa6595ac94b636375e3cc6fe0fdf1a7533e26f1b741ff3fdf9"},"schema_version":"1.0"},"canonical_sha256":"3356704fb836d3f6cec3a49c72e789fca33e9a418f80fc02cdf679b399aa9e9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.817864Z","signature_b64":"kXD985e5UIqVPJWuSrVKQc0qOMksM1T4dCoKWRgAGHangVqaURGaFggYy/Ry7yQMiM9EEjSwTUiLy/tL9lD1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3356704fb836d3f6cec3a49c72e789fca33e9a418f80fc02cdf679b399aa9e9f","last_reissued_at":"2026-05-18T03:17:34.817240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.817240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6738","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-05-18T03:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoHaP8tEnpRJniCE5DZie0F8vjxdDLEAFsVJS6hskewG1CPSGlnRnyU42WwPNl+mHvOWR7sxhEP2KyY/dhKuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:17:54.753911Z"},"content_sha256":"a9aaafdbb622ef6fa5322aae6e366f8434eb37e27158fa41eb807f8374c869e5","schema_version":"1.0","event_id":"sha256:a9aaafdbb622ef6fa5322aae6e366f8434eb37e27158fa41eb807f8374c869e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GNLHAT5YG3J7NTWDUSOHFZ4J7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient quantum protocols for XOR functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Shengyu Zhang","submitted_at":"2013-07-25T13:37:44Z","abstract_excerpt":"We show that for any Boolean function f on {0,1}^n, the bounded-error quantum communication complexity of XOR functions $f\\circ \\oplus$ satisfies that $Q_\\epsilon(f\\circ \\oplus) = O(2^d (\\log\\|\\hat f\\|_{1,\\epsilon} + \\log \\frac{n}{\\epsilon}) \\log(1/\\epsilon))$, where d is the F2-degree of f, and $\\|\\hat f\\|_{1,\\epsilon} = \\min_{g:\\|f-g\\|_\\infty \\leq \\epsilon} \\|\\hat f\\|_1$. This implies that the previous lower bound $Q_\\epsilon(f\\circ \\oplus) = \\Omega(\\log\\|\\hat f\\|_{1,\\epsilon})$ by Lee and Shraibman \\cite{LS09} is tight for f with low F2-degree. The result also confirms the quantum version o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6738","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":""},"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:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTTQkVzXaGHlQgRXzCizSZ/KjQ78MddAATZcldOaZZScs3XiZzq/8dtRTGWVmsMaCHGtoOd2udoDg4b7WOKSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:17:54.754418Z"},"content_sha256":"158146128e8b66e3989f8080abb753886f3ecc999f5422483a62d483743434c4","schema_version":"1.0","event_id":"sha256:158146128e8b66e3989f8080abb753886f3ecc999f5422483a62d483743434c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/bundle.json","state_url":"https://pith.science/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/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-27T14:17:54Z","links":{"resolver":"https://pith.science/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S","bundle":"https://pith.science/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/bundle.json","state":"https://pith.science/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNLHAT5YG3J7NTWDUSOHFZ4J7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GNLHAT5YG3J7NTWDUSOHFZ4J7S","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":"c6b29d8a0da338fa6595ac94b636375e3cc6fe0fdf1a7533e26f1b741ff3fdf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-25T13:37:44Z","title_canon_sha256":"5a11f02acc00344a5cffde51e5c91c1693ae337b6c47b0eec3c1cd24a0dc88c4"},"schema_version":"1.0","source":{"id":"1307.6738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6738","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6738v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6738","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"GNLHAT5YG3J7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNLHAT5YG3J7NTWD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNLHAT5Y","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:158146128e8b66e3989f8080abb753886f3ecc999f5422483a62d483743434c4","target":"graph","created_at":"2026-05-18T03:17:34Z","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 show that for any Boolean function f on {0,1}^n, the bounded-error quantum communication complexity of XOR functions $f\\circ \\oplus$ satisfies that $Q_\\epsilon(f\\circ \\oplus) = O(2^d (\\log\\|\\hat f\\|_{1,\\epsilon} + \\log \\frac{n}{\\epsilon}) \\log(1/\\epsilon))$, where d is the F2-degree of f, and $\\|\\hat f\\|_{1,\\epsilon} = \\min_{g:\\|f-g\\|_\\infty \\leq \\epsilon} \\|\\hat f\\|_1$. This implies that the previous lower bound $Q_\\epsilon(f\\circ \\oplus) = \\Omega(\\log\\|\\hat f\\|_{1,\\epsilon})$ by Lee and Shraibman \\cite{LS09} is tight for f with low F2-degree. The result also confirms the quantum version o","authors_text":"Shengyu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-25T13:37:44Z","title":"Efficient quantum protocols for XOR functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6738","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:a9aaafdbb622ef6fa5322aae6e366f8434eb37e27158fa41eb807f8374c869e5","target":"record","created_at":"2026-05-18T03:17:34Z","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":"c6b29d8a0da338fa6595ac94b636375e3cc6fe0fdf1a7533e26f1b741ff3fdf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-25T13:37:44Z","title_canon_sha256":"5a11f02acc00344a5cffde51e5c91c1693ae337b6c47b0eec3c1cd24a0dc88c4"},"schema_version":"1.0","source":{"id":"1307.6738","kind":"arxiv","version":1}},"canonical_sha256":"3356704fb836d3f6cec3a49c72e789fca33e9a418f80fc02cdf679b399aa9e9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3356704fb836d3f6cec3a49c72e789fca33e9a418f80fc02cdf679b399aa9e9f","first_computed_at":"2026-05-18T03:17:34.817240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:34.817240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXD985e5UIqVPJWuSrVKQc0qOMksM1T4dCoKWRgAGHangVqaURGaFggYy/Ry7yQMiM9EEjSwTUiLy/tL9lD1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:34.817864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9aaafdbb622ef6fa5322aae6e366f8434eb37e27158fa41eb807f8374c869e5","sha256:158146128e8b66e3989f8080abb753886f3ecc999f5422483a62d483743434c4"],"state_sha256":"0829f998876a86b157ad7bde130d3852ffd86bd27e97affc30b01cde3c2de802"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxSo3MUZs+8q3Y8MXR0jXn5mitZHaoKZNVU+kX4QIlm86brfrUuZypQp2cEb7w3ZMDjhkIiIFXpSijj/UribAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:17:54.757537Z","bundle_sha256":"bbd34f0a523eb2685db31b2902d18ad67640d67bbd6267a888ce3e9ed4f2d883"}}