{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LGZF5SKDA2R2B5QCEEQDNGZCBV","short_pith_number":"pith:LGZF5SKD","canonical_record":{"source":{"id":"1502.02304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T21:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"7e0bf08c456056cc9b2bf89512ba63f7dc65ab9a82df8993148f6890d1c91e42","abstract_canon_sha256":"3e70f429faf32a47e0661ff71d119c30d94443f0d35f253ab5c22d00f4a982e1"},"schema_version":"1.0"},"canonical_sha256":"59b25ec94306a3a0f6022120369b220d4bcb691f2b15850ae59820faf1d50e2e","source":{"kind":"arxiv","id":"1502.02304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02304","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02304v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02304","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"LGZF5SKDA2R2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGZF5SKDA2R2B5QC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGZF5SKD","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LGZF5SKDA2R2B5QCEEQDNGZCBV","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T21:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"7e0bf08c456056cc9b2bf89512ba63f7dc65ab9a82df8993148f6890d1c91e42","abstract_canon_sha256":"3e70f429faf32a47e0661ff71d119c30d94443f0d35f253ab5c22d00f4a982e1"},"schema_version":"1.0"},"canonical_sha256":"59b25ec94306a3a0f6022120369b220d4bcb691f2b15850ae59820faf1d50e2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.936255Z","signature_b64":"6Clyj5k85bcHJFnyu8ScICpnzf3cFh2k8vqhDex3s/jVjSra2SIpC/mM/TChwQUiRAa/qzpty5Yo3+56RPyoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b25ec94306a3a0f6022120369b220d4bcb691f2b15850ae59820faf1d50e2e","last_reissued_at":"2026-05-18T02:27:42.935494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.935494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02304","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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TSQ7JLVuoTU15YDu9zZqkR0/qPFs+ka3xVqitQrEDQcFC0auuKYE2SVmS8OLbqce32rZBKCNjSJvBYEO+aFqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:47.741409Z"},"content_sha256":"cec26cb61c83321d586d1b5a1eb8359e2fbf0f68cf96420128ba3e460fb29e78","schema_version":"1.0","event_id":"sha256:cec26cb61c83321d586d1b5a1eb8359e2fbf0f68cf96420128ba3e460fb29e78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LGZF5SKDA2R2B5QCEEQDNGZCBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Algorithms for a Generalized Parallel Machine Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gyorgy Dosa, Istvan Szalkai","submitted_at":"2015-02-08T21:11:36Z","abstract_excerpt":"We consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the first section. This problem is the generalization of the classical parallel machine scheduling problem, when the make-span is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02304","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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFLpkId5Z17kNlnrfakn8mtiDXRfc4ik81fsiozFccof+k4VfhOsEJLDQc7RhRgLwgBNYcfT576luieHt5tFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:47.741758Z"},"content_sha256":"8ac09a1198ecfb836e8e9cda7e93eb9d250808d791fb4a79054925743e94a451","schema_version":"1.0","event_id":"sha256:8ac09a1198ecfb836e8e9cda7e93eb9d250808d791fb4a79054925743e94a451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/bundle.json","state_url":"https://pith.science/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/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-03T02:43:47Z","links":{"resolver":"https://pith.science/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV","bundle":"https://pith.science/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/bundle.json","state":"https://pith.science/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGZF5SKDA2R2B5QCEEQDNGZCBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LGZF5SKDA2R2B5QCEEQDNGZCBV","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":"3e70f429faf32a47e0661ff71d119c30d94443f0d35f253ab5c22d00f4a982e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T21:11:36Z","title_canon_sha256":"7e0bf08c456056cc9b2bf89512ba63f7dc65ab9a82df8993148f6890d1c91e42"},"schema_version":"1.0","source":{"id":"1502.02304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02304","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02304v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02304","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"LGZF5SKDA2R2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGZF5SKDA2R2B5QC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGZF5SKD","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:8ac09a1198ecfb836e8e9cda7e93eb9d250808d791fb4a79054925743e94a451","target":"graph","created_at":"2026-05-18T02:27:42Z","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 different online algorithms for a generalized scheduling problem for parallel machines, described in details in the first section. This problem is the generalization of the classical parallel machine scheduling problem, when the make-span is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests.","authors_text":"Gyorgy Dosa, Istvan Szalkai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T21:11:36Z","title":"Online Algorithms for a Generalized Parallel Machine Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02304","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:cec26cb61c83321d586d1b5a1eb8359e2fbf0f68cf96420128ba3e460fb29e78","target":"record","created_at":"2026-05-18T02:27:42Z","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":"3e70f429faf32a47e0661ff71d119c30d94443f0d35f253ab5c22d00f4a982e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T21:11:36Z","title_canon_sha256":"7e0bf08c456056cc9b2bf89512ba63f7dc65ab9a82df8993148f6890d1c91e42"},"schema_version":"1.0","source":{"id":"1502.02304","kind":"arxiv","version":1}},"canonical_sha256":"59b25ec94306a3a0f6022120369b220d4bcb691f2b15850ae59820faf1d50e2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59b25ec94306a3a0f6022120369b220d4bcb691f2b15850ae59820faf1d50e2e","first_computed_at":"2026-05-18T02:27:42.935494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:42.935494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Clyj5k85bcHJFnyu8ScICpnzf3cFh2k8vqhDex3s/jVjSra2SIpC/mM/TChwQUiRAa/qzpty5Yo3+56RPyoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:42.936255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cec26cb61c83321d586d1b5a1eb8359e2fbf0f68cf96420128ba3e460fb29e78","sha256:8ac09a1198ecfb836e8e9cda7e93eb9d250808d791fb4a79054925743e94a451"],"state_sha256":"3b72bf2186b629d2fe1d2741109e2b2a23a47f37554633fe190c0277a9301b12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE25K9KUg4UWuT/rOPAmNfaVvR7mFbjxeZWxUBNfKv6r0SqtOSi5rXrssii5LeXtHV0MbuvxbhVHjyhxYz+nAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:43:47.743732Z","bundle_sha256":"d6c4e905ec064cc97606ac62e8cd62e98f460e4599ee84759522a6c0d9cec509"}}