{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2VHCWISRM6ECRCI4YLDJ375YJN","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":"40f58882f3c7e299b57e32d278dc4ade6d5976a170d816ebbcf9e8c26f908f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-25T10:57:35Z","title_canon_sha256":"e9dc4468616d328a835067ac93adc9b5a15a72953f391e6591186ea390166b3a"},"schema_version":"1.0","source":{"id":"2605.25699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25699","created_at":"2026-05-26T02:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25699v1","created_at":"2026-05-26T02:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25699","created_at":"2026-05-26T02:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"2VHCWISRM6EC","created_at":"2026-05-26T02:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"2VHCWISRM6ECRCI4","created_at":"2026-05-26T02:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"2VHCWISR","created_at":"2026-05-26T02:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:55c050a2539be466615354f43a264a773438c81b017901fabe02e8df8df0e13d","target":"graph","created_at":"2026-05-26T02:04:51Z","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/2605.25699/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study finite-blocklength bounds for noisy permutation channels whose reachable output polytope may be lower-dimensional than the output simplex. Existing Gaussian achievability analyses focus on strictly positive full-rank square DMC transition matrices. The capacity result for arbitrary strictly positive DMCs is established through a weak converse, while available strong converse bounds in the lower-dimensional setting can scale with the dimension of the output simplex rather than with that of the reachable output polytope. On the achievability side, messages are placed on a simplex lattic","authors_text":"Guocheng Lv, Lugaoze Feng, Xunan Li., Ye Jin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-25T10:57:35Z","title":"Finite-Blocklength Analysis for Noisy Permutation Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25699","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:aa8a0bb74db4e6bf581947249263e2290e3b20344af30f199361b3ad257eb3a6","target":"record","created_at":"2026-05-26T02:04:51Z","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":"40f58882f3c7e299b57e32d278dc4ade6d5976a170d816ebbcf9e8c26f908f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-25T10:57:35Z","title_canon_sha256":"e9dc4468616d328a835067ac93adc9b5a15a72953f391e6591186ea390166b3a"},"schema_version":"1.0","source":{"id":"2605.25699","kind":"arxiv","version":1}},"canonical_sha256":"d54e2b2251678828891cc2c69dffb84b5ddea4f003cbf4ab443df22eacd4f4ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d54e2b2251678828891cc2c69dffb84b5ddea4f003cbf4ab443df22eacd4f4ad","first_computed_at":"2026-05-26T02:04:51.148295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:51.148295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+fLgdiXISDY/qZp4hLzwHuxC1aGDqxPvMUHvcW38G9QJ4lko9vlRUJcoQydDj7FfXWIdRMMQfquttnReKucAA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:51.148925Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa8a0bb74db4e6bf581947249263e2290e3b20344af30f199361b3ad257eb3a6","sha256:55c050a2539be466615354f43a264a773438c81b017901fabe02e8df8df0e13d"],"state_sha256":"d8a27e02f164b5dc74b6c7fb9933deb1572db3d93691f96df09db01527d66e9f"}