{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CFVRYYJBUW4EIY227FQ5BMOL4H","short_pith_number":"pith:CFVRYYJB","schema_version":"1.0","canonical_sha256":"116b1c6121a5b844635af961d0b1cbe1d571c28823384037ef523dc4b9ebf6de","source":{"kind":"arxiv","id":"2205.11148","version":1},"attestation_state":"computed","paper":{"title":"Distributed Computations in Fully-Defective Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Sela, Keren Censor-Hillel, Ran Gelles, Shir Cohen","submitted_at":"2022-05-23T09:18:35Z","abstract_excerpt":"We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible.\n  The key structural property of 2-edge-co"},"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":"2205.11148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-05-23T09:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"66acdce2dc19ca9177d5ffbbb49ca583928cf55836a60ab8fec647d7db16009a","abstract_canon_sha256":"1464512cd5c9d460638d736fd24813a186bd70ef3a8ce657551f567215e191cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:27.764705Z","signature_b64":"yCCx0gCufVqUDf8FuLcCeF5UYJRliO0nhwsWBKWRisXv1Chh1BLkLmNYXe0eaHzkZfkpcClM6WJfmAyx20MBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116b1c6121a5b844635af961d0b1cbe1d571c28823384037ef523dc4b9ebf6de","last_reissued_at":"2026-07-05T04:25:27.763599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:27.763599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computations in Fully-Defective Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Sela, Keren Censor-Hillel, Ran Gelles, Shir Cohen","submitted_at":"2022-05-23T09:18:35Z","abstract_excerpt":"We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible.\n  The key structural property of 2-edge-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11148","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/2205.11148/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":"2205.11148","created_at":"2026-07-05T04:25:27.763666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11148v1","created_at":"2026-07-05T04:25:27.763666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11148","created_at":"2026-07-05T04:25:27.763666+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFVRYYJBUW4E","created_at":"2026-07-05T04:25:27.763666+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFVRYYJBUW4EIY22","created_at":"2026-07-05T04:25:27.763666+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFVRYYJB","created_at":"2026-07-05T04:25:27.763666+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/CFVRYYJBUW4EIY227FQ5BMOL4H","json":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H.json","graph_json":"https://pith.science/api/pith-number/CFVRYYJBUW4EIY227FQ5BMOL4H/graph.json","events_json":"https://pith.science/api/pith-number/CFVRYYJBUW4EIY227FQ5BMOL4H/events.json","paper":"https://pith.science/paper/CFVRYYJB"},"agent_actions":{"view_html":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H","download_json":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H.json","view_paper":"https://pith.science/paper/CFVRYYJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11148&json=true","fetch_graph":"https://pith.science/api/pith-number/CFVRYYJBUW4EIY227FQ5BMOL4H/graph.json","fetch_events":"https://pith.science/api/pith-number/CFVRYYJBUW4EIY227FQ5BMOL4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H/action/storage_attestation","attest_author":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H/action/author_attestation","sign_citation":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H/action/citation_signature","submit_replication":"https://pith.science/pith/CFVRYYJBUW4EIY227FQ5BMOL4H/action/replication_record"}},"created_at":"2026-07-05T04:25:27.763666+00:00","updated_at":"2026-07-05T04:25:27.763666+00:00"}