Paper Citation Record · LEDGER

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs

As of 10 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2502.05591.

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

pith.paper-citation-record.v1
2502.05591 v5

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T18:54:49.822285Z

measured 46 of 46 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T21:19:27.217876Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

45 of 45 outbound references displayed

verified exact2
verified fuzzy2
unresolved36
parse uncertain0
malformed identifier3
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bac3e6be-c50a-46c2-af4b-b799b513fdb3 · outbound

This paper cites Optimal resilience asynchronous approxi- mate agreement.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Optimal resilience asynchronous approxi- mate agreement

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.663129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14cc98e7-9017-4f1d-bb77-10342329d7d6 · outbound

This paper cites The topology of look-compute-move robot wait-free algorithms with hard termination.Distributed Computing, 32(3):235–255, 2019.doi:10.1007/s00446-018-0345-3.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs The topology of look-compute-move robot wait-free algorithms with hard termination.Distributed Computing, 32(3):235–255, 2019.doi:10.1007/s00446-018-0345-3

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.667574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57ba637c-a7c0-4d7d-8846-a9e690885a91 · outbound

This paper cites Wait-free approximate agreement on graphs.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Wait-free approximate agreement on graphs

Reference 3

Resolution: malformed identifier; no resolver link, observed 2026-08-08T18:54:49.671591Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 217f44a2-cd07-499c-879e-033f91141c71 · outbound

This paper cites The Step Complexity of Multidimensional Approximate Agree- ment.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs The Step Complexity of Multidimensional Approximate Agree- ment

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.675578Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24480145-b56d-4c04-b40a-2662df277d67 · outbound

This paper cites Bandarupalli, A.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Bandarupalli, A

Reference 5

Resolution: verified exact; raw_fallback, observed 2026-08-08T18:54:50.818891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation a9be8d7d-288f-41c3-872f-c21ecdd4b635 · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.683656Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8385b26f-f822-4967-b217-d0683e05d3a5 · outbound

This paper cites Simple Gradecast Based Algorithms.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Simple Gradecast Based Algorithms

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.687602Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2448ad6e-8bbb-4b2b-bb62-ae21fef8fe33 · outbound

This paper cites Bender and Mart ´ ın Farach-Colton.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Bender and Mart ´ ın Farach-Colton

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T18:54:50.930209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 62937dc9-4927-4761-883b-74a2f2f76368 · outbound

This paper cites Centroid Approximation with Multidimensional Approximate Agreement Protocols.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Centroid Approximation with Multidimensional Approximate Agreement Protocols

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.694849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 563ffcc7-a8af-40db-8908-06dd6d8436c2 · outbound

This paper cites Con- vex Consensus with Asynchronous Fallback.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Con- vex Consensus with Asynchronous Fallback

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.698899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f452ecfe-cb60-4bef-a553-e643d90dadcd · outbound

This paper cites Gathering on rings under the look-compute-move model.Distributed Computing, 27(4):255–285, 2014.doi:10.1007/ s00446-014-0212-9.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Gathering on rings under the look-compute-move model.Distributed Computing, 27(4):255–285, 2014.doi:10.1007/ s00446-014-0212-9

Reference 11

Resolution: malformed identifier; no resolver link, observed 2026-08-08T18:54:49.702310Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4eb2ced-1087-431c-bc1c-5c36fcae9cc1 · outbound

This paper cites Lynch, Shlomit S.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Lynch, Shlomit S

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.705936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fccd3be8-c89f-407c-9589-a49c345a46e7 · outbound

This paper cites Raymond Strong.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Raymond Strong

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.709257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be5cf8f3-6604-451b-981c-eae4b49417cd · outbound

This paper cites Validated Byzantine Asynchronous Multidimensional Approximate Agreement.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Validated Byzantine Asynchronous Multidimensional Approximate Agreement

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.712556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d3877a6-fe8e-4139-9d24-96b6f85b9265 · outbound

This paper cites Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning).

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning)

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.716503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66a99161-323b-4855-b3e6-edf3a8eca00d · outbound

This paper cites Genuinely distributed byzantine machine learning.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Genuinely distributed byzantine machine learning

Reference 16

Resolution: metadata mismatch; raw_fallback, observed 2026-08-08T18:54:50.643456Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation dabec76d-e410-41b2-b128-fa14cdf517c8 · outbound

This paper cites Asynchronous Approximate Agreement with Quadratic Communication.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Asynchronous Approximate Agreement with Quadratic Communication

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.723199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3d02c75-72d0-46e9-ac2e-c370a88dca7f · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.726798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4514bd30-591e-449c-9653-323efcc80a07 · outbound

This paper cites Asymptotically optimal algorithms for approximate agreement.Distributed Computing, 4(1):9–29, 1990.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Asymptotically optimal algorithms for approximate agreement.Distributed Computing, 4(1):9–29, 1990

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.730067Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d3e15aa-cdfc-4559-9030-adc5059a94c8 · outbound

This paper cites Gathering asyn- chronous oblivious agents with local vision in regular bipartite graphs.Theoretical Computer Science, 509:26–41, 2013.doi:10.1016/j.tcs.2012.07.004.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Gathering asyn- chronous oblivious agents with local vision in regular bipartite graphs.Theoretical Computer Science, 509:26–41, 2013.doi:10.1016/j.tcs.2012.07.004

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.733386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9f8a773-7141-4cb2-8f05-776cbe77ae4f · outbound

This paper cites Brief announcement: Towards round- optimal approximate agreement on trees.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Brief announcement: Towards round- optimal approximate agreement on trees

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.736950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bce83132-9410-4538-8ff4-949fa9b048cd · outbound

This paper cites Fast Multidimensional Asymptotic and Approximate Consensus.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Fast Multidimensional Asymptotic and Approximate Consensus

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.740469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 053bdc53-12cf-470a-9831-8ca3aaa3a4eb · outbound

This paper cites Round-optimal byzantine agreement.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Round-optimal byzantine agreement

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.743913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5ef300c-eaa3-4be0-9847-a0c80196ba30 · outbound

This paper cites Multidimensional approximate agreement with asynchronous fallback.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Multidimensional approximate agreement with asynchronous fallback

Reference 25

Resolution: metadata mismatch; raw_fallback, observed 2026-08-08T18:54:50.329729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d32946e5-ce58-40b0-96cd-13fb17876fdb · outbound

This paper cites Brief announcement: Communication-optimal convex agreement.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Brief announcement: Communication-optimal convex agreement

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.754041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6bd49fa3-4cbe-4b29-a2a9-13e6643eb0fe · outbound

This paper cites Communication-Optimal Convex Agreement.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Communication-Optimal Convex Agreement

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.757503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation caa72a81-e874-47b5-85cc-eeb292204377 · outbound

This paper cites Brief announcement: Variants of approximate agreement on graphs and simplicial complexes.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Brief announcement: Variants of approximate agreement on graphs and simplicial complexes

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.761050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fabad026-72b2-43dc-87fc-14159e685037 · outbound

This paper cites Optimal clock synchronization with signatures.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Optimal clock synchronization with signatures

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.764408Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5564417b-3640-4993-8dcb-bf2f8d85d9eb · outbound

This paper cites The Impossibility of Approximate Agreement on a Larger Class of Graphs.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs The Impossibility of Approximate Agreement on a Larger Class of Graphs

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.767861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bda91231-f2cb-405a-9d52-40f46eee49fd · outbound

This paper cites Byzantine agreement with interval validity.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Byzantine agreement with interval validity

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.771364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db4be7ac-3b43-4dba-a7ca-e2987ff3a0de · outbound

This paper cites Multidimensional approximate agreement in byzan- tine asynchronous systems.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Multidimensional approximate agreement in byzan- tine asynchronous systems

Reference 32

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T18:54:50.065917Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0b91a216-a7b6-4ac9-a588-b2042798e2a2 · outbound

This paper cites Multidimensional agreement in byzantine systems.Distributed Computing, 28(6):423–441, 2015.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Multidimensional agreement in byzantine systems.Distributed Computing, 28(6):423–441, 2015

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.777939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c75ed5aa-78cb-4dc6-b299-a40813c6a0bc · outbound

This paper cites Optimal and player-replaceable consensus with an honest majority.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Optimal and player-replaceable consensus with an honest majority

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.781286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc140fa8-8c98-460c-8d9b-b2d167c65867 · outbound

This paper cites Byzantine Approximate Agreement on Graphs.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Byzantine Approximate Agreement on Graphs

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.784499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95e193b5-d036-4bd4-80cb-70f99a40f77b · outbound

This paper cites Distributed computing with mobile robots: An introductory survey.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Distributed computing with mobile robots: An introductory survey

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.788088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8048304e-f4d8-4ddd-8a89-29e876f86050 · outbound

This paper cites Byzantine Agreement with Median Validity.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Byzantine Agreement with Median Validity

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.791473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1fed3125-6087-44e6-8174-dcf9572a40b1 · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.794716Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25cdc564-6197-4079-b0c9-8b6714588eab · outbound

This paper cites Vaidya and Vijay K.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Vaidya and Vijay K

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.797946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b338959f-8f19-4143-bb7a-1e8268a00033 · outbound

This paper cites Brief announcement: Relaxed byzantine vector consensus.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Brief announcement: Relaxed byzantine vector consensus

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.801078Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bfaa379b-6004-4fe6-9251-49c334e8fff5 · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.804257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f03a5922-2ee1-4bb8-b220-d036783e52ea · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 42

Resolution: malformed identifier; raw_fallback, observed 2026-08-08T18:54:50.858177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ca227497-80bd-4d28-8f2f-75e927fdd6e9 · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.811786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78685256-85a6-44c1-93c2-0fe1478cae7b · outbound

This paper cites an unresolved cited work.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.815490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e30e49e-1bf0-4e7b-b7fa-54627eb9779e · outbound

This paper cites Then, a vertexu is in the subtree rooted atvif and only ifL(u)⊆[i min, imax].

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Then, a vertexu is in the subtree rooted atvif and only ifL(u)⊆[i min, imax]

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-08T18:54:49.818975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b7ca313-1eb6-4152-9cbc-4fbe1f3e35b0 · outbound

This paper cites Proof.First, we prove thatListConstruction(T, v root) terminates in a finite amount of time.

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Proof.First, we prove thatListConstruction(T, v root) terminates in a finite amount of time

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T18:54:50.829290Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Pith citing papers

Observation 83032052-d259-4342-ba8d-5ea3186eb602 · inbound

General Convex Agreement with Near-Optimal Communication cites this paper.

General Convex Agreement with Near-Optimal Communication Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-02T21:19:27.217876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.