{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IO4IPGK7KMAGT5KEYZQSMTJ3QX","short_pith_number":"pith:IO4IPGK7","schema_version":"1.0","canonical_sha256":"43b887995f530069f544c661264d3b85d4bb464459576aeb3222e89ffaedc096","source":{"kind":"arxiv","id":"1810.01223","version":2},"attestation_state":"computed","paper":{"title":"Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Max A. Deppert","submitted_at":"2018-10-02T13:14:46Z","abstract_excerpt":"We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$ identical parallel machines. For every class there is a setup time which is required whenever a machine switches from the processing of one class to another class. The objective is to find a schedule that minimizes the makespan. We give near-linear approximation algorithms for the following problem variants: the non-preemptive context where jobs may not be preempted, the preemptive context where jobs may be preempted but not parallelized, as well as the splittable context where jobs may be preempted and parallelized.\n  W"},"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":"1810.01223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:14:46Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b4f17ba66a3c364111588325a4d5c3fa099a187047bff51fc289c1e43047f7d0","abstract_canon_sha256":"65540899048d3bdfbca96089ff13341812610db1a06efdd2a90a0ce007a0e1f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.918221Z","signature_b64":"tDOi25dYmpnghb6El8VCrt4xLxudWxaxFjSTZgt8uxTYN1cKThMT8ZsQK7CIZ81FB9twQ97USmxtW/53LkCyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b887995f530069f544c661264d3b85d4bb464459576aeb3222e89ffaedc096","last_reissued_at":"2026-05-17T23:47:15.917746Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.917746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Max A. Deppert","submitted_at":"2018-10-02T13:14:46Z","abstract_excerpt":"We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$ identical parallel machines. For every class there is a setup time which is required whenever a machine switches from the processing of one class to another class. The objective is to find a schedule that minimizes the makespan. We give near-linear approximation algorithms for the following problem variants: the non-preemptive context where jobs may not be preempted, the preemptive context where jobs may be preempted but not parallelized, as well as the splittable context where jobs may be preempted and parallelized.\n  W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01223","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.01223","created_at":"2026-05-17T23:47:15.917820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01223v2","created_at":"2026-05-17T23:47:15.917820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01223","created_at":"2026-05-17T23:47:15.917820+00:00"},{"alias_kind":"pith_short_12","alias_value":"IO4IPGK7KMAG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IO4IPGK7KMAGT5KE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IO4IPGK7","created_at":"2026-05-18T12:32:31.084164+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/IO4IPGK7KMAGT5KEYZQSMTJ3QX","json":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX.json","graph_json":"https://pith.science/api/pith-number/IO4IPGK7KMAGT5KEYZQSMTJ3QX/graph.json","events_json":"https://pith.science/api/pith-number/IO4IPGK7KMAGT5KEYZQSMTJ3QX/events.json","paper":"https://pith.science/paper/IO4IPGK7"},"agent_actions":{"view_html":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX","download_json":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX.json","view_paper":"https://pith.science/paper/IO4IPGK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01223&json=true","fetch_graph":"https://pith.science/api/pith-number/IO4IPGK7KMAGT5KEYZQSMTJ3QX/graph.json","fetch_events":"https://pith.science/api/pith-number/IO4IPGK7KMAGT5KEYZQSMTJ3QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX/action/storage_attestation","attest_author":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX/action/author_attestation","sign_citation":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX/action/citation_signature","submit_replication":"https://pith.science/pith/IO4IPGK7KMAGT5KEYZQSMTJ3QX/action/replication_record"}},"created_at":"2026-05-17T23:47:15.917820+00:00","updated_at":"2026-05-17T23:47:15.917820+00:00"}