{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SCDB3OLG4W6Y73NN45IYNVW6B2","short_pith_number":"pith:SCDB3OLG","canonical_record":{"source":{"id":"1805.10499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-26T15:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"6d83b857c4f8eeb50c9bb2790cfffcddf107077d8ecaca9251537daef7d572f6","abstract_canon_sha256":"1417af67ddee6f11c6cb97171e4586a2f8628014ada16f23a8fc491eeabdc06d"},"schema_version":"1.0"},"canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","source":{"kind":"arxiv","id":"1805.10499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10499","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10499v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10499","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"SCDB3OLG4W6Y","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SCDB3OLG4W6Y73NN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SCDB3OLG","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SCDB3OLG4W6Y73NN45IYNVW6B2","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-26T15:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"6d83b857c4f8eeb50c9bb2790cfffcddf107077d8ecaca9251537daef7d572f6","abstract_canon_sha256":"1417af67ddee6f11c6cb97171e4586a2f8628014ada16f23a8fc491eeabdc06d"},"schema_version":"1.0"},"canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.352005Z","signature_b64":"1rSQQxG6YWl0qd3fUzFETxQ4+WVLuYM50nRZ5l+u81QdmFHVBd5oNc76j8UKjjcN3tkjIQQvjUa85LBPeWVNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","last_reissued_at":"2026-05-18T00:14:52.351285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.351285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10499","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2V7A2lzuZHMCDyZgu5zaF80M7baULPpXWSNye1GUe0TR0x2NiW9WF4vlfz5Q8VCa3ZidErAAe/oIKI9oZnQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:53:19.004723Z"},"content_sha256":"8d6f745024e78e14dab5324a97d9157edb96de60ec61106277d58f14ecd0f802","schema_version":"1.0","event_id":"sha256:8d6f745024e78e14dab5324a97d9157edb96de60ec61106277d58f14ecd0f802"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SCDB3OLG4W6Y73NN45IYNVW6B2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Aware Approximate Workflow Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dengpan Yin, Tevfik Kosar","submitted_at":"2018-05-26T15:41:55Z","abstract_excerpt":"Optimization of data placement in complex scientific workflows has become very crucial since the large amounts of data generated by these workflows significantly increases the turnaround time of the end-to-end application. It is almost impossible to make an optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the complexity of the workflow-scheduling problem, most of the existing work constrains the problem space by some unrealistic assumptions, which result in non-optimal scheduling in practice. In this study, we propose a genet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10499","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DZp0tZQVOBmdeAx9JtajzojYTOTu3OFqe6ErKybg0HdgdZVj6MlG8h/D01bMb7ZSt14aG44HBwnJtZeFrtjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:53:19.005097Z"},"content_sha256":"244afb7987ad28a5f0a6710e0165849fd02f682b5696c97bddcfb12e96e5bf3e","schema_version":"1.0","event_id":"sha256:244afb7987ad28a5f0a6710e0165849fd02f682b5696c97bddcfb12e96e5bf3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/bundle.json","state_url":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/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-28T00:53:19Z","links":{"resolver":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2","bundle":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/bundle.json","state":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SCDB3OLG4W6Y73NN45IYNVW6B2","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":"1417af67ddee6f11c6cb97171e4586a2f8628014ada16f23a8fc491eeabdc06d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-26T15:41:55Z","title_canon_sha256":"6d83b857c4f8eeb50c9bb2790cfffcddf107077d8ecaca9251537daef7d572f6"},"schema_version":"1.0","source":{"id":"1805.10499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10499","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10499v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10499","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"SCDB3OLG4W6Y","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SCDB3OLG4W6Y73NN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SCDB3OLG","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:244afb7987ad28a5f0a6710e0165849fd02f682b5696c97bddcfb12e96e5bf3e","target":"graph","created_at":"2026-05-18T00:14:52Z","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":"Optimization of data placement in complex scientific workflows has become very crucial since the large amounts of data generated by these workflows significantly increases the turnaround time of the end-to-end application. It is almost impossible to make an optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the complexity of the workflow-scheduling problem, most of the existing work constrains the problem space by some unrealistic assumptions, which result in non-optimal scheduling in practice. In this study, we propose a genet","authors_text":"Dengpan Yin, Tevfik Kosar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-26T15:41:55Z","title":"Data-Aware Approximate Workflow Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10499","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:8d6f745024e78e14dab5324a97d9157edb96de60ec61106277d58f14ecd0f802","target":"record","created_at":"2026-05-18T00:14:52Z","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":"1417af67ddee6f11c6cb97171e4586a2f8628014ada16f23a8fc491eeabdc06d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-26T15:41:55Z","title_canon_sha256":"6d83b857c4f8eeb50c9bb2790cfffcddf107077d8ecaca9251537daef7d572f6"},"schema_version":"1.0","source":{"id":"1805.10499","kind":"arxiv","version":1}},"canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","first_computed_at":"2026-05-18T00:14:52.351285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:52.351285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1rSQQxG6YWl0qd3fUzFETxQ4+WVLuYM50nRZ5l+u81QdmFHVBd5oNc76j8UKjjcN3tkjIQQvjUa85LBPeWVNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:52.352005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d6f745024e78e14dab5324a97d9157edb96de60ec61106277d58f14ecd0f802","sha256:244afb7987ad28a5f0a6710e0165849fd02f682b5696c97bddcfb12e96e5bf3e"],"state_sha256":"8366eb78290efe3797ad4ebf492256d3aafd4229e5b91e54fe8c6700c0ebb957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqQyk/HiYZcvyOP+Kca8YOEX4CNuyPxMo79yUu1IxCk5iWirEKBsuiG8DmNZ2TGeELRg6ieZ3hUasA4qnoqDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:53:19.007105Z","bundle_sha256":"74d9b2457f967ad1fcc355e431d8f0e741db27783e3641aa234e7e5a849b37da"}}