{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VH5ZPOXLNWDXJEXVWLYCQJEPKD","short_pith_number":"pith:VH5ZPOXL","canonical_record":{"source":{"id":"1801.05489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"9b1da41a61f357f69fcebb8a2f5cd89cef6ad0bfee344bd4c7c8647e42b52774","abstract_canon_sha256":"97ab90aeb741452d6cfc6fc644e11a1824d25175eacfe5a2b2805e5f8c9d3098"},"schema_version":"1.0"},"canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","source":{"kind":"arxiv","id":"1801.05489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05489","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05489v1","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05489","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"pith_short_12","alias_value":"VH5ZPOXLNWDX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VH5ZPOXLNWDXJEXV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VH5ZPOXL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VH5ZPOXLNWDXJEXVWLYCQJEPKD","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"9b1da41a61f357f69fcebb8a2f5cd89cef6ad0bfee344bd4c7c8647e42b52774","abstract_canon_sha256":"97ab90aeb741452d6cfc6fc644e11a1824d25175eacfe5a2b2805e5f8c9d3098"},"schema_version":"1.0"},"canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:41.111623Z","signature_b64":"9z660gLEbc/ZGT/LrnYSfMl2FWu5BTpYY0zoL8KO50BlhKAf5evEUK4l2aOXSGyl8tQJoBIy3za81e7J/cL0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","last_reissued_at":"2026-05-18T00:25:41.111077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:41.111077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05489","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-18T00:25:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buEsdu6HNj/vr87xXH9Wn0d9pMMWj2M7ZInkdUlRuWbyAdF5hZcCPOoDpjLUVm4X8BXilwNtMTSKqM5qIHOBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:39.436917Z"},"content_sha256":"6303e28a0a6ec2d67f7a43776db486339b69d7bb97f057bd9ee4f905dc4ee079","schema_version":"1.0","event_id":"sha256:6303e28a0a6ec2d67f7a43776db486339b69d7bb97f057bd9ee4f905dc4ee079"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VH5ZPOXLNWDXJEXVWLYCQJEPKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest Processing Time rule for identical parallel machines revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Della Croce, Rosario Scatamacchia","submitted_at":"2018-01-16T21:39:50Z","abstract_excerpt":"We consider the Pm || Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule proposed by Graham in 1969. LPT requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We provide new insights on LPT and discuss the approximation ratio of a modification of LPT that improves Graham's bound from 4/3 - 1/(3m) to 4/3 - 1/(3(m-1)) for m >= 3 and from 7/6 to 9/8 for m = 2. We use Linear Programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05489","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-18T00:25:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zA8Qv3GZg35iyQ9UOHzAFLJuBY2tmHLG9vKDSwcA7pjutrdlsFuEX8jQPynTSrR3IneAMEAFHG3oWHAtkHDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:39.437276Z"},"content_sha256":"cac7c741f98611e40807bfd2fb9a7586871282323bfa8d327f1cbc9a40dc6b1f","schema_version":"1.0","event_id":"sha256:cac7c741f98611e40807bfd2fb9a7586871282323bfa8d327f1cbc9a40dc6b1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/bundle.json","state_url":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/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-21T20:33:39Z","links":{"resolver":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD","bundle":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/bundle.json","state":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VH5ZPOXLNWDXJEXVWLYCQJEPKD","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":"97ab90aeb741452d6cfc6fc644e11a1824d25175eacfe5a2b2805e5f8c9d3098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","title_canon_sha256":"9b1da41a61f357f69fcebb8a2f5cd89cef6ad0bfee344bd4c7c8647e42b52774"},"schema_version":"1.0","source":{"id":"1801.05489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05489","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05489v1","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05489","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"pith_short_12","alias_value":"VH5ZPOXLNWDX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VH5ZPOXLNWDXJEXV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VH5ZPOXL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:cac7c741f98611e40807bfd2fb9a7586871282323bfa8d327f1cbc9a40dc6b1f","target":"graph","created_at":"2026-05-18T00:25:41Z","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 Pm || Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule proposed by Graham in 1969. LPT requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We provide new insights on LPT and discuss the approximation ratio of a modification of LPT that improves Graham's bound from 4/3 - 1/(3m) to 4/3 - 1/(3(m-1)) for m >= 3 and from 7/6 to 9/8 for m = 2. We use Linear Programmin","authors_text":"Federico Della Croce, Rosario Scatamacchia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","title":"Longest Processing Time rule for identical parallel machines revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05489","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:6303e28a0a6ec2d67f7a43776db486339b69d7bb97f057bd9ee4f905dc4ee079","target":"record","created_at":"2026-05-18T00:25:41Z","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":"97ab90aeb741452d6cfc6fc644e11a1824d25175eacfe5a2b2805e5f8c9d3098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","title_canon_sha256":"9b1da41a61f357f69fcebb8a2f5cd89cef6ad0bfee344bd4c7c8647e42b52774"},"schema_version":"1.0","source":{"id":"1801.05489","kind":"arxiv","version":1}},"canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","first_computed_at":"2026-05-18T00:25:41.111077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:41.111077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9z660gLEbc/ZGT/LrnYSfMl2FWu5BTpYY0zoL8KO50BlhKAf5evEUK4l2aOXSGyl8tQJoBIy3za81e7J/cL0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:41.111623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6303e28a0a6ec2d67f7a43776db486339b69d7bb97f057bd9ee4f905dc4ee079","sha256:cac7c741f98611e40807bfd2fb9a7586871282323bfa8d327f1cbc9a40dc6b1f"],"state_sha256":"a31b56bc1f262c92422771a84123451a6813cddb72bbe8c5bbf7d79fd5dcd67f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upIl/w/Wj8t0olqwIInzmNQbe/Hz8jdXMHP2g/eqeZXzld5ZS2BM1QZ/qXh3Zy7DSh505KMwy5fIs9FK6mAwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:33:39.439410Z","bundle_sha256":"e0729046331d5f1a3dea2c20382c59768426f9c9f35a43a0026c197da0957650"}}