{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KQMZWZB2AVGZ7PEHXXC3YUZGN","short_pith_number":"pith:6KQMZWZB","canonical_record":{"source":{"id":"1706.02328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-07T18:33:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4744c615d1b63f4f20dd0b10f58234af7bde99416464908da27576debdacec35","abstract_canon_sha256":"49cfdcd4c778b539c0a06ad9272a1a9f5f4dbbccef9cef709b0ac4975fbc879d"},"schema_version":"1.0"},"canonical_sha256":"f2a0ccdb21d02a6cfde43dee2de299335342506f643d713565194696ebc9cd01","source":{"kind":"arxiv","id":"1706.02328","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02328","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02328v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02328","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"6KQMZWZB2AVG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KQMZWZB2AVGZ7PE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KQMZWZB","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KQMZWZB2AVGZ7PEHXXC3YUZGN","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-07T18:33:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4744c615d1b63f4f20dd0b10f58234af7bde99416464908da27576debdacec35","abstract_canon_sha256":"49cfdcd4c778b539c0a06ad9272a1a9f5f4dbbccef9cef709b0ac4975fbc879d"},"schema_version":"1.0"},"canonical_sha256":"f2a0ccdb21d02a6cfde43dee2de299335342506f643d713565194696ebc9cd01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.383996Z","signature_b64":"r5q4ZE0Kks9DSftPJj1NGw/wa3UNOg3d8AT4uA+OrRSqfl3oCMMGkcYpOfo50Bi1/4bbg9rLJdD16rMSkrG1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2a0ccdb21d02a6cfde43dee2de299335342506f643d713565194696ebc9cd01","last_reissued_at":"2026-05-18T00:42:43.383481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.383481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02328","source_version":2,"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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCk8N9cpM7/6kMbSFc+rUdqoV+D7bS1wJFKPRGe/srcr7/DeCUN7RfRnQU/hLUZlHP8OzTcPV1sTQkIpRraAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:12:30.452536Z"},"content_sha256":"970b93a0cd49aa8e3337c18a02dcbce7f80a800f6bdf3f51aed1f41dcca11093","schema_version":"1.0","event_id":"sha256:970b93a0cd49aa8e3337c18a02dcbce7f80a800f6bdf3f51aed1f41dcca11093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KQMZWZB2AVGZ7PEHXXC3YUZGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay Optimal Scheduling for Chunked Random Linear Network Coding Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanouil Skevakis, Hassan Halabian, Ioannis Lambadaris","submitted_at":"2017-06-07T18:33:14Z","abstract_excerpt":"We study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process (especially for large files) we apply chunked RLNC (i.e. RLNC is applied within non-overlapping subsets of the file).\n  In our work we show the optimality of the Least Received (LR) batch scheduling policy (which was introduced in our prior work) with regards to the expected file transfer completion time. Furthermore, we refine some of our earlier results, n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02328","kind":"arxiv","version":2},"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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C8zEL3fqoIpKpwumTDGQMdX1CCaU2BYO/FfT1lvccRFTE1VdBeXLDmPsFmAsKw3VxYWKOWwzYOpxhTocZ/8qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:12:30.452878Z"},"content_sha256":"5ac42139bbbee84bf46b043506b884c66c9fd73e5c6225ec2bff9031290a6ad8","schema_version":"1.0","event_id":"sha256:5ac42139bbbee84bf46b043506b884c66c9fd73e5c6225ec2bff9031290a6ad8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/bundle.json","state_url":"https://pith.science/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/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-03T14:12:30Z","links":{"resolver":"https://pith.science/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN","bundle":"https://pith.science/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/bundle.json","state":"https://pith.science/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KQMZWZB2AVGZ7PEHXXC3YUZGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KQMZWZB2AVGZ7PEHXXC3YUZGN","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":"49cfdcd4c778b539c0a06ad9272a1a9f5f4dbbccef9cef709b0ac4975fbc879d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-07T18:33:14Z","title_canon_sha256":"4744c615d1b63f4f20dd0b10f58234af7bde99416464908da27576debdacec35"},"schema_version":"1.0","source":{"id":"1706.02328","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02328","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02328v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02328","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"6KQMZWZB2AVG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KQMZWZB2AVGZ7PE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KQMZWZB","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5ac42139bbbee84bf46b043506b884c66c9fd73e5c6225ec2bff9031290a6ad8","target":"graph","created_at":"2026-05-18T00:42:43Z","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 study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process (especially for large files) we apply chunked RLNC (i.e. RLNC is applied within non-overlapping subsets of the file).\n  In our work we show the optimality of the Least Received (LR) batch scheduling policy (which was introduced in our prior work) with regards to the expected file transfer completion time. Furthermore, we refine some of our earlier results, n","authors_text":"Emmanouil Skevakis, Hassan Halabian, Ioannis Lambadaris","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-07T18:33:14Z","title":"Delay Optimal Scheduling for Chunked Random Linear Network Coding Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02328","kind":"arxiv","version":2},"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:970b93a0cd49aa8e3337c18a02dcbce7f80a800f6bdf3f51aed1f41dcca11093","target":"record","created_at":"2026-05-18T00:42:43Z","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":"49cfdcd4c778b539c0a06ad9272a1a9f5f4dbbccef9cef709b0ac4975fbc879d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-07T18:33:14Z","title_canon_sha256":"4744c615d1b63f4f20dd0b10f58234af7bde99416464908da27576debdacec35"},"schema_version":"1.0","source":{"id":"1706.02328","kind":"arxiv","version":2}},"canonical_sha256":"f2a0ccdb21d02a6cfde43dee2de299335342506f643d713565194696ebc9cd01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2a0ccdb21d02a6cfde43dee2de299335342506f643d713565194696ebc9cd01","first_computed_at":"2026-05-18T00:42:43.383481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:43.383481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r5q4ZE0Kks9DSftPJj1NGw/wa3UNOg3d8AT4uA+OrRSqfl3oCMMGkcYpOfo50Bi1/4bbg9rLJdD16rMSkrG1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:43.383996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02328","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:970b93a0cd49aa8e3337c18a02dcbce7f80a800f6bdf3f51aed1f41dcca11093","sha256:5ac42139bbbee84bf46b043506b884c66c9fd73e5c6225ec2bff9031290a6ad8"],"state_sha256":"3a60431256db804168b2f3927fcf1b68ee5a572ec2e3cb833bb34f0aa5589fdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8s2f5jKJnfwCnq54dgz7HxP5gVZnMaZKfFfMOKuypl0LCNGvMTq3I6XY2s16emVKj9tJCadfRvEcLJ0eSSgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:12:30.454780Z","bundle_sha256":"b9ca89d456c95f2494b489856f08b32a99d641addc5dd217e4a2a664e3f937d4"}}