{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SJ4QDFN4MX3TA4452AQBUPIIW3","short_pith_number":"pith:SJ4QDFN4","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"},"canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","source":{"kind":"arxiv","id":"1604.07153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07153","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07153v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07153","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"SJ4QDFN4MX3T","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SJ4QDFN4MX3TA445","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SJ4QDFN4","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SJ4QDFN4MX3TA4452AQBUPIIW3","target":"record","payload":{"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"},"canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","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"},"source_kind":"arxiv","source_id":"1604.07153","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMQN32A3s2JyD8MFmAZ2ewxGzxBHnzz73J+Sk4QnAAFFxPPbrUilfmPXvmxOr/n/H76G3bBDfL7PGZWy83UbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:51:40.213116Z"},"content_sha256":"eebb52320bc42eaee398fbf65b3c8a3cdd89f2713b34379cd987038e9adfe8f1","schema_version":"1.0","event_id":"sha256:eebb52320bc42eaee398fbf65b3c8a3cdd89f2713b34379cd987038e9adfe8f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SJ4QDFN4MX3TA4452AQBUPIIW3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNt6dKuCtgFpwqe0eOJRFGsJULvbnYVy/7CZbw6preYSo0gCGcn71MTGgJKME8zeo4lo2YnZ0pe/PV8P3dbdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:51:40.213724Z"},"content_sha256":"e4922c7441b061ca78eedafb70e6bf35ad3c5d9e9d7ee9e65fde9c2ddb09e074","schema_version":"1.0","event_id":"sha256:e4922c7441b061ca78eedafb70e6bf35ad3c5d9e9d7ee9e65fde9c2ddb09e074"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/bundle.json","state_url":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:51:40Z","links":{"resolver":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3","bundle":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/bundle.json","state":"https://pith.science/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJ4QDFN4MX3TA4452AQBUPIIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SJ4QDFN4MX3TA4452AQBUPIIW3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07bba4e0667fb18313ef6153358cfc8f1e6c8b004fbfa98c7d584318b91d383e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T07:47:34Z","title_canon_sha256":"9685cc782472151372cfb1c055a65c6d0f17ad507d8a54881365fc503a7929b4"},"schema_version":"1.0","source":{"id":"1604.07153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07153","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07153v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07153","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"SJ4QDFN4MX3T","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SJ4QDFN4MX3TA445","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SJ4QDFN4","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:e4922c7441b061ca78eedafb70e6bf35ad3c5d9e9d7ee9e65fde9c2ddb09e074","target":"graph","created_at":"2026-05-18T01:16:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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)","authors_text":"Jos\\'e Verschae, Kim-Manuel Klein, Klaus Jansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T07:47:34Z","title":"Closing the Gap for Makespan Scheduling via Sparsification Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07153","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eebb52320bc42eaee398fbf65b3c8a3cdd89f2713b34379cd987038e9adfe8f1","target":"record","created_at":"2026-05-18T01:16:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07bba4e0667fb18313ef6153358cfc8f1e6c8b004fbfa98c7d584318b91d383e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T07:47:34Z","title_canon_sha256":"9685cc782472151372cfb1c055a65c6d0f17ad507d8a54881365fc503a7929b4"},"schema_version":"1.0","source":{"id":"1604.07153","kind":"arxiv","version":1}},"canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92790195bc65f730739dd0201a3d08b6fe214010aa81729d3b0dffd7fd0f17f6","first_computed_at":"2026-05-18T01:16:22.927382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:22.927382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A6Vwpn4r0v1WGfXF/cT8AjOzTV/kjBax/1t3AgnOOLgUUeic6c7YnYyisEiQdJTqAHJDlvyodYduIKviUIghDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:22.928078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eebb52320bc42eaee398fbf65b3c8a3cdd89f2713b34379cd987038e9adfe8f1","sha256:e4922c7441b061ca78eedafb70e6bf35ad3c5d9e9d7ee9e65fde9c2ddb09e074"],"state_sha256":"97e8af8b1ba0d61d780f41e9ee1a61a149395845669b0997689a2602e46fb529"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUa1VzbcGhxN0P+ZVlLgSvhneZZFSX618yXOHMqxhxZz1LYfj/lp+tKT6DrsBwJeGfBpKJ4fJB8HJk4Tn8OoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:51:40.216064Z","bundle_sha256":"cb26ef845e1df73c7309cb9a49a9341bf45d20697766ad4693d0436cef5842e8"}}