{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2EYUZISSSUIIBFHK22YTZPKFVS","short_pith_number":"pith:2EYUZISS","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"},"canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","source":{"kind":"arxiv","id":"1507.08492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08492","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08492v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08492","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"2EYUZISSSUII","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EYUZISSSUIIBFHK","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EYUZISS","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2EYUZISSSUIIBFHK22YTZPKFVS","target":"record","payload":{"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"},"canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","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"},"source_kind":"arxiv","source_id":"1507.08492","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-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7msaTx+iCGHg9kExPRDAY1YAlQGa23WEfAKTPul56cdj7JdZoLvt1y2eXjTp3wLmbSWq9aTosZmPBnyQdVLWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:53:08.407279Z"},"content_sha256":"991cb788c250190f026caa54c54020c38c51006215be6a0a1234386241786bb0","schema_version":"1.0","event_id":"sha256:991cb788c250190f026caa54c54020c38c51006215be6a0a1234386241786bb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2EYUZISSSUIIBFHK22YTZPKFVS","target":"graph","payload":{"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"},"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-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHUFppMAO0Yniu7CjbNsa60OR82MLya2YCVHNYsTf8OEkqcyyo113BPy8qIgxJefQjmjUAaUWwcma0S/TYqVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:53:08.407644Z"},"content_sha256":"9b7898044752c64557be8095c0cfff3f6d49a1f699284b8af4871ad0cad8420b","schema_version":"1.0","event_id":"sha256:9b7898044752c64557be8095c0cfff3f6d49a1f699284b8af4871ad0cad8420b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/bundle.json","state_url":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EYUZISSSUIIBFHK22YTZPKFVS/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-25T18:53:08Z","links":{"resolver":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS","bundle":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/bundle.json","state":"https://pith.science/pith/2EYUZISSSUIIBFHK22YTZPKFVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EYUZISSSUIIBFHK22YTZPKFVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2EYUZISSSUIIBFHK22YTZPKFVS","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":"db140bf3abf429fd1a82eeb957e633fe2c8f10d9b8adfa919df5b7db19e75be4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-30T13:25:40Z","title_canon_sha256":"8c5df092e2417209fb8cbfb5e978e72b38e2ff67c4ef35de4b0b7f644a080c6d"},"schema_version":"1.0","source":{"id":"1507.08492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08492","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08492v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08492","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"2EYUZISSSUII","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EYUZISSSUIIBFHK","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EYUZISS","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9b7898044752c64557be8095c0cfff3f6d49a1f699284b8af4871ad0cad8420b","target":"graph","created_at":"2026-05-18T01:36:06Z","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":"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","authors_text":"Anastasios Gounaris, Georgia Kougka","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-30T13:25:40Z","title":"Cost optimization of data flows based on task re-ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08492","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:991cb788c250190f026caa54c54020c38c51006215be6a0a1234386241786bb0","target":"record","created_at":"2026-05-18T01:36:06Z","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":"db140bf3abf429fd1a82eeb957e633fe2c8f10d9b8adfa919df5b7db19e75be4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-30T13:25:40Z","title_canon_sha256":"8c5df092e2417209fb8cbfb5e978e72b38e2ff67c4ef35de4b0b7f644a080c6d"},"schema_version":"1.0","source":{"id":"1507.08492","kind":"arxiv","version":1}},"canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1314ca25295108094ead6b13cbd45ac8b5268cf6c8a6b7fc0e23c7eff0e9f0d","first_computed_at":"2026-05-18T01:36:06.288728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:06.288728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"In51zoWLdGJXztMUtYUxfsPFjNRZ4hrnl//qDQgAR9QCP2KtDj5DxOH2voA4YC5SZFPYnOTUc5NpXmJeN2RDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:06.289251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:991cb788c250190f026caa54c54020c38c51006215be6a0a1234386241786bb0","sha256:9b7898044752c64557be8095c0cfff3f6d49a1f699284b8af4871ad0cad8420b"],"state_sha256":"e917756f836c8dd7daaa0a354ade305e44920030d752225e72694fafaf7b0d5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgHXqQY33paiBVFeA1U3N/u9qpqdKNauVKO/3ABEIbs0kgOxrGorjQVMngzgIgcw9583ol+8qUhHqReo7aYXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:53:08.410267Z","bundle_sha256":"4e267170c4f786c1fb609a2ed27020e8704d4fbabed85a36a5a4c2665e1762c2"}}