{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LHRGIHZ22IFNLOONDQ7RNFTYGH","short_pith_number":"pith:LHRGIHZ2","schema_version":"1.0","canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","source":{"kind":"arxiv","id":"1611.07371","version":2},"attestation_state":"computed","paper":{"title":"Lazy Local Search Meets Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chidambaram Annamalai","submitted_at":"2016-11-22T15:43:09Z","abstract_excerpt":"We study the restricted case of Scheduling on Unrelated Parallel Machines. In this problem, we are given a set of jobs $J$ with processing times $p_j$ and each job may be scheduled only on some subset of machines $S_j \\subseteq M$. The goal is to find an assignment of jobs to machines to minimize the time by which all jobs can be processed. In a seminal paper, Lenstra, Shmoys, and Tardos designed an elegant $2$-approximation for the problem in 1987. The question of whether approximation algorithms with better guarantees exist for this classic scheduling problem has since remained a source of m"},"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":"1611.07371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T15:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"96ee82c37854638a62a56b9a156d106e460d5f2cf3cef5ec6debeab5cd6e853c","abstract_canon_sha256":"40953dc3c0022e1f4e1400e573753a8f4c83e2457d743e28956f51f077b653cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:06.450002Z","signature_b64":"u30loG2/zNTzBmGa4KFy0jdJgfOevxy0X3iH2BCgFCMYctVwiBDkClk/7flZHDD2kTjTSQ0aLgVJDZjZ6xmsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","last_reissued_at":"2026-05-18T00:55:06.449241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:06.449241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy Local Search Meets Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chidambaram Annamalai","submitted_at":"2016-11-22T15:43:09Z","abstract_excerpt":"We study the restricted case of Scheduling on Unrelated Parallel Machines. In this problem, we are given a set of jobs $J$ with processing times $p_j$ and each job may be scheduled only on some subset of machines $S_j \\subseteq M$. The goal is to find an assignment of jobs to machines to minimize the time by which all jobs can be processed. In a seminal paper, Lenstra, Shmoys, and Tardos designed an elegant $2$-approximation for the problem in 1987. The question of whether approximation algorithms with better guarantees exist for this classic scheduling problem has since remained a source of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07371","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":"1611.07371","created_at":"2026-05-18T00:55:06.449389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07371v2","created_at":"2026-05-18T00:55:06.449389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07371","created_at":"2026-05-18T00:55:06.449389+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHRGIHZ22IFN","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHRGIHZ22IFNLOON","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHRGIHZ2","created_at":"2026-05-18T12:30:29.479603+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/LHRGIHZ22IFNLOONDQ7RNFTYGH","json":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH.json","graph_json":"https://pith.science/api/pith-number/LHRGIHZ22IFNLOONDQ7RNFTYGH/graph.json","events_json":"https://pith.science/api/pith-number/LHRGIHZ22IFNLOONDQ7RNFTYGH/events.json","paper":"https://pith.science/paper/LHRGIHZ2"},"agent_actions":{"view_html":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH","download_json":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH.json","view_paper":"https://pith.science/paper/LHRGIHZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07371&json=true","fetch_graph":"https://pith.science/api/pith-number/LHRGIHZ22IFNLOONDQ7RNFTYGH/graph.json","fetch_events":"https://pith.science/api/pith-number/LHRGIHZ22IFNLOONDQ7RNFTYGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/action/storage_attestation","attest_author":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/action/author_attestation","sign_citation":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/action/citation_signature","submit_replication":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/action/replication_record"}},"created_at":"2026-05-18T00:55:06.449389+00:00","updated_at":"2026-05-18T00:55:06.449389+00:00"}