{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CJWSKSZMN3QEUZBZASBYUYBNQ3","short_pith_number":"pith:CJWSKSZM","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"},"canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","source":{"kind":"arxiv","id":"1904.06150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06150","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06150v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06150","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"CJWSKSZMN3QE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CJWSKSZMN3QEUZBZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CJWSKSZM","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CJWSKSZMN3QEUZBZASBYUYBNQ3","target":"record","payload":{"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"},"canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","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"},"source_kind":"arxiv","source_id":"1904.06150","source_version":1,"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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1rv+REAjZWj2VbgMowDOvwRN38EWeLDC/gYBVu/J/XJwviQ48RfWGf6AG+E9xnLPo2zABP5Pr6o7csKPK1fAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:25.891236Z"},"content_sha256":"86581875e94422c2dbcabbde6a83c3d68028bd6ab389ad7b3014105392f69ea1","schema_version":"1.0","event_id":"sha256:86581875e94422c2dbcabbde6a83c3d68028bd6ab389ad7b3014105392f69ea1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CJWSKSZMN3QEUZBZASBYUYBNQ3","target":"graph","payload":{"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"},"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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pC7dRdvpa9kNqkEXNElXVntXblFiwDZhT8NGpBTeiI62vaAx8dedz/yuonYSCcgO+ILzvrlqxRG2VBKmGoFOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:25.891637Z"},"content_sha256":"c9165c59da674b3dface7fc9ddee8089ebf7c35a9c0f90d5191a967b93952b95","schema_version":"1.0","event_id":"sha256:c9165c59da674b3dface7fc9ddee8089ebf7c35a9c0f90d5191a967b93952b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/bundle.json","state_url":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/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-01T14:43:25Z","links":{"resolver":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3","bundle":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/bundle.json","state":"https://pith.science/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJWSKSZMN3QEUZBZASBYUYBNQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CJWSKSZMN3QEUZBZASBYUYBNQ3","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":"417abd3c4acfa929c84fa4ea15e0bf6b0acd3ffe609f3532affa3c5ed12a513c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T10:39:07Z","title_canon_sha256":"ced4e085b9080ff7b87066a6e186128c4f8eb3b108ee79cc3b74122c1c04ae77"},"schema_version":"1.0","source":{"id":"1904.06150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06150","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06150v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06150","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"CJWSKSZMN3QE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CJWSKSZMN3QEUZBZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CJWSKSZM","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:c9165c59da674b3dface7fc9ddee8089ebf7c35a9c0f90d5191a967b93952b95","target":"graph","created_at":"2026-05-17T23:48:43Z","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":"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","authors_text":"Chris Schwiegelshohn (Sapienza, Germany), Italy), University of Rome, Uwe Schwiegelshohn (TU Dortmund University","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T10:39:07Z","title":"Maximizing Online Utilization with Commitment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06150","kind":"arxiv","version":1},"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:86581875e94422c2dbcabbde6a83c3d68028bd6ab389ad7b3014105392f69ea1","target":"record","created_at":"2026-05-17T23:48:43Z","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":"417abd3c4acfa929c84fa4ea15e0bf6b0acd3ffe609f3532affa3c5ed12a513c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T10:39:07Z","title_canon_sha256":"ced4e085b9080ff7b87066a6e186128c4f8eb3b108ee79cc3b74122c1c04ae77"},"schema_version":"1.0","source":{"id":"1904.06150","kind":"arxiv","version":1}},"canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"126d254b2c6ee04a643904838a602d86d1455f2f3593fd8a28fc1783951fc25b","first_computed_at":"2026-05-17T23:48:43.956574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:43.956574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55JHVlcH6lDsiSR4RL4wjQixtsVQsEjFuL8FLL/ensK9z1SvN1jzQhXuz+uFTYYrZqarFbhcTmzcus6hCUBUDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:43.957156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86581875e94422c2dbcabbde6a83c3d68028bd6ab389ad7b3014105392f69ea1","sha256:c9165c59da674b3dface7fc9ddee8089ebf7c35a9c0f90d5191a967b93952b95"],"state_sha256":"11795558b7ce70057658bc187a203bc1e5b5156beb20edfab6eb4faa107f08fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oobiYa3oRqBBGPEouW9LIodYqbVdm2A4BVnO4wU1TsMmD6kggBv4cW3dMf9Y/pSrzKrzzNkzC51alwVONx4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:43:25.893599Z","bundle_sha256":"3fe502a809e87359d8a800b22497252a1919a7db3118992f30b4b3217bf169f2"}}