{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TEDBY3KL66BYZHCSZK7RP55HMH","short_pith_number":"pith:TEDBY3KL","schema_version":"1.0","canonical_sha256":"99061c6d4bf7838c9c52cabf17f7a761cc7a17263f7e2c50b87854b60a130fee","source":{"kind":"arxiv","id":"2503.22365","version":1},"attestation_state":"computed","paper":{"title":"Memory-aware Adaptive Scheduling of Scientific Workflows on Heterogeneous Architectures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne Benoit, Henning Meyerhenke, Svetlana Kulagina","submitted_at":"2025-03-28T12:16:21Z","abstract_excerpt":"The analysis of massive scientific data often happens in the form of workflows with interdependent tasks. When such a scientific workflow needs to be scheduled on a parallel or distributed system, one usually represents the workflow as a directed acyclic graph (DAG). The vertices of the DAG represent the tasks, while its edges model the dependencies between the tasks (data to be communicated to successor tasks). When executed, each task requires a certain amount of memory and if it exceeds the available memory, the execution fails. The typical goal is to execute the workflow without failures ("},"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":"2503.22365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-03-28T12:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"aa39d19036f77899192cd5a404b377069336ce7f7502abf7f179719f9500ed34","abstract_canon_sha256":"9f840e3d1967ae7c9b8c61dc6b223b600db8f4e1aaf8b1a195a44480b5bc7e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:03.664777Z","signature_b64":"OeFFHWhKE7dILi7l24pnXBlGJDdvCrciTyMFis/BOLSB+q9I6kucBFncTDDYQv+Gf/yOU/1ZOUmeWXLHt+9VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99061c6d4bf7838c9c52cabf17f7a761cc7a17263f7e2c50b87854b60a130fee","last_reissued_at":"2026-07-05T10:41:03.664270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:03.664270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-aware Adaptive Scheduling of Scientific Workflows on Heterogeneous Architectures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne Benoit, Henning Meyerhenke, Svetlana Kulagina","submitted_at":"2025-03-28T12:16:21Z","abstract_excerpt":"The analysis of massive scientific data often happens in the form of workflows with interdependent tasks. When such a scientific workflow needs to be scheduled on a parallel or distributed system, one usually represents the workflow as a directed acyclic graph (DAG). The vertices of the DAG represent the tasks, while its edges model the dependencies between the tasks (data to be communicated to successor tasks). When executed, each task requires a certain amount of memory and if it exceeds the available memory, the execution fails. The typical goal is to execute the workflow without failures ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.22365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.22365","created_at":"2026-07-05T10:41:03.664353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.22365v1","created_at":"2026-07-05T10:41:03.664353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22365","created_at":"2026-07-05T10:41:03.664353+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEDBY3KL66BY","created_at":"2026-07-05T10:41:03.664353+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEDBY3KL66BYZHCS","created_at":"2026-07-05T10:41:03.664353+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEDBY3KL","created_at":"2026-07-05T10:41:03.664353+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.08725","citing_title":"Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH","json":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH.json","graph_json":"https://pith.science/api/pith-number/TEDBY3KL66BYZHCSZK7RP55HMH/graph.json","events_json":"https://pith.science/api/pith-number/TEDBY3KL66BYZHCSZK7RP55HMH/events.json","paper":"https://pith.science/paper/TEDBY3KL"},"agent_actions":{"view_html":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH","download_json":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH.json","view_paper":"https://pith.science/paper/TEDBY3KL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.22365&json=true","fetch_graph":"https://pith.science/api/pith-number/TEDBY3KL66BYZHCSZK7RP55HMH/graph.json","fetch_events":"https://pith.science/api/pith-number/TEDBY3KL66BYZHCSZK7RP55HMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH/action/storage_attestation","attest_author":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH/action/author_attestation","sign_citation":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH/action/citation_signature","submit_replication":"https://pith.science/pith/TEDBY3KL66BYZHCSZK7RP55HMH/action/replication_record"}},"created_at":"2026-07-05T10:41:03.664353+00:00","updated_at":"2026-07-05T10:41:03.664353+00:00"}