{"as_of":"2026-08-15T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:359cfd941acdd8d777de923e3bbf1e82e5492dfb2be94732967d5075386847a6","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:52:42.465226Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2501.00717/citation-record","integrity":"/paper/2501.00717/integrity","json":"/paper/2501.00717/citation-record.json","paper":"/paper/2501.00717"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:52:43.212732Z","title":"Signature-free asynchronous byzantine consensus with t <n 3 and O(n2) messages","venue":null,"work_id":"c36e990e-a4be-46b6-b7af-de9e757e01b2","year":2014},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.334679Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:25f37d0a93359f7a71d372ad5f29065dbd69381e1ea0af9e5f3dd03d7f0ccccd","observation_id":"bdf38de4-7dd5-46fb-9137-619f04c0e97f","resolution":{"observed_at":"2026-08-10T22:52:43.216651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.201774Z","title":"Upright cluster services","venue":null,"work_id":"310b17d5-ad41-44bb-9a1d-42617e1443e2","year":2009},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.338935Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:7534b06d8276712382508ac1fb587189ead26716d75e03d8e2393c7873a382e5","observation_id":"f6054fde-c5e2-454e-887c-a13ca8f2cd7c","resolution":{"observed_at":"2026-08-10T22:52:43.205315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.188951Z","title":"State Machine Replication for the Masses with BFT-SMART","venue":null,"work_id":"5e4e129a-cc66-4798-b1a1-7d3330f43e83","year":2014},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.343127Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:5cf45a782131afac96918d30d9058c6c8622c1fc896f9576dada97c909fe0696","observation_id":"bbcd8a02-ccd5-4f2a-8c0c-cacf89aeb06f","resolution":{"observed_at":"2026-08-10T22:52:43.193767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.177909Z","title":"The honey badger of BFT protocols","venue":null,"work_id":"0cc85f5c-6d00-400c-86a2-5646bb52d0b4","year":2016},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.347012Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:e9d1c26d81fa21ea4ad126818188e42a1aae1190cfeff4115134da4a3a3dece6","observation_id":"9113e9d5-4cf5-43e3-9086-cd1629ee020c","resolution":{"observed_at":"2026-08-10T22:52:43.181584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.166434Z","title":"Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares","venue":null,"work_id":"64223544-c45c-4f75-a25a-5e7036f0c9d2","year":2016},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.351744Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:d55b1c981e9e9074209f2dfdd1395ddb55befaddb24c60402b7f2c5810aee5c9","observation_id":"d22bd426-ca10-4b87-b520-f3f99d36578f","resolution":{"observed_at":"2026-08-10T22:52:43.170709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.155750Z","title":"Dumbo: Faster asynchronous bft protocols","venue":null,"work_id":"0c417216-de3b-4677-b5c4-235410c72722","year":null},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.355663Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:f78379ef98b9095afe1dbc770173584b178befdc2c9526470c69ac71af019cd1","observation_id":"47c86847-8f45-410f-ac47-3db05c687ba2","resolution":{"observed_at":"2026-08-10T22:52:43.159524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.143985Z","title":"Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography","venue":null,"work_id":"66ce57d9-b953-4742-810f-828fa3000f38","year":2000},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.363628Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:2c4587888a9b7af952bc78ce557cab5fe7ac73a8b58e710c91b342313190bd7b","observation_id":"426ea9d5-e706-4b0c-9369-29e2f71bcfe3","resolution":{"observed_at":"2026-08-10T22:52:43.147876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.132846Z","title":"Asynchronous verifiable secret sharing and proactive cryptosystems","venue":null,"work_id":"4d0b8e4a-2440-497e-b33c-1881561470b2","year":2002},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.367577Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:b3df7aa54b2a62bb2e992fd4241fbb6a037450cddfdfa1608b12e000048fb003","observation_id":"08fc57d2-15ff-4e58-84e6-4ba6e563565d","resolution":{"observed_at":"2026-08-10T22:52:43.136558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.122969Z","title":"Secure and efficient asynchronous broadcast protocols","venue":null,"work_id":"57e9dcb9-4c3f-4989-8ed7-90f4cfac23be","year":2001},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.371096Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:9f8d1819dfc2baa500b58bad0dac20009b48ee93bc07ee47b7cabd772596876a","observation_id":"17e764af-e99e-40d7-9d32-2975ae7a1661","resolution":{"observed_at":"2026-08-10T22:52:43.126302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.111260Z","title":"Consensus in the presence of partial synchrony","venue":null,"work_id":"e5e3f10e-1539-46f9-9e72-fd6bc58dc313","year":1988},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.374900Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:30d23e6d264586a7cde26855e05f34423be2f6e32682e4db15befba0e81d3a19","observation_id":"39a92adf-db43-49ca-b982-6b2294aba013","resolution":{"observed_at":"2026-08-10T22:52:43.115248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.378748Z","title":"https://doi.org/10.1007/s00145-004-0314-9","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.378748Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:06c60d2803949d9277605bdd20d018491eb1de5ba05841d2583bd0c870d05ad5","observation_id":"1cb13946-4e84-485c-85e4-7f319f1f5c75","resolution":{"observed_at":"2026-08-10T22:52:42.378748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.01626","last_updated":"2019-01-02T07:06:34Z","snapshot_observed_at":"2026-08-14T19:29:10.751928Z","submitted_at":"2018-04-04T23:46:43Z","title":"SBFT: a Scalable and Decentralized Trust Infrastructure","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.01626","snapshot_observed_at":"2026-08-10T22:52:42.382903Z","title":"Reiter, Dragos- Adrian Seredinschi, Orr Tamir, and Alin Tomescu","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.382903Z"},"links":{"cited_paper":"/paper/1804.01626","citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:b8a8f83f30bcb881e32826ff1834adcf18fc26f4a05f9119feea847bfd27fd09","observation_id":"9e612ac2-df0d-45df-a670-575def76be05","resolution":{"observed_at":"2026-08-10T22:52:42.382903Z","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-10T22:52:43.098874Z","title":"Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast","venue":null,"work_id":"bddc3fcd-5dc0-4059-8062-9ced590054e3","year":2005},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.387145Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:fbcd6161045a971346aa8206a630b17f5ac8bb26487e76c330c06674f89f7cf1","observation_id":"887ed995-be93-470d-867a-50752d885dbc","resolution":{"observed_at":"2026-08-10T22:52:43.103230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.087489Z","title":"Asymptotically optimal validated asynchronous byzantine agreement","venue":null,"work_id":"46c7edfc-3646-46f2-b073-6af7bfc6c1bb","year":2019},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.390798Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:06c3b58c5853ee12e335ee19d8528dac74960d43e06f1797138b2a49208720d0","observation_id":"65ea3af6-ebe4-48fe-a0f1-fc1ff1847282","resolution":{"observed_at":"2026-08-10T22:52:43.091386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.077980Z","title":"Optimistic asynchronous atomic broadcast","venue":null,"work_id":"4268d972-f04f-4961-9323-469c52176583","year":2005},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.394884Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:dfeccf065be78f7356a5a8012ff97e147ec7f0822f5de8e243c79148b38c12a0","observation_id":"3ba48b7b-e162-40af-9fa1-1dac9a90cec2","resolution":{"observed_at":"2026-08-10T22:52:43.081132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.067316Z","title":"The weak Byzantine generals problem","venue":null,"work_id":"1e0e15a6-342c-4afc-b187-0958ed1ab4d9","year":1983},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.398889Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:e8a4347504b3c887d2e51d9d47641c34072514bfd753bc8a5a595038d97b3f65","observation_id":"081560cd-4f87-4907-96d2-ae32fff4c639","resolution":{"observed_at":"2026-08-10T22:52:43.070813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.056452Z","title":"Ben-Or, B","venue":null,"work_id":"3ff51a87-246e-4188-87a2-177e966e38b6","year":1994},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.402740Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:aadc7af963ca0f6d048e9ad22d00cf42995a916baf6ad334242c0788c46c25ee","observation_id":"62c1a48f-6f81-4e5c-8e85-6157add8c536","resolution":{"observed_at":"2026-08-10T22:52:43.060000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.045355Z","title":null,"venue":null,"work_id":"a849701b-d628-43a0-b9f4-eacd7240ec9f","year":1999},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.406394Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:ba0d54136f95851bbe2fab379bc74ff8309b9a1a6a4ba147b3f274910809c8c1","observation_id":"f52e7a49-fac4-41f2-8349-5682d89517d4","resolution":{"observed_at":"2026-08-10T22:52:43.049552Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.034270Z","title":"Reiter, Guy Golan Gueta, and Ittai Abraham","venue":null,"work_id":"8be2820e-706f-46fe-a15a-b889937c699f","year":2019},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.409820Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:d81fed3cbafa84b8d14cffb8e9795b3313359e075f755401bb8a60462eb4970a","observation_id":"d1d51293-fbe8-41e6-b06d-0e07ad1d7198","resolution":{"observed_at":"2026-08-10T22:52:43.038167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.023155Z","title":"Reaching agreement in the presence of faults","venue":null,"work_id":"f5655f3e-ba3d-4810-b037-9032bd8b4263","year":1980},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.414059Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:9d1b40495ca1b572ffbf623e57fc6fedeee6f2a65f6c5a62b93b325df2c42028","observation_id":"defc02b8-08ab-45f8-898e-0f688309f066","resolution":{"observed_at":"2026-08-10T22:52:43.026947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.011825Z","title":"Fischer, Nancy A","venue":null,"work_id":"2e21cbe1-ef4c-4ec3-8132-c5cbd91b2af6","year":1985},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.417972Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:d42b76daee64d98d1b00bdca4023924746fc75c0d5efc3304dac91bdf3e8b5dd","observation_id":"da59b198-ba46-41c1-b3c8-0b793631a2a8","resolution":{"observed_at":"2026-08-10T22:52:43.015600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:43.000992Z","title":"Practical byzantine fault tolerance","venue":null,"work_id":"2dc177bf-a0d5-45c0-8674-3c7bb9945d65","year":1999},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.421852Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:28fe3a9c239f23e222901b6f76d972c0b31c27555ee838207ed3fc1abd590191","observation_id":"466ac577-bca1-4506-98d8-37e40e68862d","resolution":{"observed_at":"2026-08-10T22:52:43.004520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.990209Z","title":"A peer-to-peer electronic cash system, 2008","venue":null,"work_id":"e4e65169-acc4-4f81-8595-c59d9212f8bb","year":2008},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.425508Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:78e781d799ba1a26acf525460a75e7000fe88dda2c69e2511ce29d68a94a6958","observation_id":"98390ed2-cb10-4842-8da0-231fd929b49e","resolution":{"observed_at":"2026-08-10T22:52:42.993810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.978310Z","title":"https://easychair.org/publications/preprint/ Zs8Mw/open","venue":null,"work_id":"bd627380-8d9f-46b5-867a-3550a5ea30cf","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.429054Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:1a2a0714b466361ec6fa958854a372eaaa3b0850ac061f52f0e7e13d50219ff9","observation_id":"e9261b54-7ab7-48c9-b40b-854d0177613b","resolution":{"observed_at":"2026-08-10T22:52:42.982392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2406.03739","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:52:42.806910Z","title":"arXivpreprintarXiv: 2406.03739","venue":null,"work_id":"d0d662ca-416c-4b2a-a51d-2ddb3e4508fe","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.432639Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:65d2efca02ca4701ee4f3db024975798a970e20ddeade5ad1381d86907d6512e","observation_id":"a7e7e8e2-3bd9-4f85-98b0-7ae29b5f0b5a","resolution":{"observed_at":"2026-08-10T22:52:42.812740Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.966433Z","title":"The Next 700 BFT Protocols","venue":null,"work_id":"73e89d8f-624b-4d27-8f40-f239d15a2558","year":2015},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.436287Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:2fa414ac780efedfaf7c9ebf980f451b873412622320c0f7e5fa8e5b1325bfa4","observation_id":"9e1a61ac-7019-4b6c-b256-91862445ebe8","resolution":{"observed_at":"2026-08-10T22:52:42.970148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.954583Z","title":"Zyzzyva: Speculative Byzantine Fault Tolerance","venue":null,"work_id":"c68ef6ab-a830-4192-af78-fe29675a2512","year":2009},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.439852Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:0ea59c13ad5a49fb8d85740449e8e1a6a94ea24f09f3fe46051f5db445dc9563","observation_id":"b3e36084-35a8-43cf-a4a7-5a4a92be78e7","resolution":{"observed_at":"2026-08-10T22:52:42.958899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03789","last_updated":"2024-12-09T01:30:38Z","snapshot_observed_at":"2026-08-11T22:03:37.670596Z","submitted_at":"2024-12-05T00:39:20Z","title":"An Approach to Optimizing the VABA Protocol Using $\\kappa$-size Committee","version":2},"cited_work":{"arxiv_id":"2412.03789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.03789","snapshot_observed_at":"2026-08-10T22:52:42.548890Z","title":"An Approach to Optimizing the VABA Protocol Using $\\kappa$-size Committee","venue":"cs.DC","work_id":"c322a491-9aa0-4a20-a948-9a4b1d23f85d","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.444148Z"},"links":{"cited_paper":"/paper/2412.03789","citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:520ab223948eee1634a5ef6f15baaaaf26c96f1ac3996784875e0d499b03e542","observation_id":"4a300185-55f9-4462-a4ee-97a757f233c3","resolution":{"observed_at":"2026-08-10T22:52:42.553119Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.943294Z","title":"Agreement protocol wp","venue":null,"work_id":"09edef8d-5a45-40d1-a709-2b74f4a39aa8","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.448055Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:bfbec947bbc7df74458902e0551f6dbf20eb715a04418a4e9847a56ab14269cc","observation_id":"688160b5-a751-423c-9cee-9d54481c9ca7","resolution":{"observed_at":"2026-08-10T22:52:42.947172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.23477","last_updated":"2024-11-07T21:07:09Z","snapshot_observed_at":"2026-08-14T15:09:17.047502Z","submitted_at":"2024-10-30T21:55:08Z","title":"A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1","version":2},"cited_work":{"arxiv_id":"2410.23477","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.23477","snapshot_observed_at":"2026-08-10T22:52:42.532586Z","title":"A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1","venue":"cs.DC","work_id":"10574c44-28f0-47a1-80aa-0b240f92769f","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.451503Z"},"links":{"cited_paper":"/paper/2410.23477","citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:74eab25cba6ef6c5ab836ceccb635fa6ecbd38d08ee935e8e8ac3f975a0992cb","observation_id":"b1a8b0b2-04cd-43d9-ae56-eea323e9ee46","resolution":{"observed_at":"2026-08-10T22:52:42.537029Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04268","last_updated":"2024-10-05T19:13:59Z","snapshot_observed_at":"2026-08-12T22:30:01.221211Z","submitted_at":"2024-10-05T19:13:59Z","title":"Slim-ABC: An Optimized Atomic Broadcast Protocol","version":1},"cited_work":{"arxiv_id":"2410.04268","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.04268","snapshot_observed_at":"2026-08-10T22:52:42.512184Z","title":"Slim-ABC: An Optimized Atomic Broadcast Protocol","venue":"cs.DC","work_id":"d5de8d67-a6fa-43ce-ae53-b8d2e839c38f","year":2024},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.455098Z"},"links":{"cited_paper":"/paper/2410.04268","citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:a3de818c9a27c15ef2baba0d6e29c1233784e9c18019b7b9a3b5c7df689747a8","observation_id":"64ab4e8a-f215-439b-81b1-5d30c4721600","resolution":{"observed_at":"2026-08-10T22:52:42.518883Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.931835Z","title":"Practical threshold signatures","venue":null,"work_id":"6f6c96e1-3af3-442b-b630-ee200eb9f765","year":2000},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.458764Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:ea639ce806e836d00c19a338ed66e86a2b0dccc6f87d3717e5cef2cbca480cb2","observation_id":"b2f81603-c6c8-47bf-bb15-335ba14a59a3","resolution":{"observed_at":"2026-08-10T22:52:42.935634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.461934Z","title":"Coan, Jonathan Kirsch, and John Lane","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.461934Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:919f3ba26bc55b8f89fdda65be9cacc2b77289dc0f1e16cd6d68a0d4d4c71ed0","observation_id":"ed605631-821f-4337-bb30-8ce59520af06","resolution":{"observed_at":"2026-08-10T22:52:42.461934Z","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-10T22:52:42.917694Z","title":"Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited","venue":null,"work_id":"1c8673ff-cb2c-4868-bfea-4fd4e87dc1bd","year":2020},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.465226Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:511d6e3730690190e5495202727eae3ca76f4413c9e409e04f3a814b2b6966b5","observation_id":"54d46712-2e3a-4c61-bfee-15f3cc476e5d","resolution":{"observed_at":"2026-08-10T22:52:42.922022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:52:42.359718Z","title":"https://doi.org/10.1145/3372297.3417262","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:42.359718Z"},"links":{"citing_paper":"/paper/2501.00717"},"observation_digest":"sha256:8798a1d1eef0c2890cf921bc5aa77d6491f973eb5459faa1a1c0197631d8f5e9","observation_id":"faec9fc5-6d0d-45a0-835b-24d97db55bb3","resolution":{"observed_at":"2026-08-10T22:52:42.359718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.00717","last_updated":"2025-01-01T04:06:17Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T05:08:00.951375Z","submitted_at":"2025-01-01T04:06:17Z","title":"An efficient validated asynchronous byzantine agreement protocol using committee"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":4,"verified_fuzzy":26},"total_outbound_references":35},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2501.00717."}