{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XA4ZY2OVIV3KA6ZITL4LRUZ5C2","short_pith_number":"pith:XA4ZY2OV","schema_version":"1.0","canonical_sha256":"b8399c69d54576a07b289af8b8d33d16beb6352d69285976f96900121e5b7af2","source":{"kind":"arxiv","id":"1604.05573","version":1},"attestation_state":"computed","paper":{"title":"On Efficient Decoding and Design of Sparse Random Linear Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Steven D. Blostein, Wai-Yip Chan, Ye Li","submitted_at":"2016-04-19T14:05:53Z","abstract_excerpt":"Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A generation-based strategy is employed in which source packets are grouped into overlapping subsets called generations. RLNC is performed only amongst packets belonging to the same generation throughout the network so that sparseness can be maintained. In this paper, generation-based network codes with low reception overheads and decoding costs are designed fo"},"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":"1604.05573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-19T14:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"264c9384f9662e517c149d4927565e1c7e9aa68abe5e00a71e55c690178adb3a","abstract_canon_sha256":"2c5e6c1e7433e6a4c29c3849705b2e428a9653a055afaf34d426f4d4426b9d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:38.349103Z","signature_b64":"IXkrLqLCgruCZmsNZKDkfMkZW/rp9ZZOvI6inS/p6xEhirHuI8xRfTQUUOhiFlaBMYNVaZUU+hTUts5offVLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8399c69d54576a07b289af8b8d33d16beb6352d69285976f96900121e5b7af2","last_reissued_at":"2026-05-18T01:16:38.348215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:38.348215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Efficient Decoding and Design of Sparse Random Linear Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Steven D. Blostein, Wai-Yip Chan, Ye Li","submitted_at":"2016-04-19T14:05:53Z","abstract_excerpt":"Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A generation-based strategy is employed in which source packets are grouped into overlapping subsets called generations. RLNC is performed only amongst packets belonging to the same generation throughout the network so that sparseness can be maintained. In this paper, generation-based network codes with low reception overheads and decoding costs are designed fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05573","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":"1604.05573","created_at":"2026-05-18T01:16:38.348373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05573v1","created_at":"2026-05-18T01:16:38.348373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05573","created_at":"2026-05-18T01:16:38.348373+00:00"},{"alias_kind":"pith_short_12","alias_value":"XA4ZY2OVIV3K","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XA4ZY2OVIV3KA6ZI","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XA4ZY2OV","created_at":"2026-05-18T12:30:51.357362+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/XA4ZY2OVIV3KA6ZITL4LRUZ5C2","json":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2.json","graph_json":"https://pith.science/api/pith-number/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/graph.json","events_json":"https://pith.science/api/pith-number/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/events.json","paper":"https://pith.science/paper/XA4ZY2OV"},"agent_actions":{"view_html":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2","download_json":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2.json","view_paper":"https://pith.science/paper/XA4ZY2OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05573&json=true","fetch_graph":"https://pith.science/api/pith-number/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/graph.json","fetch_events":"https://pith.science/api/pith-number/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/action/storage_attestation","attest_author":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/action/author_attestation","sign_citation":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/action/citation_signature","submit_replication":"https://pith.science/pith/XA4ZY2OVIV3KA6ZITL4LRUZ5C2/action/replication_record"}},"created_at":"2026-05-18T01:16:38.348373+00:00","updated_at":"2026-05-18T01:16:38.348373+00:00"}