{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HW2JICSXRZHFBRVLU4AOA7FPFG","short_pith_number":"pith:HW2JICSX","schema_version":"1.0","canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","source":{"kind":"arxiv","id":"1506.00273","version":1},"attestation_state":"computed","paper":{"title":"Communication Complexity of Permutation-Invariant Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, Madhu Sudan, Pritish Kamath","submitted_at":"2015-05-31T19:13:58Z","abstract_excerpt":"Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of \"permutation-invariant\" functions. A partial function $f:\\{0,1\\}^n \\times \\{0,1\\}^n\\to \\{0,1,?\\}$ is permutation-invariant if for every bijection $\\pi:\\{1,\\ldots,n\\} \\to \\{1,\\ldots,n\\}$ and every $\\mathbf{x}, \\mathbf{y} \\in \\{0,1\\}^n$, it is the case that $f(\\mathbf{x}, \\mathbf{y}) = f(\\mathbf{x}^{\\pi}, \\mathbf{y}^{\\pi})$. Most of the commonly studied functions in communication complexity are permutation-invariant. For such functions, we present a simple complexity meas"},"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":"1506.00273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-31T19:13:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8fa035bd84a0c5ce8aa4a1258dd31b098af44f154c8aa1677a100be1e7ee2bce","abstract_canon_sha256":"068df5f8e1bd1bc071e896875794f88d2d77b26f0da0b2f7bfcef5a60b298405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.025450Z","signature_b64":"RwZUUwQubLehAUlVsZbyb7TmeuBIo7fxtP4XmafbFRidHCo1Ri40RIppHh9AE6/WhsEw3V1cAIsENA87FPCJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","last_reissued_at":"2026-05-18T01:59:55.024967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.024967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Complexity of Permutation-Invariant Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, Madhu Sudan, Pritish Kamath","submitted_at":"2015-05-31T19:13:58Z","abstract_excerpt":"Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of \"permutation-invariant\" functions. A partial function $f:\\{0,1\\}^n \\times \\{0,1\\}^n\\to \\{0,1,?\\}$ is permutation-invariant if for every bijection $\\pi:\\{1,\\ldots,n\\} \\to \\{1,\\ldots,n\\}$ and every $\\mathbf{x}, \\mathbf{y} \\in \\{0,1\\}^n$, it is the case that $f(\\mathbf{x}, \\mathbf{y}) = f(\\mathbf{x}^{\\pi}, \\mathbf{y}^{\\pi})$. Most of the commonly studied functions in communication complexity are permutation-invariant. For such functions, we present a simple complexity meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00273","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00273","created_at":"2026-05-18T01:59:55.025043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00273v1","created_at":"2026-05-18T01:59:55.025043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00273","created_at":"2026-05-18T01:59:55.025043+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW2JICSXRZHF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW2JICSXRZHFBRVL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW2JICSX","created_at":"2026-05-18T12:29:25.134429+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/HW2JICSXRZHFBRVLU4AOA7FPFG","json":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG.json","graph_json":"https://pith.science/api/pith-number/HW2JICSXRZHFBRVLU4AOA7FPFG/graph.json","events_json":"https://pith.science/api/pith-number/HW2JICSXRZHFBRVLU4AOA7FPFG/events.json","paper":"https://pith.science/paper/HW2JICSX"},"agent_actions":{"view_html":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG","download_json":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG.json","view_paper":"https://pith.science/paper/HW2JICSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00273&json=true","fetch_graph":"https://pith.science/api/pith-number/HW2JICSXRZHFBRVLU4AOA7FPFG/graph.json","fetch_events":"https://pith.science/api/pith-number/HW2JICSXRZHFBRVLU4AOA7FPFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/action/storage_attestation","attest_author":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/action/author_attestation","sign_citation":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/action/citation_signature","submit_replication":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/action/replication_record"}},"created_at":"2026-05-18T01:59:55.025043+00:00","updated_at":"2026-05-18T01:59:55.025043+00:00"}