{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KLFLLEHUJEL6RYXZKFHNVKOVE3","short_pith_number":"pith:KLFLLEHU","canonical_record":{"source":{"id":"1501.07033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T08:58:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ba23f85188fff1213b62ec8608b3189e7f5dfc6c5c5cc2d59f553bd50c649966","abstract_canon_sha256":"99cd756c9c992c35a269f07e68647e9b74701a33157dde0778cc1f3a2cc5bfc4"},"schema_version":"1.0"},"canonical_sha256":"52cab590f44917e8e2f9514edaa9d526df03dd333d190edd08723a56d46b7a53","source":{"kind":"arxiv","id":"1501.07033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07033","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07033v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07033","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"KLFLLEHUJEL6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLFLLEHUJEL6RYXZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLFLLEHU","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KLFLLEHUJEL6RYXZKFHNVKOVE3","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T08:58:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ba23f85188fff1213b62ec8608b3189e7f5dfc6c5c5cc2d59f553bd50c649966","abstract_canon_sha256":"99cd756c9c992c35a269f07e68647e9b74701a33157dde0778cc1f3a2cc5bfc4"},"schema_version":"1.0"},"canonical_sha256":"52cab590f44917e8e2f9514edaa9d526df03dd333d190edd08723a56d46b7a53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.482580Z","signature_b64":"ueCfqsb1+wRVmxZoakNEccebJ7qwIPdBtaGpOkyITAT3tToheHEmLprzgESiH6UKzDYeQ8NTOaNdC5cbNwnEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52cab590f44917e8e2f9514edaa9d526df03dd333d190edd08723a56d46b7a53","last_reissued_at":"2026-05-18T02:28:30.482108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.482108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07033","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-18T02:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rpuBb9u8puU/NziTjXEkDQflqW6nqqZUuMSDjS18TDofTU/UB/GWuev6qJt54RTDCcNuJ3jQQJprby2mbCmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:24:17.700283Z"},"content_sha256":"48a7a9488f1ebafd4f0fbdd7b6748127bb83718bc53bb9bcba01c973b2edaef4","schema_version":"1.0","event_id":"sha256:48a7a9488f1ebafd4f0fbdd7b6748127bb83718bc53bb9bcba01c973b2edaef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KLFLLEHUJEL6RYXZKFHNVKOVE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Correction for Differential Linear Network Coding in Slowly-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Martin Bossert, Michael Cyran, Robert F. H. Fischer, Sven Puchinger","submitted_at":"2015-01-28T08:58:19Z","abstract_excerpt":"Differential linear network coding (DLNC) is a precoding scheme for information transmission over random linear networks. By using differential encoding and decoding, the conventional approach of lifting, required for inherent channel sounding, can be omitted and in turn higher transmission rates are supported. However, the scheme is sensitive to variations in the network topology. In this paper, we derive an extended DLNC channel model which includes slow network changes. Based on this, we propose and analyze a suitable channel coding scheme matched to the situation at hand using rank-metric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07033","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-18T02:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbsVhNz5mG4H4/v8T1m1PdIi+7SO7V4B7tAYTqYvEqcvurV0VIEHXRcpz4emGgpdfdIj7t/0Z2mu+JWBlgAkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:24:17.701026Z"},"content_sha256":"e10f6f56d1ed8529614bc3ab0341ce563d9c4fa6674e14654099427badb6a035","schema_version":"1.0","event_id":"sha256:e10f6f56d1ed8529614bc3ab0341ce563d9c4fa6674e14654099427badb6a035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/bundle.json","state_url":"https://pith.science/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/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-05-31T17:24:17Z","links":{"resolver":"https://pith.science/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3","bundle":"https://pith.science/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/bundle.json","state":"https://pith.science/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLFLLEHUJEL6RYXZKFHNVKOVE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KLFLLEHUJEL6RYXZKFHNVKOVE3","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":"99cd756c9c992c35a269f07e68647e9b74701a33157dde0778cc1f3a2cc5bfc4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T08:58:19Z","title_canon_sha256":"ba23f85188fff1213b62ec8608b3189e7f5dfc6c5c5cc2d59f553bd50c649966"},"schema_version":"1.0","source":{"id":"1501.07033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07033","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07033v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07033","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"KLFLLEHUJEL6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLFLLEHUJEL6RYXZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLFLLEHU","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:e10f6f56d1ed8529614bc3ab0341ce563d9c4fa6674e14654099427badb6a035","target":"graph","created_at":"2026-05-18T02:28:30Z","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":"Differential linear network coding (DLNC) is a precoding scheme for information transmission over random linear networks. By using differential encoding and decoding, the conventional approach of lifting, required for inherent channel sounding, can be omitted and in turn higher transmission rates are supported. However, the scheme is sensitive to variations in the network topology. In this paper, we derive an extended DLNC channel model which includes slow network changes. Based on this, we propose and analyze a suitable channel coding scheme matched to the situation at hand using rank-metric ","authors_text":"Johannes B. Huber, Martin Bossert, Michael Cyran, Robert F. H. Fischer, Sven Puchinger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T08:58:19Z","title":"Error Correction for Differential Linear Network Coding in Slowly-Varying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07033","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:48a7a9488f1ebafd4f0fbdd7b6748127bb83718bc53bb9bcba01c973b2edaef4","target":"record","created_at":"2026-05-18T02:28:30Z","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":"99cd756c9c992c35a269f07e68647e9b74701a33157dde0778cc1f3a2cc5bfc4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T08:58:19Z","title_canon_sha256":"ba23f85188fff1213b62ec8608b3189e7f5dfc6c5c5cc2d59f553bd50c649966"},"schema_version":"1.0","source":{"id":"1501.07033","kind":"arxiv","version":1}},"canonical_sha256":"52cab590f44917e8e2f9514edaa9d526df03dd333d190edd08723a56d46b7a53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52cab590f44917e8e2f9514edaa9d526df03dd333d190edd08723a56d46b7a53","first_computed_at":"2026-05-18T02:28:30.482108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:30.482108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ueCfqsb1+wRVmxZoakNEccebJ7qwIPdBtaGpOkyITAT3tToheHEmLprzgESiH6UKzDYeQ8NTOaNdC5cbNwnEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:30.482580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a7a9488f1ebafd4f0fbdd7b6748127bb83718bc53bb9bcba01c973b2edaef4","sha256:e10f6f56d1ed8529614bc3ab0341ce563d9c4fa6674e14654099427badb6a035"],"state_sha256":"eb34c356d552007288142028b6c480b8ef954c2820cfcef92b7938cbe7aa9d98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIKLE8UBAlI4w3fgf1nrWNZLtEyljzEYnDrZsxOw9ML5EbfW4m7RvJjJ9qguSWLhmGWbM1hce8Z/iGDLacPVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:24:17.704929Z","bundle_sha256":"5a1c21d284d1e3164d3a8a385ebc236fb30b1551803aa3eabd6b3a6848590468"}}