{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FREK7NPCVDSWLXBAW5RJJNPLCZ","short_pith_number":"pith:FREK7NPC","schema_version":"1.0","canonical_sha256":"2c48afb5e2a8e565dc20b76294b5eb167b46682c103cd3dad77b7dfc0a54f076","source":{"kind":"arxiv","id":"2203.05372","version":2},"attestation_state":"computed","paper":{"title":"Adaptive advantage in entanglement-assisted communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Tavakoli, Emmanuel Zambrini Cruzeiro, Jef Pauwels, Stefano Pironio","submitted_at":"2022-03-10T13:54:02Z","abstract_excerpt":"Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we al"},"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":"2203.05372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-10T13:54:02Z","cross_cats_sorted":[],"title_canon_sha256":"0a231bf7e6d8ceb3abf608455ff14933576418f2602e8ad05565da40b86a9211","abstract_canon_sha256":"4b66218c357470a2173db19efdb46131103aa169ae3192755da896745167a545"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:24.606851Z","signature_b64":"c2dsvSUIod+T/NhMH20kppRUDw7pD2ihElXzqSGwtsmZGbuyiRUqoIJXsnI60XlxZz03QVBa2UffnSwQbf7PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c48afb5e2a8e565dc20b76294b5eb167b46682c103cd3dad77b7dfc0a54f076","last_reissued_at":"2026-07-05T04:57:24.606397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:24.606397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive advantage in entanglement-assisted communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Tavakoli, Emmanuel Zambrini Cruzeiro, Jef Pauwels, Stefano Pironio","submitted_at":"2022-03-10T13:54:02Z","abstract_excerpt":"Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05372","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.05372/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.05372","created_at":"2026-07-05T04:57:24.606458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.05372v2","created_at":"2026-07-05T04:57:24.606458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05372","created_at":"2026-07-05T04:57:24.606458+00:00"},{"alias_kind":"pith_short_12","alias_value":"FREK7NPCVDSW","created_at":"2026-07-05T04:57:24.606458+00:00"},{"alias_kind":"pith_short_16","alias_value":"FREK7NPCVDSWLXBA","created_at":"2026-07-05T04:57:24.606458+00:00"},{"alias_kind":"pith_short_8","alias_value":"FREK7NPC","created_at":"2026-07-05T04:57:24.606458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.02988","citing_title":"An Operational Framework for Nonclassicality in Quantum Communication Networks","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12886","citing_title":"Can outcome communication explain Bell nonlocality?","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ","json":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ.json","graph_json":"https://pith.science/api/pith-number/FREK7NPCVDSWLXBAW5RJJNPLCZ/graph.json","events_json":"https://pith.science/api/pith-number/FREK7NPCVDSWLXBAW5RJJNPLCZ/events.json","paper":"https://pith.science/paper/FREK7NPC"},"agent_actions":{"view_html":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ","download_json":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ.json","view_paper":"https://pith.science/paper/FREK7NPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.05372&json=true","fetch_graph":"https://pith.science/api/pith-number/FREK7NPCVDSWLXBAW5RJJNPLCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FREK7NPCVDSWLXBAW5RJJNPLCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ/action/storage_attestation","attest_author":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ/action/author_attestation","sign_citation":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ/action/citation_signature","submit_replication":"https://pith.science/pith/FREK7NPCVDSWLXBAW5RJJNPLCZ/action/replication_record"}},"created_at":"2026-07-05T04:57:24.606458+00:00","updated_at":"2026-07-05T04:57:24.606458+00:00"}