{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BWCWDNSMTUYCP2RJZEXKVGU6ND","short_pith_number":"pith:BWCWDNSM","schema_version":"1.0","canonical_sha256":"0d8561b64c9d3027ea29c92eaa9a9e68ccaf8d4e562790dbc8c988e8db3872da","source":{"kind":"arxiv","id":"1810.07510","version":1},"attestation_state":"computed","paper":{"title":"An EPTAS for machine scheduling with bag-constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kilian Grage, Kim Manuel Klein, Klaus Jansen","submitted_at":"2018-10-17T13:00:20Z","abstract_excerpt":"Machine scheduling is a fundamental optimization problem in computer science. The task of scheduling a set of jobs on a given number of machines and minimizing the makespan is well studied and among other results, we know that EPTAS's for machine scheduling on identical machines exist. Das and Wiese initiated the research on a generalization of makespan minimization, that includes so called bag-constraints. In this variation of machine scheduling the given set of jobs is partitioned into subsets, so called bags. Given this partition a schedule is only considered feasible when on any machine th"},"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.07510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T13:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"6746a1aa6318262152cbc2c03bb90ea6f781b357a04899dff8b83f579510246f","abstract_canon_sha256":"8eb6928cb4ab08069e26a65ea34d0c4d16b300d16213aad09bb481b18eedb0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:56.133833Z","signature_b64":"50pIkCQWsrALdwxEC9gMGG2vLGNqsbwwZnFOK41uFcb1q7t4iAPNAh3632XsTeAwc1yUu9KimaTmoOFc+wSOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8561b64c9d3027ea29c92eaa9a9e68ccaf8d4e562790dbc8c988e8db3872da","last_reissued_at":"2026-05-18T00:02:56.133186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:56.133186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An EPTAS for machine scheduling with bag-constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kilian Grage, Kim Manuel Klein, Klaus Jansen","submitted_at":"2018-10-17T13:00:20Z","abstract_excerpt":"Machine scheduling is a fundamental optimization problem in computer science. The task of scheduling a set of jobs on a given number of machines and minimizing the makespan is well studied and among other results, we know that EPTAS's for machine scheduling on identical machines exist. Das and Wiese initiated the research on a generalization of makespan minimization, that includes so called bag-constraints. In this variation of machine scheduling the given set of jobs is partitioned into subsets, so called bags. Given this partition a schedule is only considered feasible when on any machine th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07510","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.07510","created_at":"2026-05-18T00:02:56.133282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07510v1","created_at":"2026-05-18T00:02:56.133282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07510","created_at":"2026-05-18T00:02:56.133282+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWCWDNSMTUYC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWCWDNSMTUYCP2RJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWCWDNSM","created_at":"2026-05-18T12:32:16.446611+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/BWCWDNSMTUYCP2RJZEXKVGU6ND","json":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND.json","graph_json":"https://pith.science/api/pith-number/BWCWDNSMTUYCP2RJZEXKVGU6ND/graph.json","events_json":"https://pith.science/api/pith-number/BWCWDNSMTUYCP2RJZEXKVGU6ND/events.json","paper":"https://pith.science/paper/BWCWDNSM"},"agent_actions":{"view_html":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND","download_json":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND.json","view_paper":"https://pith.science/paper/BWCWDNSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07510&json=true","fetch_graph":"https://pith.science/api/pith-number/BWCWDNSMTUYCP2RJZEXKVGU6ND/graph.json","fetch_events":"https://pith.science/api/pith-number/BWCWDNSMTUYCP2RJZEXKVGU6ND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND/action/storage_attestation","attest_author":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND/action/author_attestation","sign_citation":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND/action/citation_signature","submit_replication":"https://pith.science/pith/BWCWDNSMTUYCP2RJZEXKVGU6ND/action/replication_record"}},"created_at":"2026-05-18T00:02:56.133282+00:00","updated_at":"2026-05-18T00:02:56.133282+00:00"}