{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:F6N2ACBQMITUWAUEUHF3SES2KL","short_pith_number":"pith:F6N2ACBQ","schema_version":"1.0","canonical_sha256":"2f9ba0083062274b0284a1cbb9125a52f15f2ceb6ff68241691f725d5d75ff99","source":{"kind":"arxiv","id":"1201.4183","version":2},"attestation_state":"computed","paper":{"title":"Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Lewis Tseng, Nitin Vaidya","submitted_at":"2012-01-19T22:05:08Z","abstract_excerpt":"In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs."},"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":"1201.4183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-19T22:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"7ef872bf77d7542d7c8307179edf22d7c45455d07a28c22b3c9b008eb55d4799","abstract_canon_sha256":"684415345c3630f473fadec4fb85b79dab45f13663b1de3f5c0b699f50c8c81a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:08.715617Z","signature_b64":"9VnLB9l/xXbu0P8A+JKK2pmaM3tOIutf0SWEVyiH6NQLVd75+gk386reGkJGlrPYy38uAZExua5qPG5k+/XLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f9ba0083062274b0284a1cbb9125a52f15f2ceb6ff68241691f725d5d75ff99","last_reissued_at":"2026-05-18T04:03:08.714824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:08.714824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Lewis Tseng, Nitin Vaidya","submitted_at":"2012-01-19T22:05:08Z","abstract_excerpt":"In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4183","kind":"arxiv","version":2},"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":"1201.4183","created_at":"2026-05-18T04:03:08.714948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4183v2","created_at":"2026-05-18T04:03:08.714948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4183","created_at":"2026-05-18T04:03:08.714948+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6N2ACBQMITU","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6N2ACBQMITUWAUE","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6N2ACBQ","created_at":"2026-05-18T12:27:04.183437+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/F6N2ACBQMITUWAUEUHF3SES2KL","json":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL.json","graph_json":"https://pith.science/api/pith-number/F6N2ACBQMITUWAUEUHF3SES2KL/graph.json","events_json":"https://pith.science/api/pith-number/F6N2ACBQMITUWAUEUHF3SES2KL/events.json","paper":"https://pith.science/paper/F6N2ACBQ"},"agent_actions":{"view_html":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL","download_json":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL.json","view_paper":"https://pith.science/paper/F6N2ACBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4183&json=true","fetch_graph":"https://pith.science/api/pith-number/F6N2ACBQMITUWAUEUHF3SES2KL/graph.json","fetch_events":"https://pith.science/api/pith-number/F6N2ACBQMITUWAUEUHF3SES2KL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL/action/storage_attestation","attest_author":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL/action/author_attestation","sign_citation":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL/action/citation_signature","submit_replication":"https://pith.science/pith/F6N2ACBQMITUWAUEUHF3SES2KL/action/replication_record"}},"created_at":"2026-05-18T04:03:08.714948+00:00","updated_at":"2026-05-18T04:03:08.714948+00:00"}