{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CJWSKSZMN3QEUZBZASBYUYBNQ3","short_pith_number":"pith:CJWSKSZM","schema_version":"1.0","canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","source":{"kind":"arxiv","id":"1904.06150","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Online Utilization with Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn (Sapienza, Germany), Italy), University of Rome, Uwe Schwiegelshohn (TU Dortmund University","submitted_at":"2019-04-12T10:39:07Z","abstract_excerpt":"We investigate online scheduling with commitment for parallel identical machines. Our objective is to maximize the total processing time of accepted jobs. As soon as a job has been submitted, the commitment constraint forces us to decide immediately whether we accept or reject the job. Upon acceptance of a job, we must complete it before its deadline $d$ that satisfies $d \\geq (1+\\epsilon)\\cdot p + r$, with $p$ and $r$ being the processing time and the submission time of the job, respectively while $\\epsilon>0$ is the slack of the system. Since the hard case typically arises for near-tight dea"},"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":"1904.06150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T10:39:07Z","cross_cats_sorted":[],"title_canon_sha256":"ced4e085b9080ff7b87066a6e186128c4f8eb3b108ee79cc3b74122c1c04ae77","abstract_canon_sha256":"417abd3c4acfa929c84fa4ea15e0bf6b0acd3ffe609f3532affa3c5ed12a513c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.957156Z","signature_b64":"55JHVlcH6lDsiSR4RL4wjQixtsVQsEjFuL8FLL/ensK9z1SvN1jzQhXuz+uFTYYrZqarFbhcTmzcus6hCUBUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","last_reissued_at":"2026-05-17T23:48:43.956574Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.956574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Online Utilization with Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn (Sapienza, Germany), Italy), University of Rome, Uwe Schwiegelshohn (TU Dortmund University","submitted_at":"2019-04-12T10:39:07Z","abstract_excerpt":"We investigate online scheduling with commitment for parallel identical machines. Our objective is to maximize the total processing time of accepted jobs. As soon as a job has been submitted, the commitment constraint forces us to decide immediately whether we accept or reject the job. Upon acceptance of a job, we must complete it before its deadline $d$ that satisfies $d \\geq (1+\\epsilon)\\cdot p + r$, with $p$ and $r$ being the processing time and the submission time of the job, respectively while $\\epsilon>0$ is the slack of the system. Since the hard case typically arises for near-tight dea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06150","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":"1904.06150","created_at":"2026-05-17T23:48:43.956662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06150v1","created_at":"2026-05-17T23:48:43.956662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06150","created_at":"2026-05-17T23:48:43.956662+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJWSKSZMN3QE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJWSKSZMN3QEUZBZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJWSKSZM","created_at":"2026-05-18T12:33:15.570797+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/CJWSKSZMN3QEUZBZASBYUYBNQ3","json":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3.json","graph_json":"https://pith.science/api/pith-number/CJWSKSZMN3QEUZBZASBYUYBNQ3/graph.json","events_json":"https://pith.science/api/pith-number/CJWSKSZMN3QEUZBZASBYUYBNQ3/events.json","paper":"https://pith.science/paper/CJWSKSZM"},"agent_actions":{"view_html":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3","download_json":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3.json","view_paper":"https://pith.science/paper/CJWSKSZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06150&json=true","fetch_graph":"https://pith.science/api/pith-number/CJWSKSZMN3QEUZBZASBYUYBNQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/CJWSKSZMN3QEUZBZASBYUYBNQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/action/storage_attestation","attest_author":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/action/author_attestation","sign_citation":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/action/citation_signature","submit_replication":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/action/replication_record"}},"created_at":"2026-05-17T23:48:43.956662+00:00","updated_at":"2026-05-17T23:48:43.956662+00:00"}