{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WSI4DACBLHUH4SD6YVMS3YAACN","short_pith_number":"pith:WSI4DACB","schema_version":"1.0","canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","source":{"kind":"arxiv","id":"1708.09046","version":2},"attestation_state":"computed","paper":{"title":"An O(log log m)-competitive Algorithm for Online Machine Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Moseley, Clifford Stein, Kirk Pruhs, Sungjin Im","submitted_at":"2017-08-29T21:57:22Z","abstract_excerpt":"This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where each job has a deadline by which it must be completed. The goal is to design an online scheduler that feasibly schedules the jobs on a nearly minimal number of machines. An algorithm is c-machine optimal if the algorithm will feasibly schedule a collection of jobs on cm machines if there exists a feasible schedule on m machines. For over two decades the best known result was a O(log P)-machine optimal algorithm, where P"},"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":"1708.09046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-29T21:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"a05ccf1aa534387a09cb60bbcb1af3111238a79a904dbdd514ff21428368d40a","abstract_canon_sha256":"ac5ffae0d1a7e5f7318334078a4ebe8021f8e4410d024028d1ce81de81965d6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:54.352058Z","signature_b64":"Pr1AGeuqAaxP11gK/PnvPz6s7rfDqVGh9JEdYbvQTXzT27LGD9Oru005hfUZ+vI+9aBWEHMSNobKNrp8Es4gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","last_reissued_at":"2026-05-18T00:24:54.351403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:54.351403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(log log m)-competitive Algorithm for Online Machine Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Moseley, Clifford Stein, Kirk Pruhs, Sungjin Im","submitted_at":"2017-08-29T21:57:22Z","abstract_excerpt":"This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where each job has a deadline by which it must be completed. The goal is to design an online scheduler that feasibly schedules the jobs on a nearly minimal number of machines. An algorithm is c-machine optimal if the algorithm will feasibly schedule a collection of jobs on cm machines if there exists a feasible schedule on m machines. For over two decades the best known result was a O(log P)-machine optimal algorithm, where P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09046","kind":"arxiv","version":2},"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":"1708.09046","created_at":"2026-05-18T00:24:54.351506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09046v2","created_at":"2026-05-18T00:24:54.351506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09046","created_at":"2026-05-18T00:24:54.351506+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSI4DACBLHUH","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSI4DACBLHUH4SD6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSI4DACB","created_at":"2026-05-18T12:31:53.515858+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/WSI4DACBLHUH4SD6YVMS3YAACN","json":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN.json","graph_json":"https://pith.science/api/pith-number/WSI4DACBLHUH4SD6YVMS3YAACN/graph.json","events_json":"https://pith.science/api/pith-number/WSI4DACBLHUH4SD6YVMS3YAACN/events.json","paper":"https://pith.science/paper/WSI4DACB"},"agent_actions":{"view_html":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN","download_json":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN.json","view_paper":"https://pith.science/paper/WSI4DACB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09046&json=true","fetch_graph":"https://pith.science/api/pith-number/WSI4DACBLHUH4SD6YVMS3YAACN/graph.json","fetch_events":"https://pith.science/api/pith-number/WSI4DACBLHUH4SD6YVMS3YAACN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/action/storage_attestation","attest_author":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/action/author_attestation","sign_citation":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/action/citation_signature","submit_replication":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/action/replication_record"}},"created_at":"2026-05-18T00:24:54.351506+00:00","updated_at":"2026-05-18T00:24:54.351506+00:00"}