{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I6W4YROZUOI33PMRBPSQBNB4RY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d26363b7c5fae8729b2c2073779652e9b5ae23668ea2e3fb954505359860cec7","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-03T16:00:02Z","title_canon_sha256":"0a47f2e247261656a001ddaef6fd9fbbc3a5fa0104de6553f755a4103fde1808"},"schema_version":"1.0","source":{"id":"2606.05032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05032","created_at":"2026-06-04T01:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05032v1","created_at":"2026-06-04T01:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05032","created_at":"2026-06-04T01:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"I6W4YROZUOI3","created_at":"2026-06-04T01:10:03Z"},{"alias_kind":"pith_short_16","alias_value":"I6W4YROZUOI33PMR","created_at":"2026-06-04T01:10:03Z"},{"alias_kind":"pith_short_8","alias_value":"I6W4YROZ","created_at":"2026-06-04T01:10:03Z"}],"graph_snapshots":[{"event_id":"sha256:4e313427e6a0e04c431509031f5111ebe72eb867ec02d91b8c3ff7df83b2c195","target":"graph","created_at":"2026-06-04T01:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.05032/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Satvik Singh","cross_cats":["cs.IT","math.IT","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-03T16:00:02Z","title":"Gaussian mean width strong converse bound on the classical identification capacity of quantum channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05032","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dbbc35bcc88d678a976eb359d0b9e25123128c06cd8b672c07a2d99ac99d9c30","target":"record","created_at":"2026-06-04T01:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d26363b7c5fae8729b2c2073779652e9b5ae23668ea2e3fb954505359860cec7","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-03T16:00:02Z","title_canon_sha256":"0a47f2e247261656a001ddaef6fd9fbbc3a5fa0104de6553f755a4103fde1808"},"schema_version":"1.0","source":{"id":"2606.05032","kind":"arxiv","version":1}},"canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","first_computed_at":"2026-06-04T01:10:03.109486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:10:03.109486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8zqFYczsyaBzJUcu2JQcVfAqtldddedlMcEmBnUBkEUhVJG6GQZw1wg5NcokIjm/p7TrCjQqYPM4mw5tyGrnAQ==","signature_status":"signed_v1","signed_at":"2026-06-04T01:10:03.110216Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbbc35bcc88d678a976eb359d0b9e25123128c06cd8b672c07a2d99ac99d9c30","sha256:4e313427e6a0e04c431509031f5111ebe72eb867ec02d91b8c3ff7df83b2c195"],"state_sha256":"3dca6d1a137aa7b31dae6b9b84ebde3dabf886572e410664a16711cc1534ec09"}