{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DTSFQ34Y6VIDESBNVKAIHZW7W3","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":"308245b193556bc2fa0a6d3269b34cb921c5bc873b8d10cbcd8f1b5f6788c17d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T07:17:57Z","title_canon_sha256":"e63637593339f8031cec04df085f8a6da60a8a71561ed77bb07408c88212a9bc"},"schema_version":"1.0","source":{"id":"2605.17961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17961","created_at":"2026-05-20T00:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17961v1","created_at":"2026-05-20T00:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17961","created_at":"2026-05-20T00:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"DTSFQ34Y6VID","created_at":"2026-05-20T00:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"DTSFQ34Y6VIDESBN","created_at":"2026-05-20T00:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"DTSFQ34Y","created_at":"2026-05-20T00:05:08Z"}],"graph_snapshots":[{"event_id":"sha256:70476c751d554e4ca5a9cf1ee47b192134f78b089a9f14f82a0c860805484d36","target":"graph","created_at":"2026-05-20T00:05:08Z","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":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.586465Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17961/integrity.json","findings":[],"snapshot_sha256":"71ea03f7c12543a2990d3c58713555e31be61d8c2a775aaafa3f3b70dec4a7a0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Task Completion problem, in which $M$ abstract tasks must be completed by a network of $n$ crash-prone nodes, where up to $\\alpha n$ nodes may crash for some constant $\\alpha<1$. Our main result is a deterministic congested-clique algorithm that completes all $M$ tasks in $O(\\lceil M/n\\rceil \\log n)$ rounds. This round complexity is optimal up to $\\log\\log n$ terms.\n  The key technical ingredient underlying our algorithm is a novel combinatorial structure, which we call a \\emph{load balancing covering family}. In essence, this covering family induces, for each task, a subset of no","authors_text":"Orr Fischer, Ran Gelles","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T07:17:57Z","title":"The Task Completion Problem and its Application to Crash-Resilient Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17961","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:e0f46645f49792b70f37f040e7f8f0b04d5fc6e4beb980b1f28aa999ad320dc2","target":"record","created_at":"2026-05-20T00:05:08Z","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":"308245b193556bc2fa0a6d3269b34cb921c5bc873b8d10cbcd8f1b5f6788c17d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T07:17:57Z","title_canon_sha256":"e63637593339f8031cec04df085f8a6da60a8a71561ed77bb07408c88212a9bc"},"schema_version":"1.0","source":{"id":"2605.17961","kind":"arxiv","version":1}},"canonical_sha256":"1ce4586f98f55032482daa8083e6dfb6f66970fa44423cd707119142a4123f82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ce4586f98f55032482daa8083e6dfb6f66970fa44423cd707119142a4123f82","first_computed_at":"2026-05-20T00:05:08.279474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:08.279474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6YWYbXUHAE51qT5QuX79501zf6hSuFYPkLJn+qQEcp4ksyM0t316hcqaWdpKMrHsijEBT8cKeGpXXH0VSLxBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:08.280427Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0f46645f49792b70f37f040e7f8f0b04d5fc6e4beb980b1f28aa999ad320dc2","sha256:70476c751d554e4ca5a9cf1ee47b192134f78b089a9f14f82a0c860805484d36"],"state_sha256":"c2698cd629fb07a3ccd011eb0ef3923599a9182d29afd3f64eb33ceb84dc830e"}