{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VQRGGFNBTNXBSVT2ZMQPXK3BLY","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":"bf285aa55d25eafaeddc2cfc897072e238890d2f5ba8725706a1a8a0c8de3bb1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-31T18:07:23Z","title_canon_sha256":"d4bbb2b754ad9fd85184473ae4a1f92fa0f4ec7aede15723803e92dc07a9fe37"},"schema_version":"1.0","source":{"id":"2111.00559","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00559","created_at":"2026-07-05T07:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00559v4","created_at":"2026-07-05T07:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00559","created_at":"2026-07-05T07:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"VQRGGFNBTNXB","created_at":"2026-07-05T07:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"VQRGGFNBTNXBSVT2","created_at":"2026-07-05T07:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"VQRGGFNB","created_at":"2026-07-05T07:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:d75e3efb7fa8c46a2c5da8ff91498449e2b34fe4d74efff8aa4a072249f2fc82","target":"graph","created_at":"2026-07-05T07:05:38Z","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/2111.00559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jennifer Tang, Yury Polyanskiy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-31T18:07:23Z","title":"Capacity of Noisy Permutation Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00559","kind":"arxiv","version":4},"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:d1aeb2e75e0e7c9e9111fd264c51f35e5d73f56c0751fa1fe4e924deb9bedb26","target":"record","created_at":"2026-07-05T07:05:38Z","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":"bf285aa55d25eafaeddc2cfc897072e238890d2f5ba8725706a1a8a0c8de3bb1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-31T18:07:23Z","title_canon_sha256":"d4bbb2b754ad9fd85184473ae4a1f92fa0f4ec7aede15723803e92dc07a9fe37"},"schema_version":"1.0","source":{"id":"2111.00559","kind":"arxiv","version":4}},"canonical_sha256":"ac226315a19b6e19567acb20fbab615e1a667a94f37a2656c0a29abce17a71de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac226315a19b6e19567acb20fbab615e1a667a94f37a2656c0a29abce17a71de","first_computed_at":"2026-07-05T07:05:38.439738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:05:38.439738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3Ky/osXd9DRQ7e3r61+iNJCkXpXZKruNMyFHRD7NkXGvqXVs0UF3Ey211HWGV/se4vp/7JZseORmY3Tj+gcCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:05:38.440175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00559","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1aeb2e75e0e7c9e9111fd264c51f35e5d73f56c0751fa1fe4e924deb9bedb26","sha256:d75e3efb7fa8c46a2c5da8ff91498449e2b34fe4d74efff8aa4a072249f2fc82"],"state_sha256":"1d171438e8d1259d93472a9f4f97aa3d1e1804d3eae6504bca3140a3ac6dbca5"}