{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:S7HQD5GIGAQLKXVPNDGEPCWMPA","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":"95c72cea585049291d69be77d76a9fcf92fd813277aa09e91c5f585d268bdff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T13:03:20Z","title_canon_sha256":"6686bb09ea9091e23ea5aa92f3c63c4fe18e39108579c8316aecb9637f73e388"},"schema_version":"1.0","source":{"id":"1405.2530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2530","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2530v2","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2530","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"S7HQD5GIGAQL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S7HQD5GIGAQLKXVP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S7HQD5GI","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:dc785ddbb0ec0b67d5f6bf437101107d0e919757df2824f29b710c3c18942200","target":"graph","created_at":"2026-05-18T02:49:11Z","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 problem of scheduling $n$ jobs to minimize the makespan on $m$ unrelated machines, where job $j$ requires time $p_{ij}$ if processed on machine $i$. A classic algorithm of Lenstra et al. yields the best known approximation ratio of $2$ for the problem. Improving this bound has been a prominent open problem for over two decades. In this paper we obtain a tighter bound for a wide subclass of instances which can be identified efficiently. Specifically, we define the feasibility factor of a given instance as the minimum fraction of machines on which each job can be processed. We sh","authors_text":"Dor Arad, Hadas Shachnai, Yael Mordechai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T13:03:20Z","title":"Tighter Bounds for Makespan Minimization on Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2530","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:064e40afe89539851e3ea7a49eaa427831a8d8b2f63dd0d4de8f8be3992548b2","target":"record","created_at":"2026-05-18T02:49:11Z","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":"95c72cea585049291d69be77d76a9fcf92fd813277aa09e91c5f585d268bdff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T13:03:20Z","title_canon_sha256":"6686bb09ea9091e23ea5aa92f3c63c4fe18e39108579c8316aecb9637f73e388"},"schema_version":"1.0","source":{"id":"1405.2530","kind":"arxiv","version":2}},"canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","first_computed_at":"2026-05-18T02:49:11.607627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:11.607627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"saWS1C1OuGeKRc86m1gysvctgpoEKPe/AZSjxgw6SuWYh+iQVNWGI77zpxWeEpjd9xDaa7EtnQfSe2vdK01hBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:11.608086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:064e40afe89539851e3ea7a49eaa427831a8d8b2f63dd0d4de8f8be3992548b2","sha256:dc785ddbb0ec0b67d5f6bf437101107d0e919757df2824f29b710c3c18942200"],"state_sha256":"1134b0bcc22eaaf85bb33bd7c92b880368e984b5c781a669eb38d57005292f64"}