{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PF2RQUUMQQ4O74J56MGB2NZS3I","short_pith_number":"pith:PF2RQUUM","canonical_record":{"source":{"id":"1809.10428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","cross_cats_sorted":[],"title_canon_sha256":"925aa5357103c09a24aeb0fb423f209cc18da4e9f0e70d65a7ccc7e4d0963ea4","abstract_canon_sha256":"6b4e4d053e977d4397ba1398baf36b3084d1d471e4d620e52e8162ae850bc130"},"schema_version":"1.0"},"canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","source":{"kind":"arxiv","id":"1809.10428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10428","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10428v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10428","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"PF2RQUUMQQ4O","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PF2RQUUMQQ4O74J5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PF2RQUUM","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PF2RQUUMQQ4O74J56MGB2NZS3I","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","cross_cats_sorted":[],"title_canon_sha256":"925aa5357103c09a24aeb0fb423f209cc18da4e9f0e70d65a7ccc7e4d0963ea4","abstract_canon_sha256":"6b4e4d053e977d4397ba1398baf36b3084d1d471e4d620e52e8162ae850bc130"},"schema_version":"1.0"},"canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.375541Z","signature_b64":"EyzdhW3zJga85BoMXfyh2vLs04xOmP6mDrtwlYsdyzLnUVQvC+Vuj4w01sG7H5tEL1eF37jqetJi/f4CrYn4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","last_reissued_at":"2026-05-18T00:04:38.375069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.375069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10428","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YLCtHHcpWXOyTC8AkFNrZYsVu4Z0RGApJNszRZZRbASYpHhb9htvEjMBOC9CMhBO0wVcevIN8e/TuPJOWOkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:54:30.839594Z"},"content_sha256":"52725ab1c26575010729ab5e92736b8ce7fa10e9a24654a8b38b1bf202a9335e","schema_version":"1.0","event_id":"sha256:52725ab1c26575010729ab5e92736b8ce7fa10e9a24654a8b38b1bf202a9335e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PF2RQUUMQQ4O74J56MGB2NZS3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling on (Un-)Related Machines with Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Klaus Jansen, Marten Maack","submitted_at":"2018-09-27T09:41:39Z","abstract_excerpt":"We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from processing jobs of one class to jobs of a different class. During such a setup, a machine cannot process jobs and the duration of a setup may depend on the machine as well as the class of the job to be processed next.\n  For this problem, we study approximation algorithms for non-identical machines. We develop a polynomial-time approximation scheme for uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10428","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1R48JavaM9YJtvanC6FSlusN1PvHTWCg0ibVeORt1H2QdKvkW38Ae+mw182DylecNHJNzqoyZ/nIujkSDbMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:54:30.839938Z"},"content_sha256":"62f2950b9e0035ebffbf6957c1e7c9d6dd972a26c4a22109e459630a4769c899","schema_version":"1.0","event_id":"sha256:62f2950b9e0035ebffbf6957c1e7c9d6dd972a26c4a22109e459630a4769c899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/bundle.json","state_url":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T20:54:30Z","links":{"resolver":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I","bundle":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/bundle.json","state":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PF2RQUUMQQ4O74J56MGB2NZS3I","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":"6b4e4d053e977d4397ba1398baf36b3084d1d471e4d620e52e8162ae850bc130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","title_canon_sha256":"925aa5357103c09a24aeb0fb423f209cc18da4e9f0e70d65a7ccc7e4d0963ea4"},"schema_version":"1.0","source":{"id":"1809.10428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10428","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10428v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10428","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"PF2RQUUMQQ4O","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PF2RQUUMQQ4O74J5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PF2RQUUM","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:62f2950b9e0035ebffbf6957c1e7c9d6dd972a26c4a22109e459630a4769c899","target":"graph","created_at":"2026-05-18T00:04:38Z","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"},"paper":{"abstract_excerpt":"We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from processing jobs of one class to jobs of a different class. During such a setup, a machine cannot process jobs and the duration of a setup may depend on the machine as well as the class of the job to be processed next.\n  For this problem, we study approximation algorithms for non-identical machines. We develop a polynomial-time approximation scheme for uni","authors_text":"Alexander M\\\"acker, Klaus Jansen, Marten Maack","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","title":"Scheduling on (Un-)Related Machines with Setup Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10428","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:52725ab1c26575010729ab5e92736b8ce7fa10e9a24654a8b38b1bf202a9335e","target":"record","created_at":"2026-05-18T00:04:38Z","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":"6b4e4d053e977d4397ba1398baf36b3084d1d471e4d620e52e8162ae850bc130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","title_canon_sha256":"925aa5357103c09a24aeb0fb423f209cc18da4e9f0e70d65a7ccc7e4d0963ea4"},"schema_version":"1.0","source":{"id":"1809.10428","kind":"arxiv","version":1}},"canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","first_computed_at":"2026-05-18T00:04:38.375069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.375069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EyzdhW3zJga85BoMXfyh2vLs04xOmP6mDrtwlYsdyzLnUVQvC+Vuj4w01sG7H5tEL1eF37jqetJi/f4CrYn4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.375541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52725ab1c26575010729ab5e92736b8ce7fa10e9a24654a8b38b1bf202a9335e","sha256:62f2950b9e0035ebffbf6957c1e7c9d6dd972a26c4a22109e459630a4769c899"],"state_sha256":"9a78fa560f4f8b36831853aa5699d358777f14dd17892f0cde6c69d9ad56d7fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMzFZJbxbhYx6J2ksZgWWE9YJMZUKfiP1poRtx0Lqeozqr1BoI4J0OYEQxq2JREhwUumwXKJdbsIgY1ecQbxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:54:30.841962Z","bundle_sha256":"a6d95be51b20957984484997de162316adfde6e09d6e64264cfd674f9d2b83f8"}}