{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I6W4YROZUOI33PMRBPSQBNB4RY","short_pith_number":"pith:I6W4YROZ","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"},"canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","source":{"kind":"arxiv","id":"2606.05032","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I6W4YROZUOI33PMRBPSQBNB4RY","target":"record","payload":{"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"},"canonical_sha256":"47adcc45d9a391bdbd910be500b43c8e3f082f95c34d9f65aa079b0b946d48d4","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"},"source_kind":"arxiv","source_id":"2606.05032","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rnz9gAoi7EYcjUlVfckcnpCYZgABDA/8ZgB1fFPqgG+MQI1RjXM86nt4iqyiZ+70M/Iy4h7ap3/BqTwyKyqOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:19:57.770405Z"},"content_sha256":"dbbc35bcc88d678a976eb359d0b9e25123128c06cd8b672c07a2d99ac99d9c30","schema_version":"1.0","event_id":"sha256:dbbc35bcc88d678a976eb359d0b9e25123128c06cd8b672c07a2d99ac99d9c30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I6W4YROZUOI33PMRBPSQBNB4RY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7U1e0pN9XipL/e8uuXa2lRVY6GcYlZ+dFiOHYfMYJTRbo93rtNj4iGeEuOhkJXQXSmfClaFqUK/KFTlrYp1TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:19:57.770784Z"},"content_sha256":"4e313427e6a0e04c431509031f5111ebe72eb867ec02d91b8c3ff7df83b2c195","schema_version":"1.0","event_id":"sha256:4e313427e6a0e04c431509031f5111ebe72eb867ec02d91b8c3ff7df83b2c195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/bundle.json","state_url":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6W4YROZUOI33PMRBPSQBNB4RY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T18:19:57Z","links":{"resolver":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY","bundle":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/bundle.json","state":"https://pith.science/pith/I6W4YROZUOI33PMRBPSQBNB4RY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6W4YROZUOI33PMRBPSQBNB4RY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75+3nebfZ+giu8CbkAMeSK56NpNlA1Ur0KH5IH9Gk795KTNpSZ8it66uO7dJDFJCLNeb3R5SdFrKMghvT+YLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:19:57.773134Z","bundle_sha256":"821afbe73014222db0646c70e1200deb959e5620d98240f19c892db2c7d889d3"}}