{"as_of":"2026-08-17T00:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f394cebdc8909b2cf5426936004f31be3a18152f8daea247ec867d8a311ea64","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:47:48.696466Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T23:37:41.941179Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T23:42:16.614012Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"cited_work":{"arxiv_id":"2502.09116","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09116","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.09116 (2025)","venue":null,"work_id":"db6bbbbe-4390-4862-b5b8-c1d575eaef08","year":2025},"citing_paper":{"arxiv_id":"2503.16783","last_updated":"2026-05-17T12:33:06Z","snapshot_observed_at":"2026-08-16T20:20:58.087546Z","submitted_at":"2025-03-21T01:39:29Z","title":"CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T23:37:41.941179Z"},"links":{"cited_paper":"/paper/2502.09116","citing_paper":"/paper/2503.16783"},"observation_digest":"sha256:49ea428dbbba4cec2d37616e7b66fb5ad07665953b77dc601d5e4b4ce89d78c5","observation_id":"b49c306f-cced-4b72-a7a3-ddd83bb841c1","resolution":{"observed_at":"2026-05-22T23:42:16.616682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"cited_work":{"arxiv_id":"2502.09116","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09116","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.09116 (2025)","venue":null,"work_id":"db6bbbbe-4390-4862-b5b8-c1d575eaef08","year":2025},"citing_paper":{"arxiv_id":"2604.08914","last_updated":"2026-04-10T03:20:16Z","snapshot_observed_at":"2026-07-06T22:57:55.179136Z","submitted_at":"2026-04-10T03:20:16Z","title":"Finding Nemo-Nemo: CFT DAG-based Consensus in the WAN","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:56:01.360158Z"},"links":{"cited_paper":"/paper/2502.09116","citing_paper":"/paper/2604.08914"},"observation_digest":"sha256:aeaf8c6f278947ef8d197591d02d01daa671b496ab139008005202b377491274","observation_id":"f434a5cb-6595-4a14-b12b-e0f9b52907be","resolution":{"observed_at":"2026-05-11T05:51:02.237407Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"cited_work":{"arxiv_id":"2502.09116","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09116","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.09116 (2025)","venue":null,"work_id":"db6bbbbe-4390-4862-b5b8-c1d575eaef08","year":2025},"citing_paper":{"arxiv_id":"2604.21910","last_updated":"2026-04-23T17:52:52Z","snapshot_observed_at":"2026-08-16T20:44:54.123259Z","submitted_at":"2026-04-23T17:52:52Z","title":"From Research Question to Scientific Workflow: Leveraging Agentic AI for Science Automation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T21:24:43.778166Z"},"links":{"cited_paper":"/paper/2502.09116","citing_paper":"/paper/2604.21910"},"observation_digest":"sha256:065c583772fa1058f8c56318df3b746052bfc1648e10b52a468af853f7bc3890","observation_id":"4cb902e9-37ee-4431-a6b3-c1dea4ba4166","resolution":{"observed_at":"2026-05-11T14:36:08.235757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.09116/citation-record","integrity":"/paper/2502.09116/integrity","json":"/paper/2502.09116/citation-record.json","paper":"/paper/2502.09116"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.610388Z","title":"Aiyer, Lorenzo Alvisi, and Rida A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.610388Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:75fb067ce15316a87221f1fe30fdfc482a4768f4363c60489e1db176c6c1d9ea","observation_id":"f7b9dd0a-6413-4b93-9840-4cdccc4fdfef","resolution":{"observed_at":"2026-08-07T22:47:48.610388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2903136","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Are lock-free concurrent algorithms practically wait-free? J","venue":"Journal of the ACM","work_id":"819bc902-8636-4e6f-a5e6-43637bf1aab6","year":2016},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.614676Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:17d62b2f46f84f3925c17f6393c93aa9466bfd809ceb79f9f2ec8d656c2d6470","observation_id":"56abf841-3224-4e16-8dba-7ce53f919e6d","resolution":{"observed_at":"2026-08-07T22:47:48.776747Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.618401Z","title":"Lock-free algorithms under stochastic schedulers","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.618401Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:360fd18311b7132a0f37cb0a33ef4059715cbcab40d691d9c1b5a748d5c4dd34","observation_id":"3572af0f-f81d-4ec1-9848-b7b2bad5c9c3","resolution":{"observed_at":"2026-08-07T22:47:48.618401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0196-6774(02)00220-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fast deterministic consensus in a noisy environment","venue":"Journal of Algorithms","work_id":"d6c037bf-fbf4-4fec-9233-5e1596757198","year":2002},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.622281Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:9db62f7edacfbc1d07069540a7517c6428a752ef5f1f66ce79f28f49e11d2242","observation_id":"564f86f9-22ea-481b-b69c-9528dd7c2225","resolution":{"observed_at":"2026-08-07T22:47:48.766802Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2158.36628","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.715658Z","title":"Probabilistic byzantine fault tolerance","venue":null,"work_id":"3a792ee8-2337-4729-ba4f-89d5cfdbb1e0","year":2024},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.625895Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:50ffd0a022ca9d1354d1e374b3b28fe307fadb122a799a8c1d062b73232d2400","observation_id":"7884f3f9-520b-4848-871c-b02983bf0f16","resolution":{"observed_at":"2026-08-07T22:47:49.720095Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.855316Z","title":"Sok: Consensus in the age of blockchains","venue":null,"work_id":"38bfaba5-118a-4491-bbe6-30744bf0215d","year":2019},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.629153Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:dc49812aa61ce9126d7fbb8c5ca6fab68be33689c4eb3c3bc15f0bb9ead582e5","observation_id":"f3725cc9-acd7-4345-bf19-799e6698ede3","resolution":{"observed_at":"2026-08-07T22:47:49.859589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.632919Z","title":"Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.632919Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:0bb412afddafa0da9734a4add7fc0b4fe0f73b6907706a411dd206456b14752c","observation_id":"4ea1b7f1-56eb-48e7-a687-f54efef6a4f6","resolution":{"observed_at":"2026-08-07T22:47:48.632919Z","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":"4221.21413","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.546711Z","title":"Asynchronous consensus and broadcast protocols","venue":null,"work_id":"da36a930-d4b6-4664-a5e8-4396c1747854","year":1985},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.636127Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:050ccec9b5c884bd8a1ba70deb69adeda4e1d70eaa733a1c9fb8258d64184855","observation_id":"a44fe043-9952-49cd-9a66-84f04c91cb5f","resolution":{"observed_at":"2026-08-07T22:47:49.552412Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.639413Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.639413Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:047a9a4be01c0fbd21a5eee9040e05b472ca04c454a44444f72e6df461c2ac66","observation_id":"d8374057-4ed9-415c-8cfb-58e962e2a26f","resolution":{"observed_at":"2026-08-07T22:47:48.639413Z","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":"3477.34353","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.479986Z","title":"Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract)","venue":null,"work_id":"08b0feda-46d2-4e9c-a002-d96f60b43044","year":2000},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.642607Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:19fa1bf2aac1d41731882ef1388bb46f471ac61fba836d54983788c20b51f814","observation_id":"3f837210-7e76-4d60-93f2-ec3baefd0fb5","resolution":{"observed_at":"2026-08-07T22:47:49.485108Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.645235Z","title":"Narwhal and tusk: a dag-based mempool and efficient BFT consensus","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.645235Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:1cce5af19cece9b73693085a0802ed674e6b4645e296eda2f72120eaae12c28a","observation_id":"c4043535-8f99-4710-b6c9-5008b0cf8d98","resolution":{"observed_at":"2026-08-07T22:47:48.645235Z","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-07T22:47:49.842528Z","title":"Consensus in the presence of partial synchrony","venue":null,"work_id":"10ed8b1d-3a29-482c-97c2-c4fd5a4cc9f0","year":1988},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.648084Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:8cc65db291ce5b2070f3004b0c09a3813c320620aeddab8f087d6d9edf8aaa29","observation_id":"e06cd088-776c-4517-bb40-6c5f8abe0adb","resolution":{"observed_at":"2026-08-07T22:47:49.846824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8058.58806","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.315790Z","title":"Fischer, Nancy A","venue":null,"work_id":"62d30bd2-f696-4985-886b-00899a161eec","year":1983},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.650641Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:b77abf1184cc3e320a75a3d50f93562cfcc8beba260dad4ffe4c9a8b67b54a96","observation_id":"a60a8fff-6325-4623-b936-d81f0b2fe7a3","resolution":{"observed_at":"2026-08-07T22:47:49.320770Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7697.27772","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.229938Z","title":"Round-by-round fault detectors: Unifying synchrony and asynchrony (extended abstract)","venue":null,"work_id":"c3c2270e-78bd-4f7a-8933-9cd172e8720e","year":1998},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.653139Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:5e943c78c6baad9bfb9be29df446e3ebf27ca540b0da440b83058c404ffb8ecd","observation_id":"809933b5-4c6f-4197-a198-0fcd274b0df6","resolution":{"observed_at":"2026-08-07T22:47:49.235187Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.830145Z","title":"An Empirical Study of Consensus Protocols’ DoS Resilience","venue":null,"work_id":"5228abe0-9a39-4ab6-b07c-0948fdf4dfec","year":2024},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.655671Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:936185e0e11b7150cf89b0f1cbb1391b0f5af9e68e377d11bb32e4b18cb0dee4","observation_id":"966cccdc-b6e4-4867-a6ab-aeb328d7af11","resolution":{"observed_at":"2026-08-07T22:47:49.834526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08670","last_updated":"2024-10-17T14:06:29Z","snapshot_observed_at":"2026-08-16T13:10:23.848665Z","submitted_at":"2024-10-11T09:54:56Z","title":"Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08670","snapshot_observed_at":"2026-08-07T22:47:48.658133Z","title":"Mahi-mahi: Low-latency asynchronous bft dag-based consensus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.658133Z"},"links":{"cited_paper":"/paper/2410.08670","citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:068d3a8e48df9b01457a88c5f070cbcd871cf01dc97cdc8e18e62d74bdc3a4c0","observation_id":"f7904659-a162-4a5e-9753-c68ae28b60a9","resolution":{"observed_at":"2026-08-07T22:47:48.658133Z","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-07T22:47:49.817624Z","title":"All You Need is DAG","venue":null,"work_id":"ed621322-2808-4cda-a9d0-7cbf28161f92","year":2021},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.661091Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:81db97b354182b86c45b915639846174bd21fc97370fc44a26db9d10accc0266","observation_id":"8648e17d-9e03-42d6-86d4-2cb9a54a27c9","resolution":{"observed_at":"2026-08-07T22:47:49.821858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2402.32239","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.132074Z","title":"The weak byzantine generals problem","venue":null,"work_id":"62bde2d2-d146-4e0a-97ab-55c300f2527e","year":1983},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.663588Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:d33625631e1df706fc37eca689a5e66118f9fbfea79efc535d6dfc63cf3724cb","observation_id":"63c867e3-4599-4f52-8252-1ea5e87ee541","resolution":{"observed_at":"2026-08-07T22:47:49.137175Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.666081Z","title":"Shostak, and Marshall C","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.666081Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:74cf600843f05e3955baed9b719e28cef08eff0d37ab8fdbab2e5540c686b84a","observation_id":"559f17d9-d5cd-4834-b4c6-2580f7a49f65","resolution":{"observed_at":"2026-08-07T22:47:48.666081Z","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":"2001.3054","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.001185Z","title":"Reiter, Avishai Wool, and Rebecca N","venue":null,"work_id":"57ea5892-e874-4423-baf0-d622d4fdaeb2","year":2001},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.669569Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:3ee3cdf5e7b5275605f3f0fea48ae418b5f84e02ff33b097856bb63fa3f079ee","observation_id":"386f18e1-f8cb-4428-ade4-ea2b85451edb","resolution":{"observed_at":"2026-08-07T22:47:49.006395Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tdsc.2008.76","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"RITAS: services for randomized intrusion tolerance","venue":"IEEE Transactions on Dependable and Secure Computing","work_id":"d661ce15-2a8a-4d89-896a-5dfbfd1498fb","year":2011},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.673014Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:6e1b6cd2bbb6dae368a29eba029486936ce82936e385ffdfac9a689ef709be56","observation_id":"b72ba61c-1e49-4d62-accd-155a86507a5c","resolution":{"observed_at":"2026-08-07T22:47:48.750148Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.676556Z","title":"Signature-free asynchronous binary byzantine consensus with t < n/3 , o(n^2) messages, and o(1) expected time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.676556Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:3c5fd0385e678c9d0bcfc3a8432b84e3faea57301886afdf99301c3a49482d21","observation_id":"f94c59b1-2099-4cf9-8c12-105a9dec7cc8","resolution":{"observed_at":"2026-08-07T22:47:48.676556Z","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-07T22:47:48.679779Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.679779Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:ab30768fb1fe1a08ac3aabc0132a79c254673e21c9a9d639f721d0f7d5c31eb2","observation_id":"e1440255-b6fd-4783-a76d-f10e96f04e9d","resolution":{"observed_at":"2026-08-07T22:47:48.679779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.11046","last_updated":"2017-07-14T07:40:08Z","snapshot_observed_at":"2026-08-14T20:57:03.446285Z","submitted_at":"2017-05-31T11:54:44Z","title":"Implicit Consensus: Blockchain with Unbounded Throughput","version":3},"cited_work":{"arxiv_id":"1705.11046","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.11046","snapshot_observed_at":"2026-08-07T22:47:48.938325Z","title":"Implicit Consensus: Blockchain with Unbounded Throughput","venue":"cs.DC","work_id":"f7bc343c-3b7e-49b6-8e97-8ac1e1dbe5aa","year":2017},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.683048Z"},"links":{"cited_paper":"/paper/1705.11046","citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:a28f0bed8f63fbdd3c011d614fd4f1cccbf952d5da10556f93c669d6dc182264","observation_id":"2ef8625a-6c36-4375-ae7f-0405c3bcdbbd","resolution":{"observed_at":"2026-08-07T22:47:48.941860Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.686755Z","title":"Bullshark: DAG BFT protocols made practical","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.686755Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:a4535d1ee1ef96a2eb89f539c3c42a9488e9e58871ff8912eeadd32f655f6756","observation_id":"886118aa-0a2b-46f0-8f4b-7f470b1f669f","resolution":{"observed_at":"2026-08-07T22:47:48.686755Z","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":"7697.27775","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:48.857103Z","title":"Structured derivations of consensus algorithms for failure detectors","venue":null,"work_id":"ba961943-752b-47ed-b548-175a919a4fa8","year":1998},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.690019Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:eb9f93dd07f0eb97d329207717cae8a75e6a18228e4d7dde021dfe93dd80d5c4","observation_id":"cc3d7665-4090-45aa-a960-25252e062981","resolution":{"observed_at":"2026-08-07T22:47:48.862557Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00446-005-0133-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Signed quorum systems","venue":"Distributed Computing","work_id":"108436ec-9b73-4b10-a904-f60e714609fb","year":2006},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.692996Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:b0dfebf8ceb3b542def1c0d745ae5cbb98ec086e63cb080c8f9855abaed296d2","observation_id":"b8d05c3f-34b2-4f84-b9d4-9664947e794c","resolution":{"observed_at":"2026-08-07T22:47:48.726570Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:49.797924Z","title":"Waterbear: Practical asynchronous BFT matching security guarantees of partially synchronous BFT","venue":null,"work_id":"10d419cf-db24-4984-b083-5c7bd46e94a1","year":2023},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.696466Z"},"links":{"citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:71074c08deba4702456aa3deb9f70abb9b46dc98926cfd30e1ed0871f6135d68","observation_id":"22c57809-7cb7-41dc-b425-9da2392fb49f","resolution":{"observed_at":"2026-08-07T22:47:49.800990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-13T11:27:27.632180Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":10,"verified_exact":6,"verified_fuzzy":5},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 3 inbound Pith citation observations for arXiv:2502.09116."}