{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DLWZZ5DXE5KCPUNX5XNQVVCE4F","short_pith_number":"pith:DLWZZ5DX","canonical_record":{"source":{"id":"1802.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-02T00:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"1303409cbbd6c181ed996756e7786bc1a48ba376660d963718caa2bd2d4cecad","abstract_canon_sha256":"38958f2f56e2f869d86590585b131d5339dd4c72290e98ba2513e6d94559e51a"},"schema_version":"1.0"},"canonical_sha256":"1aed9cf477275427d1b7eddb0ad444e16e2264cfc79842521e5a6be85551221d","source":{"kind":"arxiv","id":"1802.00521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00521","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00521v1","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00521","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"DLWZZ5DXE5KC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DLWZZ5DXE5KCPUNX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DLWZZ5DX","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DLWZZ5DXE5KCPUNX5XNQVVCE4F","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-02T00:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"1303409cbbd6c181ed996756e7786bc1a48ba376660d963718caa2bd2d4cecad","abstract_canon_sha256":"38958f2f56e2f869d86590585b131d5339dd4c72290e98ba2513e6d94559e51a"},"schema_version":"1.0"},"canonical_sha256":"1aed9cf477275427d1b7eddb0ad444e16e2264cfc79842521e5a6be85551221d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:32.971382Z","signature_b64":"cdLiXFNHJUZLLGrEbD2ugsjKkTEUvFtnYbMXyrOfwhOAF1Bpe9DAulqP+Tdz1MHk3ludVni6e82+yFPvVtM5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aed9cf477275427d1b7eddb0ad444e16e2264cfc79842521e5a6be85551221d","last_reissued_at":"2026-05-18T00:24:32.970918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:32.970918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00521","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-18T00:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LvuAKE5pXOPPNMgukXSusCylkVBvGJ33Xgu/7EPYBijW+LigE8nqmOPXHamuy35icI32jDxn4kFMamg/ZyrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:04:47.170950Z"},"content_sha256":"ed52e266b87a77fcdce55cb8ace886cacb7ae8f76fcf56ec7a31315042385a8c","schema_version":"1.0","event_id":"sha256:ed52e266b87a77fcdce55cb8ace886cacb7ae8f76fcf56ec7a31315042385a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DLWZZ5DXE5KCPUNX5XNQVVCE4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anil Kumar Chorppath, Frank Gabriel, Frank H.P. Fitzek, Ievgenii Tsokalo","submitted_at":"2018-02-02T00:03:53Z","abstract_excerpt":"We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window, unlike the previous wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00521","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-18T00:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXt+HzanPj11fTwHfcyN3Tz8Bn9NuIYHb7h2ylvjGkRRATkFbW+GsWNrTbiZd1AVTESPyIYvzGSh9C8aAG8+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:04:47.171290Z"},"content_sha256":"26ff5a11bc83589c9a0c2cdb40ea0e59c14d6f7bab557db834123449b64e08bb","schema_version":"1.0","event_id":"sha256:26ff5a11bc83589c9a0c2cdb40ea0e59c14d6f7bab557db834123449b64e08bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/bundle.json","state_url":"https://pith.science/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/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-25T18:04:47Z","links":{"resolver":"https://pith.science/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F","bundle":"https://pith.science/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/bundle.json","state":"https://pith.science/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLWZZ5DXE5KCPUNX5XNQVVCE4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DLWZZ5DXE5KCPUNX5XNQVVCE4F","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":"38958f2f56e2f869d86590585b131d5339dd4c72290e98ba2513e6d94559e51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-02T00:03:53Z","title_canon_sha256":"1303409cbbd6c181ed996756e7786bc1a48ba376660d963718caa2bd2d4cecad"},"schema_version":"1.0","source":{"id":"1802.00521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00521","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00521v1","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00521","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"DLWZZ5DXE5KC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DLWZZ5DXE5KCPUNX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DLWZZ5DX","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:26ff5a11bc83589c9a0c2cdb40ea0e59c14d6f7bab557db834123449b64e08bb","target":"graph","created_at":"2026-05-18T00:24:32Z","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":"We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window, unlike the previous wor","authors_text":"Anil Kumar Chorppath, Frank Gabriel, Frank H.P. Fitzek, Ievgenii Tsokalo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-02T00:03:53Z","title":"Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00521","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:ed52e266b87a77fcdce55cb8ace886cacb7ae8f76fcf56ec7a31315042385a8c","target":"record","created_at":"2026-05-18T00:24:32Z","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":"38958f2f56e2f869d86590585b131d5339dd4c72290e98ba2513e6d94559e51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-02T00:03:53Z","title_canon_sha256":"1303409cbbd6c181ed996756e7786bc1a48ba376660d963718caa2bd2d4cecad"},"schema_version":"1.0","source":{"id":"1802.00521","kind":"arxiv","version":1}},"canonical_sha256":"1aed9cf477275427d1b7eddb0ad444e16e2264cfc79842521e5a6be85551221d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aed9cf477275427d1b7eddb0ad444e16e2264cfc79842521e5a6be85551221d","first_computed_at":"2026-05-18T00:24:32.970918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:32.970918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cdLiXFNHJUZLLGrEbD2ugsjKkTEUvFtnYbMXyrOfwhOAF1Bpe9DAulqP+Tdz1MHk3ludVni6e82+yFPvVtM5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:32.971382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed52e266b87a77fcdce55cb8ace886cacb7ae8f76fcf56ec7a31315042385a8c","sha256:26ff5a11bc83589c9a0c2cdb40ea0e59c14d6f7bab557db834123449b64e08bb"],"state_sha256":"ed47804b5664eacdfaebee88fca7406ddbdb4f613dff29d43e5c93885052b175"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74VmliqP2FQ7gPJveOnW/KEVucyL7Q/5mf1Mp3yaU0PAjew+ocE1igoOz81jfHf7WDhbSu+zZCGo1y5a1hwbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:04:47.173260Z","bundle_sha256":"99b3563c1b76eaed2c74fb3011973692b77829c691932623b12f2a33b284d959"}}