{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N2DGRZSOYJOEKZRAEFTQIJ63LA","short_pith_number":"pith:N2DGRZSO","schema_version":"1.0","canonical_sha256":"6e8668e64ec25c45662021670427db583c3214f7cdfe3a951b4acbd1ac3859a6","source":{"kind":"arxiv","id":"1408.5663","version":1},"attestation_state":"computed","paper":{"title":"Structured Random Linear Codes (SRLC): Bridging the Gap between Block and Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hitoshi Asaeda, Kazuhisa Matsuzono, Vincent Roca","submitted_at":"2014-08-25T05:26:28Z","abstract_excerpt":"Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a simple yet efficient coding technique, for instance massively used for Network Coding applications. However the price to pay is a high encoding and decoding complexity, especially when working on $GF(2^8)$, which seriously limits the number of packets in the encoding window. On the opposite, structured block codes have been designed for situations where the set o"},"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":"1408.5663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T05:26:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6452498dc47103882ae06726d0a6cd3c4b77a69ca6d4c4e1b66001b8bee34fde","abstract_canon_sha256":"b182918a458869cac61e9788b4d55b819047ece490c7aded1582ddc2472f1381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.601686Z","signature_b64":"TG0xYmgprlAIXjDigQkQ9y74/d7qp+RjDjuQj+U1PBXCmMLBGo5GPhx//BWUVRkwH4Pbpy1sRkEdl5hLTFTWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e8668e64ec25c45662021670427db583c3214f7cdfe3a951b4acbd1ac3859a6","last_reissued_at":"2026-05-18T02:44:24.601297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.601297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Random Linear Codes (SRLC): Bridging the Gap between Block and Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hitoshi Asaeda, Kazuhisa Matsuzono, Vincent Roca","submitted_at":"2014-08-25T05:26:28Z","abstract_excerpt":"Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a simple yet efficient coding technique, for instance massively used for Network Coding applications. However the price to pay is a high encoding and decoding complexity, especially when working on $GF(2^8)$, which seriously limits the number of packets in the encoding window. On the opposite, structured block codes have been designed for situations where the set o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5663","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":"1408.5663","created_at":"2026-05-18T02:44:24.601366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5663v1","created_at":"2026-05-18T02:44:24.601366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5663","created_at":"2026-05-18T02:44:24.601366+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2DGRZSOYJOE","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2DGRZSOYJOEKZRA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2DGRZSO","created_at":"2026-05-18T12:28:41.024544+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/N2DGRZSOYJOEKZRAEFTQIJ63LA","json":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA.json","graph_json":"https://pith.science/api/pith-number/N2DGRZSOYJOEKZRAEFTQIJ63LA/graph.json","events_json":"https://pith.science/api/pith-number/N2DGRZSOYJOEKZRAEFTQIJ63LA/events.json","paper":"https://pith.science/paper/N2DGRZSO"},"agent_actions":{"view_html":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA","download_json":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA.json","view_paper":"https://pith.science/paper/N2DGRZSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5663&json=true","fetch_graph":"https://pith.science/api/pith-number/N2DGRZSOYJOEKZRAEFTQIJ63LA/graph.json","fetch_events":"https://pith.science/api/pith-number/N2DGRZSOYJOEKZRAEFTQIJ63LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA/action/storage_attestation","attest_author":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA/action/author_attestation","sign_citation":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA/action/citation_signature","submit_replication":"https://pith.science/pith/N2DGRZSOYJOEKZRAEFTQIJ63LA/action/replication_record"}},"created_at":"2026-05-18T02:44:24.601366+00:00","updated_at":"2026-05-18T02:44:24.601366+00:00"}