{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WNWUVFABQPIJFER2AXFMHKII5G","short_pith_number":"pith:WNWUVFAB","schema_version":"1.0","canonical_sha256":"b36d4a940183d092923a05cac3a908e9bba9d70188725a7aff208e495a10bb1d","source":{"kind":"arxiv","id":"1302.6224","version":5},"attestation_state":"computed","paper":{"title":"Distributed Computability in Byzantine Asynchronous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christine Tasson, Hammurabi Mendes, Maurice Herlihy","submitted_at":"2013-02-25T20:50:25Z","abstract_excerpt":"In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give the first theorem with necessary and sufficient conditions to solve arbitrary tasks in asynchronous Byzantine systems where an adversary chooses faulty processes. In our adversarial formulation, outputs of non-faulty processes are constrained in terms of inputs of non-faulty processes only. For colorless tasks, an important subclass of distributed problems, the general result reduces to an elegant model that effectivel"},"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":"1302.6224","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-25T20:50:25Z","cross_cats_sorted":[],"title_canon_sha256":"c702e10a2125bd4329505cbe15bd98f9a73e107b93d048fc5e3942d6e24b9244","abstract_canon_sha256":"c510f8901fbb315ba486c2db04958304bb57672b205ae2a4292cac396a668394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:03.545498Z","signature_b64":"JBmOjBL3CDAMtrc/cDrpW/ZVVoL7VhdJ/kgIlNkHuUpc0lNqP63GfJqLhuAVS84UAcwgpjFqu+qM5+a7LSu7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36d4a940183d092923a05cac3a908e9bba9d70188725a7aff208e495a10bb1d","last_reissued_at":"2026-05-18T02:50:03.544698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:03.544698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computability in Byzantine Asynchronous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christine Tasson, Hammurabi Mendes, Maurice Herlihy","submitted_at":"2013-02-25T20:50:25Z","abstract_excerpt":"In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give the first theorem with necessary and sufficient conditions to solve arbitrary tasks in asynchronous Byzantine systems where an adversary chooses faulty processes. In our adversarial formulation, outputs of non-faulty processes are constrained in terms of inputs of non-faulty processes only. For colorless tasks, an important subclass of distributed problems, the general result reduces to an elegant model that effectivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6224","kind":"arxiv","version":5},"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":"1302.6224","created_at":"2026-05-18T02:50:03.544819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6224v5","created_at":"2026-05-18T02:50:03.544819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6224","created_at":"2026-05-18T02:50:03.544819+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNWUVFABQPIJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNWUVFABQPIJFER2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNWUVFAB","created_at":"2026-05-18T12:28:04.890932+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/WNWUVFABQPIJFER2AXFMHKII5G","json":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G.json","graph_json":"https://pith.science/api/pith-number/WNWUVFABQPIJFER2AXFMHKII5G/graph.json","events_json":"https://pith.science/api/pith-number/WNWUVFABQPIJFER2AXFMHKII5G/events.json","paper":"https://pith.science/paper/WNWUVFAB"},"agent_actions":{"view_html":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G","download_json":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G.json","view_paper":"https://pith.science/paper/WNWUVFAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6224&json=true","fetch_graph":"https://pith.science/api/pith-number/WNWUVFABQPIJFER2AXFMHKII5G/graph.json","fetch_events":"https://pith.science/api/pith-number/WNWUVFABQPIJFER2AXFMHKII5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G/action/storage_attestation","attest_author":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G/action/author_attestation","sign_citation":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G/action/citation_signature","submit_replication":"https://pith.science/pith/WNWUVFABQPIJFER2AXFMHKII5G/action/replication_record"}},"created_at":"2026-05-18T02:50:03.544819+00:00","updated_at":"2026-05-18T02:50:03.544819+00:00"}