{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KRIGWWXDAG55RZXCZMDQKACDKV","short_pith_number":"pith:KRIGWWXD","schema_version":"1.0","canonical_sha256":"54506b5ae301bbd8e6e2cb07050043554093e420b936d9d875f5b035b2e07e27","source":{"kind":"arxiv","id":"1203.6096","version":1},"attestation_state":"computed","paper":{"title":"Asynchrony from Synchrony","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eli Gafni, Yehuda Afek","submitted_at":"2012-03-27T22:26:02Z","abstract_excerpt":"We consider synchronous dynamic networks which like radio networks may have asymmetric communication links, and are affected by communication rather than processor failures. In this paper we investigate the minimal message survivability in a per round basis that allows for the minimal global cooperation, i.e., allows to solve any task that is wait-free read-write solvable. The paper completely characterizes this survivability requirement. Message survivability is formalized by considering adversaries that have a limited power to remove messages in a round. Removal of a message on a link in one"},"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":"1203.6096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-27T22:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"e5d10203b36387935c12915d878ce04897c98569a6e38b916f5d4ee27bde725c","abstract_canon_sha256":"4902b3ae5e3644f9bb1d508dd6e77cfd04f506a8408fc5c6d303e87c2a18a2fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:04.183569Z","signature_b64":"apDvxxrfYugjPyQJIMPVI9nDPSd0QhK37G/YgNDR2eAZw9vBQq2kg5gKk6oWn4AGqaf3AUir/Dqnq+VS6nAmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54506b5ae301bbd8e6e2cb07050043554093e420b936d9d875f5b035b2e07e27","last_reissued_at":"2026-05-18T03:59:04.182617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:04.182617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchrony from Synchrony","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eli Gafni, Yehuda Afek","submitted_at":"2012-03-27T22:26:02Z","abstract_excerpt":"We consider synchronous dynamic networks which like radio networks may have asymmetric communication links, and are affected by communication rather than processor failures. In this paper we investigate the minimal message survivability in a per round basis that allows for the minimal global cooperation, i.e., allows to solve any task that is wait-free read-write solvable. The paper completely characterizes this survivability requirement. Message survivability is formalized by considering adversaries that have a limited power to remove messages in a round. Removal of a message on a link in one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6096","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":"1203.6096","created_at":"2026-05-18T03:59:04.182782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6096v1","created_at":"2026-05-18T03:59:04.182782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6096","created_at":"2026-05-18T03:59:04.182782+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRIGWWXDAG55","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRIGWWXDAG55RZXC","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRIGWWXD","created_at":"2026-05-18T12:27:11.947152+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/KRIGWWXDAG55RZXCZMDQKACDKV","json":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV.json","graph_json":"https://pith.science/api/pith-number/KRIGWWXDAG55RZXCZMDQKACDKV/graph.json","events_json":"https://pith.science/api/pith-number/KRIGWWXDAG55RZXCZMDQKACDKV/events.json","paper":"https://pith.science/paper/KRIGWWXD"},"agent_actions":{"view_html":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV","download_json":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV.json","view_paper":"https://pith.science/paper/KRIGWWXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6096&json=true","fetch_graph":"https://pith.science/api/pith-number/KRIGWWXDAG55RZXCZMDQKACDKV/graph.json","fetch_events":"https://pith.science/api/pith-number/KRIGWWXDAG55RZXCZMDQKACDKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV/action/storage_attestation","attest_author":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV/action/author_attestation","sign_citation":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV/action/citation_signature","submit_replication":"https://pith.science/pith/KRIGWWXDAG55RZXCZMDQKACDKV/action/replication_record"}},"created_at":"2026-05-18T03:59:04.182782+00:00","updated_at":"2026-05-18T03:59:04.182782+00:00"}