{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P2K7FVQP3C3IPMH7A6HOS3VTCE","short_pith_number":"pith:P2K7FVQP","canonical_record":{"source":{"id":"2607.00878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"8c5ccf353be27aa9ed7843459cc997f6ac0a8054fc62e62ecf090e4e6545ff44","abstract_canon_sha256":"ef6ff033a6566a29e41c77139446f51b02388f3be825a615d734faaa0ac7391e"},"schema_version":"1.0"},"canonical_sha256":"7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc","source":{"kind":"arxiv","id":"2607.00878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00878","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00878v1","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00878","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"P2K7FVQP3C3I","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"P2K7FVQP3C3IPMH7","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"P2K7FVQP","created_at":"2026-07-02T01:18:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P2K7FVQP3C3IPMH7A6HOS3VTCE","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"8c5ccf353be27aa9ed7843459cc997f6ac0a8054fc62e62ecf090e4e6545ff44","abstract_canon_sha256":"ef6ff033a6566a29e41c77139446f51b02388f3be825a615d734faaa0ac7391e"},"schema_version":"1.0"},"canonical_sha256":"7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:22.049065Z","signature_b64":"tLROcEj4CMBRR8t4tqM9/GHIV5BwwDtJETqV3njlbbXu9ocl6Hvye5GrkRI6z6G71rJJIC/eHa4Op/be+a2KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc","last_reissued_at":"2026-07-02T01:18:22.048732Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:22.048732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00878","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-07-02T01:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilo5Su9LU9TwgKISznAfHk2EXOpnDUtrLxylSdyfRo0Hbjr5/89qU1PY68ZtYbyH2NEBXUVE9TDaDoEx2lIxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:41:57.239276Z"},"content_sha256":"5d3b0d6ecc5b55570c9fb75dba408f6bf2ad9c5adeec6ec66a11a08bef009465","schema_version":"1.0","event_id":"sha256:5d3b0d6ecc5b55570c9fb75dba408f6bf2ad9c5adeec6ec66a11a08bef009465"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P2K7FVQP3C3IPMH7A6HOS3VTCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bennet Edler, Felix Ohnesorge, Klaus Jansen, Lis Pirotton","submitted_at":"2026-07-01T12:43:36Z","abstract_excerpt":"In the problem of Parallel Task Scheduling (PTS), we are asked to schedule $n$ jobs, each with a fixed processing time and machine requirement, such that the completion time of the last job is minimized. Jansen and Rau (2019) presented an algorithm for PTS that achieves an approximation ratio of $(3/2)\\text{OPT} + p_{\\max}$. They additionally posed the open question whether an approximation ratio of $(4/3)\\text{OPT} + p_{\\max}$ is possible. In this work, we present such an algorithm with a running time of $O(n\\log n)$.\n  The problem of Multiple Cluster Scheduling (MCS) is a natural extension o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00878","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00878/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T01:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htIqrAU40mi5/XxNzbl5mOO9oz4CU/xMIr0aZGfyma4U3szCuDpN763G6lUhJigUdj2aHPpjT8zBLBcFVhcBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:41:57.239669Z"},"content_sha256":"e46deb2c9fb64dc77678a708337fa2fa96f3e507ca0b001bd16714dd444ff84e","schema_version":"1.0","event_id":"sha256:e46deb2c9fb64dc77678a708337fa2fa96f3e507ca0b001bd16714dd444ff84e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/bundle.json","state_url":"https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/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-07-02T12:41:57Z","links":{"resolver":"https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE","bundle":"https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/bundle.json","state":"https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P2K7FVQP3C3IPMH7A6HOS3VTCE","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":"ef6ff033a6566a29e41c77139446f51b02388f3be825a615d734faaa0ac7391e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:43:36Z","title_canon_sha256":"8c5ccf353be27aa9ed7843459cc997f6ac0a8054fc62e62ecf090e4e6545ff44"},"schema_version":"1.0","source":{"id":"2607.00878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00878","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00878v1","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00878","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"P2K7FVQP3C3I","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"P2K7FVQP3C3IPMH7","created_at":"2026-07-02T01:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"P2K7FVQP","created_at":"2026-07-02T01:18:22Z"}],"graph_snapshots":[{"event_id":"sha256:e46deb2c9fb64dc77678a708337fa2fa96f3e507ca0b001bd16714dd444ff84e","target":"graph","created_at":"2026-07-02T01:18: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the problem of Parallel Task Scheduling (PTS), we are asked to schedule $n$ jobs, each with a fixed processing time and machine requirement, such that the completion time of the last job is minimized. Jansen and Rau (2019) presented an algorithm for PTS that achieves an approximation ratio of $(3/2)\\text{OPT} + p_{\\max}$. They additionally posed the open question whether an approximation ratio of $(4/3)\\text{OPT} + p_{\\max}$ is possible. In this work, we present such an algorithm with a running time of $O(n\\log n)$.\n  The problem of Multiple Cluster Scheduling (MCS) is a natural extension o","authors_text":"Bennet Edler, Felix Ohnesorge, Klaus Jansen, Lis Pirotton","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:43:36Z","title":"Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00878","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:5d3b0d6ecc5b55570c9fb75dba408f6bf2ad9c5adeec6ec66a11a08bef009465","target":"record","created_at":"2026-07-02T01:18: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":"ef6ff033a6566a29e41c77139446f51b02388f3be825a615d734faaa0ac7391e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:43:36Z","title_canon_sha256":"8c5ccf353be27aa9ed7843459cc997f6ac0a8054fc62e62ecf090e4e6545ff44"},"schema_version":"1.0","source":{"id":"2607.00878","kind":"arxiv","version":1}},"canonical_sha256":"7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc","first_computed_at":"2026-07-02T01:18:22.048732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:22.048732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tLROcEj4CMBRR8t4tqM9/GHIV5BwwDtJETqV3njlbbXu9ocl6Hvye5GrkRI6z6G71rJJIC/eHa4Op/be+a2KCA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:22.049065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d3b0d6ecc5b55570c9fb75dba408f6bf2ad9c5adeec6ec66a11a08bef009465","sha256:e46deb2c9fb64dc77678a708337fa2fa96f3e507ca0b001bd16714dd444ff84e"],"state_sha256":"ecc1ee9c9413db7b53d090e8fea375140017b3452b42658968b10f39499c945a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHYapNTOEyYXF56Nl4x8H0kjyHvma4stMYqAeS2mQVU0bXB5VwD3rNVyamV0Y0cutxMZcnOgH+9Qcz608gINBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:41:57.241689Z","bundle_sha256":"d14bc5e09f633d963dfe55a206b1e27201ead37d66149e9c2ec7a558d75c3baa"}}