{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RDEYRGCKNKAX2B5GIIWL7JKTTZ","short_pith_number":"pith:RDEYRGCK","canonical_record":{"source":{"id":"1309.1323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T11:56:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa3e0ec55086fb68fca5888f4f972f96361466c71d3325039f0f773604c53055","abstract_canon_sha256":"7e713e718f2006faf420daa34848d3f6e1cf0a9e178ac4334efe1c476bb0437c"},"schema_version":"1.0"},"canonical_sha256":"88c988984a6a817d07a6422cbfa5539e54e7703fb30d06c4b273927951eb9999","source":{"kind":"arxiv","id":"1309.1323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1323","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1323v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1323","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"RDEYRGCKNKAX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDEYRGCKNKAX2B5G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDEYRGCK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RDEYRGCKNKAX2B5GIIWL7JKTTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T11:56:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa3e0ec55086fb68fca5888f4f972f96361466c71d3325039f0f773604c53055","abstract_canon_sha256":"7e713e718f2006faf420daa34848d3f6e1cf0a9e178ac4334efe1c476bb0437c"},"schema_version":"1.0"},"canonical_sha256":"88c988984a6a817d07a6422cbfa5539e54e7703fb30d06c4b273927951eb9999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.582123Z","signature_b64":"myldT8BswfDxVTkPPOvOa7lvoiJnCIqO5tJFZCenU2p4rxRGS04bnSNWaxl77mJySxXNtL0XWVo3YfnI9gKBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c988984a6a817d07a6422cbfa5539e54e7703fb30d06c4b273927951eb9999","last_reissued_at":"2026-05-18T03:14:07.581301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.581301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1323","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwNqT33UJrcpaLJHSQbIjIAOx/w+WrP4oDlY3YkgkZn3Avi7vIH5PUJmLv+WbwXolRhY79mlejnMwdBe1kChBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:02:19.475465Z"},"content_sha256":"f329dee17a80f73ebbb3bbe11ab4b6952dee7618abb4e1f5369f93ffb0110c27","schema_version":"1.0","event_id":"sha256:f329dee17a80f73ebbb3bbe11ab4b6952dee7618abb4e1f5369f93ffb0110c27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RDEYRGCKNKAX2B5GIIWL7JKTTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Instantly Decodable to Random Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingchao Yu, Neda Aboutorab, Parastoo Sadeghi","submitted_at":"2013-09-05T11:56:54Z","abstract_excerpt":"Our primary goal in this paper is to traverse the performance gap between two linear network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC) in terms of throughput and decoding delay. We first redefine the concept of packet generation and use it to partition a block of partially-received data packets in a novel way, based on the coding sets in an IDNC solution. By varying the generation size, we obtain a general coding framework which consists of a series of coding schemes, with RLNC and IDNC identified as two extreme cases. We then prove that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1323","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfNnt+684LOJsJMr7dwkPZsJcLmcfG7wg/mkHg4UKecykfteyFrYRhGltoUULMcKtqYQQR3EwtTn8FVeQehACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:02:19.476152Z"},"content_sha256":"9ddc7acc6e5e952d1b9d87a1eeff4eaf79f30bff9496957c478a93eadc953879","schema_version":"1.0","event_id":"sha256:9ddc7acc6e5e952d1b9d87a1eeff4eaf79f30bff9496957c478a93eadc953879"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/bundle.json","state_url":"https://pith.science/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/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-25T13:02:19Z","links":{"resolver":"https://pith.science/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ","bundle":"https://pith.science/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/bundle.json","state":"https://pith.science/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDEYRGCKNKAX2B5GIIWL7JKTTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RDEYRGCKNKAX2B5GIIWL7JKTTZ","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":"7e713e718f2006faf420daa34848d3f6e1cf0a9e178ac4334efe1c476bb0437c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T11:56:54Z","title_canon_sha256":"fa3e0ec55086fb68fca5888f4f972f96361466c71d3325039f0f773604c53055"},"schema_version":"1.0","source":{"id":"1309.1323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1323","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1323v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1323","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"RDEYRGCKNKAX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDEYRGCKNKAX2B5G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDEYRGCK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:9ddc7acc6e5e952d1b9d87a1eeff4eaf79f30bff9496957c478a93eadc953879","target":"graph","created_at":"2026-05-18T03:14:07Z","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":"Our primary goal in this paper is to traverse the performance gap between two linear network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC) in terms of throughput and decoding delay. We first redefine the concept of packet generation and use it to partition a block of partially-received data packets in a novel way, based on the coding sets in an IDNC solution. By varying the generation size, we obtain a general coding framework which consists of a series of coding schemes, with RLNC and IDNC identified as two extreme cases. We then prove that ","authors_text":"Mingchao Yu, Neda Aboutorab, Parastoo Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T11:56:54Z","title":"From Instantly Decodable to Random Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1323","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:f329dee17a80f73ebbb3bbe11ab4b6952dee7618abb4e1f5369f93ffb0110c27","target":"record","created_at":"2026-05-18T03:14:07Z","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":"7e713e718f2006faf420daa34848d3f6e1cf0a9e178ac4334efe1c476bb0437c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T11:56:54Z","title_canon_sha256":"fa3e0ec55086fb68fca5888f4f972f96361466c71d3325039f0f773604c53055"},"schema_version":"1.0","source":{"id":"1309.1323","kind":"arxiv","version":1}},"canonical_sha256":"88c988984a6a817d07a6422cbfa5539e54e7703fb30d06c4b273927951eb9999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88c988984a6a817d07a6422cbfa5539e54e7703fb30d06c4b273927951eb9999","first_computed_at":"2026-05-18T03:14:07.581301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.581301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"myldT8BswfDxVTkPPOvOa7lvoiJnCIqO5tJFZCenU2p4rxRGS04bnSNWaxl77mJySxXNtL0XWVo3YfnI9gKBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.582123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f329dee17a80f73ebbb3bbe11ab4b6952dee7618abb4e1f5369f93ffb0110c27","sha256:9ddc7acc6e5e952d1b9d87a1eeff4eaf79f30bff9496957c478a93eadc953879"],"state_sha256":"1909da0f5d9ea327183fba659cdfda2817093ef718c162fc08961de42a67a0b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQvpxQTMvV4e/l1ysweiyOLKc7A0NmiKSZ7KXn461kXkVnE56bm2Ig9+ohYzFm4K7w2P7uJdLVWWWzAt6xF4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:02:19.478693Z","bundle_sha256":"9704b0d778b782bc26458087897652f933c73bc955910a753f4ce28c4a543390"}}