{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LPNTV5KXT5ZDICM2BAXSACRO7H","short_pith_number":"pith:LPNTV5KX","schema_version":"1.0","canonical_sha256":"5bdb3af5579f7234099a082f200a2ef9e9e5d36d7efbb3184ad3f390040eec2f","source":{"kind":"arxiv","id":"1805.06865","version":2},"attestation_state":"computed","paper":{"title":"Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Ziv Scully","submitted_at":"2018-05-17T17:06:21Z","abstract_excerpt":"Scheduling to minimize mean response time in an M/G/1 queue is a classic problem. The problem is usually addressed in one of two scenarios. In the perfect-information scenario, the scheduler knows each job's exact size, or service requirement. In the zero-information scenario, the scheduler knows only each job's size distribution. The well-known shortest remaining processing time (SRPT) policy is optimal in the perfect-information scenario, and the more complex Gittins policy is optimal in the zero-information scenario.\n  In real systems the scheduler often has partial but incomplete informati"},"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":"1805.06865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-17T17:06:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9512d36fbce94419862f74686376ed9e21cd7d7e34948d965a367c61a308506d","abstract_canon_sha256":"e18390ad38624bcf3f89aec1fb32669d04fb25d39324be8caa170b51624de349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:09.345937Z","signature_b64":"XzZEPV6MyvVdajhhdvy2+LzBndShepmDweocgOaSEzho0NOPCP1pEfQHp53EdFiWouIPbyXFhSSyc9mmtDHjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bdb3af5579f7234099a082f200a2ef9e9e5d36d7efbb3184ad3f390040eec2f","last_reissued_at":"2026-05-18T00:01:09.345443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:09.345443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Ziv Scully","submitted_at":"2018-05-17T17:06:21Z","abstract_excerpt":"Scheduling to minimize mean response time in an M/G/1 queue is a classic problem. The problem is usually addressed in one of two scenarios. In the perfect-information scenario, the scheduler knows each job's exact size, or service requirement. In the zero-information scenario, the scheduler knows only each job's size distribution. The well-known shortest remaining processing time (SRPT) policy is optimal in the perfect-information scenario, and the more complex Gittins policy is optimal in the zero-information scenario.\n  In real systems the scheduler often has partial but incomplete informati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06865","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":"1805.06865","created_at":"2026-05-18T00:01:09.345511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06865v2","created_at":"2026-05-18T00:01:09.345511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06865","created_at":"2026-05-18T00:01:09.345511+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/LPNTV5KXT5ZDICM2BAXSACRO7H","json":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H.json","graph_json":"https://pith.science/api/pith-number/LPNTV5KXT5ZDICM2BAXSACRO7H/graph.json","events_json":"https://pith.science/api/pith-number/LPNTV5KXT5ZDICM2BAXSACRO7H/events.json","paper":"https://pith.science/paper/LPNTV5KX"},"agent_actions":{"view_html":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H","download_json":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H.json","view_paper":"https://pith.science/paper/LPNTV5KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06865&json=true","fetch_graph":"https://pith.science/api/pith-number/LPNTV5KXT5ZDICM2BAXSACRO7H/graph.json","fetch_events":"https://pith.science/api/pith-number/LPNTV5KXT5ZDICM2BAXSACRO7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H/action/storage_attestation","attest_author":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H/action/author_attestation","sign_citation":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H/action/citation_signature","submit_replication":"https://pith.science/pith/LPNTV5KXT5ZDICM2BAXSACRO7H/action/replication_record"}},"created_at":"2026-05-18T00:01:09.345511+00:00","updated_at":"2026-05-18T00:01:09.345511+00:00"}