{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QEHIWQ53IMZWHPL5OMEEH2I5WD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbab609fa5dd9257e10898478edb3f02364de3dcb20db213ba0caf5b23f94588","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-24T17:38:31Z","title_canon_sha256":"d83a61cdb25ff809a369dfc03122fabde8cfa428667f09218531ed42174b106b"},"schema_version":"1.0","source":{"id":"2009.11840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11840","created_at":"2026-07-05T01:37:50Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11840v1","created_at":"2026-07-05T01:37:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11840","created_at":"2026-07-05T01:37:50Z"},{"alias_kind":"pith_short_12","alias_value":"QEHIWQ53IMZW","created_at":"2026-07-05T01:37:50Z"},{"alias_kind":"pith_short_16","alias_value":"QEHIWQ53IMZWHPL5","created_at":"2026-07-05T01:37:50Z"},{"alias_kind":"pith_short_8","alias_value":"QEHIWQ53","created_at":"2026-07-05T01:37:50Z"}],"graph_snapshots":[{"event_id":"sha256:c1c8f36e009c34c7b19d73f41cf5ac10e77ef91a72c88d3732e70694b54deadb","target":"graph","created_at":"2026-07-05T01:37:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.11840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Johannes Zink, Martin Kouteck\\'y","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-24T17:38:31Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:196657ab0c544f0198814d82a48233eea5db30780ff29eb68d6ca48d7da4bb73","target":"record","created_at":"2026-07-05T01:37:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbab609fa5dd9257e10898478edb3f02364de3dcb20db213ba0caf5b23f94588","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-24T17:38:31Z","title_canon_sha256":"d83a61cdb25ff809a369dfc03122fabde8cfa428667f09218531ed42174b106b"},"schema_version":"1.0","source":{"id":"2009.11840","kind":"arxiv","version":1}},"canonical_sha256":"810e8b43bb433363bd7d730843e91db0d44f56dec848dd65768e21eaf8ed95ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"810e8b43bb433363bd7d730843e91db0d44f56dec848dd65768e21eaf8ed95ff","first_computed_at":"2026-07-05T01:37:50.084148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:50.084148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BokxQpEjSIxoqbVtoRjtNa6ag5cjPaKs9xl7N4l8A6Np7uhNq+sPcEDQk5pobYaZNB7g4NDnEo/grS9WkuzdAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:50.084555Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:196657ab0c544f0198814d82a48233eea5db30780ff29eb68d6ca48d7da4bb73","sha256:c1c8f36e009c34c7b19d73f41cf5ac10e77ef91a72c88d3732e70694b54deadb"],"state_sha256":"46d81c307124e15c5d4b4ccce6ed9408187f2587c1f5f0a44b139b0e5dc19bc4"}