{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EEGQ5JJWTIU7NW2X6GC3LPMDTR","short_pith_number":"pith:EEGQ5JJW","schema_version":"1.0","canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","source":{"kind":"arxiv","id":"1407.0442","version":1},"attestation_state":"computed","paper":{"title":"Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander A. Shvartsman, Alexander Russell, Kishori M. Konwar, Seda Davtyan","submitted_at":"2014-07-02T02:29:12Z","abstract_excerpt":"Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers. This paper presents a new algorithm for the problem of using network supercomputing to perform a large collection of independent tasks, while dealing with undependable processors. The adversary may cause the processors to return bogus results for tasks with certain probabilities, and may cause a subset $F$ of the initial set of processors $P$ to crash. The adversary is constrained in two ways. First, for the set of non-crashed pro"},"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":"1407.0442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-02T02:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"6bf02bddc7ebb7f77f973e8cad49d3c98b4d94763f85ba631c659885a277c6f6","abstract_canon_sha256":"533571ffe4c9f443e73a1157f316095fadd5b620efcebedf375d41b18163dc60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:33.767829Z","signature_b64":"z1VoVmveEYCsJe4SjbZxmmgHE3EVs/L4Z7pMbQelhTDgXtfzxXvzb2//VAN/QDpwv57eRwIlnKAA6NfLfmQTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","last_reissued_at":"2026-05-18T02:48:33.767130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:33.767130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander A. Shvartsman, Alexander Russell, Kishori M. Konwar, Seda Davtyan","submitted_at":"2014-07-02T02:29:12Z","abstract_excerpt":"Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers. This paper presents a new algorithm for the problem of using network supercomputing to perform a large collection of independent tasks, while dealing with undependable processors. The adversary may cause the processors to return bogus results for tasks with certain probabilities, and may cause a subset $F$ of the initial set of processors $P$ to crash. The adversary is constrained in two ways. First, for the set of non-crashed pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0442","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.0442","created_at":"2026-05-18T02:48:33.767234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0442v1","created_at":"2026-05-18T02:48:33.767234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0442","created_at":"2026-05-18T02:48:33.767234+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEGQ5JJWTIU7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEGQ5JJWTIU7NW2X","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEGQ5JJW","created_at":"2026-05-18T12:28:25.294606+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/EEGQ5JJWTIU7NW2X6GC3LPMDTR","json":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR.json","graph_json":"https://pith.science/api/pith-number/EEGQ5JJWTIU7NW2X6GC3LPMDTR/graph.json","events_json":"https://pith.science/api/pith-number/EEGQ5JJWTIU7NW2X6GC3LPMDTR/events.json","paper":"https://pith.science/paper/EEGQ5JJW"},"agent_actions":{"view_html":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR","download_json":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR.json","view_paper":"https://pith.science/paper/EEGQ5JJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0442&json=true","fetch_graph":"https://pith.science/api/pith-number/EEGQ5JJWTIU7NW2X6GC3LPMDTR/graph.json","fetch_events":"https://pith.science/api/pith-number/EEGQ5JJWTIU7NW2X6GC3LPMDTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/action/storage_attestation","attest_author":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/action/author_attestation","sign_citation":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/action/citation_signature","submit_replication":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/action/replication_record"}},"created_at":"2026-05-18T02:48:33.767234+00:00","updated_at":"2026-05-18T02:48:33.767234+00:00"}