{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QMQO6KWOXV4Y7N2LGX6CFSXLJC","short_pith_number":"pith:QMQO6KWO","schema_version":"1.0","canonical_sha256":"8320ef2acebd798fb74b35fc22caeb489fca6cfb11bb1b7cb41c7b07db8dda37","source":{"kind":"arxiv","id":"1705.04587","version":1},"attestation_state":"computed","paper":{"title":"Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Klaus Jansen, Lars Schmarje, Malin Rau, S\\\"oren Henning","submitted_at":"2017-05-12T14:22:53Z","abstract_excerpt":"We study the Parallel Task Scheduling problem $Pm|size_j|C_{\\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \\geq 5$, while it is solvable in pseudo-polynomial time for each $m \\leq 3$. We give a positive answer to the long-standing open question whether this problem is strongly $NP$-complete for $m=4$. As a second result, we improve the lower bound of $\\frac{12}{11}$ for approximating pseudo-polynomial Strip Packing to $\\frac{5}{4}$. Since the best known approximation algorithm for this problem has a ratio of $\\frac{4}{3} + \\varepsilon$, "},"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":"1705.04587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-12T14:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"908f66dfb73f7c27d859659de6821c7a1bcb1e32822abfdcf0c4f0bd6a18fdf2","abstract_canon_sha256":"4d68cdcc3a6a549bc79170b243a851d49b6a189fda6f193461ff1858ff47ccd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.721676Z","signature_b64":"rchELIWwNxmHHozy8TCBDPV8sbKmno+E0nqSB9bx2XNTjdduZfXOvF/hFtj1mlaDhV/N+0KDc0gjF3MA0ylZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8320ef2acebd798fb74b35fc22caeb489fca6cfb11bb1b7cb41c7b07db8dda37","last_reissued_at":"2026-05-18T00:44:37.721110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.721110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Klaus Jansen, Lars Schmarje, Malin Rau, S\\\"oren Henning","submitted_at":"2017-05-12T14:22:53Z","abstract_excerpt":"We study the Parallel Task Scheduling problem $Pm|size_j|C_{\\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \\geq 5$, while it is solvable in pseudo-polynomial time for each $m \\leq 3$. We give a positive answer to the long-standing open question whether this problem is strongly $NP$-complete for $m=4$. As a second result, we improve the lower bound of $\\frac{12}{11}$ for approximating pseudo-polynomial Strip Packing to $\\frac{5}{4}$. Since the best known approximation algorithm for this problem has a ratio of $\\frac{4}{3} + \\varepsilon$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04587","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":"1705.04587","created_at":"2026-05-18T00:44:37.721177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04587v1","created_at":"2026-05-18T00:44:37.721177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04587","created_at":"2026-05-18T00:44:37.721177+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMQO6KWOXV4Y","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMQO6KWOXV4Y7N2L","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMQO6KWO","created_at":"2026-05-18T12:31:39.905425+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/QMQO6KWOXV4Y7N2LGX6CFSXLJC","json":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC.json","graph_json":"https://pith.science/api/pith-number/QMQO6KWOXV4Y7N2LGX6CFSXLJC/graph.json","events_json":"https://pith.science/api/pith-number/QMQO6KWOXV4Y7N2LGX6CFSXLJC/events.json","paper":"https://pith.science/paper/QMQO6KWO"},"agent_actions":{"view_html":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC","download_json":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC.json","view_paper":"https://pith.science/paper/QMQO6KWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04587&json=true","fetch_graph":"https://pith.science/api/pith-number/QMQO6KWOXV4Y7N2LGX6CFSXLJC/graph.json","fetch_events":"https://pith.science/api/pith-number/QMQO6KWOXV4Y7N2LGX6CFSXLJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC/action/storage_attestation","attest_author":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC/action/author_attestation","sign_citation":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC/action/citation_signature","submit_replication":"https://pith.science/pith/QMQO6KWOXV4Y7N2LGX6CFSXLJC/action/replication_record"}},"created_at":"2026-05-18T00:44:37.721177+00:00","updated_at":"2026-05-18T00:44:37.721177+00:00"}