{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:76PDC7PLCY5XJU6X5F42MQLYZV","short_pith_number":"pith:76PDC7PL","schema_version":"1.0","canonical_sha256":"ff9e317deb163b74d3d7e979a64178cd7b5a000656d96062b3b979f5d3e5820b","source":{"kind":"arxiv","id":"2101.07953","version":2},"attestation_state":"computed","paper":{"title":"New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Aimin Li, Jian Jiao, Ning Zhang, Qinyu Zhang, Shaohua Wu","submitted_at":"2021-01-20T03:56:41Z","abstract_excerpt":"Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to analyze the bounds on the error probability of Spinal codes and design a joint transmission-decoding system. First, in the finite block-length regime, we derive new upper bounds on the Maximum Likelihood (ML) decoding error probability for Spinal codes over both the AWGN channel and the BSC. Then, based on the derived bounds, we formulate a rate maximization prob"},"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":"2101.07953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-20T03:56:41Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"f8c477415d838f5598e30588216c19c23e93527bbde1c8c8caf3e9ee66acda10","abstract_canon_sha256":"08b0330ebf2b6957d988b2058c211edbff8caaf9ed3720d3f3a91df4f82c6f5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:04.893917Z","signature_b64":"cByf8E8aLHOcwuSlyC2R2p6XeQpnPXuYFEev1FPWWEp/EuGqV1euXOb0hqQcKkbrB/0+vlcIF0AeBG4mqH4oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9e317deb163b74d3d7e979a64178cd7b5a000656d96062b3b979f5d3e5820b","last_reissued_at":"2026-07-05T04:11:04.893540Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:04.893540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Aimin Li, Jian Jiao, Ning Zhang, Qinyu Zhang, Shaohua Wu","submitted_at":"2021-01-20T03:56:41Z","abstract_excerpt":"Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to analyze the bounds on the error probability of Spinal codes and design a joint transmission-decoding system. First, in the finite block-length regime, we derive new upper bounds on the Maximum Likelihood (ML) decoding error probability for Spinal codes over both the AWGN channel and the BSC. Then, based on the derived bounds, we formulate a rate maximization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07953","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.07953/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.07953","created_at":"2026-07-05T04:11:04.893597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.07953v2","created_at":"2026-07-05T04:11:04.893597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07953","created_at":"2026-07-05T04:11:04.893597+00:00"},{"alias_kind":"pith_short_12","alias_value":"76PDC7PLCY5X","created_at":"2026-07-05T04:11:04.893597+00:00"},{"alias_kind":"pith_short_16","alias_value":"76PDC7PLCY5XJU6X","created_at":"2026-07-05T04:11:04.893597+00:00"},{"alias_kind":"pith_short_8","alias_value":"76PDC7PL","created_at":"2026-07-05T04:11:04.893597+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/76PDC7PLCY5XJU6X5F42MQLYZV","json":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV.json","graph_json":"https://pith.science/api/pith-number/76PDC7PLCY5XJU6X5F42MQLYZV/graph.json","events_json":"https://pith.science/api/pith-number/76PDC7PLCY5XJU6X5F42MQLYZV/events.json","paper":"https://pith.science/paper/76PDC7PL"},"agent_actions":{"view_html":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV","download_json":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV.json","view_paper":"https://pith.science/paper/76PDC7PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.07953&json=true","fetch_graph":"https://pith.science/api/pith-number/76PDC7PLCY5XJU6X5F42MQLYZV/graph.json","fetch_events":"https://pith.science/api/pith-number/76PDC7PLCY5XJU6X5F42MQLYZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV/action/storage_attestation","attest_author":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV/action/author_attestation","sign_citation":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV/action/citation_signature","submit_replication":"https://pith.science/pith/76PDC7PLCY5XJU6X5F42MQLYZV/action/replication_record"}},"created_at":"2026-07-05T04:11:04.893597+00:00","updated_at":"2026-07-05T04:11:04.893597+00:00"}