{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YF4MPEH5INXIM3SBK2N6LIN34U","short_pith_number":"pith:YF4MPEH5","canonical_record":{"source":{"id":"2412.11091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-15T07:22:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc065ea275a782916b7622a8a5315ad4fe4bba5205355ca18318af382568bffa","abstract_canon_sha256":"e35c1e26c5a28eda9bf3e3a9e9f23bb9b69d4e23ea9e86759b8d3ff8379b6b4a"},"schema_version":"1.0"},"canonical_sha256":"c178c790fd436e866e41569be5a1bbe507b3b4e7a47c79dc5fc816d162d2df12","source":{"kind":"arxiv","id":"2412.11091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.11091","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.11091v2","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11091","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"YF4MPEH5INXI","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_16","alias_value":"YF4MPEH5INXIM3SB","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_8","alias_value":"YF4MPEH5","created_at":"2026-07-05T11:22:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YF4MPEH5INXIM3SBK2N6LIN34U","target":"record","payload":{"canonical_record":{"source":{"id":"2412.11091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-15T07:22:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc065ea275a782916b7622a8a5315ad4fe4bba5205355ca18318af382568bffa","abstract_canon_sha256":"e35c1e26c5a28eda9bf3e3a9e9f23bb9b69d4e23ea9e86759b8d3ff8379b6b4a"},"schema_version":"1.0"},"canonical_sha256":"c178c790fd436e866e41569be5a1bbe507b3b4e7a47c79dc5fc816d162d2df12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:34.839349Z","signature_b64":"iNVeoTFTIbAdFUOgC8f7n6Fwy8OXCbZ+/VJlU7CiZ/rGGqVX2r4U5RSoWEGLkzAJCyeWczkOOxH4xDYM9O7fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c178c790fd436e866e41569be5a1bbe507b3b4e7a47c79dc5fc816d162d2df12","last_reissued_at":"2026-07-05T11:22:34.838797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:34.838797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.11091","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHAxmUjAD3zQR+NVS52MvY2MARF2L2BlfW2dpUJx1Kcs0oTEbuex+8jZf4/6YAEF42GIPzBM7C2MlXVv01gECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:34:21.763750Z"},"content_sha256":"7605093a4f4d1c44c1cc488392eb596ac68d3eaa5688c702efd3b7d8c4053e60","schema_version":"1.0","event_id":"sha256:7605093a4f4d1c44c1cc488392eb596ac68d3eaa5688c702efd3b7d8c4053e60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YF4MPEH5INXIM3SBK2N6LIN34U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification Over Noisy 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-12-15T07:22:06Z","abstract_excerpt":"We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the maximum second-order exponent is same as the Shannon capacity of the DMC. We consider a $q$-ary noisy permutation channel where the transmitted vector is first permuted by a permutation chosen uniformly at random, and then passed through a DMC with strictly positive entries in its transition probability matrix $U$. In an earlier work, we showed that over $q$-ary noiseless permutation channel, $2^{c_n n^{q-1}}$ messa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11091","kind":"arxiv","version":2},"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/2412.11091/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSYQRj4NzT08RBitgsfP7Q0du7rD+T6CofJOk77K1MvyXuKVNSgfO12N9Vb2qEYQhwA0RY/hbNiH0owv1X8ZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:34:21.764375Z"},"content_sha256":"dbdc51d196bb4ded1f376b51fc26366d750a569e2f09de3e3a7ae0912a5f57ca","schema_version":"1.0","event_id":"sha256:dbdc51d196bb4ded1f376b51fc26366d750a569e2f09de3e3a7ae0912a5f57ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF4MPEH5INXIM3SBK2N6LIN34U/bundle.json","state_url":"https://pith.science/pith/YF4MPEH5INXIM3SBK2N6LIN34U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF4MPEH5INXIM3SBK2N6LIN34U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T01:34:21Z","links":{"resolver":"https://pith.science/pith/YF4MPEH5INXIM3SBK2N6LIN34U","bundle":"https://pith.science/pith/YF4MPEH5INXIM3SBK2N6LIN34U/bundle.json","state":"https://pith.science/pith/YF4MPEH5INXIM3SBK2N6LIN34U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF4MPEH5INXIM3SBK2N6LIN34U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YF4MPEH5INXIM3SBK2N6LIN34U","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":"e35c1e26c5a28eda9bf3e3a9e9f23bb9b69d4e23ea9e86759b8d3ff8379b6b4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-15T07:22:06Z","title_canon_sha256":"cc065ea275a782916b7622a8a5315ad4fe4bba5205355ca18318af382568bffa"},"schema_version":"1.0","source":{"id":"2412.11091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.11091","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.11091v2","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11091","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"YF4MPEH5INXI","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_16","alias_value":"YF4MPEH5INXIM3SB","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_8","alias_value":"YF4MPEH5","created_at":"2026-07-05T11:22:34Z"}],"graph_snapshots":[{"event_id":"sha256:dbdc51d196bb4ded1f376b51fc26366d750a569e2f09de3e3a7ae0912a5f57ca","target":"graph","created_at":"2026-07-05T11:22:34Z","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/2412.11091/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the maximum second-order exponent is same as the Shannon capacity of the DMC. We consider a $q$-ary noisy permutation channel where the transmitted vector is first permuted by a permutation chosen uniformly at random, and then passed through a DMC with strictly positive entries in its transition probability matrix $U$. In an earlier work, we showed that over $q$-ary noiseless permutation channel, $2^{c_n n^{q-1}}$ messa","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-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11091","kind":"arxiv","version":2},"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:7605093a4f4d1c44c1cc488392eb596ac68d3eaa5688c702efd3b7d8c4053e60","target":"record","created_at":"2026-07-05T11:22:34Z","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":"e35c1e26c5a28eda9bf3e3a9e9f23bb9b69d4e23ea9e86759b8d3ff8379b6b4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-15T07:22:06Z","title_canon_sha256":"cc065ea275a782916b7622a8a5315ad4fe4bba5205355ca18318af382568bffa"},"schema_version":"1.0","source":{"id":"2412.11091","kind":"arxiv","version":2}},"canonical_sha256":"c178c790fd436e866e41569be5a1bbe507b3b4e7a47c79dc5fc816d162d2df12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c178c790fd436e866e41569be5a1bbe507b3b4e7a47c79dc5fc816d162d2df12","first_computed_at":"2026-07-05T11:22:34.838797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:34.838797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iNVeoTFTIbAdFUOgC8f7n6Fwy8OXCbZ+/VJlU7CiZ/rGGqVX2r4U5RSoWEGLkzAJCyeWczkOOxH4xDYM9O7fDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:34.839349Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.11091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7605093a4f4d1c44c1cc488392eb596ac68d3eaa5688c702efd3b7d8c4053e60","sha256:dbdc51d196bb4ded1f376b51fc26366d750a569e2f09de3e3a7ae0912a5f57ca"],"state_sha256":"cbf8ccf33532a94f952d48524cefd5c5accb1480c26809616fd0e68e73e7b623"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Funr5jSC/Q4+5doRoiDLQhxS/puuRrZcEXzMHwjjvgegg2nlH26v4/qFOnoLkVF0wxg0iiMGB/FLNOSzgeBjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T01:34:21.769616Z","bundle_sha256":"75196c3b6d3ef346d0cf3f34d4d94b1991735202144db4d7de1ec02aef36040f"}}