{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EEGQ5JJWTIU7NW2X6GC3LPMDTR","short_pith_number":"pith:EEGQ5JJW","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"},"canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","source":{"kind":"arxiv","id":"1407.0442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0442","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0442v1","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0442","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"EEGQ5JJWTIU7","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EEGQ5JJWTIU7NW2X","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EEGQ5JJW","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EEGQ5JJWTIU7NW2X6GC3LPMDTR","target":"record","payload":{"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"},"canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","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"},"source_kind":"arxiv","source_id":"1407.0442","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-18T02:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUmBMQTJqiNuQsxMBr8lb3V8HKUyXK0XqkKSJ01SfOijVij4E/cL/emCnZwMUGhWjMbqco60oBmwjTZ5Pyh3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:36:35.553719Z"},"content_sha256":"2617202918d918315f9b4cf68a3edc49ed6305974663e813077a058cb7e454ba","schema_version":"1.0","event_id":"sha256:2617202918d918315f9b4cf68a3edc49ed6305974663e813077a058cb7e454ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EEGQ5JJWTIU7NW2X6GC3LPMDTR","target":"graph","payload":{"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"},"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-18T02:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjvC431+5C0h2Qq50MsEqez1CIvHu62eY/umFYK1iPSGk6+/PcXPWmWzGefNzuHdMQZhkcFKx2SvyJpKcHZrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:36:35.554358Z"},"content_sha256":"e021c15ba19822fe43e4dd387cd467bedc2489d6710358e77830b2cdbe0d2596","schema_version":"1.0","event_id":"sha256:e021c15ba19822fe43e4dd387cd467bedc2489d6710358e77830b2cdbe0d2596"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/bundle.json","state_url":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/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-05T20:36:35Z","links":{"resolver":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR","bundle":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/bundle.json","state":"https://pith.science/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEGQ5JJWTIU7NW2X6GC3LPMDTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EEGQ5JJWTIU7NW2X6GC3LPMDTR","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":"533571ffe4c9f443e73a1157f316095fadd5b620efcebedf375d41b18163dc60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-02T02:29:12Z","title_canon_sha256":"6bf02bddc7ebb7f77f973e8cad49d3c98b4d94763f85ba631c659885a277c6f6"},"schema_version":"1.0","source":{"id":"1407.0442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0442","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0442v1","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0442","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"EEGQ5JJWTIU7","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EEGQ5JJWTIU7NW2X","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EEGQ5JJW","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:e021c15ba19822fe43e4dd387cd467bedc2489d6710358e77830b2cdbe0d2596","target":"graph","created_at":"2026-05-18T02:48:33Z","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":"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","authors_text":"Alexander A. Shvartsman, Alexander Russell, Kishori M. Konwar, Seda Davtyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-02T02:29:12Z","title":"Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0442","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:2617202918d918315f9b4cf68a3edc49ed6305974663e813077a058cb7e454ba","target":"record","created_at":"2026-05-18T02:48:33Z","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":"533571ffe4c9f443e73a1157f316095fadd5b620efcebedf375d41b18163dc60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-02T02:29:12Z","title_canon_sha256":"6bf02bddc7ebb7f77f973e8cad49d3c98b4d94763f85ba631c659885a277c6f6"},"schema_version":"1.0","source":{"id":"1407.0442","kind":"arxiv","version":1}},"canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"210d0ea5369a29f6db57f185b5bd839c5fca7fbe27ee94f6e46bcb31534a3952","first_computed_at":"2026-05-18T02:48:33.767130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:33.767130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1VoVmveEYCsJe4SjbZxmmgHE3EVs/L4Z7pMbQelhTDgXtfzxXvzb2//VAN/QDpwv57eRwIlnKAA6NfLfmQTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:33.767829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2617202918d918315f9b4cf68a3edc49ed6305974663e813077a058cb7e454ba","sha256:e021c15ba19822fe43e4dd387cd467bedc2489d6710358e77830b2cdbe0d2596"],"state_sha256":"8f2c83cdb491c1efcbe91b037357021cba9601286ba5c2076801be9acfaaed5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qECDPHJ3rOrnQNmQWDZt4A8v//ahGcmytIzXR9oGjY1EvRAxzDyNnbiCYGq75rl/r711bx7Fq4IbBRMg463MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:36:35.558300Z","bundle_sha256":"5cf06557e828e8b39a7ee09564cd61dbe607c2a925697eeb6bd52f510868cf76"}}