{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H74SOSRPAGERLWFY6TYLHL2PS3","short_pith_number":"pith:H74SOSRP","canonical_record":{"source":{"id":"1311.7298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c90bea88dbb3cf8d101380ed405937ff755f319c12744c25a92669025d21337","abstract_canon_sha256":"cd865b02dcd1f57a3b4d4beaa7a7f3b8e572ffc083f070c38bf66855fe04b290"},"schema_version":"1.0"},"canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","source":{"kind":"arxiv","id":"1311.7298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7298","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7298v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7298","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"H74SOSRPAGER","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H74SOSRPAGERLWFY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H74SOSRP","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H74SOSRPAGERLWFY6TYLHL2PS3","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c90bea88dbb3cf8d101380ed405937ff755f319c12744c25a92669025d21337","abstract_canon_sha256":"cd865b02dcd1f57a3b4d4beaa7a7f3b8e572ffc083f070c38bf66855fe04b290"},"schema_version":"1.0"},"canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.576996Z","signature_b64":"IUyC7tpx96teqsoaP/UI2B7sa5jCMm+EWG32GmolaDK0/OlkaWTv/eCVQS1qw+3aRaJVGR3wo8+lERQB5/wkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","last_reissued_at":"2026-05-18T00:58:16.576289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.576289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7298","source_version":1,"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-05-18T00:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnenkzrGyXpgA9H3UfuDoTNzpUYI4Saq3uZkd76kzMJxyHCTkqVFqmDXv+vr/vkf1aV520DpJxxlIKZzSQ57Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:09.199254Z"},"content_sha256":"64bfe61f8bc5381ec4bb5219cd38301fe5086cd82c3eb9e7eb4f76069f63bd97","schema_version":"1.0","event_id":"sha256:64bfe61f8bc5381ec4bb5219cd38301fe5086cd82c3eb9e7eb4f76069f63bd97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H74SOSRPAGERLWFY6TYLHL2PS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List decoding - random coding exponents and expurgated exponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-11-28T12:22:52Z","abstract_excerpt":"Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed independently of the block length $n$, and the exponential list-size, where $L$ grows exponentially with $n$. We first derive a general upper bound on the list-decoding average error probability, which is suitable for both regimes. This bound leads to more specific bounds in the two regimes. In the fixed list-size regime, the bound is related to known bounds and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7298","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCVmLXQbum8ivUEpeqL3kV8Tr+R9eNyxxJiIvdxOkaScUsewy3/Id4rwhfetSphsYXblVDrpTMu74pSUkeawCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:09.199663Z"},"content_sha256":"78fa9c9b5d29426cd626198edb7b0a1aee6dbbb9e051a10af6d26c1824d4dee9","schema_version":"1.0","event_id":"sha256:78fa9c9b5d29426cd626198edb7b0a1aee6dbbb9e051a10af6d26c1824d4dee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/bundle.json","state_url":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H74SOSRPAGERLWFY6TYLHL2PS3/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-05-27T11:50:09Z","links":{"resolver":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3","bundle":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/bundle.json","state":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H74SOSRPAGERLWFY6TYLHL2PS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H74SOSRPAGERLWFY6TYLHL2PS3","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":"cd865b02dcd1f57a3b4d4beaa7a7f3b8e572ffc083f070c38bf66855fe04b290","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","title_canon_sha256":"8c90bea88dbb3cf8d101380ed405937ff755f319c12744c25a92669025d21337"},"schema_version":"1.0","source":{"id":"1311.7298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7298","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7298v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7298","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"H74SOSRPAGER","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H74SOSRPAGERLWFY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H74SOSRP","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:78fa9c9b5d29426cd626198edb7b0a1aee6dbbb9e051a10af6d26c1824d4dee9","target":"graph","created_at":"2026-05-18T00:58:16Z","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"},"paper":{"abstract_excerpt":"Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed independently of the block length $n$, and the exponential list-size, where $L$ grows exponentially with $n$. We first derive a general upper bound on the list-decoding average error probability, which is suitable for both regimes. This bound leads to more specific bounds in the two regimes. In the fixed list-size regime, the bound is related to known bounds and ","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","title":"List decoding - random coding exponents and expurgated exponents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7298","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:64bfe61f8bc5381ec4bb5219cd38301fe5086cd82c3eb9e7eb4f76069f63bd97","target":"record","created_at":"2026-05-18T00:58:16Z","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":"cd865b02dcd1f57a3b4d4beaa7a7f3b8e572ffc083f070c38bf66855fe04b290","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","title_canon_sha256":"8c90bea88dbb3cf8d101380ed405937ff755f319c12744c25a92669025d21337"},"schema_version":"1.0","source":{"id":"1311.7298","kind":"arxiv","version":1}},"canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","first_computed_at":"2026-05-18T00:58:16.576289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:16.576289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUyC7tpx96teqsoaP/UI2B7sa5jCMm+EWG32GmolaDK0/OlkaWTv/eCVQS1qw+3aRaJVGR3wo8+lERQB5/wkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:16.576996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64bfe61f8bc5381ec4bb5219cd38301fe5086cd82c3eb9e7eb4f76069f63bd97","sha256:78fa9c9b5d29426cd626198edb7b0a1aee6dbbb9e051a10af6d26c1824d4dee9"],"state_sha256":"6bd8788b36f4763fc16d98bb7ea384acd53379c63b1d8a6805fee4d61cec7a67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0740Gy+M55bgHVCXmlVYjrj2eA0C0S8b+aCaF7X697EgFBo28o2HwANuSg9AICRE87SbVw9ud6ouU46GEBKzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:50:09.201932Z","bundle_sha256":"c673fce826e1c63cdecf546668459ba4876668b50c3171bf4c92cc65256e55aa"}}