{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K7CHN3VU6AKD523WGMALRPMK7Z","short_pith_number":"pith:K7CHN3VU","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"},"canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","source":{"kind":"arxiv","id":"1610.00399","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00399","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00399v5","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00399","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"K7CHN3VU6AKD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K7CHN3VU6AKD523W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K7CHN3VU","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K7CHN3VU6AKD523WGMALRPMK7Z","target":"record","payload":{"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"},"canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","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"},"source_kind":"arxiv","source_id":"1610.00399","source_version":5,"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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+iXZ2tG6oh9Ke+hOfpdMf7m2yLT+7885rVezDzVvnKU5NqmUSyzWQgf3kcOoriz+e4loQlgjX1aWo7229+hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:46:26.593908Z"},"content_sha256":"edb098a3ccb4af38a1cb2f7e05272a62681c2cc7671db68de663731f8e2022d2","schema_version":"1.0","event_id":"sha256:edb098a3ccb4af38a1cb2f7e05272a62681c2cc7671db68de663731f8e2022d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K7CHN3VU6AKD523WGMALRPMK7Z","target":"graph","payload":{"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"},"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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDK1X5HpEdb+/NY+TRIV+Fen+kxM5zspOTckLOolzGYdRUXTbpy2yo7yKb8gziM65IxqcO50Y0qE5kVFKUugCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:46:26.594240Z"},"content_sha256":"00ad3b12f90f8d5e45845bcfd1581ce9f62e746bc37ed92effccfb66202a65ce","schema_version":"1.0","event_id":"sha256:00ad3b12f90f8d5e45845bcfd1581ce9f62e746bc37ed92effccfb66202a65ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/bundle.json","state_url":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7CHN3VU6AKD523WGMALRPMK7Z/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:46:26Z","links":{"resolver":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z","bundle":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/bundle.json","state":"https://pith.science/pith/K7CHN3VU6AKD523WGMALRPMK7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7CHN3VU6AKD523WGMALRPMK7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K7CHN3VU6AKD523WGMALRPMK7Z","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":"ede83b0ec1ebdeae8ad93cfe3af6e6ebab8ca7f5cb1c3b961998b68203d6121f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-03T04:08:57Z","title_canon_sha256":"ec374a05004cc19bc98af988f6ea20b8531638a377c34f036937c5118d74c69d"},"schema_version":"1.0","source":{"id":"1610.00399","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00399","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00399v5","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00399","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"K7CHN3VU6AKD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K7CHN3VU6AKD523W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K7CHN3VU","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:00ad3b12f90f8d5e45845bcfd1581ce9f62e746bc37ed92effccfb66202a65ce","target":"graph","created_at":"2026-05-18T00:40:46Z","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":"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","authors_text":"Lang Tong, Yunjian Xu, Zhe Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-03T04:08:57Z","title":"Deadline Scheduling as Restless Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00399","kind":"arxiv","version":5},"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:edb098a3ccb4af38a1cb2f7e05272a62681c2cc7671db68de663731f8e2022d2","target":"record","created_at":"2026-05-18T00:40:46Z","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":"ede83b0ec1ebdeae8ad93cfe3af6e6ebab8ca7f5cb1c3b961998b68203d6121f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-03T04:08:57Z","title_canon_sha256":"ec374a05004cc19bc98af988f6ea20b8531638a377c34f036937c5118d74c69d"},"schema_version":"1.0","source":{"id":"1610.00399","kind":"arxiv","version":5}},"canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c476eeb4f0143eeb763300b8bd8afe5f64e5866f6c37ecd9ac82e44a1b998a","first_computed_at":"2026-05-18T00:40:46.641965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:46.641965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1AmRqJZtd3R952OCkqpQFaU/OLXp1DwnAJK8J5O/yYX82Bn2qDk2QHkd/NedCaGzAOhqOcd3fo0rKAJSU7dLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:46.642603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00399","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edb098a3ccb4af38a1cb2f7e05272a62681c2cc7671db68de663731f8e2022d2","sha256:00ad3b12f90f8d5e45845bcfd1581ce9f62e746bc37ed92effccfb66202a65ce"],"state_sha256":"cc8613d8014fea7e8f1c380ae055e1bac5fe75640a1e71e40e51a765034450bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WglBFDiLPwDm23zjPIK2UuJRkwlCEwVjdzohuKRoMqyWza+kt+vn8KIMAO6GX3gltud6xjPUCgSy1ssr3BhDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:46:26.596297Z","bundle_sha256":"9b4c427242a8cf2ccb56d8751340ad4d61232fee86f1d5fc2fc25f29dc92159a"}}