{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:56EDNZTENEHRZBQYJQTY4OZ65H","short_pith_number":"pith:56EDNZTE","schema_version":"1.0","canonical_sha256":"ef8836e664690f1c86184c278e3b3ee9f91bf8ef8a28eda1f725247f653697b0","source":{"kind":"arxiv","id":"1701.07242","version":1},"attestation_state":"computed","paper":{"title":"Structural Parameters for Scheduling with Assignment Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Marten Maack, Roberto Solis-Oba","submitted_at":"2017-01-25T10:24:44Z","abstract_excerpt":"We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation algorithms with approximation ratios smaller than $1.5$ unless P$=$NP. However, if we impose limitations on the set of machines that can process a job, the problem sometimes becomes easier in the sense that algorithms with approximation ratios better than $1.5$ exist. We introduce three graphs, based on the assignment restrictions and study the computational complexity of the scheduling problem with respect to struc"},"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":"1701.07242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-25T10:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"257cda72257ffdc16eb6d1e18f27fd15ef69428ba086c7de90affb6afdeac534","abstract_canon_sha256":"e94261d82ec5dbf9e1838613160894e430b33573800c87901e8abd6d5fe247ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.065334Z","signature_b64":"LDksYdBDkg8NpVbcq3fXxjWB5h4Wg2b2ZulY1mAJozGQhBHGRX6hdniJ3Dm66sjrC8OvHU/YoTYmnZGOcSg1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8836e664690f1c86184c278e3b3ee9f91bf8ef8a28eda1f725247f653697b0","last_reissued_at":"2026-05-18T00:52:07.064711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.064711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Parameters for Scheduling with Assignment Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Marten Maack, Roberto Solis-Oba","submitted_at":"2017-01-25T10:24:44Z","abstract_excerpt":"We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation algorithms with approximation ratios smaller than $1.5$ unless P$=$NP. However, if we impose limitations on the set of machines that can process a job, the problem sometimes becomes easier in the sense that algorithms with approximation ratios better than $1.5$ exist. We introduce three graphs, based on the assignment restrictions and study the computational complexity of the scheduling problem with respect to struc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07242","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":"1701.07242","created_at":"2026-05-18T00:52:07.064794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07242v1","created_at":"2026-05-18T00:52:07.064794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07242","created_at":"2026-05-18T00:52:07.064794+00:00"},{"alias_kind":"pith_short_12","alias_value":"56EDNZTENEHR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"56EDNZTENEHRZBQY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"56EDNZTE","created_at":"2026-05-18T12:31:00.734936+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/56EDNZTENEHRZBQYJQTY4OZ65H","json":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H.json","graph_json":"https://pith.science/api/pith-number/56EDNZTENEHRZBQYJQTY4OZ65H/graph.json","events_json":"https://pith.science/api/pith-number/56EDNZTENEHRZBQYJQTY4OZ65H/events.json","paper":"https://pith.science/paper/56EDNZTE"},"agent_actions":{"view_html":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H","download_json":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H.json","view_paper":"https://pith.science/paper/56EDNZTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07242&json=true","fetch_graph":"https://pith.science/api/pith-number/56EDNZTENEHRZBQYJQTY4OZ65H/graph.json","fetch_events":"https://pith.science/api/pith-number/56EDNZTENEHRZBQYJQTY4OZ65H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H/action/storage_attestation","attest_author":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H/action/author_attestation","sign_citation":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H/action/citation_signature","submit_replication":"https://pith.science/pith/56EDNZTENEHRZBQYJQTY4OZ65H/action/replication_record"}},"created_at":"2026-05-18T00:52:07.064794+00:00","updated_at":"2026-05-18T00:52:07.064794+00:00"}