{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:64JUYTQ7S27DUBLN7IBTF5SLQJ","short_pith_number":"pith:64JUYTQ7","schema_version":"1.0","canonical_sha256":"f7134c4e1f96be3a056dfa0332f64b824a12abe1a90c8999b9b5047a1f3125cd","source":{"kind":"arxiv","id":"1811.08238","version":1},"attestation_state":"computed","paper":{"title":"A general framework for handling commitment in online throughput maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, Franziska Eberle, Kevin Schewior, Lin Chen, Nicole Megow","submitted_at":"2018-11-20T13:29:27Z","abstract_excerpt":"We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes the number of jobs that complete on time. To circumvent known impossibility results, we make a standard slackness assumption by which the feasible time window for scheduling a job is at least $1+\\varepsilon$ times its processing time, for some $\\varepsilon>0$. We quantify the impact that different provider commitment requirements have on the performance of online algorithms. Our main contri"},"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":"1811.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-20T13:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"c6dcf5ab8da7728eb1c15ad2167fade70b7550f30f1aa644e87f180dcd4cd304","abstract_canon_sha256":"46f890f9912da907ce97ee3a383aa427207bea2ed1bfd7ff1795984098161431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:16.483426Z","signature_b64":"vOKftI42Qkge6IPs+MeGMWb++ouIrt6NM6Bp3wNDBiXmVyGd5d9MuPZXVPnjcsGdEJxQ9sjnIWVPTjUYcEPyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7134c4e1f96be3a056dfa0332f64b824a12abe1a90c8999b9b5047a1f3125cd","last_reissued_at":"2026-05-18T00:00:16.482729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:16.482729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general framework for handling commitment in online throughput maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, Franziska Eberle, Kevin Schewior, Lin Chen, Nicole Megow","submitted_at":"2018-11-20T13:29:27Z","abstract_excerpt":"We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes the number of jobs that complete on time. To circumvent known impossibility results, we make a standard slackness assumption by which the feasible time window for scheduling a job is at least $1+\\varepsilon$ times its processing time, for some $\\varepsilon>0$. We quantify the impact that different provider commitment requirements have on the performance of online algorithms. Our main contri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08238","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":"1811.08238","created_at":"2026-05-18T00:00:16.482827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08238v1","created_at":"2026-05-18T00:00:16.482827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08238","created_at":"2026-05-18T00:00:16.482827+00:00"},{"alias_kind":"pith_short_12","alias_value":"64JUYTQ7S27D","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"64JUYTQ7S27DUBLN","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"64JUYTQ7","created_at":"2026-05-18T12:32:08.215937+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/64JUYTQ7S27DUBLN7IBTF5SLQJ","json":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ.json","graph_json":"https://pith.science/api/pith-number/64JUYTQ7S27DUBLN7IBTF5SLQJ/graph.json","events_json":"https://pith.science/api/pith-number/64JUYTQ7S27DUBLN7IBTF5SLQJ/events.json","paper":"https://pith.science/paper/64JUYTQ7"},"agent_actions":{"view_html":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ","download_json":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ.json","view_paper":"https://pith.science/paper/64JUYTQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08238&json=true","fetch_graph":"https://pith.science/api/pith-number/64JUYTQ7S27DUBLN7IBTF5SLQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/64JUYTQ7S27DUBLN7IBTF5SLQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ/action/storage_attestation","attest_author":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ/action/author_attestation","sign_citation":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ/action/citation_signature","submit_replication":"https://pith.science/pith/64JUYTQ7S27DUBLN7IBTF5SLQJ/action/replication_record"}},"created_at":"2026-05-18T00:00:16.482827+00:00","updated_at":"2026-05-18T00:00:16.482827+00:00"}