{"as_of":"2026-08-17T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbc3a324960d118ae05461a45629b3312ac2510ab442311fbf2faacedc0fd677","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:58:11.153758Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:58:10.690306Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T14:58:11.920287Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"cited_work":{"arxiv_id":"1908.02743","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.02743","snapshot_observed_at":"2026-08-14T14:58:11.920287Z","title":"Byzantine Approximate Agreement on Graphs","venue":"cs.DC","work_id":"ac2f1742-9975-4081-9bc2-80e088bddf76","year":2019},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.690306Z"},"links":{"cited_paper":"/paper/1908.02743","citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:a97f20f3c348e87e73052b517ccf7e5e0c55554ea3890860167c36614965eb46","observation_id":"aaabed31-e7d7-4c7f-ae4a-a74417a720d3","resolution":{"observed_at":"2026-08-14T14:58:11.925705Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.02743/citation-record","integrity":"/paper/1908.02743/integrity","json":"/paper/1908.02743/citation-record.json","paper":"/paper/1908.02743"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.685267Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.685267Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:4eb1ba5a137415f4465f6645fc634c9e81016dc979defadf7808fb7618f48c48","observation_id":"e463352f-1b6b-4259-86f7-51f79a917703","resolution":{"observed_at":"2026-08-14T14:58:10.685267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"cited_work":{"arxiv_id":"1908.02743","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.02743","snapshot_observed_at":"2026-08-14T14:58:11.920287Z","title":"Byzantine Approximate Agreement on Graphs","venue":"cs.DC","work_id":"ac2f1742-9975-4081-9bc2-80e088bddf76","year":2019},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.690306Z"},"links":{"cited_paper":"/paper/1908.02743","citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:a97f20f3c348e87e73052b517ccf7e5e0c55554ea3890860167c36614965eb46","observation_id":"aaabed31-e7d7-4c7f-ae4a-a74417a720d3","resolution":{"observed_at":"2026-08-14T14:58:11.925705Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.695435Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.695435Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:3f7c9e59d35d3666881e4983f94c29754239a28d4eb03be4775dd9456c10a711","observation_id":"1fd5e5f3-eb4e-4016-87b6-0091eee20a8f","resolution":{"observed_at":"2026-08-14T14:58:10.695435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.700100Z","title":"We give algorithms for approximate agreement on trees and chordal graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.700100Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:30041388461838812ee361626d95413a7974d50b381dd3ab13c53a8c7c69f96d","observation_id":"5993c152-33ca-4515-b210-08b75b3fe0c6","resolution":{"observed_at":"2026-08-14T14:58:10.700100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.705687Z","title":"To our knowledge, this is the first algorithm that solves any variant of semilattice agreement under Byzantine faults","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.705687Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:4f6208d018ab403a0ca95bf4e623d3e33ab25e17246019f70f557ce19533bfee","observation_id":"a7fe7a1c-290d-415b-9400-9be9934c0667","resolution":{"observed_at":"2026-08-14T14:58:10.705687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.710248Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.710248Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:b22e9267e7ee41147c3fc2ab901553d8c95914e13f8a52f4aee0eb3563a9a851","observation_id":"845766bc-2369-48b6-b9a1-e03b712dd9b1","resolution":{"observed_at":"2026-08-14T14:58:10.710248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.791054Z","title":"We consider the exact variant of the abstract approximate agreement problem, where the agreement constraint is replaced by|Y| = 1","venue":null,"work_id":"890ed94f-241e-4f67-bdd8-a9a2f45d1702","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.716982Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:e7ce1970c9ebe5c55fb4cc0d15d4ed6e881e7be5ae9d98896bcfa1a3c38d2181","observation_id":"73f257ab-77d8-4435-8a4e-ba0f7531f851","resolution":{"observed_at":"2026-08-14T14:58:12.797310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.769633Z","title":null,"venue":null,"work_id":"ec20caeb-cc6f-474f-91e6-b4314cac9e1b","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.722341Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:710fc702e4eee65cc416337115a18b86471c43a1d4b4329a86a5dbaf7935ab37","observation_id":"b60a5166-4d0d-4a81-a266-0c0fa1720ef7","resolution":{"observed_at":"2026-08-14T14:58:12.774590Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.755052Z","title":null,"venue":null,"work_id":"d9884e4b-31fd-4fac-baca-0ec80b23d27a","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.727453Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:065b5bdc6cd8812bad1f47784ded672d233adadbc15277c465add79a85390b8c","observation_id":"ea381f55-990c-4ce6-812f-6e61b4e48799","resolution":{"observed_at":"2026-08-14T14:58:12.759865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.741162Z","title":null,"venue":null,"work_id":"8477235d-7b5a-482a-8a68-95ecbe5fb659","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.731545Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:5ea85013ee3281f267f74f42ff2d19a30698ca9109aae93f954e11ee05046cbd","observation_id":"2fc45590-167a-49e4-97d8-ac5a3ad6c4d9","resolution":{"observed_at":"2026-08-14T14:58:12.746152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.726573Z","title":null,"venue":null,"work_id":"081d401e-cb5e-4278-bd4b-c4047afec6f0","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.736831Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:6074f5337343448b9a7a1cf765a7c58c674ebb722555ebf6017c01737f5d2319","observation_id":"6ee9eef7-174c-41a2-a2e6-8354c4d3352f","resolution":{"observed_at":"2026-08-14T14:58:12.731144Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.711713Z","title":null,"venue":null,"work_id":"5d03da48-137e-444c-9b6f-83af708e55d6","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.740794Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:d9964b52f9fe3ce70c407168e49f74c0a86af1a84032afee79e93f060d1b9e10","observation_id":"36cd183a-8007-46b0-a6ab-56a42fc5f393","resolution":{"observed_at":"2026-08-14T14:58:12.717099Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.698073Z","title":"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)","venue":null,"work_id":"7acb130d-8740-463a-a886-a9b1497ba52a","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.745350Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:50fe6e75d4ca3f723cad8ed4fbb98156887ebf34255f2b18ac62e5e5065add0d","observation_id":"55d3351e-399e-4751-89ab-18a122637a0b","resolution":{"observed_at":"2026-08-14T14:58:12.703040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.684566Z","title":"easy to peel","venue":null,"work_id":"f82315bf-b7dc-476a-912b-703a89390f19","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.749602Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f13107ce6fcf268103fb389ef697d22fe9383c6c7b4a1b415e20f9fa551957d4","observation_id":"c747d3ac-c785-42e6-acfa-a73727e74561","resolution":{"observed_at":"2026-08-14T14:58:12.689030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.665484Z","title":null,"venue":null,"work_id":"fc2a78a4-78e5-4737-a174-422ab9e3bcba","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.755037Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:dac47cc652fbf54e600cde92ef81eb22461e51d88eb03259c27f8bbb271ae94b","observation_id":"f454a26e-fb54-4a50-8013-66c019125b7a","resolution":{"observed_at":"2026-08-14T14:58:12.669731Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.653083Z","title":null,"venue":null,"work_id":"4caae818-1531-40c8-a8dc-99f20058e8da","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.760106Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:9d0db87f5ec421ad4065cefa8de15bda3dc602d2fadd4d04b8f9d05342e6ef21","observation_id":"8689732a-314a-4506-87c9-ccea27892e95","resolution":{"observed_at":"2026-08-14T14:58:12.657476Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.640059Z","title":null,"venue":null,"work_id":"bc5f75a9-f08a-414e-af90-ddf4752123ee","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.766796Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:a34c10ad417c9f03ba35db86812c8a229165b9ec4a84900bcd77acc59a27eae0","observation_id":"779af3af-4bc5-43b4-a581-74c1c26ccf1e","resolution":{"observed_at":"2026-08-14T14:58:12.645008Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.627060Z","title":"Since thebi(·) values are updated using the algorithmA, these values converge onto a single edge{a,b}∈ E(T ) in the treeT","venue":null,"work_id":"2e7b0ab4-0dc3-468f-b378-40e34318221d","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.771392Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f60bd0e13cecdf43e2d732b523ce7f1e7e5c51a6ccb0760a373b26bd22671942","observation_id":"6f908d14-a7d8-42f7-a682-f58c64db10c8","resolution":{"observed_at":"2026-08-14T14:58:12.631549Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.615184Z","title":null,"venue":null,"work_id":"8407238d-6550-4eee-97f8-476fd1d10f7f","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.778176Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:3a31404b9ae9513936a20da4a054585cc0770f2d7caa438f271a9d2c6e05d5cb","observation_id":"c5fa3285-29fb-4e64-8bdd-83df55568d3d","resolution":{"observed_at":"2026-08-14T14:58:12.619493Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.601417Z","title":null,"venue":null,"work_id":"d204ce21-7274-4682-8b6d-376f0e7fe2ed","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.782753Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:a65d3f7dce62fe4a06f631886bc3652ab28f37dac2f48aaa8e48d25021fed9a9","observation_id":"3c36fc62-5133-46e5-bf1c-c33cd4fd1a15","resolution":{"observed_at":"2026-08-14T14:58:12.606974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.587883Z","title":"6.2 Upper bound for convex consensus We start with the positive result given by Theorem 7","venue":null,"work_id":"8d51d243-4d9a-4ac5-bbe8-0919d008290e","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.786794Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:81cb410b5be1fb43b0516a21deec1a7d0d793be30d26d3832b1acf5f48db8d32","observation_id":"1e7bcb2f-76c9-4d62-a15d-4c72aee33ea4","resolution":{"observed_at":"2026-08-14T14:58:12.593530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.574386Z","title":null,"venue":null,"work_id":"8841ee29-ffb0-40c0-a248-dfe71fffc2df","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.791783Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:fff8f746a417206c433af98a2d7649d80558a0bd91bc7623deca8f83ec6ad0de","observation_id":"01dd6f25-6a81-44b0-ae2c-97a0b11c40c6","resolution":{"observed_at":"2026-08-14T14:58:12.579071Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.560911Z","title":"Theorem 12","venue":null,"work_id":"a6e639c4-2e54-46f4-b158-649aa49ed73d","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.797057Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:89078f2d15474280a6fd3df1b462907c7f187d1d2491e18a51613ad508331af3","observation_id":"225070f6-1106-4314-b2f0-1bf3cde2fdd8","resolution":{"observed_at":"2026-08-14T14:58:12.565527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.547995Z","title":"Nevertheless, we have seen that on chordal graphs and cycle-free semilattices we can solve approximate agreement efficiently","venue":null,"work_id":"0120ea7c-095b-4a58-a888-879b3df9e42b","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.802675Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f4d8b80a42e1dfe2290aecf0b6f2f3f1b6fb5832b4aa505f8cf0d4f624bcf71f","observation_id":"2254d231-9ed9-4548-abcb-39567ac4278c","resolution":{"observed_at":"2026-08-14T14:58:12.552521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.535090Z","title":null,"venue":null,"work_id":"5c5c4fab-d725-4d51-bc96-2b7e52cc5169","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.809801Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:90182335eacc56de296a7775f88818b2bcca13fa459680289ab0d791fe5b4195","observation_id":"f73ecd86-ea36-4e2f-8c3e-b4e7af175b1c","resolution":{"observed_at":"2026-08-14T14:58:12.539563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.520929Z","title":"However, our positive results for the asynchronous model hold in cases where the Carathéodory number is at most two","venue":null,"work_id":"bccbf496-58c5-44b1-a20a-b4b704ef5deb","year":2018},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.815960Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:602fdbe010c535cf27976752041f212ffcf78dda86a2ea0d0870725f87cb8679","observation_id":"c6f687b9-85c0-4bc2-b743-99882d912851","resolution":{"observed_at":"2026-08-14T14:58:12.525343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.820779Z","title":"Optimal resilience asynchronous approx- imate agreement","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.820779Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:4d53e20f5b11304fb90516afb27b79b74b9ceb3f0f9e859d15d6a11d3d7285ac","observation_id":"13363dce-0fcd-4cd3-a75d-36b1e70d25da","resolution":{"observed_at":"2026-08-14T14:58:10.820779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.507156Z","title":"Adaptive and efficient algorithms for lattice agreement and renaming","venue":null,"work_id":"2f09e74f-a4aa-4d48-8675-70e2ed812fdf","year":2001},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.825907Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:78b0f9d2c8346758515a4bd826fb59cd78e5d9d7b915133196ae6cb605998839","observation_id":"77e2a6ac-52e7-4bb3-90aa-e21b5a6bbd3a","resolution":{"observed_at":"2026-08-14T14:58:12.511697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.494327Z","title":"Atomic snapshots using lattice agree- ment","venue":null,"work_id":"623556d0-bffe-4b6f-8ba5-080d963da361","year":1995},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.830798Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:ecaec25eeea86159e6c8736826b30d9cc2ab34f47c253ed16597f8f6fb9c06fd","observation_id":"a1ca7c21-aa2d-44c1-9597-18794c113e3a","resolution":{"observed_at":"2026-08-14T14:58:12.499112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.482098Z","title":null,"venue":null,"work_id":"93413792-2757-4496-a1c2-b2ea05dcda4e","year":2012},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.835493Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:674bef75b18f18b2c14d2d088b8d7d5735a2ae8a8abc8131339ba8a9dafcea7b","observation_id":"a894bf5b-2714-468a-b322-86ec44ab6e00","resolution":{"observed_at":"2026-08-14T14:58:12.486391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.469456Z","title":"A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.Information Processing Letters, 111:508–511, 2011","venue":null,"work_id":"0d075727-ebfa-453c-97c3-c3c3a8674fea","year":2011},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.839904Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:b57669bbcdf0631ceb27717d25cacae4ab98d7a65a34660b98ff73728a116342","observation_id":"1297b36e-a052-46cf-a735-01baba528ac1","resolution":{"observed_at":"2026-08-14T14:58:12.473931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.456672Z","title":"Easy impossibility proofs fork-set agreement in message passing systems","venue":null,"work_id":"506a427e-ab94-453d-ba6d-7339e5f56c45","year":2011},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.844000Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:276268ad91c6635ab4b33b7601ede3b559ce4b0ac065a17ec926831e35c10dc3","observation_id":"17f15082-a742-4066-8c22-c4693d25a400","resolution":{"observed_at":"2026-08-14T14:58:12.460828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.443741Z","title":null,"venue":null,"work_id":"849ddab2-858e-4b37-b48c-3f97af951820","year":1993},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.848977Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:50fac004bb67a9579e24abe9cf47ed3006e5e35605df87e7001fd5e09e22c47a","observation_id":"0932b8a0-7a72-4150-8541-1aab44317f98","resolution":{"observed_at":"2026-08-14T14:58:12.448010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.432284Z","title":"More choices allow more faults: Set consensus problems in totally asynchronous systems","venue":null,"work_id":"1753bbfd-798b-41fd-b474-2ed86cd3ef41","year":1993},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.852851Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:7067ec43a69c62c10f9da6152bfa4d11b8dddb1cf2450cd1c712d1a0a769f046","observation_id":"69cdeaa4-c372-48c6-9cca-5f5800e865b6","resolution":{"observed_at":"2026-08-14T14:58:12.436377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.419545Z","title":"Onk-set consensus problems in asynchronous systems","venue":null,"work_id":"f706e07d-10bb-4c5c-b3f0-9a92b21ac6cc","year":2001},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.857699Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:23726bdb3b7748d42700ad0ec7c89f05bfb2fbaef874520bb3149daf59c954c7","observation_id":"45541856-b5dc-46be-bee6-8fcb502d37a7","resolution":{"observed_at":"2026-08-14T14:58:12.424024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.407149Z","title":"Graph Theory","venue":null,"work_id":"f490da80-9f3e-4dc3-b628-827b9be33b97","year":2010},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.861529Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:4b7661e9b7032d7f7f676818eac44db543c5013ff84ecaf4ab4a9841af3e819a","observation_id":"96e0921f-382c-456c-86a7-280aea922e09","resolution":{"observed_at":"2026-08-14T14:58:12.411791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.393988Z","title":"Dietrich","venue":null,"work_id":"1d9d8ef5-3269-4498-a343-912c693116d0","year":1989},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.865775Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:e9d122a480bbc25687997112060add1fb50906554ae372e4f879bee809977010","observation_id":"7a962794-c705-41c3-a56f-3bae89408954","resolution":{"observed_at":"2026-08-14T14:58:12.398527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.382471Z","title":"On rigid circuit graphs","venue":null,"work_id":"d68b1912-130b-4ca2-867c-2f9bf95cd145","year":1961},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.869811Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f64658b39e8059f54f2a387ad8e94437d3090f1f7ed6a6b0bff4803c7022cadf","observation_id":"4ae50f19-dfec-47c2-be1a-f1c7ac60378b","resolution":{"observed_at":"2026-08-14T14:58:12.386311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.368502Z","title":"Fault-tolerant algorithms for tick-generation in asynchronous logic.Journal of the ACM, 61(5):30:1–30:74,","venue":null,"work_id":"ec85368b-440e-494d-b755-cccea3618d1e","year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.875039Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:a95a729c7eb4a3f8ebba354c86df4886335de2b65ae26a36f047c7fb9aac1c18","observation_id":"a081ecb7-83ff-4ab0-a473-d6f8481a8d30","resolution":{"observed_at":"2026-08-14T14:58:12.373704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.879098Z","title":"Lynch, Shlomit S","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.879098Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:b6d0e6ff41b62fe85c5e9dd3d96ea34f4f9ecadff7f986044bb2b7b9fcfd6c4a","observation_id":"2094eff6-f464-4c8b-a9cf-ea5edd25d76a","resolution":{"observed_at":"2026-08-14T14:58:10.879098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.884286Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.884286Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:91daa4b2cb45b5d4543e72628e828bd57768172c82a13aa37c849baaaf11139e","observation_id":"833ad8ac-9efc-4c44-a342-06a4247b487b","resolution":{"observed_at":"2026-08-14T14:58:10.884286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2013.09.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.347849Z","title":"Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M","venue":null,"work_id":"afba14de-58b2-42e0-91b1-74af651234f6","year":2013},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.891522Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:db9e9e1418b5b53a40170d8a6f01a2d5aba6f721f158c31a6e1ba771363970e5","observation_id":"04f9ffa8-c8ae-41f8-9ebc-1a38cbcf54fe","resolution":{"observed_at":"2026-08-14T14:58:11.353454Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.356163Z","title":"Convexity in combinatorial structures","venue":null,"work_id":"5cb1b281-32b9-4bc0-8483-6cdaf9628065","year":1987},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.898984Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:8df5b81e1bd524e5d417961702e147fdcaf2aaa6470436143369d1dca66ec4e7","observation_id":"5276bdde-4812-4249-a4b6-96df820fac89","resolution":{"observed_at":"2026-08-14T14:58:12.360187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0095-8956(88)90039-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.330683Z","title":"Convex sets in graphs, II","venue":null,"work_id":"5d89872d-4d95-47b9-a35a-e516e996b61a","year":1988},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.904900Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:2a79e40f34671629b0e06a7d90e263487e0f356f3cb99e2150ca7fa33be41065","observation_id":"b33a52a9-912e-42fe-9fbf-547c6ad3d0d6","resolution":{"observed_at":"2026-08-14T14:58:11.336996Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.344168Z","title":"Helly, Radon, and Carathéodory type theorems","venue":null,"work_id":"e4a9fddc-c7d5-42fc-ba0e-02679d0fa45e","year":1993},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.909907Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:0c3906727541d4b68afc4dc64c86479f0e0ae8fe0c62ad6d856bd7c938cfe975","observation_id":"e679fc4f-1ede-4118-a96b-6583aeafb502","resolution":{"observed_at":"2026-08-14T14:58:12.348239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.914298Z","title":"Edelman and Robert E","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.914298Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:471db221ef672766dc22eae5404253d4c3fb9f48e1305e25443cfacef622acf8","observation_id":"ebe769ce-64e9-4a9a-be30-d7f4159ad7e9","resolution":{"observed_at":"2026-08-14T14:58:10.914298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00143895","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.303471Z","title":"Edelman and Michael E","venue":null,"work_id":"a6d19ba9-48f5-4d80-aba1-5b5e7c008860","year":1988},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.920091Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f515ee940e0cea6fd0d6ced434a7de55a0405097a4d6abbee504c969e3a4717c","observation_id":"a827a546-965a-4ac2-aa43-6d06289c359c","resolution":{"observed_at":"2026-08-14T14:58:11.309490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.928373Z","title":"Faleiro, Sriram Rajamani, Kaushik Rajan, G","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.928373Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:7a6f63a9ea78dac627a65b570479ec31aa7203a19c19ab8f18b37f8f6f82063a","observation_id":"407b57f7-73f8-4105-b3e0-2f2f5b52e2a2","resolution":{"observed_at":"2026-08-14T14:58:10.928373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.332409Z","title":"Farber and R","venue":null,"work_id":"d61d06b4-cf85-405a-ae85-277172571b49","year":1986},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.938597Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:1f5502a35edd1c32ecca4126af99954304f978dfc15b627df13f36f106ccfb89","observation_id":"f5523cb8-929a-4449-8051-7144299d56e1","resolution":{"observed_at":"2026-08-14T14:58:12.336303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.944375Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.944375Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:8ba3c68e26525bed58f12907d208936eb9b4ee314906d1a49de250a9ab180169","observation_id":"144995ec-b762-4832-b909-be4c7a7193b5","resolution":{"observed_at":"2026-08-14T14:58:10.944375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.320828Z","title":"Asymptotically optimal algorithms for approximate agreement.Distrib- uted Computing, 4(1):9–29, 1990","venue":null,"work_id":"16f12509-a1ee-41dc-b39d-2bd11b228a67","year":1990},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.950501Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:b3c45c19fbcf9b1726f89fe1621d03fd7c6fee8daa43845156bd78540751d397","observation_id":"de0e6e61-f753-44c3-8c9e-6fb8a7130687","resolution":{"observed_at":"2026-08-14T14:58:12.324900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.308587Z","title":"Asynchronous approximate agreement.Information and Computation, 115(1):95–124, 1994","venue":null,"work_id":"b62a5bd5-2e0c-464d-89f4-02b6854d983a","year":1994},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.955085Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:ca8e5e691513754e3002eb799280fa481f34f05f1e2588378c32367b5d3d9cee","observation_id":"84577dd5-3413-4540-98b8-bfcea009a90e","resolution":{"observed_at":"2026-08-14T14:58:12.312871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.960355Z","title":"Fischer, Nancy A","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.960355Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:087b44c0383f41cd521450d7007d03aa04dbd6d332f3ad9e6a849ea8530c1b38","observation_id":"d1d78413-3f86-4123-88f4-86999cbfa22a","resolution":{"observed_at":"2026-08-14T14:58:10.960355Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.294815Z","title":null,"venue":null,"work_id":"ce59b2bc-c443-495b-aecd-b7b5bbf8ff74","year":2007},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.964843Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:68508f45920f4c8c4fa359e921a5eece8759e6b10675eddedc2ebc0b77e052bb","observation_id":"07239e3f-2027-459f-a323-b85867f0ffa1","resolution":{"observed_at":"2026-08-14T14:58:12.299470Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.279481Z","title":"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","venue":null,"work_id":"288a0ca9-9aaa-4f4e-b682-60ed14ce1786","year":1972},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.970216Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f76154388c66897b39710a92baafc2c88b75c006a6fccd9578b99de4d342f9ce","observation_id":"15e8070f-26b2-4e6b-a004-04710b0979ec","resolution":{"observed_at":"2026-08-14T14:58:12.284976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.266383Z","title":"Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edition, 2013","venue":null,"work_id":"e0b99525-7da4-4b74-a804-7f3b217c54ec","year":2013},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.974814Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:69d23fc764d5da112d33b7d4d8c72555b93e0cd67f3f514069269db729017e6c","observation_id":"95410857-ce41-4e67-b972-99104faabab7","resolution":{"observed_at":"2026-08-14T14:58:12.270785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.254185Z","title":"A classification of wait-free loop agreement tasks","venue":null,"work_id":"ed951adb-77b9-4bf8-85ed-b4a518cff730","year":2003},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.979758Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:ce1c751ad84bfd88f2feba83fcf0c6d32545962b9f96d8d3d2200a7e3ec6797c","observation_id":"00eb70b1-e8b1-4615-b7ec-caa708b1bf3d","resolution":{"observed_at":"2026-08-14T14:58:12.258168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.242904Z","title":null,"venue":null,"work_id":"be0f09e7-2fea-46af-8151-b716643d8002","year":1998},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.984879Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:4be4d17df9595ad6475d81cc9d64281015226fdcf0cc575bed8baf623253cbc6","observation_id":"a3d3fdeb-159a-4700-a7d3-a149025bf19a","resolution":{"observed_at":"2026-08-14T14:58:12.246720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:10.989921Z","title":"Jamison and Richard Nowakowski","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.989921Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:c9c5a6bf4105b9b6496b0ac50b906d1da22e1226ce3dcbd13417f96c3f850424","observation_id":"086a2ed3-21b2-4adc-a9c4-9bb2cbdcba82","resolution":{"observed_at":"2026-08-14T14:58:10.989921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.231214Z","title":"A perspective on abstract convexity: classifying alignments by varieties","venue":null,"work_id":"c1b66e8d-2561-47dc-8bb7-f5b7a2241694","year":1982},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:10.994401Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:b1c53dfec0e18f41b6c28bca6f2304fa458459f12c25424f2cd1efa1acfc299f","observation_id":"eb290285-8f95-4b10-ad58-dc175b50f890","resolution":{"observed_at":"2026-08-14T14:58:12.235531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.215297Z","title":"Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers.Pacific Journal of Mathematics, 38(2):471–485, 1971","venue":null,"work_id":"6cb2a72f-2b93-409c-b0de-7bbcd524decf","year":1971},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.001626Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:9288bae195b9a396c04f2066b4bf540cf8efa93c39efc2e58807a46bae053d57","observation_id":"2fc7acf9-98df-4370-865e-f2889cf50819","resolution":{"observed_at":"2026-08-14T14:58:12.219580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.200756Z","title":"Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs","venue":null,"work_id":"049142be-131b-432d-8181-4d2f01008095","year":2018},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.009620Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:6085e313468e18ef7672c68c57a323842d628f13c3d0b4ef2d104f6b30fe0b04","observation_id":"23668855-cc6e-40c9-9b54-8e03f9bdec89","resolution":{"observed_at":"2026-08-14T14:58:12.206052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.022091Z","title":"Greedoids – A structural framework for the greedy algorithm","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.022091Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:dcf1fa1ba6a4cddf5312c434c2f63638af61515c6f5d2c352916a28209451ff3","observation_id":"f0234da4-7f82-477d-8eba-3d07e5369002","resolution":{"observed_at":"2026-08-14T14:58:11.022091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.184103Z","title":"Springer Science & Business Media, 2012","venue":null,"work_id":"fcc9727f-9741-4622-a69c-5efe10b97668","year":2012},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.026643Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:60f7b590e1859ce1e2d19b4262b42c1c5524f9cc131c752e921ff48ea9814203","observation_id":"f2ebe61b-82d8-4340-bdd0-fe8686696ccc","resolution":{"observed_at":"2026-08-14T14:58:12.190558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.169644Z","title":"Lauritzen.Graphical models, volume 17","venue":null,"work_id":"76707039-04d7-4cd5-b19c-d492924b4302","year":1996},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.030837Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:86fc85c66103e0e27a4b2c7643617afa411080a7acd8433e5c59c6fb2fc51f1f","observation_id":"7fb564c1-63e9-46ef-b6bc-6588c5f538dc","resolution":{"observed_at":"2026-08-14T14:58:12.174613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00446-018-0342-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.244810Z","title":"Near-optimal self-stabilising counting and firing squads","venue":null,"work_id":"f375460c-c4eb-40a7-9553-bd1aa3492a6a","year":2018},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.035566Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f502e4a5409694600112db42e08188ed59d2a8b2b6f360a0c6261a41b9dbdaf9","observation_id":"b3ee59c8-df74-495c-9ae6-bd4722672878","resolution":{"observed_at":"2026-08-14T14:58:11.253665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.155183Z","title":"Self-stabilising Byzantine clock synchronisation is almost as easy as consensus.Journal of the ACM, 2019","venue":null,"work_id":"7b7fd16d-2e1d-44ac-a9e3-b7dff0439b17","year":2019},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.040397Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:84ae1f416116f0ab95a7dd40cd5edad895d1db0c8122c317e9e71cf83b04c2d1","observation_id":"01bc33ce-4108-44c2-aebe-c12e3ca1c856","resolution":{"observed_at":"2026-08-14T14:58:12.160752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.044374Z","title":"Classifying rendezvous tasks of arbitrary dimension","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.044374Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:e936253b030b44ef926dee26cd2474d518232d23746379b48dba1daa1833f4f6","observation_id":"fbb4fa50-7485-481a-a83b-e9fd92a451c4","resolution":{"observed_at":"2026-08-14T14:58:11.044374Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.130904Z","title":"Communication complexity and combinatorial lattice theory","venue":null,"work_id":"20c6c1e9-2283-4999-bfff-585135d7169b","year":1993},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.048567Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:22935c0ef45444bd4158bc41c25469907f50a0f5f39636c46ec904420cf20e20","observation_id":"c3f98f1d-a5f7-447c-970c-edbe3eef54a9","resolution":{"observed_at":"2026-08-14T14:58:12.138223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00385814","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.208298Z","title":null,"venue":null,"work_id":"6a4f9fb1-4fff-43d0-8bce-86cdc312468f","year":1991},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.052890Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:58b379ff732f4e45668c1a5f2aa950c7f37af7fb9eccd5e6acf8ce447cbcd602","observation_id":"9971f90c-a4eb-4319-8906-2d25a40e25fa","resolution":{"observed_at":"2026-08-14T14:58:11.215418Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.058093Z","title":"Multidimensional approximate agreement in Byzantine asynchronous systems.Proc","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.058093Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:5acfb756af7140c0dc58a9e1b29bd94860f6f94d40d24232330724da46f9d778","observation_id":"a08ff37d-1810-48f5-9d0f-4fc8bd8c8a20","resolution":{"observed_at":"2026-08-14T14:58:11.058093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.108746Z","title":null,"venue":null,"work_id":"c3b2cf76-06bf-48bc-9019-e28a3cff2de3","year":2015},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.064673Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:fc5606497fe598f8d1aa59156907b369af9875329a1e9fff275eec4f01ea8d88","observation_id":"4375ac72-5f9d-49d6-ada2-e26e579e921a","resolution":{"observed_at":"2026-08-14T14:58:12.113297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.091584Z","title":"Nielsen and Ortrud R","venue":null,"work_id":"93c4375c-437e-4d5d-ae3d-c3f2f85411ac","year":2009},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.073499Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:1d4acfe576392ac02509c4e33b86b923f2e368b758628052e434ed1a1f17435f","observation_id":"ebb4f9f2-254a-46e3-bed5-6bfab1a31397","resolution":{"observed_at":"2026-08-14T14:58:12.096190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.079915Z","title":"Pease, Robert E","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.079915Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:bb42b76dd5370da297d0f6e42d15ac839eb5c442e458826424b08cce4ea962f0","observation_id":"f014836e-169a-4366-b03c-b4e1cb8aa8ff","resolution":{"observed_at":"2026-08-14T14:58:11.079915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.077631Z","title":null,"venue":null,"work_id":"123de470-4695-4fdc-935b-e1887cb00785","year":2013},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.086052Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:86901348fe8cb5f1cccf54b6299285482ddc883c289f385e2e82a7473290da47","observation_id":"d52f0bc5-2bfa-49ab-991c-c0088ef0c2e0","resolution":{"observed_at":"2026-08-14T14:58:12.081799Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.062448Z","title":"Convexities on ordered structures have their Krein–Milman theorem.Journal of Convex Analysis, 21(1):89–120, 2014","venue":null,"work_id":"1b685254-ec01-4298-a6de-942edfc3f684","year":2014},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.092799Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:c6858c1350d072cd3a8519751594130bddcc77926e013fd2b895708c84130e91","observation_id":"5f3f062a-c91d-47d1-b7a5-eb04b683e32e","resolution":{"observed_at":"2026-08-14T14:58:12.067302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.047564Z","title":null,"venue":null,"work_id":"71a93b85-6a7f-4b47-ab12-d1ce21523c22","year":1970},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.098922Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:c6a8a8aa3192f357f9860888a3947439e41a397fabc7479459fded3a8bf7f349","observation_id":"32ca3529-f6f9-4bee-a0bf-d70252033eb1","resolution":{"observed_at":"2026-08-14T14:58:12.052836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.032779Z","title":null,"venue":null,"work_id":"d7f31594-001a-47b0-b7a0-730130beed27","year":1976},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.103388Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:64cbe14f24735bb418b825ce3f63edcad0222aaa5e4c11a811dddf4cf53b781c","observation_id":"88c067b6-b73c-470a-8f50-cf9c5694d3d2","resolution":{"observed_at":"2026-08-14T14:58:12.037779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:12.014233Z","title":"Simulating authenticated broadcasts to derive simple fault- tolerant algorithms","venue":null,"work_id":"7676e701-c086-4ec3-a305-0ea1ba9147d7","year":1987},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.109494Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:ba1859a59507203583ebabef492e3c6cadb6e5cff13c28308bca79b3adbf8f82","observation_id":"794cc4cf-ac57-43b2-aec8-e71a3b6a419d","resolution":{"observed_at":"2026-08-14T14:58:12.021597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.991245Z","title":"Vaidya and Vijay K","venue":null,"work_id":"6cf33170-aa98-45e1-b7eb-f7cdb8e750e2","year":2013},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.114910Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:c134289c9bc4be8619bea9e6a58b6e34f5e04b8bc5af7085212a0495896b9c61","observation_id":"64ab1b53-fccf-46d0-a461-a46c6ec4d82e","resolution":{"observed_at":"2026-08-14T14:58:11.996717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.972012Z","title":"Elsevier, 1993","venue":null,"work_id":"3ebf0e21-ec8d-4d3c-8c0c-90a761e55f8c","year":1993},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.122609Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:76eb959380d9b058f1b4c86b3f351f45854544dcbb628f521caddb44253e70df","observation_id":"306ea85c-b3b1-425a-ae5a-8a073f65a7e2","resolution":{"observed_at":"2026-08-14T14:58:11.978638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.954484Z","title":"Chordal graphs and semidefinite optimization","venue":null,"work_id":"95e69638-3513-444c-a8ec-8d97872164d4","year":2015},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.144106Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:424b1af92d34cf36e80c429b447803c099e47a5d18046429f49b3f8643f8c40c","observation_id":"cf871bba-94cf-4438-bd80-3c45e5c2adfb","resolution":{"observed_at":"2026-08-14T14:58:11.961663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.935707Z","title":"A new fault-tolerant algorithm for clock synchronization","venue":null,"work_id":"eab3177f-142e-4630-bf86-87639271eb5a","year":1988},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.148736Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:f75719318f9e34b90ee7e707405cf42a541b5651353f3a8a69ff5e603c110d2c","observation_id":"edfc97ca-6790-45b5-8e27-28581b29dc42","resolution":{"observed_at":"2026-08-14T14:58:11.940835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.153758Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.153758Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:5df717699973c8b0c079f7b9e9bf6a7d0367c0b6c2d2ac9540b43c60f0002f0b","observation_id":"9e4fde5d-047e-4a2a-ad81-4a97cf6271e2","resolution":{"observed_at":"2026-08-14T14:58:11.153758Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:58:11.016196Z","title":"doi:10.1145/3212734.3212787","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T14:58:11.016196Z"},"links":{"citing_paper":"/paper/1908.02743"},"observation_digest":"sha256:7746967839fdaf23749b83065f3bff34a9ad6c1634aece7db0601baf5b56c72c","observation_id":"b7d682cb-283a-4c0b-aa8c-976683437984","resolution":{"observed_at":"2026-08-14T14:58:11.016196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.02743","last_updated":"2019-11-19T12:56:23Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T13:23:48.655904Z","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":5,"metadata_mismatch":1,"parse_uncertain":2,"unresolved":33,"verified_exact":5,"verified_fuzzy":39},"total_outbound_references":85},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 1 inbound Pith citation observation for arXiv:1908.02743."}