{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:64QN5ZZB2BPAPJSROXF5GBC3L2","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":"2095ce155821bf8693d6768dfb3db36182d136c265b66d47a1742b0e9662f426","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-15T13:07:35Z","title_canon_sha256":"ce97791a7fcfddaad3226951e0a9c96ed846c59856a5a24b33c47b20d2fa0c00"},"schema_version":"1.0","source":{"id":"2405.09309","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.09309","created_at":"2026-07-05T09:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"2405.09309v3","created_at":"2026-07-05T09:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09309","created_at":"2026-07-05T09:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"64QN5ZZB2BPA","created_at":"2026-07-05T09:09:22Z"},{"alias_kind":"pith_short_16","alias_value":"64QN5ZZB2BPAPJSR","created_at":"2026-07-05T09:09:22Z"},{"alias_kind":"pith_short_8","alias_value":"64QN5ZZB","created_at":"2026-07-05T09:09:22Z"}],"graph_snapshots":[{"event_id":"sha256:6ab07af4b40ba20763ba0ab317d3832335ae9e37acfd70a59bb86f3cf9c5d048","target":"graph","created_at":"2026-07-05T09:09:22Z","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/2405.09309/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study message identification over a q-ary uniform permutation channel, where the transmitted vector is permuted by a permutation chosen uniformly at random. For discrete memoryless channels(DMCs), the number of identifiable messages grows doubly exponentially. Identification capacity, the maximum second-order exponent, is known to be the same as the Shannon capacity of the DMC. Permutation channels support reliable communication of only polynomially many messages. A simple achievability result shows that message sizes growing as 2^{\\epsilon_nn^{q-1}} are identifiable for any \\epsilon_n\\righ","authors_text":"Abhishek Sarkar, Bikash Kumar Dey","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-15T13:07:35Z","title":"Identification over Permutation Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09309","kind":"arxiv","version":3},"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:cc44e24a901f37ad4d01916a77b65b3f5f92d3a25aab0fff411341e82b0f34df","target":"record","created_at":"2026-07-05T09:09:22Z","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":"2095ce155821bf8693d6768dfb3db36182d136c265b66d47a1742b0e9662f426","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-15T13:07:35Z","title_canon_sha256":"ce97791a7fcfddaad3226951e0a9c96ed846c59856a5a24b33c47b20d2fa0c00"},"schema_version":"1.0","source":{"id":"2405.09309","kind":"arxiv","version":3}},"canonical_sha256":"f720dee721d05e07a65175cbd3045b5ebe95c77d0c32a6d685d3d24609a268da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f720dee721d05e07a65175cbd3045b5ebe95c77d0c32a6d685d3d24609a268da","first_computed_at":"2026-07-05T09:09:22.451609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:22.451609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLrM/uRVQq+uK0s/cKi9LPAZf+Yzq2/VMbpWA+qiP07mB4bv0B8jT4Y1q5as1GGsrqHZN7aQXx8ud+X0gtC0BA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:22.452096Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.09309","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc44e24a901f37ad4d01916a77b65b3f5f92d3a25aab0fff411341e82b0f34df","sha256:6ab07af4b40ba20763ba0ab317d3832335ae9e37acfd70a59bb86f3cf9c5d048"],"state_sha256":"d0fb43627289bbaac453043dca06207a2b5fae7224a11240b37c900330cf089c"}