{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BFGTHQJANXQI5EC3GLMO2UX4HL","short_pith_number":"pith:BFGTHQJA","schema_version":"1.0","canonical_sha256":"094d33c1206de08e905b32d8ed52fc3ad20fa2e641e5bd5725f67f32186ef025","source":{"kind":"arxiv","id":"2507.03035","version":1},"attestation_state":"computed","paper":{"title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"quant-ph","authors_text":"Pete Rigas","submitted_at":"2025-07-03T02:59:12Z","abstract_excerpt":"We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for the bit transmission rate without the presence of significant noise over the channel shared by Alice and Bob for the purposes of encoding, decoding, transmission and authentication, the author suggests that upper bounding the bit transmission rate could be of use towards classifying paradoxical aspects of communication protocols, as well as constructing err"},"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":"2507.03035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-03T02:59:12Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"17c56842ad3c8c1c3cddea0d5ebf716c7cc4941dc20b6519b1279226ea037c79","abstract_canon_sha256":"8b0920586aba1f6e2559b9b45b20b74c6253e026fe07a1d76ac8805fe268d30e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:51.120377Z","signature_b64":"C5lk1mySW6PMcHtGCqtEPHAM1OgTLXhYTx7nsS/RbqbgYuZDB+0A72BQcU5ugE29Y3m4RUOHA8JDG3W9qpPCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094d33c1206de08e905b32d8ed52fc3ad20fa2e641e5bd5725f67f32186ef025","last_reissued_at":"2026-07-05T11:31:51.119975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:51.119975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"quant-ph","authors_text":"Pete Rigas","submitted_at":"2025-07-03T02:59:12Z","abstract_excerpt":"We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for the bit transmission rate without the presence of significant noise over the channel shared by Alice and Bob for the purposes of encoding, decoding, transmission and authentication, the author suggests that upper bounding the bit transmission rate could be of use towards classifying paradoxical aspects of communication protocols, as well as constructing err"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03035","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/2507.03035/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":"2507.03035","created_at":"2026-07-05T11:31:51.120032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03035v1","created_at":"2026-07-05T11:31:51.120032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03035","created_at":"2026-07-05T11:31:51.120032+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFGTHQJANXQI","created_at":"2026-07-05T11:31:51.120032+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFGTHQJANXQI5EC3","created_at":"2026-07-05T11:31:51.120032+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFGTHQJA","created_at":"2026-07-05T11:31:51.120032+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08259","citing_title":"Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL","json":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL.json","graph_json":"https://pith.science/api/pith-number/BFGTHQJANXQI5EC3GLMO2UX4HL/graph.json","events_json":"https://pith.science/api/pith-number/BFGTHQJANXQI5EC3GLMO2UX4HL/events.json","paper":"https://pith.science/paper/BFGTHQJA"},"agent_actions":{"view_html":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL","download_json":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL.json","view_paper":"https://pith.science/paper/BFGTHQJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03035&json=true","fetch_graph":"https://pith.science/api/pith-number/BFGTHQJANXQI5EC3GLMO2UX4HL/graph.json","fetch_events":"https://pith.science/api/pith-number/BFGTHQJANXQI5EC3GLMO2UX4HL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL/action/storage_attestation","attest_author":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL/action/author_attestation","sign_citation":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL/action/citation_signature","submit_replication":"https://pith.science/pith/BFGTHQJANXQI5EC3GLMO2UX4HL/action/replication_record"}},"created_at":"2026-07-05T11:31:51.120032+00:00","updated_at":"2026-07-05T11:31:51.120032+00:00"}