{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HMTVED23YFDM5TF5U6EK46T4OI","short_pith_number":"pith:HMTVED23","canonical_record":{"source":{"id":"2408.00047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-31T15:04:33Z","cross_cats_sorted":[],"title_canon_sha256":"e195e2c4310ed5fdd970d26a2111265d63408c5514824b59d6f9fd311e8e6568","abstract_canon_sha256":"557c18294a9d9d797b87085026cbc6892655ef1b14db7c4adcc06c2c421106b0"},"schema_version":"1.0"},"canonical_sha256":"3b27520f5bc146ceccbda788ae7a7c7222570d50ea4fc15229db987db20740cd","source":{"kind":"arxiv","id":"2408.00047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00047","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00047v2","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00047","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_12","alias_value":"HMTVED23YFDM","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_16","alias_value":"HMTVED23YFDM5TF5","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_8","alias_value":"HMTVED23","created_at":"2026-07-05T09:18:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HMTVED23YFDM5TF5U6EK46T4OI","target":"record","payload":{"canonical_record":{"source":{"id":"2408.00047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-31T15:04:33Z","cross_cats_sorted":[],"title_canon_sha256":"e195e2c4310ed5fdd970d26a2111265d63408c5514824b59d6f9fd311e8e6568","abstract_canon_sha256":"557c18294a9d9d797b87085026cbc6892655ef1b14db7c4adcc06c2c421106b0"},"schema_version":"1.0"},"canonical_sha256":"3b27520f5bc146ceccbda788ae7a7c7222570d50ea4fc15229db987db20740cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:29.028351Z","signature_b64":"l28U3l2Dpga7mBLAdSucimMy/ShP6ibVcwX/UVq2ROns2Wh5pJ276L3DTAKhbn4j6DSvlJO3QzVCcNk1admgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b27520f5bc146ceccbda788ae7a7c7222570d50ea4fc15229db987db20740cd","last_reissued_at":"2026-07-05T09:18:29.027842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:29.027842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.00047","source_version":2,"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-07-05T09:18:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eqm9aYDsO3cvEb3bXAl/RvfYYEYCgarVaDWugC+oh+VwKUaDVd3fpyc8f8HLZByxkHMNzCEABrhu3bBybcW+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:30:34.734629Z"},"content_sha256":"d2d0e10d37611962b3a067fd7668eec582d1215f66cc025be66f4738a7ab9bbd","schema_version":"1.0","event_id":"sha256:d2d0e10d37611962b3a067fd7668eec582d1215f66cc025be66f4738a7ab9bbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HMTVED23YFDM5TF5U6EK46T4OI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ponder: Online Prediction of Task Memory Requirements for Scientific Workflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Lehmann, Florian Friederici, Jonathan Bader, Lauritz Thamsen, Ninon De Mecquenem, Ulf Leser, Vasilis Bountris, Xing Wang","submitted_at":"2024-07-31T15:04:33Z","abstract_excerpt":"Scientific workflows are used to analyze large amounts of data. These workflows comprise numerous tasks, many of which are executed repeatedly, running the same custom program on different inputs. Users specify resource allocations for each task, which must be sufficient for all inputs to prevent task failures. As a result, task memory allocations tend to be overly conservative, wasting precious cluster resources, limiting overall parallelism, and increasing workflow makespan.\n  In this paper, we first benchmark a state-of-the-art method on four real-life workflows from the nf-core workflow re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00047","kind":"arxiv","version":2},"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/2408.00047/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"},"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-07-05T09:18:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiIfWNXJuuvdZ9LiChqyF8O30MlaDydIT4hV7Djf4eLRJ3+5MhP+1PDgUf3Q02U88PpWger7ZwwMWc4ADSx8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:30:34.735302Z"},"content_sha256":"7977d13fea1e774d904d482e1d3b6fb7f3c24a981c1b26497e225afaa9c26ba7","schema_version":"1.0","event_id":"sha256:7977d13fea1e774d904d482e1d3b6fb7f3c24a981c1b26497e225afaa9c26ba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMTVED23YFDM5TF5U6EK46T4OI/bundle.json","state_url":"https://pith.science/pith/HMTVED23YFDM5TF5U6EK46T4OI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMTVED23YFDM5TF5U6EK46T4OI/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-08-20T09:30:34Z","links":{"resolver":"https://pith.science/pith/HMTVED23YFDM5TF5U6EK46T4OI","bundle":"https://pith.science/pith/HMTVED23YFDM5TF5U6EK46T4OI/bundle.json","state":"https://pith.science/pith/HMTVED23YFDM5TF5U6EK46T4OI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMTVED23YFDM5TF5U6EK46T4OI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HMTVED23YFDM5TF5U6EK46T4OI","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":"557c18294a9d9d797b87085026cbc6892655ef1b14db7c4adcc06c2c421106b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-31T15:04:33Z","title_canon_sha256":"e195e2c4310ed5fdd970d26a2111265d63408c5514824b59d6f9fd311e8e6568"},"schema_version":"1.0","source":{"id":"2408.00047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00047","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00047v2","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00047","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_12","alias_value":"HMTVED23YFDM","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_16","alias_value":"HMTVED23YFDM5TF5","created_at":"2026-07-05T09:18:29Z"},{"alias_kind":"pith_short_8","alias_value":"HMTVED23","created_at":"2026-07-05T09:18:29Z"}],"graph_snapshots":[{"event_id":"sha256:7977d13fea1e774d904d482e1d3b6fb7f3c24a981c1b26497e225afaa9c26ba7","target":"graph","created_at":"2026-07-05T09:18:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.00047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scientific workflows are used to analyze large amounts of data. These workflows comprise numerous tasks, many of which are executed repeatedly, running the same custom program on different inputs. Users specify resource allocations for each task, which must be sufficient for all inputs to prevent task failures. As a result, task memory allocations tend to be overly conservative, wasting precious cluster resources, limiting overall parallelism, and increasing workflow makespan.\n  In this paper, we first benchmark a state-of-the-art method on four real-life workflows from the nf-core workflow re","authors_text":"Fabian Lehmann, Florian Friederici, Jonathan Bader, Lauritz Thamsen, Ninon De Mecquenem, Ulf Leser, Vasilis Bountris, Xing Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-31T15:04:33Z","title":"Ponder: Online Prediction of Task Memory Requirements for Scientific Workflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00047","kind":"arxiv","version":2},"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:d2d0e10d37611962b3a067fd7668eec582d1215f66cc025be66f4738a7ab9bbd","target":"record","created_at":"2026-07-05T09:18:29Z","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":"557c18294a9d9d797b87085026cbc6892655ef1b14db7c4adcc06c2c421106b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-31T15:04:33Z","title_canon_sha256":"e195e2c4310ed5fdd970d26a2111265d63408c5514824b59d6f9fd311e8e6568"},"schema_version":"1.0","source":{"id":"2408.00047","kind":"arxiv","version":2}},"canonical_sha256":"3b27520f5bc146ceccbda788ae7a7c7222570d50ea4fc15229db987db20740cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b27520f5bc146ceccbda788ae7a7c7222570d50ea4fc15229db987db20740cd","first_computed_at":"2026-07-05T09:18:29.027842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:29.027842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l28U3l2Dpga7mBLAdSucimMy/ShP6ibVcwX/UVq2ROns2Wh5pJ276L3DTAKhbn4j6DSvlJO3QzVCcNk1admgAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:29.028351Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.00047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2d0e10d37611962b3a067fd7668eec582d1215f66cc025be66f4738a7ab9bbd","sha256:7977d13fea1e774d904d482e1d3b6fb7f3c24a981c1b26497e225afaa9c26ba7"],"state_sha256":"5efe504c4dce62c416a609e8fe73d9cdec4b6c0a343079fd96a91902dda4d38d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Xlda5RA5lshrSBvLLM4UesCZksdVOO2+dR0KTNzGAIs764Yzyvnnz7xum3DI2sx0dJbsYVaIMbv+Y4cr6WhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T09:30:34.741861Z","bundle_sha256":"2c6ee5f452d27b35fab73d5de502dab770b41e0a38b9aa3c4ed13bf52661e1e6"}}