{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","short_pith_number":"pith:ORDQGT64","canonical_record":{"source":{"id":"2608.11000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T14:48:53Z","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"title_canon_sha256":"f2d66b21d237d14ab29023f3d97e754b93e01ea912ee6843953b9709b3d9fa13","abstract_canon_sha256":"4274a38f5f87fd430379c0f08dcae3442518b8a9fe4fdbc514fdc74046627a97"},"schema_version":"1.0"},"canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","source":{"kind":"arxiv","id":"2608.11000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11000","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11000v1","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11000","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"ORDQGT64TXTS","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"ORDQGT64TXTSNL3E","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"ORDQGT64","created_at":"2026-08-12T01:23:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T14:48:53Z","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"title_canon_sha256":"f2d66b21d237d14ab29023f3d97e754b93e01ea912ee6843953b9709b3d9fa13","abstract_canon_sha256":"4274a38f5f87fd430379c0f08dcae3442518b8a9fe4fdbc514fdc74046627a97"},"schema_version":"1.0"},"canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:23:59.526214Z","signature_b64":"LlHRkfSN5GuQD3zIMZd/ZU/doD7RNUzrWnVoxrZfUYCY7T/xA5rxKOjquD+L/SZm1aMnTJZQK+frhcod0DCgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","last_reissued_at":"2026-08-12T01:23:59.524584Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:23:59.524584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11000","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-08-12T01:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QW12wASfyzB94OFKpe2Evb5u8DoqzNIn/DHoLzAyFEht4KPI3w61ua+Wwidc/B4qtiTpAMxaFnq7tnTwbE60Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:30:52.572838Z"},"content_sha256":"4c3cb832e605067da259226a688caec8b97ff2074a752caaef04d0ad860cc6a1","schema_version":"1.0","event_id":"sha256:4c3cb832e605067da259226a688caec8b97ff2074a752caaef04d0ad860cc6a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The entanglement-assisted transmission capacity is a strong converse bound for identification","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-08-11T14:48:53Z","abstract_excerpt":"Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether it coincides with a message of interest. This relaxation allows the number of identifiable messages to grow doubly exponentially with the blocklength. For quantum channels, the resulting (doubly exponential) identification capacity $C_{\\mathrm{ID}}$ can strictly exceed the ordinary (exponential) transmission capacity $C$.\n  In this paper, we prove that the entanglement-assisted transmission capacity $C_E$ is a strong "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11000","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/2608.11000/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-08-12T01:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qr1vxz5X4bge4FefNydmiiYAKyd9dcDrl7Yw+FU6ov2HJhEoCvN8W3NW0CtcpftrC+BDgQ+H/XD0e/3jHkr6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:30:52.573460Z"},"content_sha256":"bd8eeb67fc54ba007b7877c16c0385dad152171f82fdc3695be5aa319e28cba1","schema_version":"1.0","event_id":"sha256:bd8eeb67fc54ba007b7877c16c0385dad152171f82fdc3695be5aa319e28cba1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevLett.83.3081 resolves to 'Entanglement-Assisted Classical Capacity of Noisy Quantum Channels'. A reader following the printed text alone cannot reach it.","snippet":"Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal. Entanglement-assisted classical capacity of noisy quantum channels.Phys. Rev. Lett., 83:3081–3084, Oct 1999. URL:https://link.aps.org/doi/10.1103/PhysRevLett. 83.30","arxiv_id":"2608.11000","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":"Entanglement-Assisted Classical Capacity of Noisy Quantum Channels","printed_excerpt":"10.1103/physrevlett","reconstructed_doi":"10.1103/PhysRevLett.83.3081"},"severity":"advisory","ref_index":6,"audited_at":"2026-08-12T12:48:08.049843Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevLett.83.3081","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e3cb03edb23219b11af1db6c5eb9ea9cfd7c1facd44d501084b756063ec820d9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Entanglement-Assisted Classical Capacity of Noisy Quantum Channels","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19322,"payload_sha256":"d3d965ed392cbd16ca25be8b16ab114ef137652ddda76f6fa4447c7c01e79a03","signature_b64":"cyRWLbBeDWJYLVIH0iDzcWF9BCeoJYScoKQpRPswQY8TJSvpa4wSbNNR41V2+uOQ9CV567Hwz6DE+68qkMM2Dw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T12:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqdIH0Fd+DSJdIQzUGOmLi0RTQGft3Eq/mNxV7HApc1GeH0UX1/qVk5MxHC3ubqaZrfGJ3ibPLN9IEcNpapUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:30:52.578504Z"},"content_sha256":"0def32963adb54ae13e9caefd0e59547df1bd943470f651470a63b3a9b32d84f","schema_version":"1.0","event_id":"sha256:0def32963adb54ae13e9caefd0e59547df1bd943470f651470a63b3a9b32d84f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/bundle.json","state_url":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/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-08-12T20:30:52Z","links":{"resolver":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS","bundle":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/bundle.json","state":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4274a38f5f87fd430379c0f08dcae3442518b8a9fe4fdbc514fdc74046627a97","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-08-11T14:48:53Z","title_canon_sha256":"f2d66b21d237d14ab29023f3d97e754b93e01ea912ee6843953b9709b3d9fa13"},"schema_version":"1.0","source":{"id":"2608.11000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11000","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11000v1","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11000","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"ORDQGT64TXTS","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"ORDQGT64TXTSNL3E","created_at":"2026-08-12T01:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"ORDQGT64","created_at":"2026-08-12T01:23:59Z"}],"graph_snapshots":[{"event_id":"sha256:bd8eeb67fc54ba007b7877c16c0385dad152171f82fdc3695be5aa319e28cba1","target":"graph","created_at":"2026-08-12T01:23:59Z","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/2608.11000/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether it coincides with a message of interest. This relaxation allows the number of identifiable messages to grow doubly exponentially with the blocklength. For quantum channels, the resulting (doubly exponential) identification capacity $C_{\\mathrm{ID}}$ can strictly exceed the ordinary (exponential) transmission capacity $C$.\n  In this paper, we prove that the entanglement-assisted transmission capacity $C_E$ is a strong ","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-08-11T14:48:53Z","title":"The entanglement-assisted transmission capacity is a strong converse bound for identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11000","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:4c3cb832e605067da259226a688caec8b97ff2074a752caaef04d0ad860cc6a1","target":"record","created_at":"2026-08-12T01:23:59Z","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":"4274a38f5f87fd430379c0f08dcae3442518b8a9fe4fdbc514fdc74046627a97","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-08-11T14:48:53Z","title_canon_sha256":"f2d66b21d237d14ab29023f3d97e754b93e01ea912ee6843953b9709b3d9fa13"},"schema_version":"1.0","source":{"id":"2608.11000","kind":"arxiv","version":1}},"canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","first_computed_at":"2026-08-12T01:23:59.524584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:23:59.524584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LlHRkfSN5GuQD3zIMZd/ZU/doD7RNUzrWnVoxrZfUYCY7T/xA5rxKOjquD+L/SZm1aMnTJZQK+frhcod0DCgDw==","signature_status":"signed_v1","signed_at":"2026-08-12T01:23:59.526214Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c3cb832e605067da259226a688caec8b97ff2074a752caaef04d0ad860cc6a1","sha256:bd8eeb67fc54ba007b7877c16c0385dad152171f82fdc3695be5aa319e28cba1","sha256:0def32963adb54ae13e9caefd0e59547df1bd943470f651470a63b3a9b32d84f"],"state_sha256":"9c5f6ebb4abbda38e44f9981d39a03746c3390f61f090d13774c69db443b123e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBSIbtO0+V24fb8gXPZ8z1abuFDnQoZPKn8uyKbCb0j98McQ1O3k1O4k/vnfexEhTJPLC6706SUNZFyExYsMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:30:52.581169Z","bundle_sha256":"c39c7042fdf5fb1dfd4126fb6fb3f10561b9f6d0bc667add09abc5164fa61e1d"}}