{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HW2JICSXRZHFBRVLU4AOA7FPFG","short_pith_number":"pith:HW2JICSX","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"},"canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","source":{"kind":"arxiv","id":"1506.00273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00273","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00273v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00273","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"HW2JICSXRZHF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HW2JICSXRZHFBRVL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HW2JICSX","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HW2JICSXRZHFBRVLU4AOA7FPFG","target":"record","payload":{"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"},"canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","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"},"source_kind":"arxiv","source_id":"1506.00273","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxuVE4jnaqESqE/sGXVnyRFRPb4Agcfrln8puaUmF0hEiWdhIl45qkupOzmY8Ttvx9qIi8K4653I6icJjCw8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:40.602001Z"},"content_sha256":"1f4904fc7cb14d46e27b3cecba600c2ee6f6f22676662283338aa1d281f23149","schema_version":"1.0","event_id":"sha256:1f4904fc7cb14d46e27b3cecba600c2ee6f6f22676662283338aa1d281f23149"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HW2JICSXRZHFBRVLU4AOA7FPFG","target":"graph","payload":{"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"},"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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5VT0KugCHrxSKPDEWxmEIo/Vbm/UAwD1vM3K8aHKst1zD5prMhVFEqCmhl7ZNRj/6sjNJrJBj015rP37JVoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:40.602682Z"},"content_sha256":"4f4e18a9c6a540fde0cc99f5d9969a7988457e1c04bc9f8c9ead9bb35af65f91","schema_version":"1.0","event_id":"sha256:4f4e18a9c6a540fde0cc99f5d9969a7988457e1c04bc9f8c9ead9bb35af65f91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/bundle.json","state_url":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/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-26T19:06:40Z","links":{"resolver":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG","bundle":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/bundle.json","state":"https://pith.science/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HW2JICSXRZHFBRVLU4AOA7FPFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HW2JICSXRZHFBRVLU4AOA7FPFG","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":"068df5f8e1bd1bc071e896875794f88d2d77b26f0da0b2f7bfcef5a60b298405","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-31T19:13:58Z","title_canon_sha256":"8fa035bd84a0c5ce8aa4a1258dd31b098af44f154c8aa1677a100be1e7ee2bce"},"schema_version":"1.0","source":{"id":"1506.00273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00273","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00273v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00273","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"HW2JICSXRZHF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HW2JICSXRZHFBRVL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HW2JICSX","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:4f4e18a9c6a540fde0cc99f5d9969a7988457e1c04bc9f8c9ead9bb35af65f91","target":"graph","created_at":"2026-05-18T01:59:55Z","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":"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","authors_text":"Badih Ghazi, Madhu Sudan, Pritish Kamath","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-31T19:13:58Z","title":"Communication Complexity of Permutation-Invariant Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00273","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:1f4904fc7cb14d46e27b3cecba600c2ee6f6f22676662283338aa1d281f23149","target":"record","created_at":"2026-05-18T01:59:55Z","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":"068df5f8e1bd1bc071e896875794f88d2d77b26f0da0b2f7bfcef5a60b298405","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-31T19:13:58Z","title_canon_sha256":"8fa035bd84a0c5ce8aa4a1258dd31b098af44f154c8aa1677a100be1e7ee2bce"},"schema_version":"1.0","source":{"id":"1506.00273","kind":"arxiv","version":1}},"canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db4940a578e4e50c6aba700e07caf29a94e5adf8929e949022891c1eef70f98","first_computed_at":"2026-05-18T01:59:55.024967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.024967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RwZUUwQubLehAUlVsZbyb7TmeuBIo7fxtP4XmafbFRidHCo1Ri40RIppHh9AE6/WhsEw3V1cAIsENA87FPCJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.025450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f4904fc7cb14d46e27b3cecba600c2ee6f6f22676662283338aa1d281f23149","sha256:4f4e18a9c6a540fde0cc99f5d9969a7988457e1c04bc9f8c9ead9bb35af65f91"],"state_sha256":"6f25108963a9b6c7b174674f719f88e1ef1f7d4a99e264e414a092e31fa92c51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lc2p2rsgkBNYk1rgpTduVjuassRoeKCUSfXB3QTQm9C30L1dioBM+yQD+RC4uKp2CNOOQ/GggFBCBQuj28XBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:40.606275Z","bundle_sha256":"b8d5f09ccf465a8a858083b345dd1daca5232bcc843b90254888d28856027c92"}}