{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SJ4QDFN4MX3TA4452AQBUPIIW3","short_pith_number":"pith:SJ4QDFN4","schema_version":"1.0","canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","source":{"kind":"arxiv","id":"1604.07153","version":1},"attestation_state":"computed","paper":{"title":"Closing the Gap for Makespan Scheduling via Sparsification Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Kim-Manuel Klein, Klaus Jansen","submitted_at":"2016-04-25T07:47:34Z","abstract_excerpt":"Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n$ jobs to a set of $m$ identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a $(1+\\epsilon)$-approximation algorithm with a running time that depends polynomially on $1/\\epsilon$. Furthermore, Chen et al. [3] recently showed that a running time of $2^{(1/\\epsilon)^{1-\\delta}}+\\text{poly}(n)$ for any $\\delta>0$ would imply that the Exponential Time Hypothesis (ETH)"},"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":"1604.07153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T07:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"9685cc782472151372cfb1c055a65c6d0f17ad507d8a54881365fc503a7929b4","abstract_canon_sha256":"07bba4e0667fb18313ef6153358cfc8f1e6c8b004fbfa98c7d584318b91d383e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:22.928078Z","signature_b64":"A6Vwpn4r0v1WGfXF/cT8AjOzTV/kjBax/1t3AgnOOLgUUeic6c7YnYyisEiQdJTqAHJDlvyodYduIKviUIghDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","last_reissued_at":"2026-05-18T01:16:22.927382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:22.927382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closing the Gap for Makespan Scheduling via Sparsification Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Kim-Manuel Klein, Klaus Jansen","submitted_at":"2016-04-25T07:47:34Z","abstract_excerpt":"Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n$ jobs to a set of $m$ identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a $(1+\\epsilon)$-approximation algorithm with a running time that depends polynomially on $1/\\epsilon$. Furthermore, Chen et al. [3] recently showed that a running time of $2^{(1/\\epsilon)^{1-\\delta}}+\\text{poly}(n)$ for any $\\delta>0$ would imply that the Exponential Time Hypothesis (ETH)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07153","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":"1604.07153","created_at":"2026-05-18T01:16:22.927496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07153v1","created_at":"2026-05-18T01:16:22.927496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07153","created_at":"2026-05-18T01:16:22.927496+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ4QDFN4MX3T","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ4QDFN4MX3TA445","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ4QDFN4","created_at":"2026-05-18T12:30:44.179134+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/SJ4QDFN4MX3TA4452AQBUPIIW3","json":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3.json","graph_json":"https://pith.science/api/pith-number/SJ4QDFN4MX3TA4452AQBUPIIW3/graph.json","events_json":"https://pith.science/api/pith-number/SJ4QDFN4MX3TA4452AQBUPIIW3/events.json","paper":"https://pith.science/paper/SJ4QDFN4"},"agent_actions":{"view_html":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3","download_json":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3.json","view_paper":"https://pith.science/paper/SJ4QDFN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07153&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ4QDFN4MX3TA4452AQBUPIIW3/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ4QDFN4MX3TA4452AQBUPIIW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/action/storage_attestation","attest_author":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/action/author_attestation","sign_citation":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/action/citation_signature","submit_replication":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/action/replication_record"}},"created_at":"2026-05-18T01:16:22.927496+00:00","updated_at":"2026-05-18T01:16:22.927496+00:00"}