{"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"}