{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","short_pith_number":"pith:BUJLJ4FE","schema_version":"1.0","canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","source":{"kind":"arxiv","id":"1708.04369","version":1},"attestation_state":"computed","paper":{"title":"Quasi-PTAS for Scheduling with Precedences using LP Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shashwat Garg","submitted_at":"2017-08-15T00:52:30Z","abstract_excerpt":"A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m=3$, it is not even known if the problem is NP-hard and this is one of the last open problems from the book of Garey and Johnson.\n  We show that for fixed $m$ and $\\epsilon$, $(\\log n)^{O(1)}$ rounds of Sherali-Adams hierarchy applied to a natural LP of the problem provides a $(1+\\epsilon)$-approximation algorithm running in quasi-polynomial time. This improves over the recent result of Levey and Rothvoss, who used $r=(\\log n)^{O(\\log \\lo"},"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":"1708.04369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"221d93ff2302155eef5f2d5a3d64d4475c2f42c26c7c38c333c02d7ab39e4073","abstract_canon_sha256":"490c4de741f90e9a811bbd144f4b740a690759b6e8ed0436e412fa87721436fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.522420Z","signature_b64":"s/Rs7h2C6+MdLx0eTJGDbSd3XpasDSnEUS8a9Df3l5Ev7mQwi1zffsQHx7l9TufwcCnmZ4S90Sz20HC4OhayCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","last_reissued_at":"2026-05-18T00:37:59.521959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.521959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-PTAS for Scheduling with Precedences using LP Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shashwat Garg","submitted_at":"2017-08-15T00:52:30Z","abstract_excerpt":"A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m=3$, it is not even known if the problem is NP-hard and this is one of the last open problems from the book of Garey and Johnson.\n  We show that for fixed $m$ and $\\epsilon$, $(\\log n)^{O(1)}$ rounds of Sherali-Adams hierarchy applied to a natural LP of the problem provides a $(1+\\epsilon)$-approximation algorithm running in quasi-polynomial time. This improves over the recent result of Levey and Rothvoss, who used $r=(\\log n)^{O(\\log \\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04369","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":"1708.04369","created_at":"2026-05-18T00:37:59.522029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04369v1","created_at":"2026-05-18T00:37:59.522029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04369","created_at":"2026-05-18T00:37:59.522029+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUJLJ4FE4N6S","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUJLJ4FE4N6SZ5Q6","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUJLJ4FE","created_at":"2026-05-18T12:31:08.081275+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/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","json":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3.json","graph_json":"https://pith.science/api/pith-number/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/graph.json","events_json":"https://pith.science/api/pith-number/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/events.json","paper":"https://pith.science/paper/BUJLJ4FE"},"agent_actions":{"view_html":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","download_json":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3.json","view_paper":"https://pith.science/paper/BUJLJ4FE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04369&json=true","fetch_graph":"https://pith.science/api/pith-number/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/graph.json","fetch_events":"https://pith.science/api/pith-number/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/action/storage_attestation","attest_author":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/action/author_attestation","sign_citation":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/action/citation_signature","submit_replication":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/action/replication_record"}},"created_at":"2026-05-18T00:37:59.522029+00:00","updated_at":"2026-05-18T00:37:59.522029+00:00"}