On the public citation graph

Unanimity in an unknown and unreliable environment

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1145/2402.322398openalex-snapshot
The Weak Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/3335772.3335936openalex-snapshot
The Byzantine generals problem
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-12689-9_120openalex-snapshot
A new solution for the Byzantine generals problem
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_169openalex-snapshot
Distributed computing in asynchronous networks with byzantine edges
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_12openalex-snapshot
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures
inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_3openalex-snapshot
Boosting the Efficiency of Byzantine-Tolerant Reliable Communication
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_8openalex-snapshot
Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-030-75100-5_10openalex-snapshot
From Incomplete to Complete Networks in Asynchronous Byzantine Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-00347-8_6openalex-snapshot
Byzantine Fault-Tolerant Distributed Set Intersection with Redundancy and Its Relationship with Byzantine Optimization
inferred← citeshttps://doi.org/10.1007/978-981-96-6232-6_1openalex-snapshot
EchoShard: A Blockchain Sharding System for Efficient Execution of Cross-Shard Smart Contract Transactions
inferred← citeshttps://doi.org/10.1007/s00778-023-00794-0openalex-snapshot
ByShard: sharding in a Byzantine environment
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90776-8openalex-snapshot
An efficient algorithm for byzantine agreement without authentication
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80042-5openalex-snapshot
A new solution for the Byzantine generals problem
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00058openalex-snapshot
Byzantine Reliable Broadcast on Partially Connected Networks Under Message Adversaries
inferred← citeshttps://doi.org/10.1109/69.142017openalex-snapshot
Optimal agreement protocol in malicious faulty processors and faulty links
inferred← citeshttps://doi.org/10.1109/access.2022.3175998openalex-snapshot
Reaching Efficient Byzantine Agreements in Bipartite Networks
inferred← citeshttps://doi.org/10.1109/cmpeur.1989.93460openalex-snapshot
Achieving Byzantine agreement in a generalized network model
inferred← citeshttps://doi.org/10.1109/cmpsac.1998.716642openalex-snapshot
Revisit consensus problem on dual link failure modes
inferred← citeshttps://doi.org/10.1109/icdcs51616.2021.00055openalex-snapshot
Practical Byzantine Reliable Broadcast on Partially Connected Networks
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00022openalex-snapshot
Partition Detection in Byzantine Networks
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621127openalex-snapshot
LightCross: Sharding with Lightweight Cross-Shard Execution for Smart Contracts
inferred← citeshttps://doi.org/10.1109/ladc.2018.00026openalex-snapshot
Multi-hop Byzantine Reliable Broadcast Made Practical
inferred← citeshttps://doi.org/10.1109/pccc.1989.37423openalex-snapshot
Achieving Byzantine agreement in a processor and link fallible network
inferred← citeshttps://doi.org/10.1109/sfcs.1982.51openalex-snapshot
'Eventual' is earlier than 'immediate'
inferred← citeshttps://doi.org/10.1109/tpds.2021.3056718openalex-snapshot
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite
inferred← citeshttps://doi.org/10.1142/s0218488526500029openalex-snapshot
A Cluster-Based Prediction Method of Specific Social Networks User Relationship: Take Academic Blog as an Example
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/22145.22180openalex-snapshot
An O(lg n) expected rounds randomized Byzantine generals protocol
inferred← citeshttps://doi.org/10.1145/2455.214112openalex-snapshot
Bounds on information exchange for Byzantine agreement
inferred← citeshttps://doi.org/10.1145/31846.42229openalex-snapshot
An O (log n ) expected rounds randomized byzantine generals protocol
inferred← citeshttps://doi.org/10.1145/323596.323604openalex-snapshot
Fast distributed agreement (preliminary version)
inferred← citeshttps://doi.org/10.1145/3366625.3369437openalex-snapshot
An In-Depth Look of BFT Consensus in Blockchain
inferred← citeshttps://doi.org/10.1145/3401025.3404099openalex-snapshot
Blockchain consensus unraveled
inferred← citeshttps://doi.org/10.1145/4221.214134openalex-snapshot
Asynchronous consensus and broadcast protocols
inferred← citeshttps://doi.org/10.1145/588058.588061openalex-snapshot
A recovery algorithm for a distributed database system
inferred← citeshttps://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement
inferred← citeshttps://doi.org/10.1145/800220.806686openalex-snapshot
Finding safe paths in a faulty environment
inferred← citeshttps://doi.org/10.1145/800220.806690openalex-snapshot
Bounds on information exchange for Byzantine Agreement
inferred← citeshttps://doi.org/10.1145/800221.806706openalex-snapshot
Resilient consensus protocols
inferred← citeshttps://doi.org/10.1145/800222.806744openalex-snapshot
Randomized Byzantine Agreements
inferred← citeshttps://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement
inferred← citeshttps://doi.org/10.1186/s13173-019-0090-xopenalex-snapshot
Multi-hop Byzantine reliable broadcast with honest dealer made practical
inferred← citeshttps://doi.org/10.14763/2024.2.1750openalex-snapshot
Consensus techniques
inferred← citeshttps://doi.org/10.14778/3380750.3380757openalex-snapshot
ResilientDB
inferred← citeshttps://doi.org/10.14778/3415478.3415565openalex-snapshot
Building high throughput permissioned blockchain fabrics
inferred← citeshttps://doi.org/10.14778/3476249.3476275openalex-snapshot
ByShard
inferred← citeshttps://doi.org/10.2200/s00773ed1v01y201704spt020openalex-snapshot
Blocks and Chains: Introduction to Bitcoin, Cryptocurrencies, and Their Consensus Mechanisms
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01770openalex-snapshot
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00838openalex-snapshot
Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation
inferred← citeshttps://doi.org/10.48550/arxiv.2007.14990openalex-snapshot
Reliable Broadcast in Practical Networks: Algorithm and Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.2008.04450openalex-snapshot
Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13047openalex-snapshot
RingBFT: Resilient Consensus over Sharded Ring Topology
inferred← citeshttps://doi.org/10.48550/arxiv.2108.08541openalex-snapshot
Byzantine Cluster-Sending in Expected Constant Communication
inferred← citeshttps://doi.org/10.5070/sr33161314openalex-snapshot
[Problem] Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing
inferred← citeshttps://doi.org/10.5753/wtf.2026.24108openalex-snapshot
A Caminho do Broadcast Hierárquico Tolerante a Falhas Bizantinas
inferred← citeshttps://doi.org/10.70675/61d0c972z95dcz4855z9a17z927b1fcf4989openalex-snapshot
Tractable Reliable Communication in Compromised Networks
inferred← citeshttps://doi.org/10.70675/8172f450z7f29z4bddz96eaz61012b995677openalex-snapshot
Governing the commons in blockchains
inferred← citeshttps://doi.org/10.7763/ijcte.2015.v7.942openalex-snapshot
New Approach to Improve the Generalized Byzantine Agreement Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.