{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GCLOIWEMDFFCPJAR4OKUDUFTHD","short_pith_number":"pith:GCLOIWEM","schema_version":"1.0","canonical_sha256":"3096e4588c194a27a411e39541d0b338c18f73120cb7cbc4226c2d875db224c3","source":{"kind":"arxiv","id":"1504.02608","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Vincent Y. F. Tan","submitted_at":"2015-04-10T09:36:16Z","abstract_excerpt":"This monograph presents a unified treatment of single- and multi-user problems in Shannon's information theory where we depart from the requirement that the error probability decays asymptotically in the blocklength. Instead, the error probabilities for various problems are bounded above by a non-vanishing constant and the spotlight is shone on achievable coding rates as functions of the growing blocklengths. This represents the study of asymptotic estimates with non-vanishing error probabilities.\n  In Part I, after reviewing the fundamentals of information theory, we discuss Strassen's semina"},"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":"1504.02608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-10T09:36:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59c4db187b6b7cfe73478df018e9ae3fc4c7d86eb87be1915a69be26d682cfc0","abstract_canon_sha256":"1d7cd2cc3a66973ee80e3cc758e9cc037ccc24d99d98c0e8b32759cfa13ef452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.209213Z","signature_b64":"7RU8rZHftprqE/7bpvIkyowr4I1np13WPmP0/m3tAO0gnL95ecipIx2DtD6RSt2xRDYmTD6e7SV8gUSS9yoKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3096e4588c194a27a411e39541d0b338c18f73120cb7cbc4226c2d875db224c3","last_reissued_at":"2026-05-18T02:19:07.208631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.208631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Vincent Y. F. Tan","submitted_at":"2015-04-10T09:36:16Z","abstract_excerpt":"This monograph presents a unified treatment of single- and multi-user problems in Shannon's information theory where we depart from the requirement that the error probability decays asymptotically in the blocklength. Instead, the error probabilities for various problems are bounded above by a non-vanishing constant and the spotlight is shone on achievable coding rates as functions of the growing blocklengths. This represents the study of asymptotic estimates with non-vanishing error probabilities.\n  In Part I, after reviewing the fundamentals of information theory, we discuss Strassen's semina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02608","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02608","created_at":"2026-05-18T02:19:07.208716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02608v1","created_at":"2026-05-18T02:19:07.208716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02608","created_at":"2026-05-18T02:19:07.208716+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCLOIWEMDFFC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCLOIWEMDFFCPJAR","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCLOIWEM","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20961","citing_title":"Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD","json":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD.json","graph_json":"https://pith.science/api/pith-number/GCLOIWEMDFFCPJAR4OKUDUFTHD/graph.json","events_json":"https://pith.science/api/pith-number/GCLOIWEMDFFCPJAR4OKUDUFTHD/events.json","paper":"https://pith.science/paper/GCLOIWEM"},"agent_actions":{"view_html":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD","download_json":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD.json","view_paper":"https://pith.science/paper/GCLOIWEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02608&json=true","fetch_graph":"https://pith.science/api/pith-number/GCLOIWEMDFFCPJAR4OKUDUFTHD/graph.json","fetch_events":"https://pith.science/api/pith-number/GCLOIWEMDFFCPJAR4OKUDUFTHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD/action/storage_attestation","attest_author":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD/action/author_attestation","sign_citation":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD/action/citation_signature","submit_replication":"https://pith.science/pith/GCLOIWEMDFFCPJAR4OKUDUFTHD/action/replication_record"}},"created_at":"2026-05-18T02:19:07.208716+00:00","updated_at":"2026-05-18T02:19:07.208716+00:00"}