{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ORREATXJML3INXL2KVWEDONGTA","short_pith_number":"pith:ORREATXJ","canonical_record":{"source":{"id":"1410.7506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T03:40:59Z","cross_cats_sorted":[],"title_canon_sha256":"9cc648f4a4c3a28fd2c7ca53216c92b582415f82b5de247350d90d6aea4b5bfa","abstract_canon_sha256":"299edaf509113edcc2f928f91bcdcc7c686d7661f67ba1014fb526fbe8104ffc"},"schema_version":"1.0"},"canonical_sha256":"7462404ee962f686dd7a556c41b9a698365451330b40a8f8d60c36eacb0f960b","source":{"kind":"arxiv","id":"1410.7506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7506","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7506v1","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7506","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ORREATXJML3I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORREATXJML3INXL2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORREATXJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ORREATXJML3INXL2KVWEDONGTA","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T03:40:59Z","cross_cats_sorted":[],"title_canon_sha256":"9cc648f4a4c3a28fd2c7ca53216c92b582415f82b5de247350d90d6aea4b5bfa","abstract_canon_sha256":"299edaf509113edcc2f928f91bcdcc7c686d7661f67ba1014fb526fbe8104ffc"},"schema_version":"1.0"},"canonical_sha256":"7462404ee962f686dd7a556c41b9a698365451330b40a8f8d60c36eacb0f960b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:16.991592Z","signature_b64":"hmff/zsDZvkzhF/Op/YXpTKijpfDSa1gjv0pdseJ9akOdBdwUg0eTYEO6vhvA/o6h2IK1YEnWhX6AC6WM0QCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7462404ee962f686dd7a556c41b9a698365451330b40a8f8d60c36eacb0f960b","last_reissued_at":"2026-05-18T02:39:16.991055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:16.991055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7506","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-18T02:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRMI9rkQmV9TRwvsPI8+49cZnYc5jsKp2+27Byt1OkpfJqSXEpzYrq9Q2+DqF+ZdfiuZIqRyzn7CrGs1D4e4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:39.656721Z"},"content_sha256":"b7c7e9cb6d5511e7d4aa5ece039e5d61dccbd7b85f267a07679686f09e5b9b7e","schema_version":"1.0","event_id":"sha256:b7c7e9cb6d5511e7d4aa5ece039e5d61dccbd7b85f267a07679686f09e5b9b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ORREATXJML3INXL2KVWEDONGTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $(1,\\epsilon)$-Restricted Assignment Makespan Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li","submitted_at":"2014-10-28T03:40:59Z","abstract_excerpt":"Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time $(2-\\delta)$-approximation algorithm is known for the problem for constant $\\delta> 0$. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be assigned to one from a specified subset. Recently in a breakthrough result, Svensson [Svensson, 2011] proved that the integrality gap of a certain configuration LP relaxation is upper bounded by $1.95$ for the restricted assignment problem; however"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7506","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-18T02:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFLihq6Px+xkuBadCrWIiZAuTiPG9xFHb3FWpGN6UD0AVh/cAk40+kB0keN2CUdBZUQddYWSBf2KBGPSXrSBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:39.657068Z"},"content_sha256":"588b3ac659f40bb1f796277ce3a1ef3fb76b636e413751dd656ddab46edd4093","schema_version":"1.0","event_id":"sha256:588b3ac659f40bb1f796277ce3a1ef3fb76b636e413751dd656ddab46edd4093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORREATXJML3INXL2KVWEDONGTA/bundle.json","state_url":"https://pith.science/pith/ORREATXJML3INXL2KVWEDONGTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORREATXJML3INXL2KVWEDONGTA/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-01T16:44:39Z","links":{"resolver":"https://pith.science/pith/ORREATXJML3INXL2KVWEDONGTA","bundle":"https://pith.science/pith/ORREATXJML3INXL2KVWEDONGTA/bundle.json","state":"https://pith.science/pith/ORREATXJML3INXL2KVWEDONGTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORREATXJML3INXL2KVWEDONGTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ORREATXJML3INXL2KVWEDONGTA","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":"299edaf509113edcc2f928f91bcdcc7c686d7661f67ba1014fb526fbe8104ffc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T03:40:59Z","title_canon_sha256":"9cc648f4a4c3a28fd2c7ca53216c92b582415f82b5de247350d90d6aea4b5bfa"},"schema_version":"1.0","source":{"id":"1410.7506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7506","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7506v1","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7506","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ORREATXJML3I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORREATXJML3INXL2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORREATXJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:588b3ac659f40bb1f796277ce3a1ef3fb76b636e413751dd656ddab46edd4093","target":"graph","created_at":"2026-05-18T02:39:16Z","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 minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time $(2-\\delta)$-approximation algorithm is known for the problem for constant $\\delta> 0$. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be assigned to one from a specified subset. Recently in a breakthrough result, Svensson [Svensson, 2011] proved that the integrality gap of a certain configuration LP relaxation is upper bounded by $1.95$ for the restricted assignment problem; however","authors_text":"Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T03:40:59Z","title":"On $(1,\\epsilon)$-Restricted Assignment Makespan Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7506","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:b7c7e9cb6d5511e7d4aa5ece039e5d61dccbd7b85f267a07679686f09e5b9b7e","target":"record","created_at":"2026-05-18T02:39:16Z","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":"299edaf509113edcc2f928f91bcdcc7c686d7661f67ba1014fb526fbe8104ffc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T03:40:59Z","title_canon_sha256":"9cc648f4a4c3a28fd2c7ca53216c92b582415f82b5de247350d90d6aea4b5bfa"},"schema_version":"1.0","source":{"id":"1410.7506","kind":"arxiv","version":1}},"canonical_sha256":"7462404ee962f686dd7a556c41b9a698365451330b40a8f8d60c36eacb0f960b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7462404ee962f686dd7a556c41b9a698365451330b40a8f8d60c36eacb0f960b","first_computed_at":"2026-05-18T02:39:16.991055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:16.991055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmff/zsDZvkzhF/Op/YXpTKijpfDSa1gjv0pdseJ9akOdBdwUg0eTYEO6vhvA/o6h2IK1YEnWhX6AC6WM0QCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:16.991592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7c7e9cb6d5511e7d4aa5ece039e5d61dccbd7b85f267a07679686f09e5b9b7e","sha256:588b3ac659f40bb1f796277ce3a1ef3fb76b636e413751dd656ddab46edd4093"],"state_sha256":"84254893d268fa97dcb84dda6e8993f8fbbff25b325d24ad879f913897582087"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DNRabbKM1O/wqK9fp0MK1I+ZZLirKq98/+ELb7LX9ePEVebvrsxea0xqUQD3/dTOSc6LGgN/RmpnoMR9bEJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:39.659053Z","bundle_sha256":"ded71918dba763afe198deaec16df10ccec0016397acacfd9e2b863e8c0908b4"}}