{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:S7HQD5GIGAQLKXVPNDGEPCWMPA","short_pith_number":"pith:S7HQD5GI","schema_version":"1.0","canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","source":{"kind":"arxiv","id":"1405.2530","version":2},"attestation_state":"computed","paper":{"title":"Tighter Bounds for Makespan Minimization on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dor Arad, Hadas Shachnai, Yael Mordechai","submitted_at":"2014-05-11T13:03:20Z","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"},"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":"1405.2530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-11T13:03:20Z","cross_cats_sorted":[],"title_canon_sha256":"6686bb09ea9091e23ea5aa92f3c63c4fe18e39108579c8316aecb9637f73e388","abstract_canon_sha256":"95c72cea585049291d69be77d76a9fcf92fd813277aa09e91c5f585d268bdff7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:11.608086Z","signature_b64":"saWS1C1OuGeKRc86m1gysvctgpoEKPe/AZSjxgw6SuWYh+iQVNWGI77zpxWeEpjd9xDaa7EtnQfSe2vdK01hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","last_reissued_at":"2026-05-18T02:49:11.607627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:11.607627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Bounds for Makespan Minimization on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dor Arad, Hadas Shachnai, Yael Mordechai","submitted_at":"2014-05-11T13:03:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2530","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":"1405.2530","created_at":"2026-05-18T02:49:11.607689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2530v2","created_at":"2026-05-18T02:49:11.607689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2530","created_at":"2026-05-18T02:49:11.607689+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7HQD5GIGAQL","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7HQD5GIGAQLKXVP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7HQD5GI","created_at":"2026-05-18T12:28:49.207871+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/S7HQD5GIGAQLKXVPNDGEPCWMPA","json":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA.json","graph_json":"https://pith.science/api/pith-number/S7HQD5GIGAQLKXVPNDGEPCWMPA/graph.json","events_json":"https://pith.science/api/pith-number/S7HQD5GIGAQLKXVPNDGEPCWMPA/events.json","paper":"https://pith.science/paper/S7HQD5GI"},"agent_actions":{"view_html":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA","download_json":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA.json","view_paper":"https://pith.science/paper/S7HQD5GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2530&json=true","fetch_graph":"https://pith.science/api/pith-number/S7HQD5GIGAQLKXVPNDGEPCWMPA/graph.json","fetch_events":"https://pith.science/api/pith-number/S7HQD5GIGAQLKXVPNDGEPCWMPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/action/storage_attestation","attest_author":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/action/author_attestation","sign_citation":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/action/citation_signature","submit_replication":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/action/replication_record"}},"created_at":"2026-05-18T02:49:11.607689+00:00","updated_at":"2026-05-18T02:49:11.607689+00:00"}