{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LHRGIHZ22IFNLOONDQ7RNFTYGH","short_pith_number":"pith:LHRGIHZ2","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"},"canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","source":{"kind":"arxiv","id":"1611.07371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07371","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07371v2","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07371","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"LHRGIHZ22IFN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHRGIHZ22IFNLOON","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHRGIHZ2","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LHRGIHZ22IFNLOONDQ7RNFTYGH","target":"record","payload":{"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"},"canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","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"},"source_kind":"arxiv","source_id":"1611.07371","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:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cpd6DNWVQS2c3Nsdw05uDUBjVK4a4J+QmBmxxxqqB6Rhw13XkwuB07cQiz97NsHXQyFAAheWoB+5RsFgQHfjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:08:06.391280Z"},"content_sha256":"ce4a89e9d57ed09498a26fb2b5be711f1b96246066d192cd2aced88773114caf","schema_version":"1.0","event_id":"sha256:ce4a89e9d57ed09498a26fb2b5be711f1b96246066d192cd2aced88773114caf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LHRGIHZ22IFNLOONDQ7RNFTYGH","target":"graph","payload":{"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"},"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:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyKJJQDlHKmHdw02/fnajU/sZJv5/VsovP3Kw6ONYEF6bBRVVh+OwSvdchCJZ2VANcLLV/qTNG31hhu3jFxyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:08:06.391926Z"},"content_sha256":"db3b669e906bcf1a303631c1de93c08c20b9c26de914e3dfa871d94f84a896e8","schema_version":"1.0","event_id":"sha256:db3b669e906bcf1a303631c1de93c08c20b9c26de914e3dfa871d94f84a896e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/bundle.json","state_url":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/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-07T22:08:06Z","links":{"resolver":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH","bundle":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/bundle.json","state":"https://pith.science/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHRGIHZ22IFNLOONDQ7RNFTYGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LHRGIHZ22IFNLOONDQ7RNFTYGH","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":"40953dc3c0022e1f4e1400e573753a8f4c83e2457d743e28956f51f077b653cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T15:43:09Z","title_canon_sha256":"96ee82c37854638a62a56b9a156d106e460d5f2cf3cef5ec6debeab5cd6e853c"},"schema_version":"1.0","source":{"id":"1611.07371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07371","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07371v2","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07371","created_at":"2026-05-18T00:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"LHRGIHZ22IFN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHRGIHZ22IFNLOON","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHRGIHZ2","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:db3b669e906bcf1a303631c1de93c08c20b9c26de914e3dfa871d94f84a896e8","target":"graph","created_at":"2026-05-18T00:55:06Z","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 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","authors_text":"Chidambaram Annamalai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T15:43:09Z","title":"Lazy Local Search Meets Machine Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07371","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:ce4a89e9d57ed09498a26fb2b5be711f1b96246066d192cd2aced88773114caf","target":"record","created_at":"2026-05-18T00:55:06Z","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":"40953dc3c0022e1f4e1400e573753a8f4c83e2457d743e28956f51f077b653cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T15:43:09Z","title_canon_sha256":"96ee82c37854638a62a56b9a156d106e460d5f2cf3cef5ec6debeab5cd6e853c"},"schema_version":"1.0","source":{"id":"1611.07371","kind":"arxiv","version":2}},"canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59e2641f3ad20ad5b9cd1c3f16967831d32b390719372e9af07a3340e5568d9b","first_computed_at":"2026-05-18T00:55:06.449241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:06.449241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u30loG2/zNTzBmGa4KFy0jdJgfOevxy0X3iH2BCgFCMYctVwiBDkClk/7flZHDD2kTjTSQ0aLgVJDZjZ6xmsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:06.450002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce4a89e9d57ed09498a26fb2b5be711f1b96246066d192cd2aced88773114caf","sha256:db3b669e906bcf1a303631c1de93c08c20b9c26de914e3dfa871d94f84a896e8"],"state_sha256":"39b4d409f6938723b201c1ab843664d73219b809adffa87d626886def11e6cf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eGcGrPeaCwqxlvv/02DU/fS1tmPxNoCYbzWSkp//qLBboqTU7UqER/hvsoiH77yAdLaIfrNP9LZlT8wJD03AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:08:06.395784Z","bundle_sha256":"3b9b88ae5ca2fa675397c8781d0ad381a86750499025c17bed3243a45ea5e07c"}}