{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QEHIWQ53IMZWHPL5OMEEH2I5WD","short_pith_number":"pith:QEHIWQ53","schema_version":"1.0","canonical_sha256":"810e8b43bb433363bd7d730843e91db0d44f56dec848dd65768e21eaf8ed95ff","source":{"kind":"arxiv","id":"2009.11840","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Johannes Zink, Martin Kouteck\\'y","submitted_at":"2020-09-24T17:38:31Z","abstract_excerpt":"The task of scheduling jobs to machines while minimizing the total makespan, the sum of weighted completion times, or a norm of the load vector, are among the oldest and most fundamental tasks in combinatorial optimization. Since all of these problems are in general NP-hard, much attention has been given to the regime where there is only a small number $k$ of job types, but possibly the number of jobs $n$ is large; this is the few job types, high-multiplicity regime. Despite many positive results, the hardness boundary of this regime was not understood until now.\n  We show that makespan minimi"},"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":"2009.11840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-24T17:38:31Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"d83a61cdb25ff809a369dfc03122fabde8cfa428667f09218531ed42174b106b","abstract_canon_sha256":"fbab609fa5dd9257e10898478edb3f02364de3dcb20db213ba0caf5b23f94588"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:50.084555Z","signature_b64":"BokxQpEjSIxoqbVtoRjtNa6ag5cjPaKs9xl7N4l8A6Np7uhNq+sPcEDQk5pobYaZNB7g4NDnEo/grS9WkuzdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"810e8b43bb433363bd7d730843e91db0d44f56dec848dd65768e21eaf8ed95ff","last_reissued_at":"2026-07-05T01:37:50.084148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:50.084148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Johannes Zink, Martin Kouteck\\'y","submitted_at":"2020-09-24T17:38:31Z","abstract_excerpt":"The task of scheduling jobs to machines while minimizing the total makespan, the sum of weighted completion times, or a norm of the load vector, are among the oldest and most fundamental tasks in combinatorial optimization. Since all of these problems are in general NP-hard, much attention has been given to the regime where there is only a small number $k$ of job types, but possibly the number of jobs $n$ is large; this is the few job types, high-multiplicity regime. Despite many positive results, the hardness boundary of this regime was not understood until now.\n  We show that makespan minimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11840","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/2009.11840/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":"2009.11840","created_at":"2026-07-05T01:37:50.084212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.11840v1","created_at":"2026-07-05T01:37:50.084212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11840","created_at":"2026-07-05T01:37:50.084212+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEHIWQ53IMZW","created_at":"2026-07-05T01:37:50.084212+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEHIWQ53IMZWHPL5","created_at":"2026-07-05T01:37:50.084212+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEHIWQ53","created_at":"2026-07-05T01:37:50.084212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13348","citing_title":"Parameterized Complexity of the Star Decomposition Problem","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD","json":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD.json","graph_json":"https://pith.science/api/pith-number/QEHIWQ53IMZWHPL5OMEEH2I5WD/graph.json","events_json":"https://pith.science/api/pith-number/QEHIWQ53IMZWHPL5OMEEH2I5WD/events.json","paper":"https://pith.science/paper/QEHIWQ53"},"agent_actions":{"view_html":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD","download_json":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD.json","view_paper":"https://pith.science/paper/QEHIWQ53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.11840&json=true","fetch_graph":"https://pith.science/api/pith-number/QEHIWQ53IMZWHPL5OMEEH2I5WD/graph.json","fetch_events":"https://pith.science/api/pith-number/QEHIWQ53IMZWHPL5OMEEH2I5WD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD/action/storage_attestation","attest_author":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD/action/author_attestation","sign_citation":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD/action/citation_signature","submit_replication":"https://pith.science/pith/QEHIWQ53IMZWHPL5OMEEH2I5WD/action/replication_record"}},"created_at":"2026-07-05T01:37:50.084212+00:00","updated_at":"2026-07-05T01:37:50.084212+00:00"}