{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZEXTO4HWYXMO6B4DG77PZLTA3G","short_pith_number":"pith:ZEXTO4HW","canonical_record":{"source":{"id":"1604.05663","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-18T14:07:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6f5b85543184218e33e3ce5747171837a9e709e1a2c3f33472485dcfac60bf76","abstract_canon_sha256":"2e49225dd2b68e4daa4378133f189332d6e4b9c781a5d745aa5eeaaf19134b53"},"schema_version":"1.0"},"canonical_sha256":"c92f3770f6c5d8ef078337fefcae60d99e4e301a9d67edfa61a37f04afe77b5d","source":{"kind":"arxiv","id":"1604.05663","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05663","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05663v6","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05663","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZEXTO4HWYXMO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZEXTO4HWYXMO6B4D","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZEXTO4HW","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZEXTO4HWYXMO6B4DG77PZLTA3G","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05663","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-18T14:07:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6f5b85543184218e33e3ce5747171837a9e709e1a2c3f33472485dcfac60bf76","abstract_canon_sha256":"2e49225dd2b68e4daa4378133f189332d6e4b9c781a5d745aa5eeaaf19134b53"},"schema_version":"1.0"},"canonical_sha256":"c92f3770f6c5d8ef078337fefcae60d99e4e301a9d67edfa61a37f04afe77b5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:46.587504Z","signature_b64":"2ZH5GMprHVdGXkzF8oGoFnimY6QI2kzp4sm6vqlauZRQqpzqr+H1cFkc0NUUaHgnTyTlhlSDlFvzpgxnfAHjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c92f3770f6c5d8ef078337fefcae60d99e4e301a9d67edfa61a37f04afe77b5d","last_reissued_at":"2026-05-18T00:55:46.586827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:46.586827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05663","source_version":6,"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-18T00:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgvQDdud6//L9Ffc5VpqTDakuqVWG386Dk2NM7PJgrJ1EVfFQFy+nwMM93W28eb6jTBfzYYvw/sclssZbOFjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:25:43.878599Z"},"content_sha256":"afa91c996f162e9345e0233e6eda1ab24e8a857c154c2a8e24c0ffeb4100f129","schema_version":"1.0","event_id":"sha256:afa91c996f162e9345e0233e6eda1ab24e8a857c154c2a8e24c0ffeb4100f129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZEXTO4HWYXMO6B4DG77PZLTA3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Three-input Majority Function as the Unique Optimal Function for the Bias Amplification using Nonlocal Boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ryuhei Mori","submitted_at":"2016-04-18T14:07:44Z","abstract_excerpt":"Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)] showed that shared nonlocal boxes with the CHSH probability greater than $\\frac{3+\\sqrt{6}}6$ yields trivial communication complexity. There still exists the gap with the maximum CHSH probability $\\frac{2+\\sqrt{2}}4$ achievable by quantum mechanics. It is an interesting open question to determine the exact threshold for the trivial communication complexity. Brassard et al.'s idea is based on the recursive bias amplification by the 3-input majority function. It was not obvious if other choice of function exhibits stronger bias amplification. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05663","kind":"arxiv","version":6},"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-18T00:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lmrUrd2HfgWfjMkq+TKkWXQbRwtCN1MPQ6Rh6DuaYWb4WEyQRBdoHV1lXlUY/c8yrYwpMCyEAYH2pWm6cp/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:25:43.879333Z"},"content_sha256":"4329d7e0d9ac86f474e5f4289e3a91210f5a2300f6e0b92b4cb060b0c4144c97","schema_version":"1.0","event_id":"sha256:4329d7e0d9ac86f474e5f4289e3a91210f5a2300f6e0b92b4cb060b0c4144c97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/bundle.json","state_url":"https://pith.science/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/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-26T09:25:43Z","links":{"resolver":"https://pith.science/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G","bundle":"https://pith.science/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/bundle.json","state":"https://pith.science/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEXTO4HWYXMO6B4DG77PZLTA3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZEXTO4HWYXMO6B4DG77PZLTA3G","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":"2e49225dd2b68e4daa4378133f189332d6e4b9c781a5d745aa5eeaaf19134b53","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-18T14:07:44Z","title_canon_sha256":"6f5b85543184218e33e3ce5747171837a9e709e1a2c3f33472485dcfac60bf76"},"schema_version":"1.0","source":{"id":"1604.05663","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05663","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05663v6","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05663","created_at":"2026-05-18T00:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZEXTO4HWYXMO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZEXTO4HWYXMO6B4D","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZEXTO4HW","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:4329d7e0d9ac86f474e5f4289e3a91210f5a2300f6e0b92b4cb060b0c4144c97","target":"graph","created_at":"2026-05-18T00:55:46Z","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":"Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)] showed that shared nonlocal boxes with the CHSH probability greater than $\\frac{3+\\sqrt{6}}6$ yields trivial communication complexity. There still exists the gap with the maximum CHSH probability $\\frac{2+\\sqrt{2}}4$ achievable by quantum mechanics. It is an interesting open question to determine the exact threshold for the trivial communication complexity. Brassard et al.'s idea is based on the recursive bias amplification by the 3-input majority function. It was not obvious if other choice of function exhibits stronger bias amplification. ","authors_text":"Ryuhei Mori","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-18T14:07:44Z","title":"Three-input Majority Function as the Unique Optimal Function for the Bias Amplification using Nonlocal Boxes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05663","kind":"arxiv","version":6},"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:afa91c996f162e9345e0233e6eda1ab24e8a857c154c2a8e24c0ffeb4100f129","target":"record","created_at":"2026-05-18T00:55:46Z","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":"2e49225dd2b68e4daa4378133f189332d6e4b9c781a5d745aa5eeaaf19134b53","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-18T14:07:44Z","title_canon_sha256":"6f5b85543184218e33e3ce5747171837a9e709e1a2c3f33472485dcfac60bf76"},"schema_version":"1.0","source":{"id":"1604.05663","kind":"arxiv","version":6}},"canonical_sha256":"c92f3770f6c5d8ef078337fefcae60d99e4e301a9d67edfa61a37f04afe77b5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c92f3770f6c5d8ef078337fefcae60d99e4e301a9d67edfa61a37f04afe77b5d","first_computed_at":"2026-05-18T00:55:46.586827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:46.586827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ZH5GMprHVdGXkzF8oGoFnimY6QI2kzp4sm6vqlauZRQqpzqr+H1cFkc0NUUaHgnTyTlhlSDlFvzpgxnfAHjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:46.587504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05663","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afa91c996f162e9345e0233e6eda1ab24e8a857c154c2a8e24c0ffeb4100f129","sha256:4329d7e0d9ac86f474e5f4289e3a91210f5a2300f6e0b92b4cb060b0c4144c97"],"state_sha256":"5293e6bde8b912e1ddc86c9c35de7a05726fad934d97692aa64e154a43515c36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D24wpuVtqUKSYQo45ljNwQrTYLse8vMTl7+XwROgE266loIMiWH26b72JcPkJ+/mJgkT8M3T0jJQy5qiPW6rCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:25:43.883161Z","bundle_sha256":"a6217e13c2faad9ed952f2eace324fe6d46c8994d478a1bc61a559cecfe2bc9b"}}