{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QJAQTZNIJNWHBZLWDRWX3MTQ4B","short_pith_number":"pith:QJAQTZNI","schema_version":"1.0","canonical_sha256":"824109e5a84b6c70e5761c6d7db270e067b280cc98b45100f9b58d05cbddb14b","source":{"kind":"arxiv","id":"2501.04859","version":1},"attestation_state":"computed","paper":{"title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lars Rohwedder","submitted_at":"2025-01-08T22:17:28Z","abstract_excerpt":"Given $n$ jobs with processing times $p_1,\\dotsc,p_n\\in\\mathbb N$ and $m\\le n$ machines with speeds $s_1,\\dotsc,s_m\\in\\mathbb N$ our goal is to allocate the jobs to machines minimizing the makespan. We present an algorithm that solves the problem in time $p_{\\max}^{O(d)} n^{O(1)}$, where $p_{\\max}$ is the maximum processing time and $d\\le p_{\\max}$ is the number of distinct processing times. This is essentially the best possible due to a lower bound based on the exponential time hypothesis (ETH).\n  Our result improves over prior works that had a quadratic term in $d$ in the exponent and answer"},"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":"2501.04859","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-08T22:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"3832ccdb8c976f0669143d2f2ca7cf20fb92a9bbd48cf196e8c0740391f01ca9","abstract_canon_sha256":"b90c5156eb417c24369ae75b16eb7e7c5a3242cd0a9603d523c34c9b4adb87a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:47.623491Z","signature_b64":"Hs20Lpjci9wrAkdGVyDEjKL+ePtcdf6KDbpPCLIVmF+N0RD2osQpRS482BGvr3Y4C4MZJSiG7kEW6e1o9mdbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824109e5a84b6c70e5761c6d7db270e067b280cc98b45100f9b58d05cbddb14b","last_reissued_at":"2026-07-05T09:58:47.623070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:47.623070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lars Rohwedder","submitted_at":"2025-01-08T22:17:28Z","abstract_excerpt":"Given $n$ jobs with processing times $p_1,\\dotsc,p_n\\in\\mathbb N$ and $m\\le n$ machines with speeds $s_1,\\dotsc,s_m\\in\\mathbb N$ our goal is to allocate the jobs to machines minimizing the makespan. We present an algorithm that solves the problem in time $p_{\\max}^{O(d)} n^{O(1)}$, where $p_{\\max}$ is the maximum processing time and $d\\le p_{\\max}$ is the number of distinct processing times. This is essentially the best possible due to a lower bound based on the exponential time hypothesis (ETH).\n  Our result improves over prior works that had a quadratic term in $d$ in the exponent and answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04859","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.04859/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.04859","created_at":"2026-07-05T09:58:47.623123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04859v1","created_at":"2026-07-05T09:58:47.623123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04859","created_at":"2026-07-05T09:58:47.623123+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJAQTZNIJNWH","created_at":"2026-07-05T09:58:47.623123+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJAQTZNIJNWHBZLW","created_at":"2026-07-05T09:58:47.623123+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJAQTZNI","created_at":"2026-07-05T09:58:47.623123+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03766","citing_title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B","json":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B.json","graph_json":"https://pith.science/api/pith-number/QJAQTZNIJNWHBZLWDRWX3MTQ4B/graph.json","events_json":"https://pith.science/api/pith-number/QJAQTZNIJNWHBZLWDRWX3MTQ4B/events.json","paper":"https://pith.science/paper/QJAQTZNI"},"agent_actions":{"view_html":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B","download_json":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B.json","view_paper":"https://pith.science/paper/QJAQTZNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04859&json=true","fetch_graph":"https://pith.science/api/pith-number/QJAQTZNIJNWHBZLWDRWX3MTQ4B/graph.json","fetch_events":"https://pith.science/api/pith-number/QJAQTZNIJNWHBZLWDRWX3MTQ4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B/action/storage_attestation","attest_author":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B/action/author_attestation","sign_citation":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B/action/citation_signature","submit_replication":"https://pith.science/pith/QJAQTZNIJNWHBZLWDRWX3MTQ4B/action/replication_record"}},"created_at":"2026-07-05T09:58:47.623123+00:00","updated_at":"2026-07-05T09:58:47.623123+00:00"}