{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:56N2YEQQYBCWQW5IC2JGLEISKE","short_pith_number":"pith:56N2YEQQ","schema_version":"1.0","canonical_sha256":"ef9bac1210c045685ba816926591125137f9d81e0a6cfebf09ace65e5d7bb13c","source":{"kind":"arxiv","id":"2208.14422","version":3},"attestation_state":"computed","paper":{"title":"Two instances of random access code in the quantum regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Micha{\\l} Eckstein, Micha{\\l} Studzi\\'nski, Nitica Sakharwade, Pawe{\\l} Horodecki","submitted_at":"2022-08-30T17:43:37Z","abstract_excerpt":"We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) [A. Grudka et al. Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed, which can be seen as quantum teleportation with constrained classical communicatio"},"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":"2208.14422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-30T17:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"1600e1564a395b8b6c06bc2591c94717c20443b7042e694a1fc312c2c848dcf0","abstract_canon_sha256":"6fc7f1d6b59aa5b6276885d6bc5ad94315ff96bda1117a095725193bc1449d4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:36.440738Z","signature_b64":"RMtKmJ0DpEMeCJADng16zhJecvhWDu21huxz8IDhyl06ARpLB0nISA8d2ifm6oQQtXAKBTekmN4eFoPyn4OmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef9bac1210c045685ba816926591125137f9d81e0a6cfebf09ace65e5d7bb13c","last_reissued_at":"2026-07-05T06:20:36.440149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:36.440149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two instances of random access code in the quantum regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Micha{\\l} Eckstein, Micha{\\l} Studzi\\'nski, Nitica Sakharwade, Pawe{\\l} Horodecki","submitted_at":"2022-08-30T17:43:37Z","abstract_excerpt":"We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) [A. Grudka et al. Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed, which can be seen as quantum teleportation with constrained classical communicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.14422","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.14422/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":"2208.14422","created_at":"2026-07-05T06:20:36.440220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.14422v3","created_at":"2026-07-05T06:20:36.440220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.14422","created_at":"2026-07-05T06:20:36.440220+00:00"},{"alias_kind":"pith_short_12","alias_value":"56N2YEQQYBCW","created_at":"2026-07-05T06:20:36.440220+00:00"},{"alias_kind":"pith_short_16","alias_value":"56N2YEQQYBCWQW5I","created_at":"2026-07-05T06:20:36.440220+00:00"},{"alias_kind":"pith_short_8","alias_value":"56N2YEQQ","created_at":"2026-07-05T06:20:36.440220+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":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE","json":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE.json","graph_json":"https://pith.science/api/pith-number/56N2YEQQYBCWQW5IC2JGLEISKE/graph.json","events_json":"https://pith.science/api/pith-number/56N2YEQQYBCWQW5IC2JGLEISKE/events.json","paper":"https://pith.science/paper/56N2YEQQ"},"agent_actions":{"view_html":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE","download_json":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE.json","view_paper":"https://pith.science/paper/56N2YEQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.14422&json=true","fetch_graph":"https://pith.science/api/pith-number/56N2YEQQYBCWQW5IC2JGLEISKE/graph.json","fetch_events":"https://pith.science/api/pith-number/56N2YEQQYBCWQW5IC2JGLEISKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE/action/storage_attestation","attest_author":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE/action/author_attestation","sign_citation":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE/action/citation_signature","submit_replication":"https://pith.science/pith/56N2YEQQYBCWQW5IC2JGLEISKE/action/replication_record"}},"created_at":"2026-07-05T06:20:36.440220+00:00","updated_at":"2026-07-05T06:20:36.440220+00:00"}