{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X3SONJ6FVA4LHN4Z42XECG5G3C","short_pith_number":"pith:X3SONJ6F","schema_version":"1.0","canonical_sha256":"bee4e6a7c5a838b3b799e6ae411ba6d8ab5eea19aa7592b7688f701e4a91ba1d","source":{"kind":"arxiv","id":"1407.0696","version":1},"attestation_state":"computed","paper":{"title":"Technical Report: Estimating Reliability of Workers for Cooperative Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander A. Shvartsman, Kishori M. Konwar, Seda Davtyan","submitted_at":"2014-07-02T02:41:00Z","abstract_excerpt":"Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers. For the problem of using network supercomputing to perform a large collection of independent tasks, prior work introduced a decentralized approach and provided randomized synchronous algorithms that perform all tasks correctly with high probability, while dealing with misbehaving or crash-prone processors. The main weaknesses of existing algorithms is that they assume either that the \\emph{average} probability of a 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.0696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-02T02:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"02631f2fc3141bda54556a20c3fcf8596a9fca67ee6181fdec6c50e69f6bec36","abstract_canon_sha256":"c6de50edd77c7fe830a83b531982fa9560f8b2882fa6d96b8cb0c493bd53fec6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:25.615866Z","signature_b64":"uoDvRD3qm2E/O0qg4Zqw2BGnnf8i2Q/AI5+5tI46Rd9FA2oZkbU9xdW3sLz9WLvgL9NukAZzD+cw4jkvoPYCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bee4e6a7c5a838b3b799e6ae411ba6d8ab5eea19aa7592b7688f701e4a91ba1d","last_reissued_at":"2026-05-18T02:48:25.615325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:25.615325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Report: Estimating Reliability of Workers for Cooperative Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander A. Shvartsman, Kishori M. Konwar, Seda Davtyan","submitted_at":"2014-07-02T02:41:00Z","abstract_excerpt":"Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers. For the problem of using network supercomputing to perform a large collection of independent tasks, prior work introduced a decentralized approach and provided randomized synchronous algorithms that perform all tasks correctly with high probability, while dealing with misbehaving or crash-prone processors. The main weaknesses of existing algorithms is that they assume either that the \\emph{average} probability of a non-crashed pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0696","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.0696","created_at":"2026-05-18T02:48:25.615412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0696v1","created_at":"2026-05-18T02:48:25.615412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0696","created_at":"2026-05-18T02:48:25.615412+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3SONJ6FVA4L","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3SONJ6FVA4LHN4Z","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3SONJ6F","created_at":"2026-05-18T12:28:54.890064+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/X3SONJ6FVA4LHN4Z42XECG5G3C","json":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C.json","graph_json":"https://pith.science/api/pith-number/X3SONJ6FVA4LHN4Z42XECG5G3C/graph.json","events_json":"https://pith.science/api/pith-number/X3SONJ6FVA4LHN4Z42XECG5G3C/events.json","paper":"https://pith.science/paper/X3SONJ6F"},"agent_actions":{"view_html":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C","download_json":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C.json","view_paper":"https://pith.science/paper/X3SONJ6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0696&json=true","fetch_graph":"https://pith.science/api/pith-number/X3SONJ6FVA4LHN4Z42XECG5G3C/graph.json","fetch_events":"https://pith.science/api/pith-number/X3SONJ6FVA4LHN4Z42XECG5G3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C/action/storage_attestation","attest_author":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C/action/author_attestation","sign_citation":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C/action/citation_signature","submit_replication":"https://pith.science/pith/X3SONJ6FVA4LHN4Z42XECG5G3C/action/replication_record"}},"created_at":"2026-05-18T02:48:25.615412+00:00","updated_at":"2026-05-18T02:48:25.615412+00:00"}