{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BTTGF6IA6K22JYIQZWVBXL7YVN","short_pith_number":"pith:BTTGF6IA","schema_version":"1.0","canonical_sha256":"0ce662f900f2b5a4e110cdaa1baff8ab7a292c04a6db3301e65d9b2c1f64e123","source":{"kind":"arxiv","id":"2504.20991","version":2},"attestation_state":"computed","paper":{"title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Andreas Winter, Christian Deppe, Holger Boche, Pau Colomer","submitted_at":"2025-04-29T17:57:36Z","abstract_excerpt":"In our previous work, we presented the \\emph{Hypothesis Testing Lemma}, a key tool that establishes sufficient conditions for the existence of good deterministic identification (DI) codes for memoryless channels with finite output, but arbitrary input alphabets. In this work, we provide a full quantum analogue of this lemma, which shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states. Specifically, we demonstrate that such a code can be constructed using product states derived from this packing. This result ena"},"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":"2504.20991","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-04-29T17:57:36Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"90f4a899db6053def1249a17770ca8e61a8a722eeac672aae80e0056ac185c0b","abstract_canon_sha256":"e83bf796a0be1d085918dfab3e5dbb885b4d170a1ceb255a8e2b047ac7664044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:28.993331Z","signature_b64":"6NNB5h4Q8TmF6Q/RwsjeHOZYNEn0jtBcbBdZRBmfTamAtW7Si7CduyxzekNMyVwuD7eOQm8IAUMRI+ILU1uSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce662f900f2b5a4e110cdaa1baff8ab7a292c04a6db3301e65d9b2c1f64e123","last_reissued_at":"2026-07-05T11:42:28.992794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:28.992794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Andreas Winter, Christian Deppe, Holger Boche, Pau Colomer","submitted_at":"2025-04-29T17:57:36Z","abstract_excerpt":"In our previous work, we presented the \\emph{Hypothesis Testing Lemma}, a key tool that establishes sufficient conditions for the existence of good deterministic identification (DI) codes for memoryless channels with finite output, but arbitrary input alphabets. In this work, we provide a full quantum analogue of this lemma, which shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states. Specifically, we demonstrate that such a code can be constructed using product states derived from this packing. This result ena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20991","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/2504.20991/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":"2504.20991","created_at":"2026-07-05T11:42:28.992865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20991v2","created_at":"2026-07-05T11:42:28.992865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20991","created_at":"2026-07-05T11:42:28.992865+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTTGF6IA6K22","created_at":"2026-07-05T11:42:28.992865+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTTGF6IA6K22JYIQ","created_at":"2026-07-05T11:42:28.992865+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTTGF6IA","created_at":"2026-07-05T11:42:28.992865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05168","citing_title":"Deterministic identification for Bernoulli channels and related channels with continuous input","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11782","citing_title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN","json":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN.json","graph_json":"https://pith.science/api/pith-number/BTTGF6IA6K22JYIQZWVBXL7YVN/graph.json","events_json":"https://pith.science/api/pith-number/BTTGF6IA6K22JYIQZWVBXL7YVN/events.json","paper":"https://pith.science/paper/BTTGF6IA"},"agent_actions":{"view_html":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN","download_json":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN.json","view_paper":"https://pith.science/paper/BTTGF6IA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20991&json=true","fetch_graph":"https://pith.science/api/pith-number/BTTGF6IA6K22JYIQZWVBXL7YVN/graph.json","fetch_events":"https://pith.science/api/pith-number/BTTGF6IA6K22JYIQZWVBXL7YVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN/action/storage_attestation","attest_author":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN/action/author_attestation","sign_citation":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN/action/citation_signature","submit_replication":"https://pith.science/pith/BTTGF6IA6K22JYIQZWVBXL7YVN/action/replication_record"}},"created_at":"2026-07-05T11:42:28.992865+00:00","updated_at":"2026-07-05T11:42:28.992865+00:00"}