{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I2WBOG3H7VV7E2K75TUOEWYMPK","short_pith_number":"pith:I2WBOG3H","canonical_record":{"source":{"id":"1611.01934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"de15dedded64b4f712f51e7bf354de86ed77f85dbad6bafee7d4654a5e619877","abstract_canon_sha256":"e8a7ae02207b72a3ac1c7adf5de046fce3cc202c2cd4eb1b86d853b9dc43b762"},"schema_version":"1.0"},"canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","source":{"kind":"arxiv","id":"1611.01934","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01934","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01934v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01934","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"I2WBOG3H7VV7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I2WBOG3H7VV7E2K7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I2WBOG3H","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I2WBOG3H7VV7E2K75TUOEWYMPK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"de15dedded64b4f712f51e7bf354de86ed77f85dbad6bafee7d4654a5e619877","abstract_canon_sha256":"e8a7ae02207b72a3ac1c7adf5de046fce3cc202c2cd4eb1b86d853b9dc43b762"},"schema_version":"1.0"},"canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.013938Z","signature_b64":"mH2vZTK8+HFNu6Aizr3rVFUm7tghTdBdULY6XEDHn6No6GQVx8kN8Uyf4HYaw03jGGxMyycwvbcj2JYwKHu+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","last_reissued_at":"2026-05-18T00:52:55.013391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.013391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01934","source_version":2,"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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIc1mr91sWyYGgZGllMx382IsSy9o1Yn5qbl6fpPEMH6YaOj1dCeVfk2OESjZjcB0uxU1m3LkIpgmC5R5EsGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:24:53.531405Z"},"content_sha256":"b959c8f4799a190f1d0a1e31dddbce142ae3d93102cd1b2837135aeb20020403","schema_version":"1.0","event_id":"sha256:b959c8f4799a190f1d0a1e31dddbce142ae3d93102cd1b2837135aeb20020403"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I2WBOG3H7VV7E2K75TUOEWYMPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Configuration-LP of the Restricted Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Lars Rohwedder","submitted_at":"2016-11-07T08:35:47Z","abstract_excerpt":"We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is to be minimized. The processing time $p_{ij}$ of a job $j$ depends on the machine $i$ it is assigned to. Lenstra, Shmoys and Tardos gave a polynomial time $2$-approximation for this problem. In this paper we focus on a prominent special case, the Restricted Assignment problem, in which $p_{ij}\\in\\{p_j,\\infty\\}$. The configuration-LP is a linear programming relaxation for the Restricted Assignment problem. It was sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01934","kind":"arxiv","version":2},"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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOm2xCJhlu5gn6mU9uuyET5M1L91GwJopM7blpG32SWcxJ8CBOlLgrlUhhL5LDb1Ejp76IdZjzhHIeLnhIg/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:24:53.532066Z"},"content_sha256":"147c9c522550f5bce6b6e4a315efe4600a1d1c3fc2ad77e072c7a9b22a7c04db","schema_version":"1.0","event_id":"sha256:147c9c522550f5bce6b6e4a315efe4600a1d1c3fc2ad77e072c7a9b22a7c04db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/bundle.json","state_url":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/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-28T17:24:53Z","links":{"resolver":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK","bundle":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/bundle.json","state":"https://pith.science/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2WBOG3H7VV7E2K75TUOEWYMPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I2WBOG3H7VV7E2K75TUOEWYMPK","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":"e8a7ae02207b72a3ac1c7adf5de046fce3cc202c2cd4eb1b86d853b9dc43b762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","title_canon_sha256":"de15dedded64b4f712f51e7bf354de86ed77f85dbad6bafee7d4654a5e619877"},"schema_version":"1.0","source":{"id":"1611.01934","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01934","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01934v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01934","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"I2WBOG3H7VV7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I2WBOG3H7VV7E2K7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I2WBOG3H","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:147c9c522550f5bce6b6e4a315efe4600a1d1c3fc2ad77e072c7a9b22a7c04db","target":"graph","created_at":"2026-05-18T00:52:55Z","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":"We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is to be minimized. The processing time $p_{ij}$ of a job $j$ depends on the machine $i$ it is assigned to. Lenstra, Shmoys and Tardos gave a polynomial time $2$-approximation for this problem. In this paper we focus on a prominent special case, the Restricted Assignment problem, in which $p_{ij}\\in\\{p_j,\\infty\\}$. The configuration-LP is a linear programming relaxation for the Restricted Assignment problem. It was sho","authors_text":"Klaus Jansen, Lars Rohwedder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","title":"On the Configuration-LP of the Restricted Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01934","kind":"arxiv","version":2},"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:b959c8f4799a190f1d0a1e31dddbce142ae3d93102cd1b2837135aeb20020403","target":"record","created_at":"2026-05-18T00:52:55Z","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":"e8a7ae02207b72a3ac1c7adf5de046fce3cc202c2cd4eb1b86d853b9dc43b762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-07T08:35:47Z","title_canon_sha256":"de15dedded64b4f712f51e7bf354de86ed77f85dbad6bafee7d4654a5e619877"},"schema_version":"1.0","source":{"id":"1611.01934","kind":"arxiv","version":2}},"canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46ac171b67fd6bf2695fece8e25b0c7aa3244136b0b76436342b746da3e4d60e","first_computed_at":"2026-05-18T00:52:55.013391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:55.013391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mH2vZTK8+HFNu6Aizr3rVFUm7tghTdBdULY6XEDHn6No6GQVx8kN8Uyf4HYaw03jGGxMyycwvbcj2JYwKHu+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:55.013938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01934","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b959c8f4799a190f1d0a1e31dddbce142ae3d93102cd1b2837135aeb20020403","sha256:147c9c522550f5bce6b6e4a315efe4600a1d1c3fc2ad77e072c7a9b22a7c04db"],"state_sha256":"28333390f090e0a1e0f72c11beb3bd7719a9b0caae1d060a03ac935844266165"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0kA7YCi5PelRFe9tfDp+BdHo3ajk006hmbnaGekodfO8/25zHv/MY94SsLFGXeXg2D3h9ZMhuLYmkVk8AAMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:24:53.535769Z","bundle_sha256":"d4023ff7c84737beaf848f06e89b0665f4625e9c7336576755ace3c9f60a4847"}}