{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:LO4AGWHTJ5T4AY3BDDWBHHFCJM","short_pith_number":"pith:LO4AGWHT","schema_version":"1.0","canonical_sha256":"5bb80358f34f67c0636118ec139ca24b33e6f3c0e4ac3bb03d92107155341cf4","source":{"kind":"arxiv","id":"quant-ph/0012127","version":2},"attestation_state":"computed","paper":{"title":"Strong Converse for Identification via Quantum Channels","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Winter, R. Ahlswede","submitted_at":"2000-12-22T13:25:25Z","abstract_excerpt":"In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in selfadjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph cov"},"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":"quant-ph/0012127","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-22T13:25:25Z","cross_cats_sorted":[],"title_canon_sha256":"a07fd4ca28f59aea286f8bfbf8616ff48e733dab44b784ba8b2153a0af44eb7b","abstract_canon_sha256":"d19629f4efcc7f32535b534f475149e739fa3592494ec8370e54fbc566df01c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:34.388273Z","signature_b64":"6h/cz2FH0UcY8xT/Rnxlgqdw23Yex56nudUvSIwE0fLcoxVFaq1YDk8ad7FS7iHvJs18eYRwA5gqf7TIIJ1JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bb80358f34f67c0636118ec139ca24b33e6f3c0e4ac3bb03d92107155341cf4","last_reissued_at":"2026-07-04T14:45:34.387928Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:34.387928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Converse for Identification via Quantum Channels","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Winter, R. Ahlswede","submitted_at":"2000-12-22T13:25:25Z","abstract_excerpt":"In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in selfadjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph cov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0012127","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/quant-ph/0012127/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":"quant-ph/0012127","created_at":"2026-07-04T14:45:34.387984+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0012127v2","created_at":"2026-07-04T14:45:34.387984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0012127","created_at":"2026-07-04T14:45:34.387984+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO4AGWHTJ5T4","created_at":"2026-07-04T14:45:34.387984+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO4AGWHTJ5T4AY3B","created_at":"2026-07-04T14:45:34.387984+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO4AGWHT","created_at":"2026-07-04T14:45:34.387984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM","json":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM.json","graph_json":"https://pith.science/api/pith-number/LO4AGWHTJ5T4AY3BDDWBHHFCJM/graph.json","events_json":"https://pith.science/api/pith-number/LO4AGWHTJ5T4AY3BDDWBHHFCJM/events.json","paper":"https://pith.science/paper/LO4AGWHT"},"agent_actions":{"view_html":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM","download_json":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM.json","view_paper":"https://pith.science/paper/LO4AGWHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0012127&json=true","fetch_graph":"https://pith.science/api/pith-number/LO4AGWHTJ5T4AY3BDDWBHHFCJM/graph.json","fetch_events":"https://pith.science/api/pith-number/LO4AGWHTJ5T4AY3BDDWBHHFCJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM/action/storage_attestation","attest_author":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM/action/author_attestation","sign_citation":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM/action/citation_signature","submit_replication":"https://pith.science/pith/LO4AGWHTJ5T4AY3BDDWBHHFCJM/action/replication_record"}},"created_at":"2026-07-04T14:45:34.387984+00:00","updated_at":"2026-07-04T14:45:34.387984+00:00"}