{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EA5DOZT5NVE4OJZMFQ6FDEDDEB","short_pith_number":"pith:EA5DOZT5","schema_version":"1.0","canonical_sha256":"203a37667d6d49c7272c2c3c51906320757ad3697c7d21612927fc0bc1a3d171","source":{"kind":"arxiv","id":"2605.29506","version":1},"attestation_state":"computed","paper":{"title":"Silent Data Corruption Protection through Efficient Task Replication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Claudia Fohry, Mia Reitz","submitted_at":"2026-05-28T07:29:28Z","abstract_excerpt":"The trend of increasing cluster sizes of supercomputers leads to a growing susceptibility to Silent Data Corruption (SDC) that can invalidate program results. A common strategy for SDC protection is replication, where the computation is repeated, and the correct result is determined as the one that is the same in at least two different computations. Applying replication to Asynchronous Many-Task (AMT) runtimes on clusters is challenging due to dynamic task spawning and work stealing, which complicate the identification of replicated tasks.\n  To address the challenge, this paper introduces a no"},"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":"2605.29506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T07:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"af3b26fc275edcd5fea9c74da789f9e75d6d2d74182234aecffa0a08aea59757","abstract_canon_sha256":"36444bbfa82b2501979394c8637208f3a0e7d8389e9d981f15854471618afdc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:43.486460Z","signature_b64":"kp7lAgQn2JS9jG2Wqq//P9X668RAXSeuQ/SSkb2uWNAEydUQ2ukixClfCARzh4VFgRoqnjrtHyjqoSRcsc06AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"203a37667d6d49c7272c2c3c51906320757ad3697c7d21612927fc0bc1a3d171","last_reissued_at":"2026-05-29T01:05:43.485558Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:43.485558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Silent Data Corruption Protection through Efficient Task Replication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Claudia Fohry, Mia Reitz","submitted_at":"2026-05-28T07:29:28Z","abstract_excerpt":"The trend of increasing cluster sizes of supercomputers leads to a growing susceptibility to Silent Data Corruption (SDC) that can invalidate program results. A common strategy for SDC protection is replication, where the computation is repeated, and the correct result is determined as the one that is the same in at least two different computations. Applying replication to Asynchronous Many-Task (AMT) runtimes on clusters is challenging due to dynamic task spawning and work stealing, which complicate the identification of replicated tasks.\n  To address the challenge, this paper introduces a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29506","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/2605.29506/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":"2605.29506","created_at":"2026-05-29T01:05:43.485720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29506v1","created_at":"2026-05-29T01:05:43.485720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29506","created_at":"2026-05-29T01:05:43.485720+00:00"},{"alias_kind":"pith_short_12","alias_value":"EA5DOZT5NVE4","created_at":"2026-05-29T01:05:43.485720+00:00"},{"alias_kind":"pith_short_16","alias_value":"EA5DOZT5NVE4OJZM","created_at":"2026-05-29T01:05:43.485720+00:00"},{"alias_kind":"pith_short_8","alias_value":"EA5DOZT5","created_at":"2026-05-29T01:05:43.485720+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/EA5DOZT5NVE4OJZMFQ6FDEDDEB","json":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB.json","graph_json":"https://pith.science/api/pith-number/EA5DOZT5NVE4OJZMFQ6FDEDDEB/graph.json","events_json":"https://pith.science/api/pith-number/EA5DOZT5NVE4OJZMFQ6FDEDDEB/events.json","paper":"https://pith.science/paper/EA5DOZT5"},"agent_actions":{"view_html":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB","download_json":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB.json","view_paper":"https://pith.science/paper/EA5DOZT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29506&json=true","fetch_graph":"https://pith.science/api/pith-number/EA5DOZT5NVE4OJZMFQ6FDEDDEB/graph.json","fetch_events":"https://pith.science/api/pith-number/EA5DOZT5NVE4OJZMFQ6FDEDDEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB/action/storage_attestation","attest_author":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB/action/author_attestation","sign_citation":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB/action/citation_signature","submit_replication":"https://pith.science/pith/EA5DOZT5NVE4OJZMFQ6FDEDDEB/action/replication_record"}},"created_at":"2026-05-29T01:05:43.485720+00:00","updated_at":"2026-05-29T01:05:43.485720+00:00"}