Paper Citation Record · LEDGER

Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2201.01107.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2201.01107 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:15:45.432555Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-23T07:17:42.659808Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 03e9b0eb-65c5-4412-9691-7840f11925c9 · inbound

Fast Byzantine Total Order Broadcast cites this paper.

Fast Byzantine Total Order Broadcast Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

Reference 69

Resolution: verified exact; arxiv_id, observed 2026-05-23T07:17:42.662775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 9b50fdf6-74c2-466b-b77b-81699fcace47 · inbound

From Few to Many Faults: Optimal Adaptive Byzantine Agreement cites this paper.

From Few to Many Faults: Optimal Adaptive Byzantine Agreement Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-07T14:15:45.432555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6675a58b-9dcf-440c-bd05-0a85300cd460 · inbound

From Permissioned to Proof-of-Stake Consensus cites this paper.

From Permissioned to Proof-of-Stake Consensus Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-07T00:30:30.808658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a48e8f48-8569-493b-bbce-ba3a1d4ca4ff · inbound

Cassandra: Consensus with Partial Progress via Robust Partitionable View Synchronization cites this paper.

Cassandra: Consensus with Partial Progress via Robust Partitionable View Synchronization Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-12T06:34:15.606663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.