{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HTAGVIYSXP37C57PNHETALRVYG","short_pith_number":"pith:HTAGVIYS","schema_version":"1.0","canonical_sha256":"3cc06aa312bbf7f177ef69c9302e35c1bd9e84cbf600667b328af9d280509b95","source":{"kind":"arxiv","id":"2003.05264","version":1},"attestation_state":"computed","paper":{"title":"Communication tasks in operational theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leevi Lepp\\\"aj\\\"arvi, Oskari Kerppo, Teiko Heinosaari","submitted_at":"2020-03-11T12:53:53Z","abstract_excerpt":"We investigate the question which communication tasks can be accomplished within a given operational theory. The concrete task is to find out which communication matrices have a prepare-and-measure implementation with states and measurement from a given theory. To set a general framework for this question we develop the ultraweak matrix majorization in the set of communication matrices. This preorder gives us means to determine when one communication task is more difficult than another. Furthermore, we introduce several monotones which can be used to compare and characterize the communication "},"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":"2003.05264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-11T12:53:53Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"b76381e53d4f27f5f39d9fbd3ea7e5a97a6479e17c10828c2ede0e62c089d570","abstract_canon_sha256":"58ffecd106da6c0aa8cd961278bb172edb4e9de0f1f89c69c20ee11dd6a7808e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:26.096154Z","signature_b64":"/0SWNY+uJ3yr1SMdst+S4+9Pq2iGD+nb+GvPTfJazgchLocdp3bnrZJvrE/Atd/4HcNjedUSpzeQPMqjcOIVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cc06aa312bbf7f177ef69c9302e35c1bd9e84cbf600667b328af9d280509b95","last_reissued_at":"2026-07-05T01:48:26.095719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:26.095719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication tasks in operational theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leevi Lepp\\\"aj\\\"arvi, Oskari Kerppo, Teiko Heinosaari","submitted_at":"2020-03-11T12:53:53Z","abstract_excerpt":"We investigate the question which communication tasks can be accomplished within a given operational theory. The concrete task is to find out which communication matrices have a prepare-and-measure implementation with states and measurement from a given theory. To set a general framework for this question we develop the ultraweak matrix majorization in the set of communication matrices. This preorder gives us means to determine when one communication task is more difficult than another. Furthermore, we introduce several monotones which can be used to compare and characterize the communication "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.05264","kind":"arxiv","version":1},"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/2003.05264/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":"2003.05264","created_at":"2026-07-05T01:48:26.095774+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.05264v1","created_at":"2026-07-05T01:48:26.095774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.05264","created_at":"2026-07-05T01:48:26.095774+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTAGVIYSXP37","created_at":"2026-07-05T01:48:26.095774+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTAGVIYSXP37C57P","created_at":"2026-07-05T01:48:26.095774+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTAGVIYS","created_at":"2026-07-05T01:48:26.095774+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.02988","citing_title":"An Operational Framework for Nonclassicality in Quantum Communication Networks","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG","json":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG.json","graph_json":"https://pith.science/api/pith-number/HTAGVIYSXP37C57PNHETALRVYG/graph.json","events_json":"https://pith.science/api/pith-number/HTAGVIYSXP37C57PNHETALRVYG/events.json","paper":"https://pith.science/paper/HTAGVIYS"},"agent_actions":{"view_html":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG","download_json":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG.json","view_paper":"https://pith.science/paper/HTAGVIYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.05264&json=true","fetch_graph":"https://pith.science/api/pith-number/HTAGVIYSXP37C57PNHETALRVYG/graph.json","fetch_events":"https://pith.science/api/pith-number/HTAGVIYSXP37C57PNHETALRVYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG/action/storage_attestation","attest_author":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG/action/author_attestation","sign_citation":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG/action/citation_signature","submit_replication":"https://pith.science/pith/HTAGVIYSXP37C57PNHETALRVYG/action/replication_record"}},"created_at":"2026-07-05T01:48:26.095774+00:00","updated_at":"2026-07-05T01:48:26.095774+00:00"}