{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WCALROIQIOO5IBHOBMGN732P57","short_pith_number":"pith:WCALROIQ","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"},"canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","source":{"kind":"arxiv","id":"1806.02207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02207","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02207v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02207","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"WCALROIQIOO5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCALROIQIOO5IBHO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCALROIQ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WCALROIQIOO5IBHOBMGN732P57","target":"record","payload":{"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"},"canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","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"},"source_kind":"arxiv","source_id":"1806.02207","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-18T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LSWeu7+RLnZjZ/Ip9fNQ/tfO8EFWjE2EhPLKAR32cxQ9wwHQOaoUvFuKb3BQ/lOPxnflvkqi/QVnY7kKbVzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:18:09.505809Z"},"content_sha256":"44a3b1d8b24960b0ebb65bc73cdc7b1f9902680c140d6256f6d3c9577b1f0bd2","schema_version":"1.0","event_id":"sha256:44a3b1d8b24960b0ebb65bc73cdc7b1f9902680c140d6256f6d3c9577b1f0bd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WCALROIQIOO5IBHOBMGN732P57","target":"graph","payload":{"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"},"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-18T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMzQxS4V4iF9Y02NfJYqpfNg5IVgq7y35kqkvRwVxS4vSacyr8XzAmk3LBDegmC1ovvXXuXoxgKT8O+sw86jAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:18:09.506452Z"},"content_sha256":"f5c7d8924b2cb382e18f7608be33c314a1995c59ed63dc6abdfc7dca9694f49e","schema_version":"1.0","event_id":"sha256:f5c7d8924b2cb382e18f7608be33c314a1995c59ed63dc6abdfc7dca9694f49e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/bundle.json","state_url":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCALROIQIOO5IBHOBMGN732P57/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-05-19T18:18:09Z","links":{"resolver":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57","bundle":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/bundle.json","state":"https://pith.science/pith/WCALROIQIOO5IBHOBMGN732P57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCALROIQIOO5IBHOBMGN732P57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WCALROIQIOO5IBHOBMGN732P57","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":"85d40c8b1efc149505e6238f790d13b56ac8640b5c6e95beb9ef606c60fe9629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-06T14:19:52Z","title_canon_sha256":"e1f2b851565cd1d0d66424b5ab51bb6d9ab6d94ef8b5e21d029d18730e239aac"},"schema_version":"1.0","source":{"id":"1806.02207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02207","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02207v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02207","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"WCALROIQIOO5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCALROIQIOO5IBHO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCALROIQ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:f5c7d8924b2cb382e18f7608be33c314a1995c59ed63dc6abdfc7dca9694f49e","target":"graph","created_at":"2026-05-18T00:14:02Z","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 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","authors_text":"Ning Kang, Xiaowei Wu, Yuhao Zhang, Zhihao Gavin Tang, Zhiyi Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-06T14:19:52Z","title":"Online Makespan Minimization: The Power of Restart"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02207","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:44a3b1d8b24960b0ebb65bc73cdc7b1f9902680c140d6256f6d3c9577b1f0bd2","target":"record","created_at":"2026-05-18T00:14:02Z","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":"85d40c8b1efc149505e6238f790d13b56ac8640b5c6e95beb9ef606c60fe9629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-06T14:19:52Z","title_canon_sha256":"e1f2b851565cd1d0d66424b5ab51bb6d9ab6d94ef8b5e21d029d18730e239aac"},"schema_version":"1.0","source":{"id":"1806.02207","kind":"arxiv","version":1}},"canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b080b8b910439dd404ee0b0cdfef4feff1ef17ef81b6ccdf2a21070aa0f530c1","first_computed_at":"2026-05-18T00:14:02.341828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:02.341828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgeocFoq8aUGWZ7SlRunfX6qznTehf3IaTCO4JiMImYRG2POmrjicBeRbVmGtHyFqZk/Vp5PG1KtWpNIndP3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:02.342509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a3b1d8b24960b0ebb65bc73cdc7b1f9902680c140d6256f6d3c9577b1f0bd2","sha256:f5c7d8924b2cb382e18f7608be33c314a1995c59ed63dc6abdfc7dca9694f49e"],"state_sha256":"81b78b53cd75837af0d1ee99e5d509fd362f0bf9aa6234a1ec932b42ed27dd6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tfISoCud8JeLh25rdpxD5fGOItUTfVhjfnIe9VYybmmBTyfKcusrZ0Jtjyg3i3KblfK5+P3mykXRqKbtyHMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:18:09.508690Z","bundle_sha256":"808423c82e607d853125989f638f0ea3c4f4ab87817358f065a3500de5bdeba5"}}