{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:64QN5ZZB2BPAPJSROXF5GBC3L2","short_pith_number":"pith:64QN5ZZB","schema_version":"1.0","canonical_sha256":"f720dee721d05e07a65175cbd3045b5ebe95c77d0c32a6d685d3d24609a268da","source":{"kind":"arxiv","id":"2405.09309","version":3},"attestation_state":"computed","paper":{"title":"Identification over Permutation Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sarkar, Bikash Kumar Dey","submitted_at":"2024-05-15T13:07:35Z","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"},"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":"2405.09309","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-15T13:07:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ce97791a7fcfddaad3226951e0a9c96ed846c59856a5a24b33c47b20d2fa0c00","abstract_canon_sha256":"2095ce155821bf8693d6768dfb3db36182d136c265b66d47a1742b0e9662f426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:22.452096Z","signature_b64":"rLrM/uRVQq+uK0s/cKi9LPAZf+Yzq2/VMbpWA+qiP07mB4bv0B8jT4Y1q5as1GGsrqHZN7aQXx8ud+X0gtC0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f720dee721d05e07a65175cbd3045b5ebe95c77d0c32a6d685d3d24609a268da","last_reissued_at":"2026-07-05T09:09:22.451609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:22.451609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identification over Permutation Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sarkar, Bikash Kumar Dey","submitted_at":"2024-05-15T13:07:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09309","kind":"arxiv","version":3},"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/2405.09309/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":"2405.09309","created_at":"2026-07-05T09:09:22.451669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09309v3","created_at":"2026-07-05T09:09:22.451669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09309","created_at":"2026-07-05T09:09:22.451669+00:00"},{"alias_kind":"pith_short_12","alias_value":"64QN5ZZB2BPA","created_at":"2026-07-05T09:09:22.451669+00:00"},{"alias_kind":"pith_short_16","alias_value":"64QN5ZZB2BPAPJSR","created_at":"2026-07-05T09:09:22.451669+00:00"},{"alias_kind":"pith_short_8","alias_value":"64QN5ZZB","created_at":"2026-07-05T09:09:22.451669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11091","citing_title":"Identification Over Noisy Permutation Channels","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2","json":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2.json","graph_json":"https://pith.science/api/pith-number/64QN5ZZB2BPAPJSROXF5GBC3L2/graph.json","events_json":"https://pith.science/api/pith-number/64QN5ZZB2BPAPJSROXF5GBC3L2/events.json","paper":"https://pith.science/paper/64QN5ZZB"},"agent_actions":{"view_html":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2","download_json":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2.json","view_paper":"https://pith.science/paper/64QN5ZZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09309&json=true","fetch_graph":"https://pith.science/api/pith-number/64QN5ZZB2BPAPJSROXF5GBC3L2/graph.json","fetch_events":"https://pith.science/api/pith-number/64QN5ZZB2BPAPJSROXF5GBC3L2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2/action/storage_attestation","attest_author":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2/action/author_attestation","sign_citation":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2/action/citation_signature","submit_replication":"https://pith.science/pith/64QN5ZZB2BPAPJSROXF5GBC3L2/action/replication_record"}},"created_at":"2026-07-05T09:09:22.451669+00:00","updated_at":"2026-07-05T09:09:22.451669+00:00"}