{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7KOKWF2FINQUHHB2GB5SNLS5YP","short_pith_number":"pith:7KOKWF2F","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"},"canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","source":{"kind":"arxiv","id":"1509.04492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04492","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04492v1","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04492","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"7KOKWF2FINQU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7KOKWF2FINQUHHB2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7KOKWF2F","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7KOKWF2FINQUHHB2GB5SNLS5YP","target":"record","payload":{"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"},"canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","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"},"source_kind":"arxiv","source_id":"1509.04492","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPXtOKpKlPU91OaOYSNedmmw6eRQCGUcf3cgzSZg46eELrkiYDPbdKxQCP4MDyhzcl4EklC6pAXwkSaLFsH/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:52.535112Z"},"content_sha256":"d160e0d8f66fdb67c05a8a4e107da06c12cbc2c7d44d79c31ccd81b913320a4a","schema_version":"1.0","event_id":"sha256:d160e0d8f66fdb67c05a8a4e107da06c12cbc2c7d44d79c31ccd81b913320a4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7KOKWF2FINQUHHB2GB5SNLS5YP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KG30T3ypBC8WDHEVGDvQqPCVqSNGRbBRoRNMd4AvV2/vkjiMe1W3hIXNGl1DEiWCdh2RJ//gYz4HOFZZyWuaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:52.535576Z"},"content_sha256":"3139d05222c5da2f452a1abb22ac85c9061923acff0fbe688526de375dcba64d","schema_version":"1.0","event_id":"sha256:3139d05222c5da2f452a1abb22ac85c9061923acff0fbe688526de375dcba64d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/bundle.json","state_url":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T17:34:52Z","links":{"resolver":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP","bundle":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/bundle.json","state":"https://pith.science/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KOKWF2FINQUHHB2GB5SNLS5YP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7KOKWF2FINQUHHB2GB5SNLS5YP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8980c2d1e4ea95d55d1df6198e2114da3b76cea1a58dd90682d2ecb954c9f56e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-15T11:10:14Z","title_canon_sha256":"102b63b7e054a81c644ada10a10c51b03f9f116b500b5fa0cc47f38738dfb451"},"schema_version":"1.0","source":{"id":"1509.04492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04492","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04492v1","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04492","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"7KOKWF2FINQU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7KOKWF2FINQUHHB2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7KOKWF2F","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:3139d05222c5da2f452a1abb22ac85c9061923acff0fbe688526de375dcba64d","target":"graph","created_at":"2026-05-18T01:32:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Frank H.P. Fitzek, Janus Heide, Morten V. Pedersen, Muriel M edard","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-15T11:10:14Z","title":"Perpetual Codes for Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04492","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d160e0d8f66fdb67c05a8a4e107da06c12cbc2c7d44d79c31ccd81b913320a4a","target":"record","created_at":"2026-05-18T01:32:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8980c2d1e4ea95d55d1df6198e2114da3b76cea1a58dd90682d2ecb954c9f56e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-15T11:10:14Z","title_canon_sha256":"102b63b7e054a81c644ada10a10c51b03f9f116b500b5fa0cc47f38738dfb451"},"schema_version":"1.0","source":{"id":"1509.04492","kind":"arxiv","version":1}},"canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa9cab17454361439c3a307b26ae5dc3e610352c6448685efa917cc74ed3d799","first_computed_at":"2026-05-18T01:32:58.776460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:58.776460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bki27r+A0U/Rvxit3MhTB+H/xG/N3qZ3w1a6KprrWClgKKAtKIYsrcob1hEoR+U7arpa7+zTsotfUFBvyyltCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:58.777012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d160e0d8f66fdb67c05a8a4e107da06c12cbc2c7d44d79c31ccd81b913320a4a","sha256:3139d05222c5da2f452a1abb22ac85c9061923acff0fbe688526de375dcba64d"],"state_sha256":"55fd511f1662026af1ed6a196dcec77ea14c8fb4ea838bc7b2ac4ec59f69bdc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVQY3tVjp/4st3Zd95YdHHv8IoFrRqOkcmV4iUhS5iDfQkM57+gki0Dwrw2HtshQcMB3Vto12AqernVYcdFhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:34:52.538248Z","bundle_sha256":"ed81813a6300faab7f95ca9216ad7481c7813ff267ec44bec468fd33f3885414"}}