{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PJAMQTIXWKKFESFEBYTPISDS5M","short_pith_number":"pith:PJAMQTIX","canonical_record":{"source":{"id":"1412.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e6138558a88149f833bbefe3ae0b89665023251d84bd296d8009884e1c7f678","abstract_canon_sha256":"09d4f8e20be3c6643772650fdf6e5f94aab2f2fb8f5a7e8074e0128a1daa714b"},"schema_version":"1.0"},"canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","source":{"kind":"arxiv","id":"1412.1964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1964","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1964v1","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1964","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"PJAMQTIXWKKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJAMQTIXWKKFESFE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJAMQTIX","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PJAMQTIXWKKFESFEBYTPISDS5M","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e6138558a88149f833bbefe3ae0b89665023251d84bd296d8009884e1c7f678","abstract_canon_sha256":"09d4f8e20be3c6643772650fdf6e5f94aab2f2fb8f5a7e8074e0128a1daa714b"},"schema_version":"1.0"},"canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.186343Z","signature_b64":"RL9Vo3TYb0zFfBK/IUhWIMHn7F7a/PGGy67LPrwzZdhI2L5Sv9vRaRtyu7rwlE9NPel0PFlM9zo0uAqfpow2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","last_reissued_at":"2026-05-18T00:58:11.185727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.185727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1964","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5/FKiaoP3VlLvBLm/xLfkU+tjIV1dFc8aaS7WylDGdRJJB8iXWsS+nJ3Dgjnx5PlawCNRoOWsYUZolHV34zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:42.482846Z"},"content_sha256":"74fdf77391bd5f8efe948d2f631b3dcbc703a2eef11a177ec3e36dad8d16eea8","schema_version":"1.0","event_id":"sha256:74fdf77391bd5f8efe948d2f631b3dcbc703a2eef11a177ec3e36dad8d16eea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PJAMQTIXWKKFESFEBYTPISDS5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplified Erasure/List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2014-12-05T11:42:01Z","abstract_excerpt":"We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1964","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhaad3puVP5zUmtSZe36AXTtTJL+RkMReSkL6yXl5CTlpwAZXNxx50Ir0f0ET4Ly+AetuGsGD80n9eaZl4udCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:42.483197Z"},"content_sha256":"b3ebc2fe14d2fcd52905f223690927d9681478e5e6d646ab9f6ee0ced66596c5","schema_version":"1.0","event_id":"sha256:b3ebc2fe14d2fcd52905f223690927d9681478e5e6d646ab9f6ee0ced66596c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/bundle.json","state_url":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJAMQTIXWKKFESFEBYTPISDS5M/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-06-01T17:27:42Z","links":{"resolver":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M","bundle":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/bundle.json","state":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJAMQTIXWKKFESFEBYTPISDS5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PJAMQTIXWKKFESFEBYTPISDS5M","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":"09d4f8e20be3c6643772650fdf6e5f94aab2f2fb8f5a7e8074e0128a1daa714b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","title_canon_sha256":"0e6138558a88149f833bbefe3ae0b89665023251d84bd296d8009884e1c7f678"},"schema_version":"1.0","source":{"id":"1412.1964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1964","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1964v1","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1964","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"PJAMQTIXWKKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJAMQTIXWKKFESFE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJAMQTIX","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b3ebc2fe14d2fcd52905f223690927d9681478e5e6d646ab9f6ee0ced66596c5","target":"graph","created_at":"2026-05-18T00:58:11Z","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":"We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates)","authors_text":"Neri Merhav, Nir Weinberger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","title":"Simplified Erasure/List Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1964","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:74fdf77391bd5f8efe948d2f631b3dcbc703a2eef11a177ec3e36dad8d16eea8","target":"record","created_at":"2026-05-18T00:58:11Z","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":"09d4f8e20be3c6643772650fdf6e5f94aab2f2fb8f5a7e8074e0128a1daa714b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","title_canon_sha256":"0e6138558a88149f833bbefe3ae0b89665023251d84bd296d8009884e1c7f678"},"schema_version":"1.0","source":{"id":"1412.1964","kind":"arxiv","version":1}},"canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","first_computed_at":"2026-05-18T00:58:11.185727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.185727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RL9Vo3TYb0zFfBK/IUhWIMHn7F7a/PGGy67LPrwzZdhI2L5Sv9vRaRtyu7rwlE9NPel0PFlM9zo0uAqfpow2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.186343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74fdf77391bd5f8efe948d2f631b3dcbc703a2eef11a177ec3e36dad8d16eea8","sha256:b3ebc2fe14d2fcd52905f223690927d9681478e5e6d646ab9f6ee0ced66596c5"],"state_sha256":"ba40e6607c7431161bc9f9c0e823a2bbf3f9b0a2891eb4c1a6d5ec81e1bb7963"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egHT4Aq2Jl2O3lK1tXSupyjjZgq5c/ue+lBgSTdUy1ABd6Ui9lHcKMhmAoLcXYU3psdWwe10A7+pDuzT+gIhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:27:42.485173Z","bundle_sha256":"43671b386eef3d295a2b88d981d5945fc40d8302b6fbb9e71e8e97bf5fcfe521"}}