Pith. sign in

Paper Citation Record · LEDGER

Byzantine Approximate Agreement on Graphs

As of 16 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 1 inbound Pith citation observation for arXiv:1908.02743.

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

pith.paper-citation-record.v1
1908.02743 v2

Coverage vector

measured 85 of 85 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T14:58:11.153758Z

measured 86 of 86 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+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-14T14:58:10.690306Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-14T14:58:11.920287Z

Reference resolution

85 of 85 outbound references displayed

  • verified exact5
  • verified fuzzy39
  • unresolved33
  • parse uncertain2
  • malformed identifier5
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e463352f-1b6b-4259-86f7-51f79a917703 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.685267Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.685267Z digest=sha256:4eb1ba5a137415f4465f6645fc634c9e81016dc979defadf7808fb7618f48c48

Observation aaabed31-e7d7-4c7f-ae4a-a74417a720d3 · outbound

This paper cites Byzantine Approximate Agreement on Graphs.

Byzantine Approximate Agreement on Graphs Byzantine Approximate Agreement on Graphs

Reference 2

Resolution
metadata mismatch
local_arxiv, observed 2026-08-14T14:58:11.925705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.690306Z digest=sha256:a97f20f3c348e87e73052b517ccf7e5e0c55554ea3890860167c36614965eb46

Observation 1fd5e5f3-eb4e-4016-87b6-0091eee20a8f · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.695435Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.695435Z digest=sha256:3f7c9e59d35d3666881e4983f94c29754239a28d4eb03be4775dd9456c10a711

Observation 5993c152-33ca-4515-b210-08b75b3fe0c6 · outbound

This paper cites We give algorithms for approximate agreement on trees and chordal graphs.

Byzantine Approximate Agreement on Graphs We give algorithms for approximate agreement on trees and chordal graphs

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.700100Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.700100Z digest=sha256:30041388461838812ee361626d95413a7974d50b381dd3ab13c53a8c7c69f96d

Observation a7fe7a1c-290d-415b-9400-9be9934c0667 · outbound

This paper cites To our knowledge, this is the first algorithm that solves any variant of semilattice agreement under Byzantine faults.

Byzantine Approximate Agreement on Graphs To our knowledge, this is the first algorithm that solves any variant of semilattice agreement under Byzantine faults

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.705687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.705687Z digest=sha256:4f6208d018ab403a0ca95bf4e623d3e33ab25e17246019f70f557ce19533bfee

Observation 845766bc-2369-48b6-b9a1-e03b712dd9b1 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.710248Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.710248Z digest=sha256:b22e9267e7ee41147c3fc2ab901553d8c95914e13f8a52f4aee0eb3563a9a851

Observation 73f257ab-77d8-4435-8a4e-ba0f7531f851 · outbound

This paper cites We consider the exact variant of the abstract approximate agreement problem, where the agreement constraint is replaced by|Y| = 1.

Byzantine Approximate Agreement on Graphs We consider the exact variant of the abstract approximate agreement problem, where the agreement constraint is replaced by|Y| = 1

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.797310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.716982Z digest=sha256:e7ce1970c9ebe5c55fb4cc0d15d4ed6e881e7be5ae9d98896bcfa1a3c38d2181

Observation b60a5166-4d0d-4a81-a266-0c0fa1720ef7 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 8

Resolution
parse uncertain
raw_fallback, observed 2026-08-14T14:58:12.774590Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.722341Z digest=sha256:710fc702e4eee65cc416337115a18b86471c43a1d4b4329a86a5dbaf7935ab37

Observation ea381f55-990c-4ce6-812f-6e61b4e48799 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.759865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.727453Z digest=sha256:065b5bdc6cd8812bad1f47784ded672d233adadbc15277c465add79a85390b8c

Observation 2fc45590-167a-49e4-97d8-ac5a3ad6c4d9 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.746152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.731545Z digest=sha256:5ea85013ee3281f267f74f42ff2d19a30698ca9109aae93f954e11ee05046cbd

Observation 6ee9eef7-174c-41a2-a2e6-8354c4d3352f · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.731144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.736831Z digest=sha256:6074f5337343448b9a7a1cf765a7c58c674ebb722555ebf6017c01737f5d2319

Observation 36cd183a-8007-46b0-a6ab-56a42fc5f393 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.717099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.740794Z digest=sha256:d9964b52f9fe3ce70c407168e49f74c0a86af1a84032afee79e93f060d1b9e10

Observation 55d3351e-399e-4751-89ab-18a122637a0b · outbound

This paper cites The received messageMij(t) may be empty, denoted by⊥, to indicate that no message arrived from processorj (e.g., due to a crash or a delay).

Byzantine Approximate Agreement on Graphs The received messageMij(t) may be empty, denoted by⊥, to indicate that no message arrived from processorj (e.g., due to a crash or a delay)

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.703040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.745350Z digest=sha256:50fe6e75d4ca3f723cad8ed4fbb98156887ebf34255f2b18ac62e5e5065add0d

Observation c747d3ac-c785-42e6-acfa-a73727e74561 · outbound

This paper cites easy to peel.

Byzantine Approximate Agreement on Graphs easy to peel

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.689030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.749602Z digest=sha256:f13107ce6fcf268103fb389ef697d22fe9383c6c7b4a1b415e20f9fa551957d4

Observation f454a26e-fb54-4a50-8013-66c019125b7a · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.669731Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.755037Z digest=sha256:dac47cc652fbf54e600cde92ef81eb22461e51d88eb03259c27f8bbb271ae94b

Observation 8689732a-314a-4506-87c9-ccea27892e95 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 16

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.657476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.760106Z digest=sha256:9d0db87f5ec421ad4065cefa8de15bda3dc602d2fadd4d04b8f9d05342e6ef21

Observation 779af3af-4bc5-43b4-a581-74c1c26ccf1e · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.645008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.766796Z digest=sha256:a34c10ad417c9f03ba35db86812c8a229165b9ec4a84900bcd77acc59a27eae0

Observation 6f908d14-a7d8-42f7-a682-f58c64db10c8 · outbound

This paper cites Since thebi(·) values are updated using the algorithmA, these values converge onto a single edge{a,b}∈ E(T ) in the treeT.

Byzantine Approximate Agreement on Graphs Since thebi(·) values are updated using the algorithmA, these values converge onto a single edge{a,b}∈ E(T ) in the treeT

Reference 18

Resolution
malformed identifier
raw_fallback, observed 2026-08-14T14:58:12.631549Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.771392Z digest=sha256:f60bd0e13cecdf43e2d732b523ce7f1e7e5c51a6ccb0760a373b26bd22671942

Observation c5fa3285-29fb-4e64-8bdd-83df55568d3d · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.619493Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.778176Z digest=sha256:3a31404b9ae9513936a20da4a054585cc0770f2d7caa438f271a9d2c6e05d5cb

Observation 3c36fc62-5133-46e5-bf1c-c33cd4fd1a15 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.606974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.782753Z digest=sha256:a65d3f7dce62fe4a06f631886bc3652ab28f37dac2f48aaa8e48d25021fed9a9

Observation 1e7bcb2f-76c9-4d62-a15d-4c72aee33ea4 · outbound

This paper cites 6.2 Upper bound for convex consensus We start with the positive result given by Theorem 7.

Byzantine Approximate Agreement on Graphs 6.2 Upper bound for convex consensus We start with the positive result given by Theorem 7

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.593530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.786794Z digest=sha256:81cb410b5be1fb43b0516a21deec1a7d0d793be30d26d3832b1acf5f48db8d32

Observation 01dd6f25-6a81-44b0-ae2c-97a0b11c40c6 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 22

Resolution
parse uncertain
raw_fallback, observed 2026-08-14T14:58:12.579071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.791783Z digest=sha256:fff8f746a417206c433af98a2d7649d80558a0bd91bc7623deca8f83ec6ad0de

Observation 225070f6-1106-4314-b2f0-1bf3cde2fdd8 · outbound

This paper cites Theorem 12.

Byzantine Approximate Agreement on Graphs Theorem 12

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.565527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.797057Z digest=sha256:89078f2d15474280a6fd3df1b462907c7f187d1d2491e18a51613ad508331af3

Observation 2254d231-9ed9-4548-abcb-39567ac4278c · outbound

This paper cites Nevertheless, we have seen that on chordal graphs and cycle-free semilattices we can solve approximate agreement efficiently.

Byzantine Approximate Agreement on Graphs Nevertheless, we have seen that on chordal graphs and cycle-free semilattices we can solve approximate agreement efficiently

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.552521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.802675Z digest=sha256:f4d8b80a42e1dfe2290aecf0b6f2f3f1b6fb5832b4aa505f8cf0d4f624bcf71f

Observation f73ecd86-ea36-4e2f-8c3e-b4e7af175b1c · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 25

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.539563Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.809801Z digest=sha256:90182335eacc56de296a7775f88818b2bcca13fa459680289ab0d791fe5b4195

Observation c6f687b9-85c0-4bc2-b743-99882d912851 · outbound

This paper cites However, our positive results for the asynchronous model hold in cases where the Carathéodory number is at most two.

Byzantine Approximate Agreement on Graphs However, our positive results for the asynchronous model hold in cases where the Carathéodory number is at most two

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.525343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.815960Z digest=sha256:602fdbe010c535cf27976752041f212ffcf78dda86a2ea0d0870725f87cb8679

Observation 13363dce-0fcd-4cd3-a75d-36b1e70d25da · outbound

This paper cites Optimal resilience asynchronous approx- imate agreement.

Byzantine Approximate Agreement on Graphs Optimal resilience asynchronous approx- imate agreement

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.820779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.820779Z digest=sha256:4d53e20f5b11304fb90516afb27b79b74b9ceb3f0f9e859d15d6a11d3d7285ac

Observation 77e2a6ac-52e7-4bb3-90aa-e21b5a6bbd3a · outbound

This paper cites Adaptive and efficient algorithms for lattice agreement and renaming.

Byzantine Approximate Agreement on Graphs Adaptive and efficient algorithms for lattice agreement and renaming

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.511697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.825907Z digest=sha256:78b0f9d2c8346758515a4bd826fb59cd78e5d9d7b915133196ae6cb605998839

Observation a1ca7c21-aa2d-44c1-9597-18794c113e3a · outbound

This paper cites Atomic snapshots using lattice agree- ment.

Byzantine Approximate Agreement on Graphs Atomic snapshots using lattice agree- ment

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.499112Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.830798Z digest=sha256:ecaec25eeea86159e6c8736826b30d9cc2ab34f47c253ed16597f8f6fb9c06fd

Observation a894bf5b-2714-468a-b322-86ec44ab6e00 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 30

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.486391Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.835493Z digest=sha256:674bef75b18f18b2c14d2d088b8d7d5735a2ae8a8abc8131339ba8a9dafcea7b

Observation 1297b36e-a052-46cf-a735-01baba528ac1 · outbound

This paper cites A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.Information Processing Letters, 111:508–511, 2011.

Byzantine Approximate Agreement on Graphs A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.Information Processing Letters, 111:508–511, 2011

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.473931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.839904Z digest=sha256:b57669bbcdf0631ceb27717d25cacae4ab98d7a65a34660b98ff73728a116342

Observation 17f15082-a742-4066-8c22-c4693d25a400 · outbound

This paper cites Easy impossibility proofs fork-set agreement in message passing systems.

Byzantine Approximate Agreement on Graphs Easy impossibility proofs fork-set agreement in message passing systems

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.460828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.844000Z digest=sha256:276268ad91c6635ab4b33b7601ede3b559ce4b0ac065a17ec926831e35c10dc3

Observation 0932b8a0-7a72-4150-8541-1aab44317f98 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.448010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.848977Z digest=sha256:50fac004bb67a9579e24abe9cf47ed3006e5e35605df87e7001fd5e09e22c47a

Observation 69cdeaa4-c372-48c6-9cca-5f5800e865b6 · outbound

This paper cites More choices allow more faults: Set consensus problems in totally asynchronous systems.

Byzantine Approximate Agreement on Graphs More choices allow more faults: Set consensus problems in totally asynchronous systems

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.436377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.852851Z digest=sha256:7067ec43a69c62c10f9da6152bfa4d11b8dddb1cf2450cd1c712d1a0a769f046

Observation 45541856-b5dc-46be-bee6-8fcb502d37a7 · outbound

This paper cites Onk-set consensus problems in asynchronous systems.

Byzantine Approximate Agreement on Graphs Onk-set consensus problems in asynchronous systems

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.424024Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.857699Z digest=sha256:23726bdb3b7748d42700ad0ec7c89f05bfb2fbaef874520bb3149daf59c954c7

Observation 96e0921f-382c-456c-86a7-280aea922e09 · outbound

This paper cites Graph Theory.

Byzantine Approximate Agreement on Graphs Graph Theory

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.411791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.861529Z digest=sha256:4b7661e9b7032d7f7f676818eac44db543c5013ff84ecaf4ab4a9841af3e819a

Observation 7a962794-c705-41c3-a56f-3bae89408954 · outbound

This paper cites Dietrich.

Byzantine Approximate Agreement on Graphs Dietrich

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.398527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.865775Z digest=sha256:e9d122a480bbc25687997112060add1fb50906554ae372e4f879bee809977010

Observation 4ae50f19-dfec-47c2-be1a-f1c7ac60378b · outbound

This paper cites On rigid circuit graphs.

Byzantine Approximate Agreement on Graphs On rigid circuit graphs

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.386311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.869811Z digest=sha256:f64658b39e8059f54f2a387ad8e94437d3090f1f7ed6a6b0bff4803c7022cadf

Observation a081ecb7-83ff-4ab0-a473-d6f8481a8d30 · outbound

This paper cites Fault-tolerant algorithms for tick-generation in asynchronous logic.Journal of the ACM, 61(5):30:1–30:74,.

Byzantine Approximate Agreement on Graphs Fault-tolerant algorithms for tick-generation in asynchronous logic.Journal of the ACM, 61(5):30:1–30:74,

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.373704Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.875039Z digest=sha256:a95a729c7eb4a3f8ebba354c86df4886335de2b65ae26a36f047c7fb9aac1c18

Observation 2094eff6-f464-4c8b-a9cf-ea5edd25d76a · outbound

This paper cites Lynch, Shlomit S.

Byzantine Approximate Agreement on Graphs Lynch, Shlomit S

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.879098Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.879098Z digest=sha256:b6d0e6ff41b62fe85c5e9dd3d96ea34f4f9ecadff7f986044bb2b7b9fcfd6c4a

Observation 833ad8ac-9efc-4c44-a342-06a4247b487b · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.884286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.884286Z digest=sha256:91daa4b2cb45b5d4543e72628e828bd57768172c82a13aa37c849baaaf11139e

Observation 04f9ffa8-c8ae-41f8-9ebc-1a38cbcf54fe · outbound

This paper cites Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M.

Byzantine Approximate Agreement on Graphs Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M

Reference 42

Resolution
verified exact
doi, observed 2026-08-14T14:58:11.353454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.891522Z digest=sha256:db9e9e1418b5b53a40170d8a6f01a2d5aba6f721f158c31a6e1ba771363970e5

Observation 5276bdde-4812-4249-a4b6-96df820fac89 · outbound

This paper cites Convexity in combinatorial structures.

Byzantine Approximate Agreement on Graphs Convexity in combinatorial structures

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.360187Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.898984Z digest=sha256:8df5b81e1bd524e5d417961702e147fdcaf2aaa6470436143369d1dca66ec4e7

Observation b33a52a9-912e-42fe-9fbf-547c6ad3d0d6 · outbound

This paper cites Convex sets in graphs, II.

Byzantine Approximate Agreement on Graphs Convex sets in graphs, II

Reference 44

Resolution
verified exact
doi, observed 2026-08-14T14:58:11.336996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.904900Z digest=sha256:2a79e40f34671629b0e06a7d90e263487e0f356f3cb99e2150ca7fa33be41065

Observation e679fc4f-1ede-4118-a96b-6583aeafb502 · outbound

This paper cites Helly, Radon, and Carathéodory type theorems.

Byzantine Approximate Agreement on Graphs Helly, Radon, and Carathéodory type theorems

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.348239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.909907Z digest=sha256:0c3906727541d4b68afc4dc64c86479f0e0ae8fe0c62ad6d856bd7c938cfe975

Observation ebe769ce-64e9-4a9a-be30-d7f4159ad7e9 · outbound

This paper cites Edelman and Robert E.

Byzantine Approximate Agreement on Graphs Edelman and Robert E

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.914298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.914298Z digest=sha256:471db221ef672766dc22eae5404253d4c3fb9f48e1305e25443cfacef622acf8

Observation a827a546-965a-4ac2-aa43-6d06289c359c · outbound

This paper cites Edelman and Michael E.

Byzantine Approximate Agreement on Graphs Edelman and Michael E

Reference 47

Resolution
verified exact
doi, observed 2026-08-14T14:58:11.309490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.920091Z digest=sha256:f515ee940e0cea6fd0d6ced434a7de55a0405097a4d6abbee504c969e3a4717c

Observation 407b57f7-73f8-4105-b3e0-2f2f5b52e2a2 · outbound

This paper cites Faleiro, Sriram Rajamani, Kaushik Rajan, G.

Byzantine Approximate Agreement on Graphs Faleiro, Sriram Rajamani, Kaushik Rajan, G

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.928373Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.928373Z digest=sha256:7a6f63a9ea78dac627a65b570479ec31aa7203a19c19ab8f18b37f8f6f82063a

Observation f5523cb8-929a-4449-8051-7144299d56e1 · outbound

This paper cites Farber and R.

Byzantine Approximate Agreement on Graphs Farber and R

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.336303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.938597Z digest=sha256:1f5502a35edd1c32ecca4126af99954304f978dfc15b627df13f36f106ccfb89

Observation 144995ec-b762-4832-b909-be4c7a7193b5 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.944375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.944375Z digest=sha256:8ba3c68e26525bed58f12907d208936eb9b4ee314906d1a49de250a9ab180169

Observation de0e6e61-f753-44c3-8c9e-6fb8a7130687 · outbound

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

Byzantine Approximate Agreement on Graphs Asymptotically optimal algorithms for approximate agreement.Distrib- uted Computing, 4(1):9–29, 1990

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.324900Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.950501Z digest=sha256:b3c45c19fbcf9b1726f89fe1621d03fd7c6fee8daa43845156bd78540751d397

Observation 84577dd5-3413-4540-98b8-bfcea009a90e · outbound

This paper cites Asynchronous approximate agreement.Information and Computation, 115(1):95–124, 1994.

Byzantine Approximate Agreement on Graphs Asynchronous approximate agreement.Information and Computation, 115(1):95–124, 1994

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.312871Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.955085Z digest=sha256:ca8e5e691513754e3002eb799280fa481f34f05f1e2588378c32367b5d3d9cee

Observation d1d78413-3f86-4123-88f4-86999cbfa22a · outbound

This paper cites Fischer, Nancy A.

Byzantine Approximate Agreement on Graphs Fischer, Nancy A

Reference 53

Resolution
malformed identifier
no resolver link, observed 2026-08-14T14:58:10.960355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.960355Z digest=sha256:087b44c0383f41cd521450d7007d03aa04dbd6d332f3ad9e6a849ea8530c1b38

Observation 07239e3f-2027-459f-a323-b85867f0ffa1 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 54

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.299470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.964843Z digest=sha256:68508f45920f4c8c4fa359e921a5eece8759e6b10675eddedc2ebc0b77e052bb

Observation 15e8070f-26b2-4e6b-a004-04710b0979ec · outbound

This paper cites Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph.SIAM Journal on Computing, 1(2):180–187, 1972.

Byzantine Approximate Agreement on Graphs Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph.SIAM Journal on Computing, 1(2):180–187, 1972

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.284976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.970216Z digest=sha256:f76154388c66897b39710a92baafc2c88b75c006a6fccd9578b99de4d342f9ce

Observation 95410857-ce41-4e67-b972-99104faabab7 · outbound

This paper cites Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edition, 2013.

Byzantine Approximate Agreement on Graphs Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edition, 2013

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.270785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.974814Z digest=sha256:69d23fc764d5da112d33b7d4d8c72555b93e0cd67f3f514069269db729017e6c

Observation 00eb70b1-e8b1-4615-b7ec-caa708b1bf3d · outbound

This paper cites A classification of wait-free loop agreement tasks.

Byzantine Approximate Agreement on Graphs A classification of wait-free loop agreement tasks

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.258168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.979758Z digest=sha256:ce1c751ad84bfd88f2feba83fcf0c6d32545962b9f96d8d3d2200a7e3ec6797c

Observation a3d3fdeb-159a-4700-a7d3-a149025bf19a · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 58

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.246720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.984879Z digest=sha256:4be4d17df9595ad6475d81cc9d64281015226fdcf0cc575bed8baf623253cbc6

Observation 086a2ed3-21b2-4adc-a9c4-9bb2cbdcba82 · outbound

This paper cites Jamison and Richard Nowakowski.

Byzantine Approximate Agreement on Graphs Jamison and Richard Nowakowski

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:10.989921Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:10.989921Z digest=sha256:c9c5a6bf4105b9b6496b0ac50b906d1da22e1226ce3dcbd13417f96c3f850424

Observation eb290285-8f95-4b10-ad58-dc175b50f890 · outbound

This paper cites A perspective on abstract convexity: classifying alignments by varieties.

Byzantine Approximate Agreement on Graphs A perspective on abstract convexity: classifying alignments by varieties

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.235531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.994401Z digest=sha256:b1c53dfec0e18f41b6c28bca6f2304fa458459f12c25424f2cd1efa1acfc299f

Observation 2fc7acf9-98df-4370-865e-f2889cf50819 · outbound

This paper cites Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers.Pacific Journal of Mathematics, 38(2):471–485, 1971.

Byzantine Approximate Agreement on Graphs Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers.Pacific Journal of Mathematics, 38(2):471–485, 1971

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.219580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.001626Z digest=sha256:9288bae195b9a396c04f2066b4bf540cf8efa93c39efc2e58807a46bae053d57

Observation 23668855-cc6e-40c9-9b54-8e03f9bdec89 · outbound

This paper cites Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs.

Byzantine Approximate Agreement on Graphs Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.206052Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.009620Z digest=sha256:6085e313468e18ef7672c68c57a323842d628f13c3d0b4ef2d104f6b30fe0b04

Observation f0234da4-7f82-477d-8eba-3d07e5369002 · outbound

This paper cites Greedoids – A structural framework for the greedy algorithm.

Byzantine Approximate Agreement on Graphs Greedoids – A structural framework for the greedy algorithm

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:11.022091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.022091Z digest=sha256:dcf1fa1ba6a4cddf5312c434c2f63638af61515c6f5d2c352916a28209451ff3

Observation f2ebe61b-82d8-4340-bdd0-fe8686696ccc · outbound

This paper cites Springer Science & Business Media, 2012.

Byzantine Approximate Agreement on Graphs Springer Science & Business Media, 2012

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.190558Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.026643Z digest=sha256:60f7b590e1859ce1e2d19b4262b42c1c5524f9cc131c752e921ff48ea9814203

Observation 7fb564c1-63e9-46ef-b6bc-6588c5f538dc · outbound

This paper cites Lauritzen.Graphical models, volume 17.

Byzantine Approximate Agreement on Graphs Lauritzen.Graphical models, volume 17

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.174613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.030837Z digest=sha256:86fc85c66103e0e27a4b2c7643617afa411080a7acd8433e5c59c6fb2fc51f1f

Observation b3ee59c8-df74-495c-9ae6-bd4722672878 · outbound

This paper cites Near-optimal self-stabilising counting and firing squads.

Byzantine Approximate Agreement on Graphs Near-optimal self-stabilising counting and firing squads

Reference 67

Resolution
verified exact
doi, observed 2026-08-14T14:58:11.253665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.035566Z digest=sha256:f502e4a5409694600112db42e08188ed59d2a8b2b6f360a0c6261a41b9dbdaf9

Observation 01bc33ce-4108-44c2-aebe-c12e3ca1c856 · outbound

This paper cites Self-stabilising Byzantine clock synchronisation is almost as easy as consensus.Journal of the ACM, 2019.

Byzantine Approximate Agreement on Graphs Self-stabilising Byzantine clock synchronisation is almost as easy as consensus.Journal of the ACM, 2019

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.160752Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.040397Z digest=sha256:84ae1f416116f0ab95a7dd40cd5edad895d1db0c8122c317e9e71cf83b04c2d1

Observation fbb4fa50-7485-481a-a83b-e9fd92a451c4 · outbound

This paper cites Classifying rendezvous tasks of arbitrary dimension.

Byzantine Approximate Agreement on Graphs Classifying rendezvous tasks of arbitrary dimension

Reference 69

Resolution
malformed identifier
no resolver link, observed 2026-08-14T14:58:11.044374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.044374Z digest=sha256:e936253b030b44ef926dee26cd2474d518232d23746379b48dba1daa1833f4f6

Observation c3f98f1d-a5f7-447c-970c-edbe3eef54a9 · outbound

This paper cites Communication complexity and combinatorial lattice theory.

Byzantine Approximate Agreement on Graphs Communication complexity and combinatorial lattice theory

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.138223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.048567Z digest=sha256:22935c0ef45444bd4158bc41c25469907f50a0f5f39636c46ec904420cf20e20

Observation 9971f90c-a4eb-4319-8906-2d25a40e25fa · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 71

Resolution
verified exact
doi, observed 2026-08-14T14:58:11.215418Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.052890Z digest=sha256:58b379ff732f4e45668c1a5f2aa950c7f37af7fb9eccd5e6acf8ce447cbcd602

Observation a08ff37d-1810-48f5-9d0f-4fc8bd8c8a20 · outbound

This paper cites Multidimensional approximate agreement in Byzantine asynchronous systems.Proc.

Byzantine Approximate Agreement on Graphs Multidimensional approximate agreement in Byzantine asynchronous systems.Proc

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:11.058093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.058093Z digest=sha256:5acfb756af7140c0dc58a9e1b29bd94860f6f94d40d24232330724da46f9d778

Observation 4375ac72-5f9d-49d6-ada2-e26e579e921a · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 73

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.113297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.064673Z digest=sha256:fc5606497fe598f8d1aa59156907b369af9875329a1e9fff275eec4f01ea8d88

Observation ebb4f9f2-254a-46e3-bed5-6bfab1a31397 · outbound

This paper cites Nielsen and Ortrud R.

Byzantine Approximate Agreement on Graphs Nielsen and Ortrud R

Reference 74

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.096190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.073499Z digest=sha256:1d4acfe576392ac02509c4e33b86b923f2e368b758628052e434ed1a1f17435f

Observation f014836e-169a-4366-b03c-b4e1cb8aa8ff · outbound

This paper cites Pease, Robert E.

Byzantine Approximate Agreement on Graphs Pease, Robert E

Reference 75

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:11.079915Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.079915Z digest=sha256:bb42b76dd5370da297d0f6e42d15ac839eb5c442e458826424b08cce4ea962f0

Observation d52f0bc5-2bfa-49ab-991c-c0088ef0c2e0 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 76

Resolution
malformed identifier
raw_fallback, observed 2026-08-14T14:58:12.081799Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.086052Z digest=sha256:86901348fe8cb5f1cccf54b6299285482ddc883c289f385e2e82a7473290da47

Observation 5f3f062a-c91d-47d1-b7a5-eb04b683e32e · outbound

This paper cites Convexities on ordered structures have their Krein–Milman theorem.Journal of Convex Analysis, 21(1):89–120, 2014.

Byzantine Approximate Agreement on Graphs Convexities on ordered structures have their Krein–Milman theorem.Journal of Convex Analysis, 21(1):89–120, 2014

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.067302Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.092799Z digest=sha256:c6858c1350d072cd3a8519751594130bddcc77926e013fd2b895708c84130e91

Observation 32ca3529-f6f9-4bee-a0bf-d70252033eb1 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 78

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.052836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.098922Z digest=sha256:c6a8a8aa3192f357f9860888a3947439e41a397fabc7479459fded3a8bf7f349

Observation 88c067b6-b73c-470a-8f50-cf9c5694d3d2 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 79

Resolution
unresolved
raw_fallback, observed 2026-08-14T14:58:12.037779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.103388Z digest=sha256:64cbe14f24735bb418b825ce3f63edcad0222aaa5e4c11a811dddf4cf53b781c

Observation 794cc4cf-ac57-43b2-aec8-e71a3b6a419d · outbound

This paper cites Simulating authenticated broadcasts to derive simple fault- tolerant algorithms.

Byzantine Approximate Agreement on Graphs Simulating authenticated broadcasts to derive simple fault- tolerant algorithms

Reference 80

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:12.021597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.109494Z digest=sha256:ba1859a59507203583ebabef492e3c6cadb6e5cff13c28308bca79b3adbf8f82

Observation 64ab1b53-fccf-46d0-a461-a46c6ec4d82e · outbound

This paper cites Vaidya and Vijay K.

Byzantine Approximate Agreement on Graphs Vaidya and Vijay K

Reference 81

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:11.996717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.114910Z digest=sha256:c134289c9bc4be8619bea9e6a58b6e34f5e04b8bc5af7085212a0495896b9c61

Observation 306ea85c-b3b1-425a-ae5a-8a073f65a7e2 · outbound

This paper cites Elsevier, 1993.

Byzantine Approximate Agreement on Graphs Elsevier, 1993

Reference 82

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:11.978638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.122609Z digest=sha256:76eb959380d9b058f1b4c86b3f351f45854544dcbb628f521caddb44253e70df

Observation cf871bba-94cf-4438-bd80-3c45e5c2adfb · outbound

This paper cites Chordal graphs and semidefinite optimization.

Byzantine Approximate Agreement on Graphs Chordal graphs and semidefinite optimization

Reference 83

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:11.961663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.144106Z digest=sha256:424b1af92d34cf36e80c429b447803c099e47a5d18046429f49b3f8643f8c40c

Observation edfc97ca-6790-45b5-8e27-28581b29dc42 · outbound

This paper cites A new fault-tolerant algorithm for clock synchronization.

Byzantine Approximate Agreement on Graphs A new fault-tolerant algorithm for clock synchronization

Reference 84

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:58:11.940835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:11.148736Z digest=sha256:f75719318f9e34b90ee7e707405cf42a541b5651353f3a8a69ff5e603c110d2c

Observation 9e4fde5d-047e-4a2a-ad81-4a97cf6271e2 · outbound

This paper cites an unresolved cited work.

Byzantine Approximate Agreement on Graphs Unresolved cited work

Reference 85

Resolution
malformed identifier
no resolver link, observed 2026-08-14T14:58:11.153758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.153758Z digest=sha256:5df717699973c8b0c079f7b9e9bf6a7d0367c0b6c2d2ac9540b43c60f0002f0b

Observation b7d682cb-283a-4c0b-aa8c-976683437984 · outbound

This paper cites doi:10.1145/3212734.3212787.

Byzantine Approximate Agreement on Graphs doi:10.1145/3212734.3212787

Reference 2018

Resolution
unresolved
no resolver link, observed 2026-08-14T14:58:11.016196Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:58:11.016196Z digest=sha256:7746967839fdaf23749b83065f3bff34a9ad6c1634aece7db0601baf5b56c72c

Pith citing papers

Observation aaabed31-e7d7-4c7f-ae4a-a74417a720d3 · inbound

Byzantine Approximate Agreement on Graphs cites this paper.

Byzantine Approximate Agreement on Graphs Byzantine Approximate Agreement on Graphs

Reference 2

Resolution
metadata mismatch
local_arxiv, observed 2026-08-14T14:58:11.925705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T14:58:10.690306Z digest=sha256:a97f20f3c348e87e73052b517ccf7e5e0c55554ea3890860167c36614965eb46