{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DGLPOK2QN6F24X3GMZCEOA5TIY","short_pith_number":"pith:DGLPOK2Q","schema_version":"1.0","canonical_sha256":"1996f72b506f8bae5f6666444703b3463ecedc2bf5c8c6daf7ba1b31c12c39ad","source":{"kind":"arxiv","id":"2608.12224","version":1},"attestation_state":"computed","paper":{"title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmed Ghazy, Anita D\\\"urr, Anubhav Dhar, Jakob Greilhuber, Karol W\\k{e}grzycki","submitted_at":"2026-08-12T16:22:21Z","abstract_excerpt":"Minimizing the weighted completion times ($P \\mid \\mid \\Sigma w_j C_j$) and weighted number of tardy jobs ($P \\mid \\mid \\Sigma w_j U_j$) on multiple identical machines are two classical NP-hard scheduling problems. As shown by Lent\\'e et al. (2014), both problems can be solved in time ${O}^{\\star}(3^n)$. In this paper, we improve these bounds to ${O}(2.755^n)$ and ${O}^{\\star}(2^n)$, respectively. Our algorithm for $P \\mid \\mid \\Sigma w_j C_j$ exploits the meet-in-the-middle paradigm and an efficient data structure answering linear programming queries. Additionally, when the number of machines"},"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":"2608.12224","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-12T16:22:21Z","cross_cats_sorted":[],"title_canon_sha256":"0335a8a08b836d4d7d75a4e2ce74b5f9d8169fd8db57a271c343364a397d91a3","abstract_canon_sha256":"a37da1730e203f316bf86f3fae0b5506146c9631b62ee94246002a39d8265518"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:30:33.186978Z","signature_b64":"mGYTtFY+UX6HjI8c5MY8JFPxXh4G7Sn95B1sCywJxB/gZRQy4Tz1p/EWumYP8wDAfU06jBAU16Df+ZrXTxSwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1996f72b506f8bae5f6666444703b3463ecedc2bf5c8c6daf7ba1b31c12c39ad","last_reissued_at":"2026-08-13T01:30:33.184476Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:30:33.184476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmed Ghazy, Anita D\\\"urr, Anubhav Dhar, Jakob Greilhuber, Karol W\\k{e}grzycki","submitted_at":"2026-08-12T16:22:21Z","abstract_excerpt":"Minimizing the weighted completion times ($P \\mid \\mid \\Sigma w_j C_j$) and weighted number of tardy jobs ($P \\mid \\mid \\Sigma w_j U_j$) on multiple identical machines are two classical NP-hard scheduling problems. As shown by Lent\\'e et al. (2014), both problems can be solved in time ${O}^{\\star}(3^n)$. In this paper, we improve these bounds to ${O}(2.755^n)$ and ${O}^{\\star}(2^n)$, respectively. Our algorithm for $P \\mid \\mid \\Sigma w_j C_j$ exploits the meet-in-the-middle paradigm and an efficient data structure answering linear programming queries. Additionally, when the number of machines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12224","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/2608.12224/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":"2608.12224","created_at":"2026-08-13T01:30:33.185675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12224v1","created_at":"2026-08-13T01:30:33.185675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12224","created_at":"2026-08-13T01:30:33.185675+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGLPOK2QN6F2","created_at":"2026-08-13T01:30:33.185675+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGLPOK2QN6F24X3G","created_at":"2026-08-13T01:30:33.185675+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGLPOK2Q","created_at":"2026-08-13T01:30:33.185675+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/DGLPOK2QN6F24X3GMZCEOA5TIY","json":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY.json","graph_json":"https://pith.science/api/pith-number/DGLPOK2QN6F24X3GMZCEOA5TIY/graph.json","events_json":"https://pith.science/api/pith-number/DGLPOK2QN6F24X3GMZCEOA5TIY/events.json","paper":"https://pith.science/paper/DGLPOK2Q"},"agent_actions":{"view_html":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY","download_json":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY.json","view_paper":"https://pith.science/paper/DGLPOK2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12224&json=true","fetch_graph":"https://pith.science/api/pith-number/DGLPOK2QN6F24X3GMZCEOA5TIY/graph.json","fetch_events":"https://pith.science/api/pith-number/DGLPOK2QN6F24X3GMZCEOA5TIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY/action/storage_attestation","attest_author":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY/action/author_attestation","sign_citation":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY/action/citation_signature","submit_replication":"https://pith.science/pith/DGLPOK2QN6F24X3GMZCEOA5TIY/action/replication_record"}},"created_at":"2026-08-13T01:30:33.185675+00:00","updated_at":"2026-08-13T01:30:33.185675+00:00"}