{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:HL257YARLCGFEWVRNZAMSTMGEY","short_pith_number":"pith:HL257YAR","schema_version":"1.0","canonical_sha256":"3af5dfe011588c525ab16e40c94d86262735a93818c0a6526396ef6daeecdc45","source":{"kind":"arxiv","id":"0903.2179","version":2},"attestation_state":"computed","paper":{"title":"Non-Local Box Complexity and Secure Function Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Iordanis Kerenidis, J\\'er\\'emie Roland, Marc Kaplan, Sophie Laplante","submitted_at":"2009-03-12T14:41:50Z","abstract_excerpt":"A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function f. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and rando"},"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":"0903.2179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-12T14:41:50Z","cross_cats_sorted":[],"title_canon_sha256":"84fcbd823db1db97c2ef6a83ee4e5999d58b174118b357f79d07320867273ea8","abstract_canon_sha256":"f415c366bc25925ec6014cdbc69fb7dff285743c5ec3af15c93145833bfd2ae5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:50.592354Z","signature_b64":"UQuM0tu8/onNXJA3VeellSmfy5hfZiobUm0el6PceL5SUTpD/RTCetQzmEyST/kbQfN4pV8dJ3eGKdBZX5GzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3af5dfe011588c525ab16e40c94d86262735a93818c0a6526396ef6daeecdc45","last_reissued_at":"2026-05-18T04:15:50.591845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:50.591845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Local Box Complexity and Secure Function Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Iordanis Kerenidis, J\\'er\\'emie Roland, Marc Kaplan, Sophie Laplante","submitted_at":"2009-03-12T14:41:50Z","abstract_excerpt":"A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function f. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2179","kind":"arxiv","version":2},"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":"0903.2179","created_at":"2026-05-18T04:15:50.591919+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2179v2","created_at":"2026-05-18T04:15:50.591919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2179","created_at":"2026-05-18T04:15:50.591919+00:00"},{"alias_kind":"pith_short_12","alias_value":"HL257YARLCGF","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"HL257YARLCGFEWVR","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"HL257YAR","created_at":"2026-05-18T12:25:59.703012+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/HL257YARLCGFEWVRNZAMSTMGEY","json":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY.json","graph_json":"https://pith.science/api/pith-number/HL257YARLCGFEWVRNZAMSTMGEY/graph.json","events_json":"https://pith.science/api/pith-number/HL257YARLCGFEWVRNZAMSTMGEY/events.json","paper":"https://pith.science/paper/HL257YAR"},"agent_actions":{"view_html":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY","download_json":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY.json","view_paper":"https://pith.science/paper/HL257YAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2179&json=true","fetch_graph":"https://pith.science/api/pith-number/HL257YARLCGFEWVRNZAMSTMGEY/graph.json","fetch_events":"https://pith.science/api/pith-number/HL257YARLCGFEWVRNZAMSTMGEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY/action/storage_attestation","attest_author":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY/action/author_attestation","sign_citation":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY/action/citation_signature","submit_replication":"https://pith.science/pith/HL257YARLCGFEWVRNZAMSTMGEY/action/replication_record"}},"created_at":"2026-05-18T04:15:50.591919+00:00","updated_at":"2026-05-18T04:15:50.591919+00:00"}