{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7SY6FHOYOPJB76F6VU6ONJ4EUT","short_pith_number":"pith:7SY6FHOY","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"},"canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","source":{"kind":"arxiv","id":"1706.02207","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02207","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02207v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02207","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"7SY6FHOYOPJB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7SY6FHOYOPJB76F6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7SY6FHOY","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7SY6FHOYOPJB76F6VU6ONJ4EUT","target":"record","payload":{"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"},"canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","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"},"source_kind":"arxiv","source_id":"1706.02207","source_version":3,"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ev9c5iQ3UWKGiKTEGE1FkhttKCiuFiCpzAx43Qt+wm9HSXdkyVxTgqVUMFJxBkaWm3qMOacPx9HyCo+C8bMaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:04:21.641221Z"},"content_sha256":"f500cb21a97a7c624883de70779d7299cc087bf5cdb2df165b4ca1365c96a662","schema_version":"1.0","event_id":"sha256:f500cb21a97a7c624883de70779d7299cc087bf5cdb2df165b4ca1365c96a662"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7SY6FHOYOPJB76F6VU6ONJ4EUT","target":"graph","payload":{"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"},"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PE3PHz0hyVdgyuiWv9oE3iIS+pue5x4HpBC6B/GniXKwST63X5YwElm9s2UX829LoF8pg9IcN9XebVxTPzqZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:04:21.641882Z"},"content_sha256":"19793987304abab42597728870e3b64a844d83b63c9c4c3ddeefbb428e8025c7","schema_version":"1.0","event_id":"sha256:19793987304abab42597728870e3b64a844d83b63c9c4c3ddeefbb428e8025c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/bundle.json","state_url":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/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-27T13:04:21Z","links":{"resolver":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT","bundle":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/bundle.json","state":"https://pith.science/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SY6FHOYOPJB76F6VU6ONJ4EUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7SY6FHOYOPJB76F6VU6ONJ4EUT","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":"e9cc0b57abcb849d93f32e0d41a5ce0af29c014b9f94c932a278cd0f4401fc4f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:28:30Z","title_canon_sha256":"0a427032f62ecbcc59ceb5246a31da902c8c2e5855107ad36643d1488803fa22"},"schema_version":"1.0","source":{"id":"1706.02207","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02207","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02207v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02207","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"7SY6FHOYOPJB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7SY6FHOYOPJB76F6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7SY6FHOY","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:19793987304abab42597728870e3b64a844d83b63c9c4c3ddeefbb428e8025c7","target":"graph","created_at":"2026-05-17T23:59:53Z","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 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 ","authors_text":"Adi Shraibman, and Toniann Pitassi, Nati Linial","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:28:30Z","title":"On The Communication Complexity of High-Dimensional Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02207","kind":"arxiv","version":3},"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:f500cb21a97a7c624883de70779d7299cc087bf5cdb2df165b4ca1365c96a662","target":"record","created_at":"2026-05-17T23:59:53Z","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":"e9cc0b57abcb849d93f32e0d41a5ce0af29c014b9f94c932a278cd0f4401fc4f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:28:30Z","title_canon_sha256":"0a427032f62ecbcc59ceb5246a31da902c8c2e5855107ad36643d1488803fa22"},"schema_version":"1.0","source":{"id":"1706.02207","kind":"arxiv","version":3}},"canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb1e29dd873d21ff8bead3ce6a784a4f64267323737b1bd40b8516dd6bef1ae","first_computed_at":"2026-05-17T23:59:53.826132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:53.826132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Gz9d/k2tmeg7jlRpZO80tSbs+S6w22bBwTias+Gb/zcVgdSWQwpaW8JYPAA8ZUyW3BOID+m1Qp+0Tw7g69PDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:53.826802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02207","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f500cb21a97a7c624883de70779d7299cc087bf5cdb2df165b4ca1365c96a662","sha256:19793987304abab42597728870e3b64a844d83b63c9c4c3ddeefbb428e8025c7"],"state_sha256":"ed15d2d594dfda3d819672f81b6dcd48dbf9f1bdc39e87a34f82100b0411af1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdffXp8SYvpQ9/woQ8PH5FxBO/PdhrtyXfAFNSgS437ex2zcNUeYM2Q348ikOtgenHc4xJg7jc5gQxLVRSZvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:04:21.645726Z","bundle_sha256":"6ab0073f08acaf55cb58384a9f4bdd853a9ba6a372df9750a8cd94ccfde2a87a"}}