{"as_of":"2026-08-13T02:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c51a3744c6975f490a70084405510b4e567bad073fa7a3941e48b369d8d6767","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:08:13.775112Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2509.01118/citation-record","integrity":"/paper/2509.01118/integrity","json":"/paper/2509.01118/citation-record.json","paper":"/paper/2509.01118"},"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-05T13:08:14.097980Z","title":null,"venue":null,"work_id":"90309f6a-8c07-4aec-87d2-dcf71b564df4","year":null},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.700337Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:57f8af5a56c4f0df404d295386541dbeacb6e0f4b78d551640a98b206c0ffa6a","observation_id":"244c1080-89dd-4558-a347-7ed2f16875b7","resolution":{"observed_at":"2026-08-05T13:08:14.100792Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.089128Z","title":"Solana: A new architecture for a high performance blockchain,","venue":null,"work_id":"ae0c39e1-309f-47c7-b529-4de878b87725","year":2018},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.704145Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:e1bb4147b5bcb1bfd99afc2a70c9bf58443e639462b36e6f234f31f4c1775120","observation_id":"480bace2-15ec-4adb-ad0b-6123dfc0e5d9","resolution":{"observed_at":"2026-08-05T13:08:14.092188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.081177Z","title":"Hotstuff: BFT consensus with linearity and responsiveness,","venue":null,"work_id":"59c1080c-12b4-467d-ac91-109cff747b19","year":2019},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.707427Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:8bc6219967a8e976c644251352b50db4e0188074bc22d1135faf665dd01855f5","observation_id":"3ac0bc8f-5b41-4cab-9a26-dda68bd81472","resolution":{"observed_at":"2026-08-05T13:08:14.083931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.072756Z","title":"Practical Byzantine fault tolerance,","venue":null,"work_id":"f2d12273-206d-4a88-829f-a84c107b0f83","year":1999},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.710896Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:c88e241f3aeb5b83ba5cb4230b8dca8f66cf0e7f546895c2b88a54f041f6c05e","observation_id":"08b9506a-7c41-4e7c-8553-05be6cf48ba9","resolution":{"observed_at":"2026-08-05T13:08:14.075961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.064013Z","title":"Hydrangea: Optimistic two-round partial synchrony,","venue":null,"work_id":"c4d4d4e4-e6fa-4257-9028-fcdcac41516f","year":2025},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.714450Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:2e1f6257024235d40270115f9d7327992efed0746deb6e267dc49b31efce7659","observation_id":"39a4842a-6ab5-42d0-b235-8ff33b5921ae","resolution":{"observed_at":"2026-08-05T13:08:14.067054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.054469Z","title":"The honey badger of BFT protocols,","venue":null,"work_id":"da44b139-0121-4cfa-90c4-baac591d99a7","year":2016},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.717802Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:435d4cda325b63545aa4b20e22df43a6cca8bee1915f6c5cbfa4abf6497205b0","observation_id":"752979b7-ad18-4106-9ed6-f4cf39fe1316","resolution":{"observed_at":"2026-08-05T13:08:14.058143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.045645Z","title":"EPIC: Efficient asynchronous BFT with adaptive security,","venue":null,"work_id":"2d06e5a7-4ae6-40b8-97c7-0f2371a107cb","year":2020},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.720917Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:76adf2c04a5c8220184581dbb161fa8d1caa71bcbefd6561cb6d5394249bb033","observation_id":"b5d689fe-94f1-4b55-b353-4738173faf68","resolution":{"observed_at":"2026-08-05T13:08:14.048361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.037459Z","title":"Ethereum consensus specifications,","venue":null,"work_id":"238233e8-38b1-44bd-ab60-5322727674c4","year":2022},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.724135Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:ff90650b7bab28b9d9e9325723c99e8d18476eb53fc1f12e3143361d93888f01","observation_id":"e812bac3-986e-450f-986a-7af1b47cccde","resolution":{"observed_at":"2026-08-05T13:08:14.040306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08936","last_updated":"2020-08-24T14:54:44Z","snapshot_observed_at":"2026-08-12T19:55:49.042575Z","submitted_at":"2019-06-21T03:55:19Z","title":"Scalable and Probabilistic Leaderless BFT Consensus through Metastability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08936","snapshot_observed_at":"2026-08-05T13:08:13.727177Z","title":"Scalable and probabilistic leaderless BFT consensus through metastability,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.727177Z"},"links":{"cited_paper":"/paper/1906.08936","citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:83d8988ad2ee0c379c5c0b45c16294c60622635bc15070af637f781b44cf4c89","observation_id":"bbc6f27a-8e86-4fcf-9ee6-22e36782cdec","resolution":{"observed_at":"2026-08-05T13:08:13.727177Z","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-05T13:08:14.029183Z","title":"Towards scalable threshold cryptosystems,","venue":null,"work_id":"a7190256-6a9e-4c99-94bb-d25a5c8356f4","year":2020},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.730657Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:5ff9a2e2a342c0f5a5c6da1289c0295be40d197e7546e1af541210aba4021dff","observation_id":"4e729328-0028-4116-a9c6-5f2b0c8d8e6b","resolution":{"observed_at":"2026-08-05T13:08:14.032070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.020582Z","title":"Zyzzyva: Speculative Byzantine fault tolerance,","venue":null,"work_id":"54392c5a-70ea-4604-8e5b-0aafbf71c9ac","year":2010},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.733600Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:2e24dd2eb8a5f5235753e34207085942ad899108d0208b83a9671a8a092eb2dd","observation_id":"64be9165-0ff2-4b30-a938-99a4d7f5d8a9","resolution":{"observed_at":"2026-08-05T13:08:14.023721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.012288Z","title":"SBFT: A scalable and decentralized trust infrastructure,","venue":null,"work_id":"54b333b3-6809-4413-b7f1-c602d96b5c03","year":2019},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.737148Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:0b2dbb06e45737c942f26d03a5e76f2ec711901b9de3b00d123fcba1c84df439","observation_id":"8fbac909-c511-4e2f-abca-eb52a1dfc33b","resolution":{"observed_at":"2026-08-05T13:08:14.015309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.08771","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:08:13.920162Z","title":"Kudzu: Fast and simple high-throughput BFT,","venue":null,"work_id":"1209bc93-c6fc-4d0b-a70c-673b65b84e30","year":2025},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.740371Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:9e201b6ab4930d6f0f9510e3a9b7f2dff126598ff61e1fa478b60f716f541dbd","observation_id":"713350c1-8f5a-4fdd-86cc-c2962f1cfd11","resolution":{"observed_at":"2026-08-05T13:08:13.924648Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:14.003027Z","title":"Solana websocket: Real-time blockchain data streaming,","venue":null,"work_id":"85652056-06fc-4093-9ea6-f6e742c0b1b0","year":2025},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.743219Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:48c58a8bf217f05df3476554f912eb3c1ae30b4b8c8b73656800e7beab503aed","observation_id":"858a6334-8bfd-475d-bb77-f6749e7078d8","resolution":{"observed_at":"2026-08-05T13:08:14.006717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10965","last_updated":"2020-12-31T17:37:25Z","snapshot_observed_at":"2026-08-10T05:15:29.103629Z","submitted_at":"2020-09-23T07:11:42Z","title":"Fundamental Limits of Byzantine Agreement","version":2},"cited_work":{"arxiv_id":"2009.10965","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.10965","snapshot_observed_at":"2026-08-05T13:08:13.832641Z","title":"Fundamental Limits of Byzantine Agreement","venue":"cs.IT","work_id":"38473318-ce6c-4bd8-8d78-dcf6094c29aa","year":2020},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.746119Z"},"links":{"cited_paper":"/paper/2009.10965","citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:4af68adeec56a5b2421a20caadd023a6575668811434019e5311de153c81783c","observation_id":"b374d56a-8836-41d5-bb4f-0c016c35bfdc","resolution":{"observed_at":"2026-08-05T13:08:13.836132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.993328Z","title":"Optimal error-free multi-valued Byzantine agreement,","venue":null,"work_id":"036a0b57-c004-412b-8f71-b975bbfbb9ab","year":2021},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.749683Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:515d624daf44c6cf7ed3d1d90c7a351a41d914dc29499dbed36252244196ecf5","observation_id":"c8ab5d97-2f6d-4621-a509-21af56e648d3","resolution":{"observed_at":"2026-08-05T13:08:13.996575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06008","last_updated":"2024-09-09T19:02:45Z","snapshot_observed_at":"2026-08-12T22:48:16.667042Z","submitted_at":"2024-09-09T19:02:45Z","title":"OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast","version":1},"cited_work":{"arxiv_id":"2409.06008","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.06008","snapshot_observed_at":"2026-08-05T13:08:13.819436Z","title":"OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast","venue":"cs.DC","work_id":"85af0261-ba17-4c1d-8127-1a8d442b58d9","year":2024},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.753773Z"},"links":{"cited_paper":"/paper/2409.06008","citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:876e59c51510092c8f4376a1701388e355ba8f59a5a0d09f87b9abadc0ba6355","observation_id":"e453a604-1931-4a2e-aff6-1f27f5df17c5","resolution":{"observed_at":"2026-08-05T13:08:13.822726Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.984275Z","title":"Polynomial codes over certain finite fields,","venue":null,"work_id":"c09177cb-028d-4fa6-a7d3-7bb986fca099","year":1960},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.756932Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:429259665a6391b1d71789482c46ad86756eb3fcea71b940761729dad14fc3cb","observation_id":"ce019748-c7de-4c0c-95e8-b1ce8e7d3391","resolution":{"observed_at":"2026-08-05T13:08:13.987475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.975129Z","title":"Expander codes,","venue":null,"work_id":"63310c88-bf10-4816-b348-68eb52602988","year":1996},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.759850Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:904d60de065d8ddfb21eb2371793c9519151f2f02f5595fc84d08aa2156340e8","observation_id":"3bfc6ff7-10d1-44ef-a37e-62da33bb00b2","resolution":{"observed_at":"2026-08-05T13:08:13.977976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.966681Z","title":"Asynchronous secure computation,","venue":null,"work_id":"4f292e3c-f94f-4eba-8bac-d6765ae8f24c","year":1993},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.762821Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:27f64c8912de69c0703398f190834a09d028af23eec56937a50590a46e06c92a","observation_id":"45f70bf1-84d0-4bac-b259-ecfcd35cb2c8","resolution":{"observed_at":"2026-08-05T13:08:13.969436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.958071Z","title":"SCRAPE: Scalable randomness attested by public entities,","venue":null,"work_id":"89098ec3-286e-4e50-aa91-95128785b8bb","year":2017},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.765918Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:33b40ddf4b098e42a9c053572735a3e17c98c4b231a5a525eb88899be977a099","observation_id":"aaf9cab9-494d-40f8-b2b8-7ae2125e6cd6","resolution":{"observed_at":"2026-08-05T13:08:13.961237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.949191Z","title":"Non-interactive distributed key generation and key resharing,","venue":null,"work_id":"1ead5dfa-93fb-4457-9191-4dc053799cc3","year":2021},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.769008Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:1bb51e7f09a19f325299a7ff3a5806f9eec63c341cc236635a054c869d68019a","observation_id":"fe90c9dd-7ceb-4a75-80c7-4abe2caf6083","resolution":{"observed_at":"2026-08-05T13:08:13.952237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11788","last_updated":"2025-01-25T04:27:12Z","snapshot_observed_at":"2026-08-10T17:50:20.029322Z","submitted_at":"2025-01-20T23:36:11Z","title":"OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement","version":2},"cited_work":{"arxiv_id":"2501.11788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11788","snapshot_observed_at":"2026-08-05T13:08:13.804498Z","title":"OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement","venue":"cs.DC","work_id":"0993ed55-450c-477c-aa6d-a88d49ebdd0c","year":2025},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.771894Z"},"links":{"cited_paper":"/paper/2501.11788","citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:976198ffc264cbae1e189d4d9502541a8956a6e1ce736f379c82ec262ba0ad1f","observation_id":"26ee45b2-9194-4f1d-becf-a1467c3da5e9","resolution":{"observed_at":"2026-08-05T13:08:13.810022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T13:08:13.939936Z","title":"Asynchronous consensus without trusted setup or public-key cryptography,","venue":null,"work_id":"94c892c2-8295-4cb5-88b0-cf001b0ac257","year":2024},"citing_paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:08:13.775112Z"},"links":{"citing_paper":"/paper/2509.01118"},"observation_digest":"sha256:d727d71c31e0b66a35ddf3c00e5d03d0db240a00244145f16c44c88a7acbd37d","observation_id":"cf5fdbc6-2493-4d18-aa2f-d2b625ab478b","resolution":{"observed_at":"2026-08-05T13:08:13.943015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.01118","last_updated":"2025-09-10T02:59:01Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-12T11:31:29.866033Z","submitted_at":"2025-09-01T04:24:33Z","title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":18},"total_outbound_references":24},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2509.01118."}