{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SCDB3OLG4W6Y73NN45IYNVW6B2","short_pith_number":"pith:SCDB3OLG","schema_version":"1.0","canonical_sha256":"90861db966e5bd8fedade75186d6de0ebb2691737009c02cf2d577c843ade1f8","source":{"kind":"arxiv","id":"1805.10499","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10499","created_at":"2026-05-18T00:14:52.351397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10499v1","created_at":"2026-05-18T00:14:52.351397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10499","created_at":"2026-05-18T00:14:52.351397+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCDB3OLG4W6Y","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCDB3OLG4W6Y73NN","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCDB3OLG","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2","json":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2.json","graph_json":"https://pith.science/api/pith-number/SCDB3OLG4W6Y73NN45IYNVW6B2/graph.json","events_json":"https://pith.science/api/pith-number/SCDB3OLG4W6Y73NN45IYNVW6B2/events.json","paper":"https://pith.science/paper/SCDB3OLG"},"agent_actions":{"view_html":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2","download_json":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2.json","view_paper":"https://pith.science/paper/SCDB3OLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10499&json=true","fetch_graph":"https://pith.science/api/pith-number/SCDB3OLG4W6Y73NN45IYNVW6B2/graph.json","fetch_events":"https://pith.science/api/pith-number/SCDB3OLG4W6Y73NN45IYNVW6B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/action/storage_attestation","attest_author":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/action/author_attestation","sign_citation":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/action/citation_signature","submit_replication":"https://pith.science/pith/SCDB3OLG4W6Y73NN45IYNVW6B2/action/replication_record"}},"created_at":"2026-05-18T00:14:52.351397+00:00","updated_at":"2026-05-18T00:14:52.351397+00:00"}