{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BAYJ4URVAHB5OMJNOCV3LVM6YC","short_pith_number":"pith:BAYJ4URV","schema_version":"1.0","canonical_sha256":"08309e523501c3d7312d70abb5d59ec0a22d72dd5dd0c24183de15e437c7a5ec","source":{"kind":"arxiv","id":"1209.2067","version":2},"attestation_state":"computed","paper":{"title":"A Markov Decision Model for Adaptive Scheduling of Stored Scalable Videos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Alan C. Bovik, Chao Chen, Gustavo de Veciana, Robert W. Heath Jr","submitted_at":"2012-09-10T17:19:45Z","abstract_excerpt":"We propose two scheduling algorithms that seek to optimize the quality of scalably coded videos that have been stored at a video server before transmission.} The first scheduling algorithm is derived from a Markov Decision Process (MDP) formulation developed here. We model the dynamics of the channel as a Markov chain and reduce the problem of dynamic video scheduling to a tractable Markov decision problem over a finite state space. Based on the MDP formulation, a near-optimal scheduling policy is computed that minimize the mean square error. Using insights taken from the development of the op"},"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":"1209.2067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2012-09-10T17:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"519342302b077f9c7eef54a31c7750b43faf75b523c2c7d8676042aa5c4674dd","abstract_canon_sha256":"927a94ddbf09e75033ca96e905cc13f754f114e47b2c086d06c7e272f917c96c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:22.513611Z","signature_b64":"8DafPo3oXcROTEIcPVJYkW3mz9S1aPUDxEJqnZTNS+LhrC3acpPmYHwe63eWCJHqPMI5kwK2oKI+FMSWMjSdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08309e523501c3d7312d70abb5d59ec0a22d72dd5dd0c24183de15e437c7a5ec","last_reissued_at":"2026-05-18T03:06:22.512993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:22.512993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Markov Decision Model for Adaptive Scheduling of Stored Scalable Videos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Alan C. Bovik, Chao Chen, Gustavo de Veciana, Robert W. Heath Jr","submitted_at":"2012-09-10T17:19:45Z","abstract_excerpt":"We propose two scheduling algorithms that seek to optimize the quality of scalably coded videos that have been stored at a video server before transmission.} The first scheduling algorithm is derived from a Markov Decision Process (MDP) formulation developed here. We model the dynamics of the channel as a Markov chain and reduce the problem of dynamic video scheduling to a tractable Markov decision problem over a finite state space. Based on the MDP formulation, a near-optimal scheduling policy is computed that minimize the mean square error. Using insights taken from the development of the op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2067","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.2067","created_at":"2026-05-18T03:06:22.513091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2067v2","created_at":"2026-05-18T03:06:22.513091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2067","created_at":"2026-05-18T03:06:22.513091+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAYJ4URVAHB5","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAYJ4URVAHB5OMJN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAYJ4URV","created_at":"2026-05-18T12:26:58.693483+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/BAYJ4URVAHB5OMJNOCV3LVM6YC","json":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC.json","graph_json":"https://pith.science/api/pith-number/BAYJ4URVAHB5OMJNOCV3LVM6YC/graph.json","events_json":"https://pith.science/api/pith-number/BAYJ4URVAHB5OMJNOCV3LVM6YC/events.json","paper":"https://pith.science/paper/BAYJ4URV"},"agent_actions":{"view_html":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC","download_json":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC.json","view_paper":"https://pith.science/paper/BAYJ4URV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2067&json=true","fetch_graph":"https://pith.science/api/pith-number/BAYJ4URVAHB5OMJNOCV3LVM6YC/graph.json","fetch_events":"https://pith.science/api/pith-number/BAYJ4URVAHB5OMJNOCV3LVM6YC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC/action/storage_attestation","attest_author":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC/action/author_attestation","sign_citation":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC/action/citation_signature","submit_replication":"https://pith.science/pith/BAYJ4URVAHB5OMJNOCV3LVM6YC/action/replication_record"}},"created_at":"2026-05-18T03:06:22.513091+00:00","updated_at":"2026-05-18T03:06:22.513091+00:00"}