{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XAFPAFKIZWX37ULIOMRGJYGBWM","short_pith_number":"pith:XAFPAFKI","schema_version":"1.0","canonical_sha256":"b80af01548cdafbfd168732264e0c1b306e1fafd0ab1c8fde768388787e6bd3c","source":{"kind":"arxiv","id":"1312.4811","version":2},"attestation_state":"computed","paper":{"title":"Finite-Length Analysis of BATS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raymond W. Yeung, Shenghao Yang, Tsz-Ching Ng","submitted_at":"2013-12-17T15:01:37Z","abstract_excerpt":"BATS codes were proposed for communication through networks with packet loss. A BATS code consists of an outer code and an inner code. The outer code is a matrix generation of a fountain code, which works with the inner code that comprises random linear coding at the intermediate network nodes. In this paper, the performance of finite-length BATS codes is analyzed with respect to both belief propagation (BP) decoding and inactivation decoding. Our results enable us to evaluate efficiently the finite-length performance in terms of the number of batches used for decoding ranging from 1 to a give"},"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":"1312.4811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T15:01:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34b3cab74528426e7f78722323e4720d23842c9e6b25c86af558787eb32853ba","abstract_canon_sha256":"d864256c6d04d8431813d4128d405d1edf915901eb3e2e21416e1788d411e427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:56.257331Z","signature_b64":"TjuiljXbM6SxTO70hqTssPISwzQjyuku0UNXrcBB0xXtxpP6HotuohBNV3e9H1f/a0Wq0If7p+Bq4ncZ+VaNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b80af01548cdafbfd168732264e0c1b306e1fafd0ab1c8fde768388787e6bd3c","last_reissued_at":"2026-05-18T01:20:56.256664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:56.256664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Length Analysis of BATS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raymond W. Yeung, Shenghao Yang, Tsz-Ching Ng","submitted_at":"2013-12-17T15:01:37Z","abstract_excerpt":"BATS codes were proposed for communication through networks with packet loss. A BATS code consists of an outer code and an inner code. The outer code is a matrix generation of a fountain code, which works with the inner code that comprises random linear coding at the intermediate network nodes. In this paper, the performance of finite-length BATS codes is analyzed with respect to both belief propagation (BP) decoding and inactivation decoding. Our results enable us to evaluate efficiently the finite-length performance in terms of the number of batches used for decoding ranging from 1 to a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4811","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":""},"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":"1312.4811","created_at":"2026-05-18T01:20:56.256759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4811v2","created_at":"2026-05-18T01:20:56.256759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4811","created_at":"2026-05-18T01:20:56.256759+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAFPAFKIZWX3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAFPAFKIZWX37ULI","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAFPAFKI","created_at":"2026-05-18T12:28:06.772260+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/XAFPAFKIZWX37ULIOMRGJYGBWM","json":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM.json","graph_json":"https://pith.science/api/pith-number/XAFPAFKIZWX37ULIOMRGJYGBWM/graph.json","events_json":"https://pith.science/api/pith-number/XAFPAFKIZWX37ULIOMRGJYGBWM/events.json","paper":"https://pith.science/paper/XAFPAFKI"},"agent_actions":{"view_html":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM","download_json":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM.json","view_paper":"https://pith.science/paper/XAFPAFKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4811&json=true","fetch_graph":"https://pith.science/api/pith-number/XAFPAFKIZWX37ULIOMRGJYGBWM/graph.json","fetch_events":"https://pith.science/api/pith-number/XAFPAFKIZWX37ULIOMRGJYGBWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM/action/storage_attestation","attest_author":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM/action/author_attestation","sign_citation":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM/action/citation_signature","submit_replication":"https://pith.science/pith/XAFPAFKIZWX37ULIOMRGJYGBWM/action/replication_record"}},"created_at":"2026-05-18T01:20:56.256759+00:00","updated_at":"2026-05-18T01:20:56.256759+00:00"}