{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FD2DA37IR3XZVFG35SUAZ5YBXN","short_pith_number":"pith:FD2DA37I","schema_version":"1.0","canonical_sha256":"28f4306fe88eef9a94dbeca80cf701bb43763ef52473dd2a78e7969226a0cc2e","source":{"kind":"arxiv","id":"2507.15661","version":1},"attestation_state":"computed","paper":{"title":"On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christoph Hirche, Zahra Baghali Khanian","submitted_at":"2025-07-21T14:22:28Z","abstract_excerpt":"We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\\epsilon > 0$ and privacy parameter $\\delta > 0$ satisfy the inequality $\\delta (1-\\epsilon^2)^{\\frac{1}{2}}+\\epsilon (1-\\delta^2)^{\\frac{1}{2}}<1$. This result strengthens previous understandings by sharply defining the boundary beyond which reliable and private communication is impossible. Furthermore, we present a ``pretty simple'' proof of the ``pretty strong'' converse for the quantum capacity of anti-degradable "},"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.15661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T14:22:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d61f81e08209f0f9ac4668a3b1c3ccf6aec031e7cf48dd0d88336b95fa1bb300","abstract_canon_sha256":"890c8fd6ef803b0c3566973aa22ccd1eeae1d662f9688661debf6056056af63a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:41.629740Z","signature_b64":"y7Vwdy++QDExI26KO4boJ9PvaDUhXouEPRv0CFEQ2303RtvR/hAcL6vU5C/4icMj6PLexLPCD88Di+CXae1uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28f4306fe88eef9a94dbeca80cf701bb43763ef52473dd2a78e7969226a0cc2e","last_reissued_at":"2026-07-05T11:40:41.629156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:41.629156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christoph Hirche, Zahra Baghali Khanian","submitted_at":"2025-07-21T14:22:28Z","abstract_excerpt":"We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\\epsilon > 0$ and privacy parameter $\\delta > 0$ satisfy the inequality $\\delta (1-\\epsilon^2)^{\\frac{1}{2}}+\\epsilon (1-\\delta^2)^{\\frac{1}{2}}<1$. This result strengthens previous understandings by sharply defining the boundary beyond which reliable and private communication is impossible. Furthermore, we present a ``pretty simple'' proof of the ``pretty strong'' converse for the quantum capacity of anti-degradable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15661","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.15661/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.15661","created_at":"2026-07-05T11:40:41.629211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15661v1","created_at":"2026-07-05T11:40:41.629211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15661","created_at":"2026-07-05T11:40:41.629211+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD2DA37IR3XZ","created_at":"2026-07-05T11:40:41.629211+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD2DA37IR3XZVFG3","created_at":"2026-07-05T11:40:41.629211+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD2DA37I","created_at":"2026-07-05T11:40:41.629211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15661","citing_title":"On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN","json":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN.json","graph_json":"https://pith.science/api/pith-number/FD2DA37IR3XZVFG35SUAZ5YBXN/graph.json","events_json":"https://pith.science/api/pith-number/FD2DA37IR3XZVFG35SUAZ5YBXN/events.json","paper":"https://pith.science/paper/FD2DA37I"},"agent_actions":{"view_html":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN","download_json":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN.json","view_paper":"https://pith.science/paper/FD2DA37I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15661&json=true","fetch_graph":"https://pith.science/api/pith-number/FD2DA37IR3XZVFG35SUAZ5YBXN/graph.json","fetch_events":"https://pith.science/api/pith-number/FD2DA37IR3XZVFG35SUAZ5YBXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN/action/storage_attestation","attest_author":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN/action/author_attestation","sign_citation":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN/action/citation_signature","submit_replication":"https://pith.science/pith/FD2DA37IR3XZVFG35SUAZ5YBXN/action/replication_record"}},"created_at":"2026-07-05T11:40:41.629211+00:00","updated_at":"2026-07-05T11:40:41.629211+00:00"}