{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4JZJSJT7HO3XCHS5KWXWXOF7RT","short_pith_number":"pith:4JZJSJT7","schema_version":"1.0","canonical_sha256":"e27299267f3bb7711e5d55af6bb8bf8ceac79682fc1313abfa837438c5d8dbc6","source":{"kind":"arxiv","id":"1409.8650","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Prioritized Random Linear Coding and Scheduling for Layered Data Delivery from Multiple Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eymen Kurdoglu, Mihaela van der Schaar, Nikolaos Thomos, Pascal Frossard","submitted_at":"2014-09-30T18:47:09Z","abstract_excerpt":"In this paper, we deal with the problem of jointly determining the optimal coding strategy and the scheduling decisions when receivers obtain layered data from multiple servers. The layered data is encoded by means of Prioritized Random Linear Coding (PRLC) in order to be resilient to channel loss while respecting the unequal levels of importance in the data, and data blocks are transmitted simultaneously in order to reduce decoding delays and improve the delivery performance. We formulate the optimal coding and scheduling decisions problem in our novel framework with the help of Markov Decisi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1409.8650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T18:47:09Z","cross_cats_sorted":["cs.MM","cs.NI","math.IT"],"title_canon_sha256":"8e6343b27626bf339d7a3d630c83230a231d43f5dd0f16e1f913f59ff5d2506a","abstract_canon_sha256":"a702f7364bb09692f9a32b3c9acd17556545711b9d4cee316c33bd3e8f089d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.423912Z","signature_b64":"JNOPeRcd7LzsfikYj4gVsSncQ4FbAAVo5Nk4xpwO1tit9g1cJ1tGfRRv+bbfnaggg//v66c3vKaGEgkVRLomDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27299267f3bb7711e5d55af6bb8bf8ceac79682fc1313abfa837438c5d8dbc6","last_reissued_at":"2026-05-18T00:57:51.423297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.423297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Prioritized Random Linear Coding and Scheduling for Layered Data Delivery from Multiple Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eymen Kurdoglu, Mihaela van der Schaar, Nikolaos Thomos, Pascal Frossard","submitted_at":"2014-09-30T18:47:09Z","abstract_excerpt":"In this paper, we deal with the problem of jointly determining the optimal coding strategy and the scheduling decisions when receivers obtain layered data from multiple servers. The layered data is encoded by means of Prioritized Random Linear Coding (PRLC) in order to be resilient to channel loss while respecting the unequal levels of importance in the data, and data blocks are transmitted simultaneously in order to reduce decoding delays and improve the delivery performance. We formulate the optimal coding and scheduling decisions problem in our novel framework with the help of Markov Decisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8650","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.8650","created_at":"2026-05-18T00:57:51.423417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8650v1","created_at":"2026-05-18T00:57:51.423417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8650","created_at":"2026-05-18T00:57:51.423417+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JZJSJT7HO3X","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JZJSJT7HO3XCHS5","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JZJSJT7","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT","json":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT.json","graph_json":"https://pith.science/api/pith-number/4JZJSJT7HO3XCHS5KWXWXOF7RT/graph.json","events_json":"https://pith.science/api/pith-number/4JZJSJT7HO3XCHS5KWXWXOF7RT/events.json","paper":"https://pith.science/paper/4JZJSJT7"},"agent_actions":{"view_html":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT","download_json":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT.json","view_paper":"https://pith.science/paper/4JZJSJT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8650&json=true","fetch_graph":"https://pith.science/api/pith-number/4JZJSJT7HO3XCHS5KWXWXOF7RT/graph.json","fetch_events":"https://pith.science/api/pith-number/4JZJSJT7HO3XCHS5KWXWXOF7RT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT/action/storage_attestation","attest_author":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT/action/author_attestation","sign_citation":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT/action/citation_signature","submit_replication":"https://pith.science/pith/4JZJSJT7HO3XCHS5KWXWXOF7RT/action/replication_record"}},"created_at":"2026-05-18T00:57:51.423417+00:00","updated_at":"2026-05-18T00:57:51.423417+00:00"}