{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DKTFVAKZSQMSIQ4HZJUXKRCWC6","short_pith_number":"pith:DKTFVAKZ","schema_version":"1.0","canonical_sha256":"1aa65a81599419244387ca69754456179e8aa54f0bd08de52045e950274a3e72","source":{"kind":"arxiv","id":"1407.0142","version":3},"attestation_state":"computed","paper":{"title":"Asymmetric Evaluations of Erasure and Undetected Error Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Vincent Y. F. Tan","submitted_at":"2014-07-01T08:45:44Z","abstract_excerpt":"The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method, a sequence of codes of increasing blocklengths $n$ is designed to illustrate this tradeoff. Furthermore, for additive discrete memoryless channels with uniform input distribution, we establish that our analysis is tight with respect to the ensemble average. This is done by analysing the ensemble performance in terms of a tradeoff between the code rate, the u"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.0142","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T08:45:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c250f758bd23152516f6bd1d495cd37c9edbc80e7978e3ff374c4714718e326","abstract_canon_sha256":"808fb313e555881415d777a933eb477fadc50b91fe50df3849d3da37088ef99c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.553439Z","signature_b64":"/WJbkWBLoRK7Fxh7KibrghqKQrVgNRSE7CJKrmGwXsoHjLhyXWMpVGfR7aTHtH4TbRg0aoKQcYXhCNN7TQliCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa65a81599419244387ca69754456179e8aa54f0bd08de52045e950274a3e72","last_reissued_at":"2026-05-18T01:29:38.552877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.552877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetric Evaluations of Erasure and Undetected Error Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Vincent Y. F. Tan","submitted_at":"2014-07-01T08:45:44Z","abstract_excerpt":"The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method, a sequence of codes of increasing blocklengths $n$ is designed to illustrate this tradeoff. Furthermore, for additive discrete memoryless channels with uniform input distribution, we establish that our analysis is tight with respect to the ensemble average. This is done by analysing the ensemble performance in terms of a tradeoff between the code rate, the u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0142","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.0142","created_at":"2026-05-18T01:29:38.552953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0142v3","created_at":"2026-05-18T01:29:38.552953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0142","created_at":"2026-05-18T01:29:38.552953+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKTFVAKZSQMS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKTFVAKZSQMSIQ4H","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKTFVAKZ","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6","json":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6.json","graph_json":"https://pith.science/api/pith-number/DKTFVAKZSQMSIQ4HZJUXKRCWC6/graph.json","events_json":"https://pith.science/api/pith-number/DKTFVAKZSQMSIQ4HZJUXKRCWC6/events.json","paper":"https://pith.science/paper/DKTFVAKZ"},"agent_actions":{"view_html":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6","download_json":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6.json","view_paper":"https://pith.science/paper/DKTFVAKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0142&json=true","fetch_graph":"https://pith.science/api/pith-number/DKTFVAKZSQMSIQ4HZJUXKRCWC6/graph.json","fetch_events":"https://pith.science/api/pith-number/DKTFVAKZSQMSIQ4HZJUXKRCWC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6/action/storage_attestation","attest_author":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6/action/author_attestation","sign_citation":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6/action/citation_signature","submit_replication":"https://pith.science/pith/DKTFVAKZSQMSIQ4HZJUXKRCWC6/action/replication_record"}},"created_at":"2026-05-18T01:29:38.552953+00:00","updated_at":"2026-05-18T01:29:38.552953+00:00"}