{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ORDQGT64TXTSNL3EGG6HY6LZWS","short_pith_number":"pith:ORDQGT64","schema_version":"1.0","canonical_sha256":"7447034fdc9de726af6431bc7c7979b4b30c00030087e0dbc487af01b26e1177","source":{"kind":"arxiv","id":"2608.11000","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.11000","created_at":"2026-08-12T01:23:59.528486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11000v1","created_at":"2026-08-12T01:23:59.528486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11000","created_at":"2026-08-12T01:23:59.528486+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDQGT64TXTS","created_at":"2026-08-12T01:23:59.528486+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDQGT64TXTSNL3E","created_at":"2026-08-12T01:23:59.528486+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDQGT64","created_at":"2026-08-12T01:23:59.528486+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/ORDQGT64TXTSNL3EGG6HY6LZWS","json":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS.json","graph_json":"https://pith.science/api/pith-number/ORDQGT64TXTSNL3EGG6HY6LZWS/graph.json","events_json":"https://pith.science/api/pith-number/ORDQGT64TXTSNL3EGG6HY6LZWS/events.json","paper":"https://pith.science/paper/ORDQGT64"},"agent_actions":{"view_html":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS","download_json":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS.json","view_paper":"https://pith.science/paper/ORDQGT64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11000&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDQGT64TXTSNL3EGG6HY6LZWS/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDQGT64TXTSNL3EGG6HY6LZWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/action/storage_attestation","attest_author":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/action/author_attestation","sign_citation":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/action/citation_signature","submit_replication":"https://pith.science/pith/ORDQGT64TXTSNL3EGG6HY6LZWS/action/replication_record"}},"created_at":"2026-08-12T01:23:59.528486+00:00","updated_at":"2026-08-12T01:23:59.528486+00:00"}