{"as_of":"2026-08-10T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d1e844b9efe4fd404f59228abc547111d736cbba6c46c2be386195b71998233","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:54:49.822285Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-02T21:19:27.217876Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05591","snapshot_observed_at":"2026-08-02T21:19:27.217876Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21411","last_updated":"2026-06-05T14:52:37Z","snapshot_observed_at":"2026-08-07T18:13:20.902591Z","submitted_at":"2026-02-24T22:31:20Z","title":"General Convex Agreement with Near-Optimal Communication","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T21:19:27.217876Z"},"links":{"cited_paper":"/paper/2502.05591","citing_paper":"/paper/2602.21411"},"observation_digest":"sha256:ea8075202debd51383a87fdbc761cb9e8ab4a080467fd12406741ea4aa4e8916","observation_id":"83032052-d259-4342-ba8d-5ea3186eb602","resolution":{"observed_at":"2026-08-02T21:19:27.217876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05591/citation-record","integrity":"/paper/2502.05591/integrity","json":"/paper/2502.05591/citation-record.json","paper":"/paper/2502.05591"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:54:49.663129Z","title":"Optimal resilience asynchronous approxi- mate agreement","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.663129Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:a943e60ea49c739e0096a1702f8c223d689d4bcafd921e0dd90f9d120026ce72","observation_id":"bac3e6be-c50a-46c2-af4b-b799b513fdb3","resolution":{"observed_at":"2026-08-08T18:54:49.663129Z","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-08T18:54:49.667574Z","title":"The topology of look-compute-move robot wait-free algorithms with hard termination.Distributed Computing, 32(3):235–255, 2019.doi:10.1007/s00446-018-0345-3","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.667574Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:f2c48b93ea8e03d3f31a2d028f118dd111fc83a6c9013c0483d276b61339f2a6","observation_id":"14cc98e7-9017-4f1d-bb77-10342329d7d6","resolution":{"observed_at":"2026-08-08T18:54:49.667574Z","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-08T18:54:49.671591Z","title":"Wait-free approximate agreement on graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.671591Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:23bfe4f714e28c07430a1c62b448a914e1f32982906bcf3f3998ca6965abdf2b","observation_id":"57ba637c-a7c0-4d7d-8846-a9e690885a91","resolution":{"observed_at":"2026-08-08T18:54:49.671591Z","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-08T18:54:49.675578Z","title":"The Step Complexity of Multidimensional Approximate Agree- ment","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.675578Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:dcf309e88bad09c7726aa2494ae52b241fd68f9db2d0f113f13b6ac416d2b87b","observation_id":"217f44a2-cd07-499c-879e-033f91141c71","resolution":{"observed_at":"2026-08-08T18:54:49.675578Z","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":"2024.00051","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:54:50.813288Z","title":"Bandarupalli, A","venue":null,"work_id":"5bc9bb7e-957a-4258-84c3-27ebcca3b6e3","year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.679597Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:144a63949dfef0b24f3bee0bac2e4a017d9fe5a8d3025e7a03dbe6a07f04f708","observation_id":"24480145-b56d-4c04-b40a-2662df277d67","resolution":{"observed_at":"2026-08-08T18:54:50.818891Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:54:49.683656Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.683656Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:831f1ad0167895033b2e0694ddacaa62fc590a3171fdf729b18edab1910c6843","observation_id":"a9be8d7d-288f-41c3-872f-c21ecdd4b635","resolution":{"observed_at":"2026-08-08T18:54:49.683656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1007.1049","last_updated":"2010-09-29T14:13:14Z","snapshot_observed_at":"2026-07-06T02:12:40.478966Z","submitted_at":"2010-07-07T04:50:43Z","title":"Simple Gradecast Based Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1007.1049","snapshot_observed_at":"2026-08-08T18:54:49.687602Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.687602Z"},"links":{"cited_paper":"/paper/1007.1049","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:203c9135fd15d4e71af990971b9dba0a421038b5253bcb8c52100613f0e3bcb1","observation_id":"8385b26f-f822-4967-b217-d0683e05d3a5","resolution":{"observed_at":"2026-08-08T18:54:49.687602Z","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-08T18:54:50.926666Z","title":"Bender and Mart ´ ın Farach-Colton","venue":null,"work_id":"a6aca06a-7421-44b3-bbfb-6df93edefad5","year":2000},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.691523Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:b19a5031ad9cc812e9c71c27865c27986572b91f1bc8e80d0d938aee5bcde5a5","observation_id":"2448ad6e-8bbb-4b2b-bb62-ae21fef8fe33","resolution":{"observed_at":"2026-08-08T18:54:50.930209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12741","last_updated":"2025-09-09T13:12:24Z","snapshot_observed_at":"2026-07-06T15:45:24.674515Z","submitted_at":"2023-06-22T08:46:07Z","title":"Centroid Approximation with Multidimensional Approximate Agreement Protocols","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12741","snapshot_observed_at":"2026-08-08T18:54:49.694849Z","title":"Improved solutions for multidimensional approximate agreement via centroid computation.arXiv preprint arXiv:2306.12741, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.694849Z"},"links":{"cited_paper":"/paper/2306.12741","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:c598e9f19384c4628f4cd6ffb06618d56b152ef135e8a7ca2bc76b1c3ee9a184","observation_id":"62937dc9-4927-4761-883b-74a2f2f76368","resolution":{"observed_at":"2026-08-08T18:54:49.694849Z","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-08T18:54:49.698899Z","title":"Con- vex Consensus with Asynchronous Fallback","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.698899Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:d5ba5ff076d7a8e74535dcf5050c0998e742e932024d32adb10245973ad5422e","observation_id":"563ffcc7-a8af-40db-8908-06dd6d8436c2","resolution":{"observed_at":"2026-08-08T18:54:49.698899Z","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-08T18:54:49.702310Z","title":"Gathering on rings under the look-compute-move model.Distributed Computing, 27(4):255–285, 2014.doi:10.1007/ s00446-014-0212-9","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.702310Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5111ba4e2376eb67362526fd3935d1526548af7619fe1530427f799c07e2121e","observation_id":"f452ecfe-cb60-4bef-a553-e643d90dadcd","resolution":{"observed_at":"2026-08-08T18:54:49.702310Z","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-08T18:54:49.705936Z","title":"Lynch, Shlomit S","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.705936Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:42ca430b872c38f6a42362451130c46173bf9c8d13b4e3a1e8293b62d05b4239","observation_id":"d4eb2ced-1087-431c-bc1c-5c36fcae9cc1","resolution":{"observed_at":"2026-08-08T18:54:49.705936Z","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-08T18:54:49.709257Z","title":"Raymond Strong","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.709257Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:4a3188f7037bbf86fcccab47b418a0d4989812eb6eea9bb20f8620a1a03a9f30","observation_id":"fccd3be8-c89f-407c-9589-a49c345a46e7","resolution":{"observed_at":"2026-08-08T18:54:49.709257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.02126","last_updated":"2022-11-03T20:02:44Z","snapshot_observed_at":"2026-07-30T10:22:11.999087Z","submitted_at":"2022-11-03T20:02:44Z","title":"Validated Byzantine Asynchronous Multidimensional Approximate Agreement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.02126","snapshot_observed_at":"2026-08-08T18:54:49.712556Z","title":"Validated byzantine asynchronous multidi- mensional approximate agreement.arXiv preprint arXiv:2211.02126, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.712556Z"},"links":{"cited_paper":"/paper/2211.02126","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:7f4c6304aba2a5d97470d5936e35077abe24764a92c66f345e1654db5f10d81a","observation_id":"be5cf8f3-6604-451b-981c-eae4b49417cd","resolution":{"observed_at":"2026-08-08T18:54:49.712556Z","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-08T18:54:49.716503Z","title":"Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.716503Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5369b08a0f0fdae5d9d79da3e11f3113607e0e695b740f550901a78a5eeaee2c","observation_id":"4d3877a6-fe8e-4139-9d24-96b6f85b9265","resolution":{"observed_at":"2026-08-08T18:54:49.716503Z","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":"2734.34056","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:54:50.638065Z","title":"Genuinely distributed byzantine machine learning","venue":null,"work_id":"2de77a47-8b93-4c8b-abf0-962fb1043d13","year":2020},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.719879Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:1495d9526948fab76b57ccb88adf88a4406b4d4cf65eba80be358cf60ebad367","observation_id":"66a99161-323b-4855-b3e6-edf3a8eca00d","resolution":{"observed_at":"2026-08-08T18:54:50.643456Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05495","last_updated":"2025-08-29T14:16:00Z","snapshot_observed_at":"2026-07-06T18:59:09.430784Z","submitted_at":"2024-08-10T09:03:06Z","title":"Asynchronous Approximate Agreement with Quadratic Communication","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05495","snapshot_observed_at":"2026-08-08T18:54:49.723199Z","title":"Asynchronous approximate agreement with quadratic communication, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.723199Z"},"links":{"cited_paper":"/paper/2408.05495","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:843d95abfc0225c43a1bb6f2aa43449ecfd205bca72d8c1fc651e46d78724fe7","observation_id":"dabec76d-e410-41b2-b128-fa14cdf517c8","resolution":{"observed_at":"2026-08-08T18:54:49.723199Z","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-08T18:54:49.726798Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.726798Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:f8e1e620a798c68d915d1d4d50baadc81ecdba521c6b5dae55029f7c6dc6799b","observation_id":"f3d02c75-72d0-46e9-ac2e-c370a88dca7f","resolution":{"observed_at":"2026-08-08T18:54:49.726798Z","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-08T18:54:49.730067Z","title":"Asymptotically optimal algorithms for approximate agreement.Distributed Computing, 4(1):9–29, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.730067Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:9148aace0703bc3cf578c38ea4c69cd3a279c7dd0b9fadf35729d1f030fdf578","observation_id":"4514bd30-591e-449c-9653-323efcc80a07","resolution":{"observed_at":"2026-08-08T18:54:49.730067Z","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-08T18:54:49.733386Z","title":"Gathering asyn- chronous oblivious agents with local vision in regular bipartite graphs.Theoretical Computer Science, 509:26–41, 2013.doi:10.1016/j.tcs.2012.07.004","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.733386Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:2f676ffa1284c13b5e81cd5e5a27e5610d39c777849871d02145ed98ce3487bf","observation_id":"9d3e15aa-cdfc-4559-9030-adc5059a94c8","resolution":{"observed_at":"2026-08-08T18:54:49.733386Z","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-08T18:54:49.736950Z","title":"Brief announcement: Towards round- optimal approximate agreement on trees","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.736950Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:100df3b4f274c1702fcb26218b7ee9d362a00a6f5cffa9cfe92b8dfa92fe507b","observation_id":"f9f8a773-7141-4cb2-8f05-776cbe77ae4f","resolution":{"observed_at":"2026-08-08T18:54:49.736950Z","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-08T18:54:49.740469Z","title":"Fast Multidimensional Asymptotic and Approximate Consensus","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.740469Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:6e01683ed60f86105191f8cd1076c68108e784b691057f9f204f7aa70f09f55b","observation_id":"bce83132-9410-4538-8ff4-949fa9b048cd","resolution":{"observed_at":"2026-08-08T18:54:49.740469Z","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-08T18:54:49.743913Z","title":"Round-optimal byzantine agreement","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.743913Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:dd8f60629b9617dbcb2ddbf03ca0b3758c27ea66b3537df580833fdf1cde9267","observation_id":"053bdc53-12cf-470a-9831-8ca3aaa3a4eb","resolution":{"observed_at":"2026-08-08T18:54:49.743913Z","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":"8481.35911","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:54:50.322407Z","title":"Multidimensional approximate agreement with asynchronous fallback","venue":null,"work_id":"ff0b2201-b0c4-488c-97b0-35983c69932b","year":2023},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.750652Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:7cab9310e7bd9e313741f46cc5b95153652f9450ac66e5e0ee2683645e4a11bc","observation_id":"f5ef300c-eaa3-4be0-9847-a0c80196ba30","resolution":{"observed_at":"2026-08-08T18:54:50.329729Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:54:49.754041Z","title":"Brief announcement: Communication-optimal convex agreement","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.754041Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:db197e1d424cca9c3a2b8e388a844dff4d83528b99118d22b585ee6fbef66de5","observation_id":"d32946e5-ce58-40b0-96cd-13fb17876fdb","resolution":{"observed_at":"2026-08-08T18:54:49.754041Z","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-08T18:54:49.757503Z","title":"Communication-Optimal Convex Agreement","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.757503Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5c2d9800e17ecde3d1f7bf5a2dd94e1518227c236a6e0d0e5e9223421eb2d57e","observation_id":"6bd49fa3-4cbe-4b29-a2a9-13e6643eb0fe","resolution":{"observed_at":"2026-08-08T18:54:49.757503Z","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-08T18:54:49.761050Z","title":"Brief announcement: Variants of approximate agreement on graphs and simplicial complexes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.761050Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:4d8d1523daa2ff956c2f79b111465e740c9fd4e72d16c5c342365552751493da","observation_id":"caa72a81-e874-47b5-85cc-eeb292204377","resolution":{"observed_at":"2026-08-08T18:54:49.761050Z","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-08T18:54:49.764408Z","title":"Optimal clock synchronization with signatures","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.764408Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:bcc88a228a8c1e0b31cbbf9e2585ddf7c2e9a43fe1146b2b9f6ba977475d95a3","observation_id":"fabad026-72b2-43dc-87fc-14159e685037","resolution":{"observed_at":"2026-08-08T18:54:49.764408Z","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-08T18:54:49.767861Z","title":"The Impossibility of Approximate Agreement on a Larger Class of Graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.767861Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:99f34977ee82a29ee39d06e25ff6044f562c5ac9ccefc9ca034c1fc4fe685eb8","observation_id":"5564417b-3640-4993-8dcb-bf2f8d85d9eb","resolution":{"observed_at":"2026-08-08T18:54:49.767861Z","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-08T18:54:49.771364Z","title":"Byzantine agreement with interval validity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.771364Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:ec725dca5715ef2f1d87bbf65adaee8dc37242486bc19e04b99e600dd5ea6ce5","observation_id":"bda91231-f2cb-405a-9d52-40f46eee49fd","resolution":{"observed_at":"2026-08-08T18:54:49.771364Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:54:50.058106Z","title":"Multidimensional approximate agreement in byzan- tine asynchronous systems","venue":null,"work_id":"6b9714e7-a6f7-45bf-b272-2d06f6abcb4a","year":2013},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.774688Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:683ed4df8e5cb4b2ef5570fb5a0eb6fb50f51771ed26dcc4ac038175120d6a93","observation_id":"db4be7ac-3b43-4dba-a7ca-e2987ff3a0de","resolution":{"observed_at":"2026-08-08T18:54:50.065917Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:54:49.777939Z","title":"Multidimensional agreement in byzantine systems.Distributed Computing, 28(6):423–441, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.777939Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:2afe6ab36b8404d321f79c67323c89ba34e0043f1da9d723c4de603ff28be4bb","observation_id":"0b91a216-a7b6-4ac9-a588-b2042798e2a2","resolution":{"observed_at":"2026-08-08T18:54:49.777939Z","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-08T18:54:49.781286Z","title":"Optimal and player-replaceable consensus with an honest majority","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.781286Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:6c233a5168de98b024c20391cdb9864ced6b794338cea503d72b0d66f5b26033","observation_id":"c75ed5aa-78cb-4dc6-b299-a40813c6a0bc","resolution":{"observed_at":"2026-08-08T18:54:49.781286Z","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-08T18:54:49.784499Z","title":"Byzantine Approximate Agreement on Graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.784499Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5abf581b8599fe6d064a486ea07fbbb356a177d0b09d136366fb43e9318270a0","observation_id":"fc140fa8-8c98-460c-8d9b-b2d167c65867","resolution":{"observed_at":"2026-08-08T18:54:49.784499Z","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-08T18:54:49.788088Z","title":"Distributed computing with mobile robots: An introductory survey","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.788088Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:71a7e4eaf898390040cc6b92de6fc2f4e190156c3703f224ce709fdccff830c2","observation_id":"95e193b5-d036-4bd4-80cb-70f99a40f77b","resolution":{"observed_at":"2026-08-08T18:54:49.788088Z","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-08T18:54:49.791473Z","title":"Byzantine Agreement with Median Validity","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.791473Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:664abf38617c13b9efd8c324bd858a6e0d0b6213eeb777f7a42b3cfca681c188","observation_id":"8048304e-f4d8-4ddd-8a89-29e876f86050","resolution":{"observed_at":"2026-08-08T18:54:49.791473Z","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-08T18:54:49.794716Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.794716Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:cf80fb5e2981e55e15c1b58731a55f1c65c74bbd2b7db788b9c04b9f850640a2","observation_id":"1fed3125-6087-44e6-8174-dcf9572a40b1","resolution":{"observed_at":"2026-08-08T18:54:49.794716Z","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-08T18:54:49.797946Z","title":"Vaidya and Vijay K","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.797946Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:db026ba4b2e491e1315cf12f48bbb718ad11e934ede41fc677d66948d07ea0f2","observation_id":"25cdc564-6197-4079-b0c9-8b6714588eab","resolution":{"observed_at":"2026-08-08T18:54:49.797946Z","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-08T18:54:49.801078Z","title":"Brief announcement: Relaxed byzantine vector consensus","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.801078Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:4d56a8021349de819cb2b5da219115b8ed374ce4b6ef2ee9d86a67d2eec0c5fe","observation_id":"b338959f-8f19-4143-bb7a-1e8268a00033","resolution":{"observed_at":"2026-08-08T18:54:49.801078Z","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-08T18:54:49.804257Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.804257Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:82066442bb17d8ad5818f95dd27d63faa3f3eb7e94a203316755d89203f69ec5","observation_id":"bfaa379b-6004-4fe6-9251-49c334e8fff5","resolution":{"observed_at":"2026-08-08T18:54:49.804257Z","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-08T18:54:50.854376Z","title":null,"venue":null,"work_id":"af99c25c-54ec-408b-89b0-1013856ba245","year":null},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.808038Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:67eb6e917dba9ed821cb5811814054427024a88ed9cebdcf7db4ea8ff6c3ce94","observation_id":"f03a5922-2ee1-4bb8-b220-d036783e52ea","resolution":{"observed_at":"2026-08-08T18:54:50.858177Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:54:49.811786Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.811786Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5bd7923aeef0f35a2a33eb65d154e5a522ead512270c57ede2101bbcc11b9f92","observation_id":"ca227497-80bd-4d28-8f2f-75e927fdd6e9","resolution":{"observed_at":"2026-08-08T18:54:49.811786Z","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-08T18:54:49.815490Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.815490Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:2f7835249e5deb59317f1492179e6b589bd52c767a6e40bd17ab597e806ba1de","observation_id":"78685256-85a6-44c1-93c2-0fe1478cae7b","resolution":{"observed_at":"2026-08-08T18:54:49.815490Z","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-08T18:54:49.818975Z","title":"Then, a vertexu is in the subtree rooted atvif and only ifL(u)⊆[i min, imax]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.818975Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:5765a510aca4336060a0d20638fa4b28cc3a5bebd5078570cd64b877c6c9dc13","observation_id":"8e30e49e-1bf0-4e7b-b7fa-54627eb9779e","resolution":{"observed_at":"2026-08-08T18:54:49.818975Z","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-08T18:54:50.825566Z","title":"Proof.First, we prove thatListConstruction(T, v root) terminates in a finite amount of time","venue":null,"work_id":"00f1d01e-70c8-444f-a1ff-b9f756b058b8","year":null},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.822285Z"},"links":{"citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:4dc10aaad3a1829a28b96078e7ecb50ec471c575ffdefdd2d119f90128640d29","observation_id":"5b7ca313-1eb6-4152-9cbc-4fbe1f3e35b0","resolution":{"observed_at":"2026-08-08T18:54:50.829290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","latest_version":5,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":3,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":36,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":45},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2502.05591."}