{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I2WBOG3H7VV7E2K75TUOEWYMPK","short_pith_number":"pith:I2WBOG3H","schema_version":"1.0","canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","source":{"kind":"arxiv","id":"1611.01934","version":2},"attestation_state":"computed","paper":{"title":"On the Configuration-LP of the Restricted Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Lars Rohwedder","submitted_at":"2016-11-07T08:35:47Z","abstract_excerpt":"We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is to be minimized. The processing time $p_{ij}$ of a job $j$ depends on the machine $i$ it is assigned to. Lenstra, Shmoys and Tardos gave a polynomial time $2$-approximation for this problem. In this paper we focus on a prominent special case, the Restricted Assignment problem, in which $p_{ij}\\in\\{p_j,\\infty\\}$. The configuration-LP is a linear programming relaxation for the Restricted Assignment problem. It was sho"},"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":"1611.01934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"de15dedded64b4f712f51e7bf354de86ed77f85dbad6bafee7d4654a5e619877","abstract_canon_sha256":"e8a7ae02207b72a3ac1c7adf5de046fce3cc202c2cd4eb1b86d853b9dc43b762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.013938Z","signature_b64":"mH2vZTK8+HFNu6Aizr3rVFUm7tghTdBdULY6XEDHn6No6GQVx8kN8Uyf4HYaw03jGGxMyycwvbcj2JYwKHu+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","last_reissued_at":"2026-05-18T00:52:55.013391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.013391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Configuration-LP of the Restricted Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Lars Rohwedder","submitted_at":"2016-11-07T08:35:47Z","abstract_excerpt":"We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is to be minimized. The processing time $p_{ij}$ of a job $j$ depends on the machine $i$ it is assigned to. Lenstra, Shmoys and Tardos gave a polynomial time $2$-approximation for this problem. In this paper we focus on a prominent special case, the Restricted Assignment problem, in which $p_{ij}\\in\\{p_j,\\infty\\}$. The configuration-LP is a linear programming relaxation for the Restricted Assignment problem. It was sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01934","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":"1611.01934","created_at":"2026-05-18T00:52:55.013477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01934v2","created_at":"2026-05-18T00:52:55.013477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01934","created_at":"2026-05-18T00:52:55.013477+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2WBOG3H7VV7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2WBOG3H7VV7E2K7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2WBOG3H","created_at":"2026-05-18T12:30:22.444734+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/I2WBOG3H7VV7E2K75TUOEWYMPK","json":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK.json","graph_json":"https://pith.science/api/pith-number/I2WBOG3H7VV7E2K75TUOEWYMPK/graph.json","events_json":"https://pith.science/api/pith-number/I2WBOG3H7VV7E2K75TUOEWYMPK/events.json","paper":"https://pith.science/paper/I2WBOG3H"},"agent_actions":{"view_html":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK","download_json":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK.json","view_paper":"https://pith.science/paper/I2WBOG3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01934&json=true","fetch_graph":"https://pith.science/api/pith-number/I2WBOG3H7VV7E2K75TUOEWYMPK/graph.json","fetch_events":"https://pith.science/api/pith-number/I2WBOG3H7VV7E2K75TUOEWYMPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/action/storage_attestation","attest_author":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/action/author_attestation","sign_citation":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/action/citation_signature","submit_replication":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/action/replication_record"}},"created_at":"2026-05-18T00:52:55.013477+00:00","updated_at":"2026-05-18T00:52:55.013477+00:00"}