{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K7CHN3VU6AKD523WGMALRPMK7Z","short_pith_number":"pith:K7CHN3VU","schema_version":"1.0","canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","source":{"kind":"arxiv","id":"1610.00399","version":5},"attestation_state":"computed","paper":{"title":"Deadline Scheduling as Restless Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lang Tong, Yunjian Xu, Zhe Yu","submitted_at":"2016-10-03T04:08:57Z","abstract_excerpt":"The problem of stochastic deadline scheduling is considered. A constrained Markov decision process model is introduced in which jobs arrive randomly at a service center with stochastic job sizes, rewards, and completion deadlines. The service provider faces random processing costs, convex non-completion penalties, and a capacity constraint that limits the simultaneous processing of jobs. Formulated as a restless multi-armed bandit problem, the stochastic deadline scheduling problem is shown to be indexable. A closed-form expression of the Whittle's index is obtained for the case when the proce"},"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":"1610.00399","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-03T04:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"ec374a05004cc19bc98af988f6ea20b8531638a377c34f036937c5118d74c69d","abstract_canon_sha256":"ede83b0ec1ebdeae8ad93cfe3af6e6ebab8ca7f5cb1c3b961998b68203d6121f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:46.642603Z","signature_b64":"1AmRqJZtd3R952OCkqpQFaU/OLXp1DwnAJK8J5O/yYX82Bn2qDk2QHkd/NedCaGzAOhqOcd3fo0rKAJSU7dLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","last_reissued_at":"2026-05-18T00:40:46.641965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:46.641965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deadline Scheduling as Restless Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lang Tong, Yunjian Xu, Zhe Yu","submitted_at":"2016-10-03T04:08:57Z","abstract_excerpt":"The problem of stochastic deadline scheduling is considered. A constrained Markov decision process model is introduced in which jobs arrive randomly at a service center with stochastic job sizes, rewards, and completion deadlines. The service provider faces random processing costs, convex non-completion penalties, and a capacity constraint that limits the simultaneous processing of jobs. Formulated as a restless multi-armed bandit problem, the stochastic deadline scheduling problem is shown to be indexable. A closed-form expression of the Whittle's index is obtained for the case when the proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00399","kind":"arxiv","version":5},"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":"1610.00399","created_at":"2026-05-18T00:40:46.642047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00399v5","created_at":"2026-05-18T00:40:46.642047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00399","created_at":"2026-05-18T00:40:46.642047+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7CHN3VU6AKD","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7CHN3VU6AKD523W","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7CHN3VU","created_at":"2026-05-18T12:30:25.849896+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/K7CHN3VU6AKD523WGMALRPMK7Z","json":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z.json","graph_json":"https://pith.science/api/pith-number/K7CHN3VU6AKD523WGMALRPMK7Z/graph.json","events_json":"https://pith.science/api/pith-number/K7CHN3VU6AKD523WGMALRPMK7Z/events.json","paper":"https://pith.science/paper/K7CHN3VU"},"agent_actions":{"view_html":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z","download_json":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z.json","view_paper":"https://pith.science/paper/K7CHN3VU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00399&json=true","fetch_graph":"https://pith.science/api/pith-number/K7CHN3VU6AKD523WGMALRPMK7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/K7CHN3VU6AKD523WGMALRPMK7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/action/storage_attestation","attest_author":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/action/author_attestation","sign_citation":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/action/citation_signature","submit_replication":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/action/replication_record"}},"created_at":"2026-05-18T00:40:46.642047+00:00","updated_at":"2026-05-18T00:40:46.642047+00:00"}