{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HK6P3YSEOSTJGGQ5WFSCYP4TUQ","short_pith_number":"pith:HK6P3YSE","canonical_record":{"source":{"id":"1506.05721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:39:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"10abf83021aba1568be62c6cbe8ab808e2dde68edbbafa746beff0df02f75c4a","abstract_canon_sha256":"247d2a5937c02169d14e9bb79d0436266d3e0b1a6ab1d7deeae299b75b023fd5"},"schema_version":"1.0"},"canonical_sha256":"3abcfde24474a6931a1db1642c3f93a43b2cbc64bc1f66f85c0aad5b27542dcf","source":{"kind":"arxiv","id":"1506.05721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05721","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05721v1","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05721","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"HK6P3YSEOSTJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HK6P3YSEOSTJGGQ5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HK6P3YSE","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HK6P3YSEOSTJGGQ5WFSCYP4TUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:39:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"10abf83021aba1568be62c6cbe8ab808e2dde68edbbafa746beff0df02f75c4a","abstract_canon_sha256":"247d2a5937c02169d14e9bb79d0436266d3e0b1a6ab1d7deeae299b75b023fd5"},"schema_version":"1.0"},"canonical_sha256":"3abcfde24474a6931a1db1642c3f93a43b2cbc64bc1f66f85c0aad5b27542dcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:09.877883Z","signature_b64":"YnjyL7SAnlJq0Enw0PjzartkZNcGZIe7BD3o/+GnUzBd93Ni/5VOYk44w+0KhIrsviodePGdS3716WHvV6/gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3abcfde24474a6931a1db1642c3f93a43b2cbc64bc1f66f85c0aad5b27542dcf","last_reissued_at":"2026-05-18T01:44:09.877128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:09.877128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05721","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-18T01:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEvebTgw0Xx5X5E0ukVfQNrSJMoGfjc3yrEqOyhhWI03M9nqBmWIUb0jmg98MH+fcRzuOx+qVvc0/2M3XPGyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:07.943836Z"},"content_sha256":"74d9080851b3c18b505d14512aa0f18228e92c06f994cd8e083540744e11ad3a","schema_version":"1.0","event_id":"sha256:74d9080851b3c18b505d14512aa0f18228e92c06f994cd8e083540744e11ad3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HK6P3YSEOSTJGGQ5WFSCYP4TUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Kevin Schewior, Lin Chen, Nicole Megow","submitted_at":"2015-06-18T15:39:00Z","abstract_excerpt":"We consider the online machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. Our main result is a general O(m^2 log m)-competitive algorithm for the preemptive online problem, where m is the optimal number of machines used in an offline solution. This is the first improvement on an O(log (p_max/p_min))-competitive algorithm by Phillips et al. (STOC 1997), which was to date the best known algorithm even when m=2. Our algorithm is O(1)-competitive for any m that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05721","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-18T01:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7ZN355KRSy7Z7OBxq81U/4mcJDmE9KWdQB3w22jb6LLB/faGoIB4b9twS1+CY62nMcjT9l79fahytRaCpKmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:07.944181Z"},"content_sha256":"ff9df3557bbb1b9f07b4b480b1c2cb01f83e21191324636dd4a7f7d5d31ec6b7","schema_version":"1.0","event_id":"sha256:ff9df3557bbb1b9f07b4b480b1c2cb01f83e21191324636dd4a7f7d5d31ec6b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/bundle.json","state_url":"https://pith.science/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/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-01T05:23:07Z","links":{"resolver":"https://pith.science/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ","bundle":"https://pith.science/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/bundle.json","state":"https://pith.science/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HK6P3YSEOSTJGGQ5WFSCYP4TUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HK6P3YSEOSTJGGQ5WFSCYP4TUQ","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":"247d2a5937c02169d14e9bb79d0436266d3e0b1a6ab1d7deeae299b75b023fd5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:39:00Z","title_canon_sha256":"10abf83021aba1568be62c6cbe8ab808e2dde68edbbafa746beff0df02f75c4a"},"schema_version":"1.0","source":{"id":"1506.05721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05721","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05721v1","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05721","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"HK6P3YSEOSTJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HK6P3YSEOSTJGGQ5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HK6P3YSE","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ff9df3557bbb1b9f07b4b480b1c2cb01f83e21191324636dd4a7f7d5d31ec6b7","target":"graph","created_at":"2026-05-18T01:44:09Z","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 machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. Our main result is a general O(m^2 log m)-competitive algorithm for the preemptive online problem, where m is the optimal number of machines used in an offline solution. This is the first improvement on an O(log (p_max/p_min))-competitive algorithm by Phillips et al. (STOC 1997), which was to date the best known algorithm even when m=2. Our algorithm is O(1)-competitive for any m that ","authors_text":"Kevin Schewior, Lin Chen, Nicole Megow","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:39:00Z","title":"An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05721","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:74d9080851b3c18b505d14512aa0f18228e92c06f994cd8e083540744e11ad3a","target":"record","created_at":"2026-05-18T01:44:09Z","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":"247d2a5937c02169d14e9bb79d0436266d3e0b1a6ab1d7deeae299b75b023fd5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:39:00Z","title_canon_sha256":"10abf83021aba1568be62c6cbe8ab808e2dde68edbbafa746beff0df02f75c4a"},"schema_version":"1.0","source":{"id":"1506.05721","kind":"arxiv","version":1}},"canonical_sha256":"3abcfde24474a6931a1db1642c3f93a43b2cbc64bc1f66f85c0aad5b27542dcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3abcfde24474a6931a1db1642c3f93a43b2cbc64bc1f66f85c0aad5b27542dcf","first_computed_at":"2026-05-18T01:44:09.877128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:09.877128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YnjyL7SAnlJq0Enw0PjzartkZNcGZIe7BD3o/+GnUzBd93Ni/5VOYk44w+0KhIrsviodePGdS3716WHvV6/gBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:09.877883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74d9080851b3c18b505d14512aa0f18228e92c06f994cd8e083540744e11ad3a","sha256:ff9df3557bbb1b9f07b4b480b1c2cb01f83e21191324636dd4a7f7d5d31ec6b7"],"state_sha256":"10f5b6033cd117eb7ed6c5c836a654b2370d1343f079bd6f568d34cd72f8c3bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+OJidtPyKjLUWOxyMl8HtuT3b/PkWFCVyI8ETTCDGoCZ+uqlCdPhE+lxy4mn0MfBFL2w4Fel5L9tffMrSd3oDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:23:07.946364Z","bundle_sha256":"7686c9a93b920657b410aecde66852384780bb462f042e82f6da138e2850f3c0"}}