{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QONNRRYSXT4FZ5DCXBQXUSFNFI","short_pith_number":"pith:QONNRRYS","schema_version":"1.0","canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","source":{"kind":"arxiv","id":"1401.6615","version":1},"attestation_state":"computed","paper":{"title":"Iterative Approximate Consensus in the presence of Byzantine Link Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2014-01-26T05:45:02Z","abstract_excerpt":"This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free.\n  Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain"},"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":"1401.6615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"48bb1e8e31031507710086583e1a452cdc18c390518a345891844be2f576b40e","abstract_canon_sha256":"237d2eeec9bc4e7e867d5feaa777ba469dd2165b282c990162c9e273d3c1d2c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:02.116385Z","signature_b64":"+Reyz7DhxM+pklEuoMOhDI2tXcxSEhObPCCb4fsQ7vY6OGnQ1ZipZ88G81+SIJfn6PODFZKrTVn5xDPpSSrhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","last_reissued_at":"2026-05-18T01:01:02.115620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:02.115620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Approximate Consensus in the presence of Byzantine Link Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2014-01-26T05:45:02Z","abstract_excerpt":"This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free.\n  Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6615","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":"1401.6615","created_at":"2026-05-18T01:01:02.115755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6615v1","created_at":"2026-05-18T01:01:02.115755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6615","created_at":"2026-05-18T01:01:02.115755+00:00"},{"alias_kind":"pith_short_12","alias_value":"QONNRRYSXT4F","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QONNRRYSXT4FZ5DC","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QONNRRYS","created_at":"2026-05-18T12:28:46.137349+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/QONNRRYSXT4FZ5DCXBQXUSFNFI","json":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI.json","graph_json":"https://pith.science/api/pith-number/QONNRRYSXT4FZ5DCXBQXUSFNFI/graph.json","events_json":"https://pith.science/api/pith-number/QONNRRYSXT4FZ5DCXBQXUSFNFI/events.json","paper":"https://pith.science/paper/QONNRRYS"},"agent_actions":{"view_html":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI","download_json":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI.json","view_paper":"https://pith.science/paper/QONNRRYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6615&json=true","fetch_graph":"https://pith.science/api/pith-number/QONNRRYSXT4FZ5DCXBQXUSFNFI/graph.json","fetch_events":"https://pith.science/api/pith-number/QONNRRYSXT4FZ5DCXBQXUSFNFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/action/storage_attestation","attest_author":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/action/author_attestation","sign_citation":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/action/citation_signature","submit_replication":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/action/replication_record"}},"created_at":"2026-05-18T01:01:02.115755+00:00","updated_at":"2026-05-18T01:01:02.115755+00:00"}