Paper Citation Record · LEDGER

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures

As of 15 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2501.05377.

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

pith.paper-citation-record.v1
2501.05377 v2

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T21:24:27.006804Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

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

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

verified exact3
verified fuzzy1
unresolved7
parse uncertain0
malformed identifier5
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 20da5927-01c1-433f-ba83-2ae22ca53fab · outbound

This paper cites An Analysis of Avalanche Consensus.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures An Analysis of Avalanche Consensus

Reference 1

Resolution: verified exact; doi, observed 2026-08-10T21:24:27.121362Z

Source-reported events for the cited work

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

Observation 49e22dcc-eb68-4655-8781-1de20bc723b0 · outbound

This paper cites A Tight Lower Bound for Rando mized Syn- chronous Consensus.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures A Tight Lower Bound for Rando mized Syn- chronous Consensus

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.933547Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 529cc8f1-dfb4-4285-8c5b-16f1bd02d8b3 · outbound

This paper cites Dynamic Probabilistic Reliable Broa dcast.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Dynamic Probabilistic Reliable Broa dcast

Reference 3

Resolution: malformed identifier; raw_fallback, observed 2026-08-10T21:24:27.990517Z

Source-reported events for the cited work

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

Observation 5e78a6d1-15b7-402b-aba0-0d32352657ea · outbound

This paper cites The industrial internet of things (IIoT): An anal ysis framework.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures The industrial internet of things (IIoT): An anal ysis framework

Reference 4

Resolution: malformed identifier; no resolver link, observed 2026-08-10T21:24:26.944510Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea3eb9fb-5207-4cd8-8ab4-ebc3f370df78 · outbound

This paper cites An Asynchronous [(n-1)/3]-Resilient Consensus Protocol.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures An Asynchronous [(n-1)/3]-Resilient Consensus Protocol

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.949789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9734c740-8d2a-4731-8064-b431410bfd92 · outbound

This paper cites an unresolved cited work.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.954414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73cd4930-83fe-4a9a-ad4e-0de2a3d88111 · outbound

This paper cites Fast asynchronous Byzantine agreement w ith optimal resilience.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Fast asynchronous Byzantine agreement w ith optimal resilience

Reference 7

Resolution: malformed identifier; no resolver link, observed 2026-08-10T21:24:26.959749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bfcf39c-2ff5-453b-9e6c-6e3f0e7790b4 · outbound

This paper cites Stabilizing consensus with the power of two c hoices.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Stabilizing consensus with the power of two c hoices

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.964868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d81d0207-0e8e-43c1-8075-9541f85908f3 · outbound

This paper cites Bounds on Information Exchange for Byzantine Agreement.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Bounds on Information Exchange for Byzantine Agreement

Reference 9

Resolution: malformed identifier; no resolver link, observed 2026-08-10T21:24:26.969437Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cbf61fd-4d0c-4b68-8515-ce8e7fe05ed3 · outbound

This paper cites Impossib ility of Distributed Consensus with One Faulty Process.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Impossib ility of Distributed Consensus with One Faulty Process

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.973558Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0eae3426-1548-4704-9d52-4c6dee34bc2e · outbound

This paper cites Fully Polynomial Byzantine Agr eement for n > 3t Processors in t + 1 Rounds.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Fully Polynomial Byzantine Agr eement for n > 3t Processors in t + 1 Rounds

Reference 11

Resolution: verified exact; doi, observed 2026-08-10T21:24:27.078444Z

Source-reported events for the cited work

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

Observation 194b33a5-7552-4ed0-a3f7-52e2ac890ed1 · outbound

This paper cites Algorand: Scaling Byzantine Agreements for C ryptocurrencies.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Algorand: Scaling Byzantine Agreements for C ryptocurrencies

Reference 12

Resolution: verified exact; doi, observed 2026-08-10T21:24:27.061763Z

Source-reported events for the cited work

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

Observation 50789ceb-38d1-49e0-bded-3703f691e62f · outbound

This paper cites Signat ure-Free Asyn- chronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Ex- pected Time.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Signat ure-Free Asyn- chronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Ex- pected Time

Reference 13

Resolution: malformed identifier; no resolver link, observed 2026-08-10T21:24:26.986445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd2a26f9-1cbb-4df6-bdfe-c7ebcf7a30d0 · outbound

This paper cites Reaching Agreement in the Presence of Faults.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Reaching Agreement in the Presence of Faults

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:26.990814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e75d5d3-8678-484a-848f-2b578b83e0af · outbound

This paper cites B reaking the Ω(√/u1D45B) Bar- rier: Fast Consensus under a Late Adversary.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures B reaking the Ω(√/u1D45B) Bar- rier: Fast Consensus under a Late Adversary

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:24:27.973147Z

Source-reported events for the cited work

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

Observation 11ccd051-cddc-4dd8-bfbe-c6e90f9c1061 · outbound

This paper cites Scalable and Probabilistic Leaderless BFT Consensus through Metastability.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures Scalable and Probabilistic Leaderless BFT Consensus through Metastability

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-10T21:24:27.006804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4e1e437-8d09-420b-910d-060c44ee095a · outbound

This paper cites by Christian Scheideler and Jeremy T.

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures by Christian Scheideler and Jeremy T

Reference 2018

Resolution: metadata mismatch; raw_fallback, observed 2026-08-10T21:24:27.346290Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.