{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WSI4DACBLHUH4SD6YVMS3YAACN","short_pith_number":"pith:WSI4DACB","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"},"canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","source":{"kind":"arxiv","id":"1708.09046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09046","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09046v2","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09046","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"WSI4DACBLHUH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSI4DACBLHUH4SD6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSI4DACB","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WSI4DACBLHUH4SD6YVMS3YAACN","target":"record","payload":{"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"},"canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","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"},"source_kind":"arxiv","source_id":"1708.09046","source_version":2,"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:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMNBaxHNWjKqSajOxi1obiuKAE+CMNrw+VF1t5y1oBK6LDOt7iAyQGPp14t5iP7+ZCFhIsmzefRDmuh4CWh8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:36:11.264879Z"},"content_sha256":"2af04d8cc716b4126979dca8bbd801424b26051f002cc3d55c49823d4d6c4258","schema_version":"1.0","event_id":"sha256:2af04d8cc716b4126979dca8bbd801424b26051f002cc3d55c49823d4d6c4258"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WSI4DACBLHUH4SD6YVMS3YAACN","target":"graph","payload":{"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"},"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:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"106/WlghLTWg2xLrGX9RNV8z5cssdofenEnBuJwGSHq4Y91FY8ywrL4nydPYeeGFsQv7sTMjwxynyaSfiWPICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:36:11.265692Z"},"content_sha256":"f524c665fd7a0cb1b8c4a692aadb21118111e4a0bde453f37350dcf3d452e6ec","schema_version":"1.0","event_id":"sha256:f524c665fd7a0cb1b8c4a692aadb21118111e4a0bde453f37350dcf3d452e6ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/bundle.json","state_url":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSI4DACBLHUH4SD6YVMS3YAACN/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-01T02:36:11Z","links":{"resolver":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN","bundle":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/bundle.json","state":"https://pith.science/pith/WSI4DACBLHUH4SD6YVMS3YAACN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSI4DACBLHUH4SD6YVMS3YAACN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WSI4DACBLHUH4SD6YVMS3YAACN","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":"ac5ffae0d1a7e5f7318334078a4ebe8021f8e4410d024028d1ce81de81965d6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-29T21:57:22Z","title_canon_sha256":"a05ccf1aa534387a09cb60bbcb1af3111238a79a904dbdd514ff21428368d40a"},"schema_version":"1.0","source":{"id":"1708.09046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09046","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09046v2","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09046","created_at":"2026-05-18T00:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"WSI4DACBLHUH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSI4DACBLHUH4SD6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSI4DACB","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:f524c665fd7a0cb1b8c4a692aadb21118111e4a0bde453f37350dcf3d452e6ec","target":"graph","created_at":"2026-05-18T00:24:54Z","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":"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","authors_text":"Benjamin Moseley, Clifford Stein, Kirk Pruhs, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-29T21:57:22Z","title":"An O(log log m)-competitive Algorithm for Online Machine Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09046","kind":"arxiv","version":2},"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:2af04d8cc716b4126979dca8bbd801424b26051f002cc3d55c49823d4d6c4258","target":"record","created_at":"2026-05-18T00:24:54Z","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":"ac5ffae0d1a7e5f7318334078a4ebe8021f8e4410d024028d1ce81de81965d6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-29T21:57:22Z","title_canon_sha256":"a05ccf1aa534387a09cb60bbcb1af3111238a79a904dbdd514ff21428368d40a"},"schema_version":"1.0","source":{"id":"1708.09046","kind":"arxiv","version":2}},"canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b491c1804159e87e487ec5592de000134c7c04190740e912e3640cbff7c8e5a8","first_computed_at":"2026-05-18T00:24:54.351403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:54.351403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pr1AGeuqAaxP11gK/PnvPz6s7rfDqVGh9JEdYbvQTXzT27LGD9Oru005hfUZ+vI+9aBWEHMSNobKNrp8Es4gBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:54.352058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af04d8cc716b4126979dca8bbd801424b26051f002cc3d55c49823d4d6c4258","sha256:f524c665fd7a0cb1b8c4a692aadb21118111e4a0bde453f37350dcf3d452e6ec"],"state_sha256":"cffa61c88d72c94d34c15084ccf460f1c772581c8af2c904e0681036c62dc479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMb5hF0Vb7pQFu7JF1p+ws60iOzjdENGBA9gldtKAzkBnUxp/NScWIMLGOVFcM8M8/AVcKk60w9NujXNTVQqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:36:11.270695Z","bundle_sha256":"2740b13db1d82303f61d4fc9422caedf477e4daec73aa850b0653e2d2721efc1"}}