{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CEXERY7YXHGIDT5KDPWDMPG6OP","short_pith_number":"pith:CEXERY7Y","canonical_record":{"source":{"id":"1011.4957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb7752ecf145eb96ca1b43b1963b85ad66aced720443e5132331658b9297cef5","abstract_canon_sha256":"38bf25c5b5146444be1afa9cc9f84aed9ddd0ea46a422e0f1e0b6e8602b5928e"},"schema_version":"1.0"},"canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","source":{"kind":"arxiv","id":"1011.4957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4957","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4957v1","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4957","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"CEXERY7YXHGI","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CEXERY7YXHGIDT5K","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CEXERY7Y","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CEXERY7YXHGIDT5KDPWDMPG6OP","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb7752ecf145eb96ca1b43b1963b85ad66aced720443e5132331658b9297cef5","abstract_canon_sha256":"38bf25c5b5146444be1afa9cc9f84aed9ddd0ea46a422e0f1e0b6e8602b5928e"},"schema_version":"1.0"},"canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:23.969436Z","signature_b64":"p7+yIs0XFN3vDXZGkKZa070n5s9tLJFCmk6l+dO3vgUyhTQ+dF/ZTEfXYIi5QI56FQACoGKsTHvkADkj7Xx6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","last_reissued_at":"2026-05-18T02:23:23.968513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:23.968513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4957","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:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKqh3ECEfXqXLI+sLakiXELH2kr9KxHrOU77tugvEI3x0RwpVzrbttIKhc/mj0ZIidgJpFqFHn3LkMEZLk/3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:29:41.441816Z"},"content_sha256":"6c3f0420468bd6aaaf790aabb151dc48d6f72c5964c84ce5d31fedff761481af","schema_version":"1.0","event_id":"sha256:6c3f0420468bd6aaaf790aabb151dc48d6f72c5964c84ce5d31fedff761481af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CEXERY7YXHGIDT5KDPWDMPG6OP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Configuration-LP for Scheduling on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Andreas Wiese, Jos\\'e Verschae","submitted_at":"2010-11-22T21:30:29Z","abstract_excerpt":"One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NP-hard to approximate with a better ratio than 3/2. Closing this gap has been open for over 20 years. The best known approximation factors are achieved by LP-based algorithms. The strongest known linear program formulation for the problem is the configuration-LP. We show that the configuration-LP has an integrality gap of 2 even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4957","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:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6yiqSWaZ4+REObkUG0t84qyArJtTwcaVdl2hwyzn3EOP3edltBx3mOaKyQVms4w5A3+OIOT1S+u3SoxZFw5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:29:41.442165Z"},"content_sha256":"773a6f4f5c4055c38d9b8db83e751dc1fb59375c5532fd22ab163f6ab6226b92","schema_version":"1.0","event_id":"sha256:773a6f4f5c4055c38d9b8db83e751dc1fb59375c5532fd22ab163f6ab6226b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/bundle.json","state_url":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/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-05-21T13:29:41Z","links":{"resolver":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP","bundle":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/bundle.json","state":"https://pith.science/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEXERY7YXHGIDT5KDPWDMPG6OP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CEXERY7YXHGIDT5KDPWDMPG6OP","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":"38bf25c5b5146444be1afa9cc9f84aed9ddd0ea46a422e0f1e0b6e8602b5928e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","title_canon_sha256":"eb7752ecf145eb96ca1b43b1963b85ad66aced720443e5132331658b9297cef5"},"schema_version":"1.0","source":{"id":"1011.4957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4957","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4957v1","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4957","created_at":"2026-05-18T02:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"CEXERY7YXHGI","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CEXERY7YXHGIDT5K","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CEXERY7Y","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:773a6f4f5c4055c38d9b8db83e751dc1fb59375c5532fd22ab163f6ab6226b92","target":"graph","created_at":"2026-05-18T02:23:23Z","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":"One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NP-hard to approximate with a better ratio than 3/2. Closing this gap has been open for over 20 years. The best known approximation factors are achieved by LP-based algorithms. The strongest known linear program formulation for the problem is the configuration-LP. We show that the configuration-LP has an integrality gap of 2 even ","authors_text":"Andreas Wiese, Jos\\'e Verschae","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","title":"On the Configuration-LP for Scheduling on Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4957","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:6c3f0420468bd6aaaf790aabb151dc48d6f72c5964c84ce5d31fedff761481af","target":"record","created_at":"2026-05-18T02:23:23Z","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":"38bf25c5b5146444be1afa9cc9f84aed9ddd0ea46a422e0f1e0b6e8602b5928e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-22T21:30:29Z","title_canon_sha256":"eb7752ecf145eb96ca1b43b1963b85ad66aced720443e5132331658b9297cef5"},"schema_version":"1.0","source":{"id":"1011.4957","kind":"arxiv","version":1}},"canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"112e48e3f8b9cc81cfaa1bec363cde73c78c414a7fbce62494540251b55722c4","first_computed_at":"2026-05-18T02:23:23.968513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:23.968513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p7+yIs0XFN3vDXZGkKZa070n5s9tLJFCmk6l+dO3vgUyhTQ+dF/ZTEfXYIi5QI56FQACoGKsTHvkADkj7Xx6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:23.969436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c3f0420468bd6aaaf790aabb151dc48d6f72c5964c84ce5d31fedff761481af","sha256:773a6f4f5c4055c38d9b8db83e751dc1fb59375c5532fd22ab163f6ab6226b92"],"state_sha256":"14e532d2bf7e305325d3adb4ada4dd822062cf81cf7d28125eb5fefdb59292b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHYYpr2tzB8WX7VkL6QaCk9gYbNwVuHjxy7zHhp0WAnODmOK++vItPoJ0dwAask7sPskBG7jYRfGUi+jpzmKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:29:41.444717Z","bundle_sha256":"47de76afc79b0b03335ad6cbceb88b7806f1d62d5c94e312448e0b9a1c6d23e2"}}