{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UQG47APUBRKASOZDOAI42OJFQC","short_pith_number":"pith:UQG47APU","schema_version":"1.0","canonical_sha256":"a40dcf81f40c54093b237011cd39258085a41284de1bde25fa7288a0489382ce","source":{"kind":"arxiv","id":"1704.00777","version":2},"attestation_state":"computed","paper":{"title":"The Unbounded-Error Communication Complexity of symmetric XOR functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hamed Hatami, Yingjie Qian","submitted_at":"2017-04-03T19:25:23Z","abstract_excerpt":"Settling a conjecture of Shi and Zhang, we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.00777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-03T19:25:23Z","cross_cats_sorted":[],"title_canon_sha256":"efd4b29ef89d38973a6fc8431db57b02813cfa00d7f6885eeb6c0488114bfcb8","abstract_canon_sha256":"df02388e0184e9ea3aeaa37d8e0d69e872caadea291e43c8ca8f5d347ce12391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.360540Z","signature_b64":"8GuUNMPrSZnklaBaYAtIYepQY2PN+/fV5DmbFHfr+LixDSGDcToK5BFtuVbPhbdnrF9CDlcuI8/IwZf0kydtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40dcf81f40c54093b237011cd39258085a41284de1bde25fa7288a0489382ce","last_reissued_at":"2026-05-18T00:46:18.360065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.360065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Unbounded-Error Communication Complexity of symmetric XOR functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hamed Hatami, Yingjie Qian","submitted_at":"2017-04-03T19:25:23Z","abstract_excerpt":"Settling a conjecture of Shi and Zhang, we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00777","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00777","created_at":"2026-05-18T00:46:18.360134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00777v2","created_at":"2026-05-18T00:46:18.360134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00777","created_at":"2026-05-18T00:46:18.360134+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQG47APUBRKA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQG47APUBRKASOZD","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQG47APU","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC","json":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC.json","graph_json":"https://pith.science/api/pith-number/UQG47APUBRKASOZDOAI42OJFQC/graph.json","events_json":"https://pith.science/api/pith-number/UQG47APUBRKASOZDOAI42OJFQC/events.json","paper":"https://pith.science/paper/UQG47APU"},"agent_actions":{"view_html":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC","download_json":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC.json","view_paper":"https://pith.science/paper/UQG47APU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00777&json=true","fetch_graph":"https://pith.science/api/pith-number/UQG47APUBRKASOZDOAI42OJFQC/graph.json","fetch_events":"https://pith.science/api/pith-number/UQG47APUBRKASOZDOAI42OJFQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC/action/storage_attestation","attest_author":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC/action/author_attestation","sign_citation":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC/action/citation_signature","submit_replication":"https://pith.science/pith/UQG47APUBRKASOZDOAI42OJFQC/action/replication_record"}},"created_at":"2026-05-18T00:46:18.360134+00:00","updated_at":"2026-05-18T00:46:18.360134+00:00"}