{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:S7HQD5GIGAQLKXVPNDGEPCWMPA","short_pith_number":"pith:S7HQD5GI","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"},"canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","source":{"kind":"arxiv","id":"1405.2530","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:S7HQD5GIGAQLKXVPNDGEPCWMPA","target":"record","payload":{"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"},"canonical_sha256":"97cf01f4c83020b55eaf68cc478acc78233f1055b700c0f9e15ca4f804163248","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"},"source_kind":"arxiv","source_id":"1405.2530","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-18T02:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7XOnazLspHVq+fG/Rd6+WrvpudjMH6AUjCo3hkOw+M13OmE8FjnnV8I54c2mkIu3ETV8mrveDvVJlda6rRaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:10:48.637252Z"},"content_sha256":"064e40afe89539851e3ea7a49eaa427831a8d8b2f63dd0d4de8f8be3992548b2","schema_version":"1.0","event_id":"sha256:064e40afe89539851e3ea7a49eaa427831a8d8b2f63dd0d4de8f8be3992548b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:S7HQD5GIGAQLKXVPNDGEPCWMPA","target":"graph","payload":{"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"},"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-18T02:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhUU3UL8T1u17YQr+lj2sOpeEi6wyrjnylcG6mJHWxnCQoTyhuB7QzwglItNiMoGnEsHpaI0+HKVbNtJD4u+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:10:48.637628Z"},"content_sha256":"dc785ddbb0ec0b67d5f6bf437101107d0e919757df2824f29b710c3c18942200","schema_version":"1.0","event_id":"sha256:dc785ddbb0ec0b67d5f6bf437101107d0e919757df2824f29b710c3c18942200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/bundle.json","state_url":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/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-28T01:10:48Z","links":{"resolver":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA","bundle":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/bundle.json","state":"https://pith.science/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7HQD5GIGAQLKXVPNDGEPCWMPA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsbB2Ad224bCe8c+1DuJ+fOTVFxlZ0jZeKZ2sh4QFW31LytmeuGT9lXK8FV3c4yRxz2RyUVqN+ywb17bZgBsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T01:10:48.639531Z","bundle_sha256":"54f6becb1392aeae8afc8c660e6e276b6e1efb17a73c1ac326e288c7ef0dd630"}}