{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OPAYB2WVX4HCADDEHKF6W7D3JA","short_pith_number":"pith:OPAYB2WV","schema_version":"1.0","canonical_sha256":"73c180ead5bf0e200c643a8beb7c7b4807e6e1053f9fb8696c310997478e81e5","source":{"kind":"arxiv","id":"1511.07826","version":2},"attestation_state":"computed","paper":{"title":"Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Nikhil Bansal, Ola Svensson","submitted_at":"2015-11-24T18:08:10Z","abstract_excerpt":"We consider the problem of scheduling jobs on unrelated machines so as to minimize the sum of weighted completion times. Our main result is a $(3/2-c)$-approximation algorithm for some fixed $c>0$, improving upon the long-standing bound of 3/2 (independently due to Skutella, Journal of the ACM, 2001, and Sethuraman & Squillante, SODA, 1999). To do this, we first introduce a new lift-and-project based SDP relaxation for the problem. This is necessary as the previous convex programming relaxations have an integrality gap of $3/2$. Second, we give a new general bipartite-rounding procedure that p"},"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":"1511.07826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T18:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"63308b5babf1653b804fb956c4a38d62b55aa30e91967aaf3bdfb35cff11a8bf","abstract_canon_sha256":"cc26ae27d7fdc68282746ac0a1e8da8d1187e17eec6245ecd8eb46ae9d777d96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:33.157441Z","signature_b64":"vTqR4StoV99c7pQBXe4yVkLgAwYRnccdI3Gxb9rWcdKNIXblzNUN6BuM1kE6IQl+/7VECYZEmzZ8RsVAC0UCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73c180ead5bf0e200c643a8beb7c7b4807e6e1053f9fb8696c310997478e81e5","last_reissued_at":"2026-05-18T01:25:33.156970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:33.156970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Nikhil Bansal, Ola Svensson","submitted_at":"2015-11-24T18:08:10Z","abstract_excerpt":"We consider the problem of scheduling jobs on unrelated machines so as to minimize the sum of weighted completion times. Our main result is a $(3/2-c)$-approximation algorithm for some fixed $c>0$, improving upon the long-standing bound of 3/2 (independently due to Skutella, Journal of the ACM, 2001, and Sethuraman & Squillante, SODA, 1999). To do this, we first introduce a new lift-and-project based SDP relaxation for the problem. This is necessary as the previous convex programming relaxations have an integrality gap of $3/2$. Second, we give a new general bipartite-rounding procedure that p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07826","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":"1511.07826","created_at":"2026-05-18T01:25:33.157034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07826v2","created_at":"2026-05-18T01:25:33.157034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07826","created_at":"2026-05-18T01:25:33.157034+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPAYB2WVX4HC","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPAYB2WVX4HCADDE","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPAYB2WV","created_at":"2026-05-18T12:29:34.919912+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/OPAYB2WVX4HCADDEHKF6W7D3JA","json":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA.json","graph_json":"https://pith.science/api/pith-number/OPAYB2WVX4HCADDEHKF6W7D3JA/graph.json","events_json":"https://pith.science/api/pith-number/OPAYB2WVX4HCADDEHKF6W7D3JA/events.json","paper":"https://pith.science/paper/OPAYB2WV"},"agent_actions":{"view_html":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA","download_json":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA.json","view_paper":"https://pith.science/paper/OPAYB2WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07826&json=true","fetch_graph":"https://pith.science/api/pith-number/OPAYB2WVX4HCADDEHKF6W7D3JA/graph.json","fetch_events":"https://pith.science/api/pith-number/OPAYB2WVX4HCADDEHKF6W7D3JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA/action/storage_attestation","attest_author":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA/action/author_attestation","sign_citation":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA/action/citation_signature","submit_replication":"https://pith.science/pith/OPAYB2WVX4HCADDEHKF6W7D3JA/action/replication_record"}},"created_at":"2026-05-18T01:25:33.157034+00:00","updated_at":"2026-05-18T01:25:33.157034+00:00"}