{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BYACDZ2Q3U32WTVOINCMNUMMA2","short_pith_number":"pith:BYACDZ2Q","canonical_record":{"source":{"id":"1304.5625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T11:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"60338d5792708a7b7426201b86f83cd4a105b23f4c28652901e8905620b6ace6","abstract_canon_sha256":"a8d34d9b25334e3a5d063ddfc2b96ffe17a1380c9f62e8bd57dce899a657318d"},"schema_version":"1.0"},"canonical_sha256":"0e0021e750dd37ab4eae4344c6d18c06b671d1db06fefa2dc9dcab0ab8ee5644","source":{"kind":"arxiv","id":"1304.5625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5625","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5625v1","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5625","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"BYACDZ2Q3U32","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYACDZ2Q3U32WTVO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYACDZ2Q","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BYACDZ2Q3U32WTVOINCMNUMMA2","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T11:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"60338d5792708a7b7426201b86f83cd4a105b23f4c28652901e8905620b6ace6","abstract_canon_sha256":"a8d34d9b25334e3a5d063ddfc2b96ffe17a1380c9f62e8bd57dce899a657318d"},"schema_version":"1.0"},"canonical_sha256":"0e0021e750dd37ab4eae4344c6d18c06b671d1db06fefa2dc9dcab0ab8ee5644","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:31.447024Z","signature_b64":"eYgRtqNt9rDVjzg2T41tu9w8wdvPqsMpn5lt3Vw9gjmOgTbsSJ9auIH38JvgdMJFW8gHXxiWifvP//UCRlZBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e0021e750dd37ab4eae4344c6d18c06b671d1db06fefa2dc9dcab0ab8ee5644","last_reissued_at":"2026-05-18T03:27:31.446414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:31.446414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5625","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-18T03:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzJpfy+m2thBjSIl4rPHR/8GfKNgZwDfyuNzljt+D2wdJ4RIuFQDVQHBmy0VD/dpenx2I0gulBt3bKbTwHCxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:04:44.474227Z"},"content_sha256":"54512c28d94d2314b4692a6b1b478a00debc3b676d86be44a79c48450ccb2402","schema_version":"1.0","event_id":"sha256:54512c28d94d2314b4692a6b1b478a00debc3b676d86be44a79c48450ccb2402"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BYACDZ2Q3U32WTVOINCMNUMMA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Makespan Minimization with Parallel Schedules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Hellwig, Susanne Albers","submitted_at":"2013-04-20T11:45:03Z","abstract_excerpt":"In online makespan minimization a sequence of jobs $\\sigma = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job. We investigate the problem with an essentially new model of resource augmentation. Here, an online algorithm is allowed to build several schedules in parallel while processing $\\sigma$. At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. The setting is of particular int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5625","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-18T03:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"585dOlOa8/B+HJ0ehDE40su0iFGEMmdvGagOyN8jmAHEOpFiM4qYph4xQOdIz1bNKIRLoq5fMxpgRBqyVdDxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:04:44.474901Z"},"content_sha256":"66ed88e4aa8e6c0b342c5247beb32c70c6bcd0b1efe4635df580142cf9063697","schema_version":"1.0","event_id":"sha256:66ed88e4aa8e6c0b342c5247beb32c70c6bcd0b1efe4635df580142cf9063697"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/bundle.json","state_url":"https://pith.science/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/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-09T23:04:44Z","links":{"resolver":"https://pith.science/pith/BYACDZ2Q3U32WTVOINCMNUMMA2","bundle":"https://pith.science/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/bundle.json","state":"https://pith.science/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYACDZ2Q3U32WTVOINCMNUMMA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BYACDZ2Q3U32WTVOINCMNUMMA2","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":"a8d34d9b25334e3a5d063ddfc2b96ffe17a1380c9f62e8bd57dce899a657318d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T11:45:03Z","title_canon_sha256":"60338d5792708a7b7426201b86f83cd4a105b23f4c28652901e8905620b6ace6"},"schema_version":"1.0","source":{"id":"1304.5625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5625","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5625v1","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5625","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"BYACDZ2Q3U32","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYACDZ2Q3U32WTVO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYACDZ2Q","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:66ed88e4aa8e6c0b342c5247beb32c70c6bcd0b1efe4635df580142cf9063697","target":"graph","created_at":"2026-05-18T03:27:31Z","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":"In online makespan minimization a sequence of jobs $\\sigma = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job. We investigate the problem with an essentially new model of resource augmentation. Here, an online algorithm is allowed to build several schedules in parallel while processing $\\sigma$. At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. The setting is of particular int","authors_text":"Matthias Hellwig, Susanne Albers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T11:45:03Z","title":"Online Makespan Minimization with Parallel Schedules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5625","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:54512c28d94d2314b4692a6b1b478a00debc3b676d86be44a79c48450ccb2402","target":"record","created_at":"2026-05-18T03:27:31Z","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":"a8d34d9b25334e3a5d063ddfc2b96ffe17a1380c9f62e8bd57dce899a657318d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T11:45:03Z","title_canon_sha256":"60338d5792708a7b7426201b86f83cd4a105b23f4c28652901e8905620b6ace6"},"schema_version":"1.0","source":{"id":"1304.5625","kind":"arxiv","version":1}},"canonical_sha256":"0e0021e750dd37ab4eae4344c6d18c06b671d1db06fefa2dc9dcab0ab8ee5644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e0021e750dd37ab4eae4344c6d18c06b671d1db06fefa2dc9dcab0ab8ee5644","first_computed_at":"2026-05-18T03:27:31.446414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:31.446414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eYgRtqNt9rDVjzg2T41tu9w8wdvPqsMpn5lt3Vw9gjmOgTbsSJ9auIH38JvgdMJFW8gHXxiWifvP//UCRlZBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:31.447024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54512c28d94d2314b4692a6b1b478a00debc3b676d86be44a79c48450ccb2402","sha256:66ed88e4aa8e6c0b342c5247beb32c70c6bcd0b1efe4635df580142cf9063697"],"state_sha256":"e0555dc683f552f1c8d638f6b17de6097d9ba5dbacb7d3e27dfd9a7fdb005e92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbNaQ9nTMpTdlPDqaN0x6oTIzQGuNavosST+KaDZix3UeFqB0rwdhjpVDkE+AJFESNmymxXlqgq4kK3pUhjPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:04:44.479295Z","bundle_sha256":"80bba97f886e8efce55983f2ed3008cc787ca2dec0dfb6d5245e19483eae214d"}}