{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7KOKWF2FINQUHHB2GB5SNLS5YP","short_pith_number":"pith:7KOKWF2F","schema_version":"1.0","canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","source":{"kind":"arxiv","id":"1509.04492","version":1},"attestation_state":"computed","paper":{"title":"Perpetual Codes for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Frank H.P. Fitzek, Janus Heide, Morten V. Pedersen, Muriel M edard","submitted_at":"2015-09-15T11:10:14Z","abstract_excerpt":"Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven platforms, these challenges are particular important. In this work, we consider the coding variant Perpetual codes which are sparse, non-uniform and the coding vectors have a compact representation. The sparsity allows for fast encoding and decoding, and the non-uniform protection of symbols enables recoding where the produced symbols are indistinguishable "},"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":"1509.04492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-15T11:10:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"102b63b7e054a81c644ada10a10c51b03f9f116b500b5fa0cc47f38738dfb451","abstract_canon_sha256":"8980c2d1e4ea95d55d1df6198e2114da3b76cea1a58dd90682d2ecb954c9f56e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.777012Z","signature_b64":"bki27r+A0U/Rvxit3MhTB+H/xG/N3qZ3w1a6KprrWClgKKAtKIYsrcob1hEoR+U7arpa7+zTsotfUFBvyyltCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","last_reissued_at":"2026-05-18T01:32:58.776460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.776460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perpetual Codes for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Frank H.P. Fitzek, Janus Heide, Morten V. Pedersen, Muriel M edard","submitted_at":"2015-09-15T11:10:14Z","abstract_excerpt":"Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven platforms, these challenges are particular important. In this work, we consider the coding variant Perpetual codes which are sparse, non-uniform and the coding vectors have a compact representation. The sparsity allows for fast encoding and decoding, and the non-uniform protection of symbols enables recoding where the produced symbols are indistinguishable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04492","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":"1509.04492","created_at":"2026-05-18T01:32:58.776538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04492v1","created_at":"2026-05-18T01:32:58.776538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04492","created_at":"2026-05-18T01:32:58.776538+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KOKWF2FINQU","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KOKWF2FINQUHHB2","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KOKWF2F","created_at":"2026-05-18T12:29:10.953037+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/7KOKWF2FINQUHHB2GB5SNLS5YP","json":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP.json","graph_json":"https://pith.science/api/pith-number/7KOKWF2FINQUHHB2GB5SNLS5YP/graph.json","events_json":"https://pith.science/api/pith-number/7KOKWF2FINQUHHB2GB5SNLS5YP/events.json","paper":"https://pith.science/paper/7KOKWF2F"},"agent_actions":{"view_html":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP","download_json":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP.json","view_paper":"https://pith.science/paper/7KOKWF2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04492&json=true","fetch_graph":"https://pith.science/api/pith-number/7KOKWF2FINQUHHB2GB5SNLS5YP/graph.json","fetch_events":"https://pith.science/api/pith-number/7KOKWF2FINQUHHB2GB5SNLS5YP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/action/storage_attestation","attest_author":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/action/author_attestation","sign_citation":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/action/citation_signature","submit_replication":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/action/replication_record"}},"created_at":"2026-05-18T01:32:58.776538+00:00","updated_at":"2026-05-18T01:32:58.776538+00:00"}