{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IAS76ISSCMMKLYK7FZUSR63UV7","short_pith_number":"pith:IAS76ISS","canonical_record":{"source":{"id":"1812.09537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-22T14:53:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"98f28a6f2f0460076bc145dbcf748978e8b280fdde2c2018ea09f46e452e37f5","abstract_canon_sha256":"25f8e03d49341287e1d684c64271afc6987b2ca63f50b91cc2134109f69c512f"},"schema_version":"1.0"},"canonical_sha256":"4025ff22521318a5e15f2e6928fb74aff57fe03bf1c2738805f5d21570ce161e","source":{"kind":"arxiv","id":"1812.09537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09537","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09537v1","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09537","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"IAS76ISSCMMK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IAS76ISSCMMKLYK7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IAS76ISS","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IAS76ISSCMMKLYK7FZUSR63UV7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-22T14:53:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"98f28a6f2f0460076bc145dbcf748978e8b280fdde2c2018ea09f46e452e37f5","abstract_canon_sha256":"25f8e03d49341287e1d684c64271afc6987b2ca63f50b91cc2134109f69c512f"},"schema_version":"1.0"},"canonical_sha256":"4025ff22521318a5e15f2e6928fb74aff57fe03bf1c2738805f5d21570ce161e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:27.618849Z","signature_b64":"PJT3UKyX+9WROhglYpHu2xeUWiNmHaE1pYmamL3s/l5dHsj9Pop6+J2PXhhbzoJl2/FGRtj+dD8pPGobhiyTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4025ff22521318a5e15f2e6928fb74aff57fe03bf1c2738805f5d21570ce161e","last_reissued_at":"2026-05-17T23:57:27.618132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:27.618132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09537","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-17T23:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50+gCewGqUQyCCBsR9jzzD2cjHy0tv42rPtBoJ/jprel83nLHrgfYNPI2eOQ4Fke7HbEl4jhcZZl3nogbFuNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:02.006630Z"},"content_sha256":"28beafdf3ff7bc844def9cb1ff74b4ffa47e74d0a460b086fe60b0f4f42c76d8","schema_version":"1.0","event_id":"sha256:28beafdf3ff7bc844def9cb1ff74b4ffa47e74d0a460b086fe60b0f4f42c76d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IAS76ISSCMMKLYK7FZUSR63UV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bioinformatics Computational Cluster Batch Task Profiling with Machine Learning for Failure Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"Christine R. Kirkpatrick, Christopher Harrison, In\\^es Dutra","submitted_at":"2018-12-22T14:53:15Z","abstract_excerpt":"Motivation: Traditional computational cluster schedulers are based on user inputs and run time needs request for memory and CPU, not IO. Heavily IO bound task run times, like ones seen in many big data and bioinformatics problems, are dependent on the IO subsystems scheduling and are problematic for cluster resource scheduling. The problematic rescheduling of IO intensive and errant tasks is a lost resource. Understanding the conditions in both successful and failed tasks and differentiating them could provide knowledge to enhancing cluster scheduling and intelligent resource optimization.\n  R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09537","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-17T23:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCb2FHfZoKOx3YY9Wkg9a3cgkEwHnq5P/Y6iZUkVzbHxS7QQRheS8t56cYIQMjh+Aopr+FpjO7vBTBnGSgu/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:02.006972Z"},"content_sha256":"46e6ca2eaf6b92b2c3eeb8ec0e282b06278e88112d96d3dd4e0d5910c82a6f53","schema_version":"1.0","event_id":"sha256:46e6ca2eaf6b92b2c3eeb8ec0e282b06278e88112d96d3dd4e0d5910c82a6f53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAS76ISSCMMKLYK7FZUSR63UV7/bundle.json","state_url":"https://pith.science/pith/IAS76ISSCMMKLYK7FZUSR63UV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAS76ISSCMMKLYK7FZUSR63UV7/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-01T20:46:02Z","links":{"resolver":"https://pith.science/pith/IAS76ISSCMMKLYK7FZUSR63UV7","bundle":"https://pith.science/pith/IAS76ISSCMMKLYK7FZUSR63UV7/bundle.json","state":"https://pith.science/pith/IAS76ISSCMMKLYK7FZUSR63UV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAS76ISSCMMKLYK7FZUSR63UV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IAS76ISSCMMKLYK7FZUSR63UV7","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":"25f8e03d49341287e1d684c64271afc6987b2ca63f50b91cc2134109f69c512f","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-22T14:53:15Z","title_canon_sha256":"98f28a6f2f0460076bc145dbcf748978e8b280fdde2c2018ea09f46e452e37f5"},"schema_version":"1.0","source":{"id":"1812.09537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09537","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09537v1","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09537","created_at":"2026-05-17T23:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"IAS76ISSCMMK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IAS76ISSCMMKLYK7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IAS76ISS","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:46e6ca2eaf6b92b2c3eeb8ec0e282b06278e88112d96d3dd4e0d5910c82a6f53","target":"graph","created_at":"2026-05-17T23:57:27Z","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":"Motivation: Traditional computational cluster schedulers are based on user inputs and run time needs request for memory and CPU, not IO. Heavily IO bound task run times, like ones seen in many big data and bioinformatics problems, are dependent on the IO subsystems scheduling and are problematic for cluster resource scheduling. The problematic rescheduling of IO intensive and errant tasks is a lost resource. Understanding the conditions in both successful and failed tasks and differentiating them could provide knowledge to enhancing cluster scheduling and intelligent resource optimization.\n  R","authors_text":"Christine R. Kirkpatrick, Christopher Harrison, In\\^es Dutra","cross_cats":["cs.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-22T14:53:15Z","title":"Bioinformatics Computational Cluster Batch Task Profiling with Machine Learning for Failure Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09537","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:28beafdf3ff7bc844def9cb1ff74b4ffa47e74d0a460b086fe60b0f4f42c76d8","target":"record","created_at":"2026-05-17T23:57:27Z","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":"25f8e03d49341287e1d684c64271afc6987b2ca63f50b91cc2134109f69c512f","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-22T14:53:15Z","title_canon_sha256":"98f28a6f2f0460076bc145dbcf748978e8b280fdde2c2018ea09f46e452e37f5"},"schema_version":"1.0","source":{"id":"1812.09537","kind":"arxiv","version":1}},"canonical_sha256":"4025ff22521318a5e15f2e6928fb74aff57fe03bf1c2738805f5d21570ce161e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4025ff22521318a5e15f2e6928fb74aff57fe03bf1c2738805f5d21570ce161e","first_computed_at":"2026-05-17T23:57:27.618132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:27.618132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJT3UKyX+9WROhglYpHu2xeUWiNmHaE1pYmamL3s/l5dHsj9Pop6+J2PXhhbzoJl2/FGRtj+dD8pPGobhiyTBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:27.618849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28beafdf3ff7bc844def9cb1ff74b4ffa47e74d0a460b086fe60b0f4f42c76d8","sha256:46e6ca2eaf6b92b2c3eeb8ec0e282b06278e88112d96d3dd4e0d5910c82a6f53"],"state_sha256":"85c2168137ef77ef76be5ad54805036ab8ad8a6c71ce01fca58b354e012fefbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3zq3GvXF0udXHy4Y09SEj+MG7oV4k93MnxRz0CDRGERHbxW3G6kxrJqqXhV1R0CbfFBpTmfuMRPhjyR9mMjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:46:02.008814Z","bundle_sha256":"08425352d6c3541985d763a8d20cd38e63e35cd3f18e045aee4b8d367a94524d"}}