{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I6W4YROZUOI33PMRBPSQBNB4RY","short_pith_number":"pith:I6W4YROZ","schema_version":"1.0","canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","source":{"kind":"arxiv","id":"2606.05032","version":1},"attestation_state":"computed","paper":{"title":"Gaussian mean width strong converse bound on the classical identification capacity of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.MG"],"primary_cat":"quant-ph","authors_text":"Satvik Singh","submitted_at":"2026-06-03T16:00:02Z","abstract_excerpt":"We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. By equipping the $n$-fold channel output space with a product state-weighted $\\sigma$-Euclidean geometry, we allow trace-distance separation constraints for identification codes to be controlled by Euclidean covering estimates. Using Sudakov's inequality, we bound the covering numbers of the $n$-fold channel outputs via their Gaussian mean widths in the weighted geometry, whose exponential growth in $n$ is governed by the operator norm of a single-letter p"},"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":"2606.05032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-03T16:00:02Z","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"title_canon_sha256":"0a47f2e247261656a001ddaef6fd9fbbc3a5fa0104de6553f755a4103fde1808","abstract_canon_sha256":"d26363b7c5fae8729b2c2073779652e9b5ae23668ea2e3fb954505359860cec7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:10:03.110216Z","signature_b64":"8zqFYczsyaBzJUcu2JQcVfAqtldddedlMcEmBnUBkEUhVJG6GQZw1wg5NcokIjm/p7TrCjQqYPM4mw5tyGrnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","last_reissued_at":"2026-06-04T01:10:03.109486Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:10:03.109486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian mean width strong converse bound on the classical identification capacity of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.MG"],"primary_cat":"quant-ph","authors_text":"Satvik Singh","submitted_at":"2026-06-03T16:00:02Z","abstract_excerpt":"We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. By equipping the $n$-fold channel output space with a product state-weighted $\\sigma$-Euclidean geometry, we allow trace-distance separation constraints for identification codes to be controlled by Euclidean covering estimates. Using Sudakov's inequality, we bound the covering numbers of the $n$-fold channel outputs via their Gaussian mean widths in the weighted geometry, whose exponential growth in $n$ is governed by the operator norm of a single-letter p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05032","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/2606.05032/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":"2606.05032","created_at":"2026-06-04T01:10:03.109599+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05032v1","created_at":"2026-06-04T01:10:03.109599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05032","created_at":"2026-06-04T01:10:03.109599+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6W4YROZUOI3","created_at":"2026-06-04T01:10:03.109599+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6W4YROZUOI33PMR","created_at":"2026-06-04T01:10:03.109599+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6W4YROZ","created_at":"2026-06-04T01:10:03.109599+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/I6W4YROZUOI33PMRBPSQBNB4RY","json":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY.json","graph_json":"https://pith.science/api/pith-number/I6W4YROZUOI33PMRBPSQBNB4RY/graph.json","events_json":"https://pith.science/api/pith-number/I6W4YROZUOI33PMRBPSQBNB4RY/events.json","paper":"https://pith.science/paper/I6W4YROZ"},"agent_actions":{"view_html":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY","download_json":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY.json","view_paper":"https://pith.science/paper/I6W4YROZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05032&json=true","fetch_graph":"https://pith.science/api/pith-number/I6W4YROZUOI33PMRBPSQBNB4RY/graph.json","fetch_events":"https://pith.science/api/pith-number/I6W4YROZUOI33PMRBPSQBNB4RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/action/storage_attestation","attest_author":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/action/author_attestation","sign_citation":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/action/citation_signature","submit_replication":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/action/replication_record"}},"created_at":"2026-06-04T01:10:03.109599+00:00","updated_at":"2026-06-04T01:10:03.109599+00:00"}