{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WCALROIQIOO5IBHOBMGN732P57","short_pith_number":"pith:WCALROIQ","schema_version":"1.0","canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","source":{"kind":"arxiv","id":"1806.02207","version":1},"attestation_state":"computed","paper":{"title":"Online Makespan Minimization: The Power of Restart","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Kang, Xiaowei Wu, Yuhao Zhang, Zhihao Gavin Tang, Zhiyi Huang","submitted_at":"2018-06-06T14:19:52Z","abstract_excerpt":"We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of $(5 - \\sqrt{5})/2 \\approx 1.382$, matching the lower bound by Chen and Vestjens (ORL 1997). Furthermore, Noga and Seiden note that in many applications one can kill a job and restart it later, and they leave an open problem whether algorithms with restart can obtain better competit"},"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":"1806.02207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-06T14:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"e1f2b851565cd1d0d66424b5ab51bb6d9ab6d94ef8b5e21d029d18730e239aac","abstract_canon_sha256":"85d40c8b1efc149505e6238f790d13b56ac8640b5c6e95beb9ef606c60fe9629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.342509Z","signature_b64":"zgeocFoq8aUGWZ7SlRunfX6qznTehf3IaTCO4JiMImYRG2POmrjicBeRbVmGtHyFqZk/Vp5PG1KtWpNIndP3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","last_reissued_at":"2026-05-18T00:14:02.341828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.341828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Makespan Minimization: The Power of Restart","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Kang, Xiaowei Wu, Yuhao Zhang, Zhihao Gavin Tang, Zhiyi Huang","submitted_at":"2018-06-06T14:19:52Z","abstract_excerpt":"We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of $(5 - \\sqrt{5})/2 \\approx 1.382$, matching the lower bound by Chen and Vestjens (ORL 1997). Furthermore, Noga and Seiden note that in many applications one can kill a job and restart it later, and they leave an open problem whether algorithms with restart can obtain better competit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02207","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":"1806.02207","created_at":"2026-05-18T00:14:02.341944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02207v1","created_at":"2026-05-18T00:14:02.341944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02207","created_at":"2026-05-18T00:14:02.341944+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCALROIQIOO5","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCALROIQIOO5IBHO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCALROIQ","created_at":"2026-05-18T12:32:59.047623+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/WCALROIQIOO5IBHOBMGN732P57","json":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57.json","graph_json":"https://pith.science/api/pith-number/WCALROIQIOO5IBHOBMGN732P57/graph.json","events_json":"https://pith.science/api/pith-number/WCALROIQIOO5IBHOBMGN732P57/events.json","paper":"https://pith.science/paper/WCALROIQ"},"agent_actions":{"view_html":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57","download_json":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57.json","view_paper":"https://pith.science/paper/WCALROIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02207&json=true","fetch_graph":"https://pith.science/api/pith-number/WCALROIQIOO5IBHOBMGN732P57/graph.json","fetch_events":"https://pith.science/api/pith-number/WCALROIQIOO5IBHOBMGN732P57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/action/storage_attestation","attest_author":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/action/author_attestation","sign_citation":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/action/citation_signature","submit_replication":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/action/replication_record"}},"created_at":"2026-05-18T00:14:02.341944+00:00","updated_at":"2026-05-18T00:14:02.341944+00:00"}