{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CEXERY7YXHGIDT5KDPWDMPG6OP","short_pith_number":"pith:CEXERY7Y","schema_version":"1.0","canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","source":{"kind":"arxiv","id":"1011.4957","version":1},"attestation_state":"computed","paper":{"title":"On the Configuration-LP for Scheduling on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Andreas Wiese, Jos\\'e Verschae","submitted_at":"2010-11-22T21:30:29Z","abstract_excerpt":"One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NP-hard to approximate with a better ratio than 3/2. Closing this gap has been open for over 20 years. The best known approximation factors are achieved by LP-based algorithms. The strongest known linear program formulation for the problem is the configuration-LP. We show that the configuration-LP has an integrality gap of 2 even "},"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":"1011.4957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb7752ecf145eb96ca1b43b1963b85ad66aced720443e5132331658b9297cef5","abstract_canon_sha256":"38bf25c5b5146444be1afa9cc9f84aed9ddd0ea46a422e0f1e0b6e8602b5928e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:23.969436Z","signature_b64":"p7+yIs0XFN3vDXZGkKZa070n5s9tLJFCmk6l+dO3vgUyhTQ+dF/ZTEfXYIi5QI56FQACoGKsTHvkADkj7Xx6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","last_reissued_at":"2026-05-18T02:23:23.968513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:23.968513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Configuration-LP for Scheduling on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Andreas Wiese, Jos\\'e Verschae","submitted_at":"2010-11-22T21:30:29Z","abstract_excerpt":"One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NP-hard to approximate with a better ratio than 3/2. Closing this gap has been open for over 20 years. The best known approximation factors are achieved by LP-based algorithms. The strongest known linear program formulation for the problem is the configuration-LP. We show that the configuration-LP has an integrality gap of 2 even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4957","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":"1011.4957","created_at":"2026-05-18T02:23:23.968676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4957v1","created_at":"2026-05-18T02:23:23.968676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4957","created_at":"2026-05-18T02:23:23.968676+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEXERY7YXHGI","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEXERY7YXHGIDT5K","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEXERY7Y","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20317","citing_title":"Exact and approximate maximin share allocations in multi-graphs","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP","json":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP.json","graph_json":"https://pith.science/api/pith-number/CEXERY7YXHGIDT5KDPWDMPG6OP/graph.json","events_json":"https://pith.science/api/pith-number/CEXERY7YXHGIDT5KDPWDMPG6OP/events.json","paper":"https://pith.science/paper/CEXERY7Y"},"agent_actions":{"view_html":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP","download_json":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP.json","view_paper":"https://pith.science/paper/CEXERY7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4957&json=true","fetch_graph":"https://pith.science/api/pith-number/CEXERY7YXHGIDT5KDPWDMPG6OP/graph.json","fetch_events":"https://pith.science/api/pith-number/CEXERY7YXHGIDT5KDPWDMPG6OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/action/storage_attestation","attest_author":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/action/author_attestation","sign_citation":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/action/citation_signature","submit_replication":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/action/replication_record"}},"created_at":"2026-05-18T02:23:23.968676+00:00","updated_at":"2026-05-18T02:23:23.968676+00:00"}