{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VQRGGFNBTNXBSVT2ZMQPXK3BLY","short_pith_number":"pith:VQRGGFNB","schema_version":"1.0","canonical_sha256":"ac226315a19b6e19567acb20fbab615e1a667a94f37a2656c0a29abce17a71de","source":{"kind":"arxiv","id":"2111.00559","version":4},"attestation_state":"computed","paper":{"title":"Capacity of Noisy Permutation Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jennifer Tang, Yury Polyanskiy","submitted_at":"2021-10-31T18:07:23Z","abstract_excerpt":"We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly permuted. We show that the maximal communication rate (normalized by $\\log n$) equals $1/2 (rank(P_{Z|X})-1)$ whenever $P_{Z|X}$ is strictly positive. This is done by establishing a converse bound matching the achievability of [1]. The two main ingredients of our proof are (1) a sharp bound on the entropy of a uniformly sampled vector from a type class and obse"},"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":"2111.00559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-31T18:07:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4bbb2b754ad9fd85184473ae4a1f92fa0f4ec7aede15723803e92dc07a9fe37","abstract_canon_sha256":"bf285aa55d25eafaeddc2cfc897072e238890d2f5ba8725706a1a8a0c8de3bb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:38.440175Z","signature_b64":"E3Ky/osXd9DRQ7e3r61+iNJCkXpXZKruNMyFHRD7NkXGvqXVs0UF3Ey211HWGV/se4vp/7JZseORmY3Tj+gcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac226315a19b6e19567acb20fbab615e1a667a94f37a2656c0a29abce17a71de","last_reissued_at":"2026-07-05T07:05:38.439738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:38.439738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Noisy Permutation Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jennifer Tang, Yury Polyanskiy","submitted_at":"2021-10-31T18:07:23Z","abstract_excerpt":"We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly permuted. We show that the maximal communication rate (normalized by $\\log n$) equals $1/2 (rank(P_{Z|X})-1)$ whenever $P_{Z|X}$ is strictly positive. This is done by establishing a converse bound matching the achievability of [1]. The two main ingredients of our proof are (1) a sharp bound on the entropy of a uniformly sampled vector from a type class and obse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00559","kind":"arxiv","version":4},"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/2111.00559/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":"2111.00559","created_at":"2026-07-05T07:05:38.439795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00559v4","created_at":"2026-07-05T07:05:38.439795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00559","created_at":"2026-07-05T07:05:38.439795+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQRGGFNBTNXB","created_at":"2026-07-05T07:05:38.439795+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQRGGFNBTNXBSVT2","created_at":"2026-07-05T07:05:38.439795+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQRGGFNB","created_at":"2026-07-05T07:05:38.439795+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/VQRGGFNBTNXBSVT2ZMQPXK3BLY","json":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY.json","graph_json":"https://pith.science/api/pith-number/VQRGGFNBTNXBSVT2ZMQPXK3BLY/graph.json","events_json":"https://pith.science/api/pith-number/VQRGGFNBTNXBSVT2ZMQPXK3BLY/events.json","paper":"https://pith.science/paper/VQRGGFNB"},"agent_actions":{"view_html":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY","download_json":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY.json","view_paper":"https://pith.science/paper/VQRGGFNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00559&json=true","fetch_graph":"https://pith.science/api/pith-number/VQRGGFNBTNXBSVT2ZMQPXK3BLY/graph.json","fetch_events":"https://pith.science/api/pith-number/VQRGGFNBTNXBSVT2ZMQPXK3BLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY/action/storage_attestation","attest_author":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY/action/author_attestation","sign_citation":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY/action/citation_signature","submit_replication":"https://pith.science/pith/VQRGGFNBTNXBSVT2ZMQPXK3BLY/action/replication_record"}},"created_at":"2026-07-05T07:05:38.439795+00:00","updated_at":"2026-07-05T07:05:38.439795+00:00"}