{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7SY6FHOYOPJB76F6VU6ONJ4EUT","short_pith_number":"pith:7SY6FHOY","schema_version":"1.0","canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","source":{"kind":"arxiv","id":"1706.02207","version":3},"attestation_state":"computed","paper":{"title":"On The Communication Complexity of High-Dimensional Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Adi Shraibman, and Toniann Pitassi, Nati Linial","submitted_at":"2017-06-07T14:28:30Z","abstract_excerpt":"We study the multiparty communication complexity of high dimensional permutations, in the Number On the Forehead (NOF) model. This model is due to Chandra, Furst and Lipton (CFL) who also gave a nontrivial protocol for the Exactly-n problem where three players receive integer inputs and need to decide if their inputs sum to a given integer $n$. There is a considerable body of literature dealing with the same problem, where $(\\mathbb{N},+)$ is replaced by some other abelian group. Our work can be viewed as a far-reaching extension of this line of work.\n  We show that the known lower bounds for "},"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":"1706.02207","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:28:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a427032f62ecbcc59ceb5246a31da902c8c2e5855107ad36643d1488803fa22","abstract_canon_sha256":"e9cc0b57abcb849d93f32e0d41a5ce0af29c014b9f94c932a278cd0f4401fc4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:53.826802Z","signature_b64":"/Gz9d/k2tmeg7jlRpZO80tSbs+S6w22bBwTias+Gb/zcVgdSWQwpaW8JYPAA8ZUyW3BOID+m1Qp+0Tw7g69PDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","last_reissued_at":"2026-05-17T23:59:53.826132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:53.826132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Communication Complexity of High-Dimensional Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Adi Shraibman, and Toniann Pitassi, Nati Linial","submitted_at":"2017-06-07T14:28:30Z","abstract_excerpt":"We study the multiparty communication complexity of high dimensional permutations, in the Number On the Forehead (NOF) model. This model is due to Chandra, Furst and Lipton (CFL) who also gave a nontrivial protocol for the Exactly-n problem where three players receive integer inputs and need to decide if their inputs sum to a given integer $n$. There is a considerable body of literature dealing with the same problem, where $(\\mathbb{N},+)$ is replaced by some other abelian group. Our work can be viewed as a far-reaching extension of this line of work.\n  We show that the known lower bounds for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02207","kind":"arxiv","version":3},"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":"1706.02207","created_at":"2026-05-17T23:59:53.826229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02207v3","created_at":"2026-05-17T23:59:53.826229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02207","created_at":"2026-05-17T23:59:53.826229+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SY6FHOYOPJB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SY6FHOYOPJB76F6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SY6FHOY","created_at":"2026-05-18T12:31:05.417338+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/7SY6FHOYOPJB76F6VU6ONJ4EUT","json":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT.json","graph_json":"https://pith.science/api/pith-number/7SY6FHOYOPJB76F6VU6ONJ4EUT/graph.json","events_json":"https://pith.science/api/pith-number/7SY6FHOYOPJB76F6VU6ONJ4EUT/events.json","paper":"https://pith.science/paper/7SY6FHOY"},"agent_actions":{"view_html":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT","download_json":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT.json","view_paper":"https://pith.science/paper/7SY6FHOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02207&json=true","fetch_graph":"https://pith.science/api/pith-number/7SY6FHOYOPJB76F6VU6ONJ4EUT/graph.json","fetch_events":"https://pith.science/api/pith-number/7SY6FHOYOPJB76F6VU6ONJ4EUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/action/storage_attestation","attest_author":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/action/author_attestation","sign_citation":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/action/citation_signature","submit_replication":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/action/replication_record"}},"created_at":"2026-05-17T23:59:53.826229+00:00","updated_at":"2026-05-17T23:59:53.826229+00:00"}