{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2EYUZISSSUIIBFHK22YTZPKFVS","short_pith_number":"pith:2EYUZISS","schema_version":"1.0","canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","source":{"kind":"arxiv","id":"1507.08492","version":1},"attestation_state":"computed","paper":{"title":"Cost optimization of data flows based on task re-ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Anastasios Gounaris, Georgia Kougka","submitted_at":"2015-07-30T13:25:40Z","abstract_excerpt":"Analyzing big data in a highly dynamic environment becomes more and more critical because of the increasingly need for end-to-end processing of this data. Modern data flows are quite complex and there are not efficient, cost-based, fully-automated, scalable optimization solutions that can facilitate flow designers. The state-of-the-art proposals fail to provide near optimal solutions even for simple data flows. To tackle this problem, we introduce a set of approximate algorithms for defining the execution order of the constituent tasks, in order to minimize the total execution cost of a data f"},"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":"1507.08492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-30T13:25:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8c5df092e2417209fb8cbfb5e978e72b38e2ff67c4ef35de4b0b7f644a080c6d","abstract_canon_sha256":"db140bf3abf429fd1a82eeb957e633fe2c8f10d9b8adfa919df5b7db19e75be4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:06.289251Z","signature_b64":"In51zoWLdGJXztMUtYUxfsPFjNRZ4hrnl//qDQgAR9QCP2KtDj5DxOH2voA4YC5SZFPYnOTUc5NpXmJeN2RDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","last_reissued_at":"2026-05-18T01:36:06.288728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:06.288728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost optimization of data flows based on task re-ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Anastasios Gounaris, Georgia Kougka","submitted_at":"2015-07-30T13:25:40Z","abstract_excerpt":"Analyzing big data in a highly dynamic environment becomes more and more critical because of the increasingly need for end-to-end processing of this data. Modern data flows are quite complex and there are not efficient, cost-based, fully-automated, scalable optimization solutions that can facilitate flow designers. The state-of-the-art proposals fail to provide near optimal solutions even for simple data flows. To tackle this problem, we introduce a set of approximate algorithms for defining the execution order of the constituent tasks, in order to minimize the total execution cost of a data f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08492","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":"1507.08492","created_at":"2026-05-18T01:36:06.288804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08492v1","created_at":"2026-05-18T01:36:06.288804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08492","created_at":"2026-05-18T01:36:06.288804+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EYUZISSSUII","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EYUZISSSUIIBFHK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EYUZISS","created_at":"2026-05-18T12:28:59.999130+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/2EYUZISSSUIIBFHK22YTZPKFVS","json":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS.json","graph_json":"https://pith.science/api/pith-number/2EYUZISSSUIIBFHK22YTZPKFVS/graph.json","events_json":"https://pith.science/api/pith-number/2EYUZISSSUIIBFHK22YTZPKFVS/events.json","paper":"https://pith.science/paper/2EYUZISS"},"agent_actions":{"view_html":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS","download_json":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS.json","view_paper":"https://pith.science/paper/2EYUZISS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08492&json=true","fetch_graph":"https://pith.science/api/pith-number/2EYUZISSSUIIBFHK22YTZPKFVS/graph.json","fetch_events":"https://pith.science/api/pith-number/2EYUZISSSUIIBFHK22YTZPKFVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/action/storage_attestation","attest_author":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/action/author_attestation","sign_citation":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/action/citation_signature","submit_replication":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/action/replication_record"}},"created_at":"2026-05-18T01:36:06.288804+00:00","updated_at":"2026-05-18T01:36:06.288804+00:00"}