{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YXSWYAOUOKCQIIIII2Q4EHSLBM","short_pith_number":"pith:YXSWYAOU","canonical_record":{"source":{"id":"1610.06974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-21T23:31:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ba6bdf490bbc9a46549681e120bf13057f22fedea3ae184fb608a22bb1f02bd","abstract_canon_sha256":"c8c70100c00a5091599874f413b88a7a7490c950be383605e1c64e2c8b409204"},"schema_version":"1.0"},"canonical_sha256":"c5e56c01d4728504210846a1c21e4b0b37e33f17608d87358ef6bc59477865a3","source":{"kind":"arxiv","id":"1610.06974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06974","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06974v1","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06974","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"YXSWYAOUOKCQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YXSWYAOUOKCQIIII","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YXSWYAOU","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YXSWYAOUOKCQIIIII2Q4EHSLBM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-21T23:31:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ba6bdf490bbc9a46549681e120bf13057f22fedea3ae184fb608a22bb1f02bd","abstract_canon_sha256":"c8c70100c00a5091599874f413b88a7a7490c950be383605e1c64e2c8b409204"},"schema_version":"1.0"},"canonical_sha256":"c5e56c01d4728504210846a1c21e4b0b37e33f17608d87358ef6bc59477865a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.674676Z","signature_b64":"7hRAMWMDG6ql5Szxve+v2P9Omv3gB5sZkbkh8jtpO3ehYtmghhHeUZyTcNn5Xmp41pdZB//wjqBKQkEklhyvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e56c01d4728504210846a1c21e4b0b37e33f17608d87358ef6bc59477865a3","last_reissued_at":"2026-05-18T01:01:30.674228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.674228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06974","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:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvVZv56iWk+lNb9yOxrmP54pQ3tHZELHPo723OlxKmciWN+1nvV6dAykDLCN8H0aSC8BBve6wS1TQh/5SW9hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:15:30.111482Z"},"content_sha256":"6b7a4ed3776144e58976c99b73ffe3380c251f3f867526fdcc2d3ef836a32f56","schema_version":"1.0","event_id":"sha256:6b7a4ed3776144e58976c99b73ffe3380c251f3f867526fdcc2d3ef836a32f56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YXSWYAOUOKCQIIIII2Q4EHSLBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Control for Network Coding Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Emmanouil Skevakis, Ioannis Lambadaris","submitted_at":"2016-10-21T23:31:54Z","abstract_excerpt":"Random linear network coding (RLNC) has been shown to efficiently improve the network performance in terms of reducing transmission delays and increasing the throughput in broadcast and multicast communications. However, it can result in increased storage and computational complexity at the receivers end. In our previous work we considered the broadcast transmission of large file to N receivers. We showed that the storage and complexity requirements at the receivers end can be greatly reduced when segmenting the file into smaller blocks and applying RLNC to these blocks. To that purpose, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06974","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:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xL38iyzegDx3YknuyziED2lf8W/bOuA+oNpqfyrx0Shw/SGz62cx8dSjer2QZ6cD//VsSXJq2Ohg4jNH083DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:15:30.111828Z"},"content_sha256":"1dab549fedc9f7bf5093b12a5bb306bb6eab2fbcba3c6c59cca224ccfbb41a15","schema_version":"1.0","event_id":"sha256:1dab549fedc9f7bf5093b12a5bb306bb6eab2fbcba3c6c59cca224ccfbb41a15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/bundle.json","state_url":"https://pith.science/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/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-02T01:15:30Z","links":{"resolver":"https://pith.science/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM","bundle":"https://pith.science/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/bundle.json","state":"https://pith.science/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXSWYAOUOKCQIIIII2Q4EHSLBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YXSWYAOUOKCQIIIII2Q4EHSLBM","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":"c8c70100c00a5091599874f413b88a7a7490c950be383605e1c64e2c8b409204","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-21T23:31:54Z","title_canon_sha256":"5ba6bdf490bbc9a46549681e120bf13057f22fedea3ae184fb608a22bb1f02bd"},"schema_version":"1.0","source":{"id":"1610.06974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06974","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06974v1","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06974","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"YXSWYAOUOKCQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YXSWYAOUOKCQIIII","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YXSWYAOU","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1dab549fedc9f7bf5093b12a5bb306bb6eab2fbcba3c6c59cca224ccfbb41a15","target":"graph","created_at":"2026-05-18T01:01: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":"Random linear network coding (RLNC) has been shown to efficiently improve the network performance in terms of reducing transmission delays and increasing the throughput in broadcast and multicast communications. However, it can result in increased storage and computational complexity at the receivers end. In our previous work we considered the broadcast transmission of large file to N receivers. We showed that the storage and complexity requirements at the receivers end can be greatly reduced when segmenting the file into smaller blocks and applying RLNC to these blocks. To that purpose, we pr","authors_text":"Emmanouil Skevakis, Ioannis Lambadaris","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-21T23:31:54Z","title":"Optimal Control for Network Coding Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06974","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:6b7a4ed3776144e58976c99b73ffe3380c251f3f867526fdcc2d3ef836a32f56","target":"record","created_at":"2026-05-18T01:01: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":"c8c70100c00a5091599874f413b88a7a7490c950be383605e1c64e2c8b409204","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-21T23:31:54Z","title_canon_sha256":"5ba6bdf490bbc9a46549681e120bf13057f22fedea3ae184fb608a22bb1f02bd"},"schema_version":"1.0","source":{"id":"1610.06974","kind":"arxiv","version":1}},"canonical_sha256":"c5e56c01d4728504210846a1c21e4b0b37e33f17608d87358ef6bc59477865a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5e56c01d4728504210846a1c21e4b0b37e33f17608d87358ef6bc59477865a3","first_computed_at":"2026-05-18T01:01:30.674228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:30.674228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hRAMWMDG6ql5Szxve+v2P9Omv3gB5sZkbkh8jtpO3ehYtmghhHeUZyTcNn5Xmp41pdZB//wjqBKQkEklhyvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:30.674676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b7a4ed3776144e58976c99b73ffe3380c251f3f867526fdcc2d3ef836a32f56","sha256:1dab549fedc9f7bf5093b12a5bb306bb6eab2fbcba3c6c59cca224ccfbb41a15"],"state_sha256":"c83ce3a05cce17888f597d2e4489ebebd762b5c01cffbbee416a1441628a2c14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLyCkN9Ft5N1Gh9T26lmznOP7pVrxSYPeGzWQGFsCKLM+GamaOtX7xqMOwuF9jr4grv/lfUFNadeQZno4tyzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:15:30.113988Z","bundle_sha256":"d46a9d013fab73df8bd8f1cd8e9ddfb4265256fb13cc7ffe2d81ad5c1b5c3570"}}