{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BYNB7UIAK2S36WQD77UQIU5AZJ","short_pith_number":"pith:BYNB7UIA","schema_version":"1.0","canonical_sha256":"0e1a1fd10056a5bf5a03ffe90453a0ca4fff69e097a6861cf52e2d3b161465b8","source":{"kind":"arxiv","id":"2012.07198","version":2},"attestation_state":"computed","paper":{"title":"Polar Codes for Quantum Reading","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Francisco Revson F. Pereira, Stefano Mancini","submitted_at":"2020-12-14T01:24:11Z","abstract_excerpt":"Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed to: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. The aim of this paper is to present a solution to these questions using polar codes. Firstly, we characterize the "},"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":"2012.07198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-14T01:24:11Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"33c42c649a1a5af08c2cef4040173bcc8af64cf19b5bafbefd5fad5729bc1898","abstract_canon_sha256":"af21fcb61883a6299b84e953447e2dd24c936cae77953e953601c9f867e365b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:18.176928Z","signature_b64":"ZVs73RIKJNcxsLpQmtzC/QLTaji2XrgKFIf6+spVe/4zBlV/GqBjco8DccJ3AgJMwIZWSj0NVib0qUySj3swBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1a1fd10056a5bf5a03ffe90453a0ca4fff69e097a6861cf52e2d3b161465b8","last_reissued_at":"2026-07-05T04:33:18.176552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:18.176552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Codes for Quantum Reading","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Francisco Revson F. Pereira, Stefano Mancini","submitted_at":"2020-12-14T01:24:11Z","abstract_excerpt":"Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed to: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. The aim of this paper is to present a solution to these questions using polar codes. Firstly, we characterize the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07198","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/2012.07198/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":"2012.07198","created_at":"2026-07-05T04:33:18.176609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.07198v2","created_at":"2026-07-05T04:33:18.176609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07198","created_at":"2026-07-05T04:33:18.176609+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYNB7UIAK2S3","created_at":"2026-07-05T04:33:18.176609+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYNB7UIAK2S36WQD","created_at":"2026-07-05T04:33:18.176609+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYNB7UIA","created_at":"2026-07-05T04:33:18.176609+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/BYNB7UIAK2S36WQD77UQIU5AZJ","json":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ.json","graph_json":"https://pith.science/api/pith-number/BYNB7UIAK2S36WQD77UQIU5AZJ/graph.json","events_json":"https://pith.science/api/pith-number/BYNB7UIAK2S36WQD77UQIU5AZJ/events.json","paper":"https://pith.science/paper/BYNB7UIA"},"agent_actions":{"view_html":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ","download_json":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ.json","view_paper":"https://pith.science/paper/BYNB7UIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.07198&json=true","fetch_graph":"https://pith.science/api/pith-number/BYNB7UIAK2S36WQD77UQIU5AZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BYNB7UIAK2S36WQD77UQIU5AZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ/action/storage_attestation","attest_author":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ/action/author_attestation","sign_citation":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ/action/citation_signature","submit_replication":"https://pith.science/pith/BYNB7UIAK2S36WQD77UQIU5AZJ/action/replication_record"}},"created_at":"2026-07-05T04:33:18.176609+00:00","updated_at":"2026-07-05T04:33:18.176609+00:00"}