{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:43FBMTCMNUAH5YTANWPWADYWCN","short_pith_number":"pith:43FBMTCM","schema_version":"1.0","canonical_sha256":"e6ca164c4c6d007ee2606d9f600f161368a4514e17175947a4ada61c4eec79ca","source":{"kind":"arxiv","id":"1606.08817","version":1},"attestation_state":"computed","paper":{"title":"Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shi Li, Sungjin Im","submitted_at":"2016-06-28T18:31:00Z","abstract_excerpt":"In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, $R | r_{ij} | \\sum_j w_j C_j$ using the three-field notation. For this problem, a 2-approximation is known based on a novel convex programming (J. ACM 2001 by Skutella). It has been a long standing open problem if one can improve upon this 2-approximation (Open Problem 8 in J. of Sched. 1999 by Schuurman and Woeginger). We answer this question in the affirmative by giving a 1.8786-approximation. We achieve this via a surprisingly simple "},"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":"1606.08817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-28T18:31:00Z","cross_cats_sorted":[],"title_canon_sha256":"7486bd43c01b566e2cbc83e1b51036aa1d5e5b9b0e24dae8c209c0ec80cffb2f","abstract_canon_sha256":"fd7d0b9738475ae13618f613a88615bbaf0fcc149f9bbd36b0795044af940dbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:47.082558Z","signature_b64":"Njq+zzAPWboc31YQxznRB/4ruygwdbO/zsDXNe2rNJ5Sb/MYphuXRRBBoEhnOU7mQDJis79GaDLl3SaUvEggDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6ca164c4c6d007ee2606d9f600f161368a4514e17175947a4ada61c4eec79ca","last_reissued_at":"2026-05-18T01:11:47.082177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:47.082177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shi Li, Sungjin Im","submitted_at":"2016-06-28T18:31:00Z","abstract_excerpt":"In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, $R | r_{ij} | \\sum_j w_j C_j$ using the three-field notation. For this problem, a 2-approximation is known based on a novel convex programming (J. ACM 2001 by Skutella). It has been a long standing open problem if one can improve upon this 2-approximation (Open Problem 8 in J. of Sched. 1999 by Schuurman and Woeginger). We answer this question in the affirmative by giving a 1.8786-approximation. We achieve this via a surprisingly simple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08817","kind":"arxiv","version":1},"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":"1606.08817","created_at":"2026-05-18T01:11:47.082236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08817v1","created_at":"2026-05-18T01:11:47.082236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08817","created_at":"2026-05-18T01:11:47.082236+00:00"},{"alias_kind":"pith_short_12","alias_value":"43FBMTCMNUAH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"43FBMTCMNUAH5YTA","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"43FBMTCM","created_at":"2026-05-18T12:29:58.707656+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/43FBMTCMNUAH5YTANWPWADYWCN","json":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN.json","graph_json":"https://pith.science/api/pith-number/43FBMTCMNUAH5YTANWPWADYWCN/graph.json","events_json":"https://pith.science/api/pith-number/43FBMTCMNUAH5YTANWPWADYWCN/events.json","paper":"https://pith.science/paper/43FBMTCM"},"agent_actions":{"view_html":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN","download_json":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN.json","view_paper":"https://pith.science/paper/43FBMTCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08817&json=true","fetch_graph":"https://pith.science/api/pith-number/43FBMTCMNUAH5YTANWPWADYWCN/graph.json","fetch_events":"https://pith.science/api/pith-number/43FBMTCMNUAH5YTANWPWADYWCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN/action/storage_attestation","attest_author":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN/action/author_attestation","sign_citation":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN/action/citation_signature","submit_replication":"https://pith.science/pith/43FBMTCMNUAH5YTANWPWADYWCN/action/replication_record"}},"created_at":"2026-05-18T01:11:47.082236+00:00","updated_at":"2026-05-18T01:11:47.082236+00:00"}