{"as_of":"2026-08-20T20:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10bea2717376f76fd51419e3d5f9b1e3a443cd4250cb0dfd62b77beb7da04fb6","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T19:37:56.621936Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2603.02071/citation-record","integrity":"/paper/2603.02071/integrity","json":"/paper/2603.02071/citation-record.json","paper":"/paper/2603.02071"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-78023-3_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Asynchronous agreement on a core set in constant expected time and more efficient asynchronous vss and mpc","venue":"Lecture notes in computer science","work_id":"456d38d8-1977-4716-87b4-76197f7ed28d","year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:53.556154Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:bd8cf42a383c10ff3dc249ca7a19f790f886d70a1888c7b35dca43156d7169c7","observation_id":"2513fcda-e120-4361-89b2-917c18fef351","resolution":{"observed_at":"2026-08-02T19:38:39.085590Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-02T19:37:53.634593Z","title":"Nearly quadratic asynchronous distributed key generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:53.634593Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:325cb12846570098409e20a66809646081c51ac38122a0c021210e4cc686c95e","observation_id":"14dcae88-dc77-4ec1-b833-dd753f4aae16","resolution":{"observed_at":"2026-08-02T19:37:53.634593Z","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-02T19:37:53.743407Z","title":"Asynchronous agreement part 4: Crusader agreement and binding crusader agreement","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:53.743407Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:c24d20d38f54c874acda2972b7bf1c11173fb8d156d41f47fc2a380a652fec0b","observation_id":"398586d3-96e2-47c9-a711-812b8e61d238","resolution":{"observed_at":"2026-08-02T19:37:53.743407Z","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-02T19:37:53.810702Z","title":"Asynchronous algorand: Reaching agreement with near linear communication and constant expected time","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:53.810702Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:10b1c65d1cbad15612e3e5ea348394610a61202846da80c2a125f81ac38016d0","observation_id":"80dda11b-666d-41eb-af54-cf2a44d33e69","resolution":{"observed_at":"2026-08-02T19:37:53.810702Z","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-02T19:37:53.918686Z","title":"Reaching consensus for asynchronous distributed key generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:53.918686Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:a700dcc21e6803b75862285cf3817113553cb69bd6ff8852c060bf7e54d4f47d","observation_id":"49013260-6233-4841-a19b-ac8f9400ef6c","resolution":{"observed_at":"2026-08-02T19:37:53.918686Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T19:37:54.136552Z","title":"Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.136552Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:8739c7dd1a8cef4d2779ce2c0cc7e2350b521041f6feaba34f041b9768f24bb5","observation_id":"ff822150-0aa8-49d1-9bd8-219ddc763d25","resolution":{"observed_at":"2026-08-02T19:37:54.136552Z","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-02T19:37:54.210222Z","title":"Laerebog i matematisk analyse","venue":null,"work_id":null,"year":1920},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.210222Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:316f17538e7b695cdc4c1c0be67e1874fa58d60653b05f51ff072556416779d3","observation_id":"053a5ab5-4f68-4cbd-81df-4040a2bc5e92","resolution":{"observed_at":"2026-08-02T19:37:54.210222Z","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-02T19:37:54.318316Z","title":"An o(lg n) expected rounds randomized byzantine generals protocol","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.318316Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:3adf061a160d6f4ba8ae722ec6bec4c518eab63cda50c252437e1f0ae6eb2322","observation_id":"4f5e19ec-2809-4a60-9074-47904c65f037","resolution":{"observed_at":"2026-08-02T19:37:54.318316Z","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-02T19:37:54.468374Z","title":"An o(log n) expected rounds randomized byzantine generals protocol","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.468374Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:99096cef22f368d2475ec06fedb0b250f2b1ba924516d34f7be86edd554993c0","observation_id":"8030d0da-599a-4da2-8d18-2d9f700a4849","resolution":{"observed_at":"2026-08-02T19:37:54.468374Z","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-02T19:37:54.538541Z","title":"Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.538541Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:cdaa25c37f148fc4d22988fe926dd61b5bc56ea5c510a68ac6d4f69785f2a09a","observation_id":"bdde5d59-d9a8-4cf2-845d-4a2c7b1e2696","resolution":{"observed_at":"2026-08-02T19:37:54.538541Z","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-02T19:37:54.660035Z","title":"Fast asynchronous byzantine agreement with optimal resilience","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.660035Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:1f35796b91305de1043691652c8cb56fb588bdf18e8ab4cc4b2734b81cad1032","observation_id":"403839ba-a92c-4d23-b201-85e6370c7284","resolution":{"observed_at":"2026-08-02T19:37:54.660035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-48624-1_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited","venue":"Lecture notes in computer science","work_id":"a77eab5d-09a6-4cf2-9856-4fe0827c7881","year":2023},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.734870Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:466e03c2bdca7ae7092e91f4dd8e7fbc0712d4ee389725e739ec2068324ed014","observation_id":"d7049fbf-8dc4-4a12-bdec-c585ef7148e4","resolution":{"observed_at":"2026-08-02T19:38:38.746865Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-02T19:37:54.844106Z","title":"Asynchronous consensus without trusted setup or public-key cryptography","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.844106Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:02f9c76e960657ee7c027ab3e870d83a385111ce8718aa06b490700e8757e990","observation_id":"fe8727e6-0fbe-4198-8623-e4dbdcc96d74","resolution":{"observed_at":"2026-08-02T19:37:54.844106Z","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-02T19:37:54.917532Z","title":"Diffie and M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:54.917532Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:f544a1cf29c6aecb6ebd431fc793ca8429472a89b15282ac446c1d2981ee7cbc","observation_id":"425c2f44-83e7-4048-81d9-33536a9f79f1","resolution":{"observed_at":"2026-08-02T19:37:54.917532Z","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-02T19:37:55.138626Z","title":"The byzantine generals strike again","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.138626Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:1f518d7346bfa4183a180cbdf267c26940927e04385c0d138b19273e70fae500","observation_id":"5e0d178f-be45-4473-b346-485b10457d8e","resolution":{"observed_at":"2026-08-02T19:37:55.138626Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T19:37:55.254191Z","title":"Lynch, Shlomit S","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.254191Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:4c0c54e1021cea505c8ac64d0730d79771adbc3ec70f4ba25bb4f82ebf58d18b","observation_id":"974a6c34-c761-4969-9c25-aea1b2ad7042","resolution":{"observed_at":"2026-08-02T19:37:55.254191Z","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-02T19:37:55.315899Z","title":"Asymptotic expansions of central binomial coefficients and catalan numbers.J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.315899Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:07a20903fa08eb9192d357f82c0565b6fb82384e9e32686e7e5fc0f4cdf18e11","observation_id":"03ec3a2f-a9ac-4914-8293-a46e5b69faf8","resolution":{"observed_at":"2026-08-02T19:37:55.315899Z","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-02T19:37:55.527817Z","title":"Dragon: Decentralization at the cost of representation after arbitrary grouping and its applications to sub-cubic dkg and interactive consistency","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.527817Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:4633c7e45fcbff40a0fba751b1556020ed03e80ab6e5a8be47ca30937e519826","observation_id":"4f159bef-1a03-43d2-9ca0-c88196a90d12","resolution":{"observed_at":"2026-08-02T19:37:55.527817Z","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-02T19:37:55.629841Z","title":"Fischer, Nancy A","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.629841Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:a5fadfedfe8252e596978f6b763f34e87363fe2f75888157891b0a9127f55d7b","observation_id":"c33bdfe5-cbc6-40f5-b35e-06ec26a902b0","resolution":{"observed_at":"2026-08-02T19:37:55.629841Z","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.4230/lipics.disc.2022.24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Distributed Randomness from Approximate Agreement","venue":"arXiv (Cornell University)","work_id":"09af1976-455f-4752-8058-281a84abf952","year":2022},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.703868Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:fe44f01740f2b60c86a113c601ebbe2c885d66512ade04c7d191ff1ea9b89f2f","observation_id":"8e704050-9e19-4099-9c68-57d99cd0a630","resolution":{"observed_at":"2026-08-02T19:38:38.634462Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-02T19:37:55.783460Z","title":"Some elementary inequalities relating to the gamma and incomplete gamma function","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.783460Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:fdf02bf364ee655520faf99366e9a1d9a4910019797dbb0ea0c8552b5f986165","observation_id":"d9769fb4-6c2b-4971-b3d9-d1b362d959cb","resolution":{"observed_at":"2026-08-02T19:37:55.783460Z","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-02T19:37:55.876142Z","title":"A tight lower bound on adaptively secure full-information coin flip","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.876142Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:1ff88c8abeca73a3a267923859bed9922ab9bbd51286ca74fe5ab61364afed17","observation_id":"7d032745-d859-4b39-92f1-046309b6a90f","resolution":{"observed_at":"2026-08-02T19:37:55.876142Z","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/3639454","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Byzantine agreement with optimal resilience via statistical fraud detection","venue":"Journal of the ACM","work_id":"7d7f85a0-6a71-49c4-92a2-4b856e861b2a","year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.955704Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:a29e4839a6351d161b268c8163f41c26bccd5ff6fb1a692a211282ceb11528b7","observation_id":"def31522-bd8c-4102-af9e-6aa59ada45d0","resolution":{"observed_at":"2026-08-02T19:38:38.398894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-02T19:37:56.009080Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.009080Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:be5a21e48a420741ec333352e1ec43e48d44b7cad620c87593336747c89801b7","observation_id":"4cdb2f85-e30f-431d-9c1f-8a2fbd06f342","resolution":{"observed_at":"2026-08-02T19:37:56.009080Z","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-02T19:37:56.038660Z","title":"Kapron, David Kempe, Valerie King, Jared Saia, and Vishal Sanwalani","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.038660Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:ea28d4f1a736cfd6a7a6f9a14195fb7efb4d098b051d5240d37f8db08491c128","observation_id":"85cf9825-2a07-4f17-a491-e6690f76481d","resolution":{"observed_at":"2026-08-02T19:37:56.038660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05077","last_updated":"2025-01-04T16:18:17Z","snapshot_observed_at":"2026-08-16T18:46:40.519108Z","submitted_at":"2021-02-09T19:06:35Z","title":"The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05077","snapshot_observed_at":"2026-08-02T19:37:56.094840Z","title":"The multiplicative version of azuma’s inequality, with an application to contention analysis, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.094840Z"},"links":{"cited_paper":"/paper/2102.05077","citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:f529864d330b6f46a839c120a95d25fdcda42808229a66aebbe8b011a4ef64b8","observation_id":"c430cd24-abd3-48b8-9823-584bc0d2f2a5","resolution":{"observed_at":"2026-08-02T19:37:56.094840Z","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-02T19:37:56.192012Z","title":"The byzantine generals problem","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.192012Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:c96407f78a120888325cbf8eb943b0ca37d3220e9495981e498c6e135cbe1d04","observation_id":"936563fc-f6e1-49af-a169-abe7250b5974","resolution":{"observed_at":"2026-08-02T19:37:56.192012Z","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.4230/lipics.disc.2024.32","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum Byzantine Agreement Against Full-Information Adversary","venue":"arXiv (Cornell University)","work_id":"0ebbb284-3242-48b9-a1b5-de395e4861a5","year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.245309Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:f5dd00ebffb0379efc7c8712dc840cced6a4663e5b639af70ce42ae696e5d5c0","observation_id":"9f69fa35-902b-43c4-86e1-a422fddca8f9","resolution":{"observed_at":"2026-08-02T19:38:38.238079Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-02T19:37:56.273549Z","title":"Asynchronous Approximate Agreement with Quadratic Communication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.273549Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:3d6fab10a7cc1a5cd130ca0ce3689f1a4e9c70ce5379b25ee8b2e3a8a5c6b1c3","observation_id":"d16c81dc-ebe9-4190-b22c-03a382383800","resolution":{"observed_at":"2026-08-02T19:37:56.273549Z","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-02T19:37:56.318244Z","title":"Signature-free asynchronous binary byzantine consensus with t < n/3, o(n2) messages, and o(1) expected time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.318244Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:1d2ef8071f14f975c0f7ab6daf2dc5dc8ff18968eff132777821efa61d2fc186","observation_id":"a8efd4fe-3920-4e4d-b24b-646e11ecc005","resolution":{"observed_at":"2026-08-02T19:37:56.318244Z","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-02T19:37:56.375011Z","title":"The evolution of quantum secure direct communication: On the road to the qinternet","venue":null,"work_id":null,"year":1949},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.375011Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:c9ca6fa6a0a1f7d896ee5bb835997f082c2704115076f6e57a9c1b5b1dd7aeb7","observation_id":"18d701c6-fc1b-4654-a7b8-63e2ecb981ea","resolution":{"observed_at":"2026-08-02T19:37:56.375011Z","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-02T19:37:56.476791Z","title":"Pease, R","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.476791Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:71dbb0eee982d345e621a613805842b83c26e984b072490015c453777eec516b","observation_id":"8595c0ca-0b2a-4dee-901b-5653bf7e70f6","resolution":{"observed_at":"2026-08-02T19:37:56.476791Z","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-02T19:37:56.484348Z","title":"A theoretical take on a practical consensus protocol","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.484348Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:06d5f80c508bf6092846bdb4d605e5a6bae2990997db93afbd1e612038a137cf","observation_id":"830cdccf-4979-4502-9286-f56897d04d30","resolution":{"observed_at":"2026-08-02T19:37:56.484348Z","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-02T19:37:56.547029Z","title":"Randomized byzantine agreements","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.547029Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:fe07fe730ccecb5de58ef8b663515075b8fc2de8ca21daee228f12adf65bbd64","observation_id":"02628c74-3fb5-4a8f-9d57-8cd4545de686","resolution":{"observed_at":"2026-08-02T19:37:56.547029Z","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-02T19:37:56.574298Z","title":"Welch and Hagit Attiya.Distributed computing: fundamentals, simulations and advanced topics","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.574298Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:c198836027cd9bf8e8bd4be3cbe5d467e479d1b60260727d65d8a62ba1bcb1cc","observation_id":"662a4da3-d69e-4963-99bd-e6ce0faec414","resolution":{"observed_at":"2026-08-02T19:37:56.574298Z","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-02T19:37:56.621936Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.621936Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:4fe1a3ed134eb66d902236f8d3e0e99d2d965d3cf48f975f822deb40c0f764ee","observation_id":"d12d7330-316e-4fa5-9e7a-861b683c9d3b","resolution":{"observed_at":"2026-08-02T19:37:56.621936Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T19:37:55.027975Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":1976,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.027975Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:8648d1b34fc324e287476a200b42ebf4180d7a981ac0504372c1e23629d48bea","observation_id":"22b9227f-d16d-4eb9-aeef-6a755448274e","resolution":{"observed_at":"2026-08-02T19:37:55.027975Z","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-02T19:37:55.429767Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:55.429767Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:2db8fef1dbb2e40127ddc41baa3713469fa46843841df22ac6fad88ddb489078","observation_id":"336ddc73-3cbc-4bcf-86a6-0d4ad6d728e2","resolution":{"observed_at":"2026-08-02T19:37:55.429767Z","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-02T19:37:56.419836Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T19:37:56.419836Z"},"links":{"citing_paper":"/paper/2603.02071"},"observation_digest":"sha256:1212577bbddf5231b34484addd2b5bc92c4bf3dc699f7e40260e8e781ae544de","observation_id":"6eef5366-e676-4167-9176-0bb420576eb4","resolution":{"observed_at":"2026-08-02T19:37:56.419836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.02071","last_updated":"2026-06-21T08:55:57Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-20T10:35:21.563406Z","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":39},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2603.02071."}