{"as_of":"2026-08-07T21:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1eed405b325a0c2061d2ea579d0a77ad07a1b86eef7a6e390b025d1f0367afce","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T14:40:38.891652Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2512.19968/citation-record","integrity":"/paper/2512.19968/integrity","json":"/paper/2512.19968/citation-record.json","paper":"/paper/2512.19968"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:40:34.358679Z","title":"Accessed: 2025- 01-02","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.358679Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:6fe39892b97179e0a956e6440600d1d23f4aee1fff5d6d7f2452c850df5c53bf","observation_id":"f15241b3-9b13-48f5-b183-1fa86aa127f0","resolution":{"observed_at":"2026-08-03T14:40:34.358679Z","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-03T14:40:34.477063Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.477063Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:314e572b3e575d32d485c73f9f020854781fffbbc69167eadf68fc59e1a8321c","observation_id":"3ed9f94a-8116-4a40-a177-dc5c899b0536","resolution":{"observed_at":"2026-08-03T14:40:34.477063Z","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-03T14:40:34.605409Z","title":"Winkle: Foiling Long-Range Attacks in Proof- of-Stake Systems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.605409Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:ba02d91775d2d3ebc9206fb79f8825d1ef75efb47f280bcc7f666ae346de684e","observation_id":"501239a3-a7ca-404c-b11c-1ab747ddb4af","resolution":{"observed_at":"2026-08-03T14:40:34.605409Z","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-03T14:40:34.697843Z","title":"Pikachu: Securing PoS Blockchains from Long-Range Attacks by Checkpointing into Bitcoin PoW using Taproot","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.697843Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:9bcf94707c8bd30ee53ba1d980d3ee71d957c5eca58a21a42bb47eb55694d89b","observation_id":"b6584154-0383-44bc-b04e-a4a304d9a439","resolution":{"observed_at":"2026-08-03T14:40:34.697843Z","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-03T14:40:34.859756Z","title":"Prism: Deconstruct- ing the blockchain to approach physical limits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.859756Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:6d7d95d0b330c9a95f15ec99214a1c58b022ba267af726a5d611a810210c3307","observation_id":"1e3b0f18-d275-4246-ab77-55dc7863289c","resolution":{"observed_at":"2026-08-03T14:40:34.859756Z","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-03T14:40:34.915606Z","title":"Another advantage of free choice (extended abstract) completely asynchronous agree- ment protocols","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:34.915606Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:9ee1c68e908edf91e8102eb93a79c8e905df39660417db360869e433d6c57a80","observation_id":"a771c1e6-2d63-411b-ac7a-06e082f26db1","resolution":{"observed_at":"2026-08-03T14:40:34.915606Z","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-03T14:40:35.009743Z","title":"Verifiable Delay Functions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.009743Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:53423103ed18e3a4b92869b71c1c690b6aa174b9c4746fba56f7d388561d58ad","observation_id":"42b36ded-5162-4727-9076-db5a9a83c424","resolution":{"observed_at":"2026-08-03T14:40:35.009743Z","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-03T14:40:35.084412Z","title":"The latest gossip on BFT consensus, November 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.084412Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:3c86a20da0245fe4ee6aeb5a7dd4b2d604d1562c5c9f435f04d13956d5500a09","observation_id":"74b32fff-4ca8-434c-9b2f-bd05e709ee42","resolution":{"observed_at":"2026-08-03T14:40:35.084412Z","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-03T14:40:35.163379Z","title":"The Economic Limits of Permissionless Con- sensus, June 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.163379Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:b6476be4217857c249b286c52e1bbbb9a997e90fb6a29107f71ed749d87c8e24","observation_id":"189b9f30-22fd-4392-803a-093f22ec1357","resolution":{"observed_at":"2026-08-03T14:40:35.163379Z","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-03T14:40:35.206891Z","title":"An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.206891Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:d1c25746a07397332e9fa22109c43d5a1a4f4e76e36935140a030e718f90987e","observation_id":"c64ec1f8-9f3a-4ee7-89bc-539fdd7dbd0a","resolution":{"observed_at":"2026-08-03T14:40:35.206891Z","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-03T14:40:35.249226Z","title":"Atomic broadcast: From simple message diffusion to byzantine agreement.Information and Computation, 118(1):158–179, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.249226Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:3b509bf2079d63f5921993bd3676700d2bc75c182deb6cc79cbeeb0aa4580245","observation_id":"af1ec1b0-f947-44bf-b706-7719c680e60f","resolution":{"observed_at":"2026-08-03T14:40:35.249226Z","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-03T14:40:35.340622Z","title":"Snow White: Robustly Reconfigurable Consensus and Appli- cations to Provably Secure Proof of Stake","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.340622Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:6864bec2624fa540875b9537d3c71153ae6349164d3929f3f083d0ded2b37095","observation_id":"6bf1836b-0252-4097-b99a-649930cce816","resolution":{"observed_at":"2026-08-03T14:40:35.340622Z","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-03T14:40:35.487485Z","title":"Goldfish: No More Attacks on Proof-of-Stake Ethereum, May 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.487485Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:8a800803d53db161e4861a2e7db7f227ff1045c939e2b433fc490a5155219716","observation_id":"28dc1b3c-f0a2-405d-8e43-93ca6ec707cb","resolution":{"observed_at":"2026-08-03T14:40:35.487485Z","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-03T14:40:35.603119Z","title":"PoSAT: Proof-of-Work Availability and Unpredictabil- ity, Without the Work","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.603119Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:b6047fdb3a86d69cd6d2c914dbdd7169c087a99e5df1ebb090168c2e6b158999","observation_id":"b90f7341-8434-4c8f-b8ee-ff932970a62b","resolution":{"observed_at":"2026-08-03T14:40:35.603119Z","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-03T14:40:35.680171Z","title":"Everything is a race and nakamoto always wins","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.680171Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:7de4c6d55c3a361070ebe9f8156a0e5186ab57846661ef8246cceb1621cb1ee2","observation_id":"2cde1668-79c6-4463-a925-61efee1531b5","resolution":{"observed_at":"2026-08-03T14:40:35.680171Z","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-03T14:40:35.916395Z","title":"On the security of public key protocols.IEEE Transactions on infor- mation theory, 29(2):198–208, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:35.916395Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:242be179f51f6aeaf9087016339052edecb9cb3795cf82c0d1b28090a44d5485","observation_id":"c5cfa4ed-ba83-4e21-89d2-b355965debdb","resolution":{"observed_at":"2026-08-03T14:40:35.916395Z","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-03T14:40:36.014763Z","title":"Bitcoin-NG: A scalable blockchain protocol","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.014763Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:85d44b115abcd1ce8ff2783fc8dca5b93b7f8e383de4494115420611cb5e36d3","observation_id":"11db4383-e8d1-4c27-85a7-ddcf5fabd455","resolution":{"observed_at":"2026-08-03T14:40:36.014763Z","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-03T14:40:36.113977Z","title":"An optimal probabilistic protocol for synchronous byzantine agree- ment.SIAM Journal on Computing, 26(4):873–933, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.113977Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:937082031624d06b16a337851ffeb246f84a2f104698bcd8c04cf49feba594e8","observation_id":"d2ddd42c-02f1-4829-839c-7d68a2754a60","resolution":{"observed_at":"2026-08-03T14:40:36.113977Z","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-03T14:40:36.353995Z","title":"Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.353995Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:afa8f1e19fdd7431c3e796a1b5e478ce0fb2e71fca09814695b00e9a8d081755","observation_id":"a7781727-2d77-4faf-806a-f02bdf78edec","resolution":{"observed_at":"2026-08-03T14:40:36.353995Z","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-03T14:40:36.448680Z","title":"Round-by-round fault detectors, unifying synchrony and asynchrony (extendeda abstract)","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.448680Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:6b51bef24e1f61e676dfcc70e29e92e5f754b502f7ccb4a053eeccf16cefe159","observation_id":"13c9156d-14e5-47bc-8a5c-c092b30d82e9","resolution":{"observed_at":"2026-08-03T14:40:36.448680Z","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-03T14:40:36.609361Z","title":"Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.609361Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:a46563e2719c3700423415722d6bd503f358f0ab7ce36466628ddb87c07b48c9","observation_id":"4240f506-bf10-4d0e-be5f-f4a67dc8c62c","resolution":{"observed_at":"2026-08-03T14:40:36.609361Z","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-03T14:40:36.699165Z","title":"The Bitcoin Backbone Protocol: Analysis and Applications","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.699165Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:0df82526251b7a7204e09386c1aeadd4917dd9ac511a778d20148edcd8defc41","observation_id":"5b282a4f-5673-4bd8-8439-67aff4dd5f9e","resolution":{"observed_at":"2026-08-03T14:40:36.699165Z","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-03T14:40:36.781035Z","title":"Proof-of-Work-Based Consensus in Expected-Constant Time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.781035Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:b31dc95999031101aadc1e0eb345d98162fc60dbcaf143be93e02910f4b9b947","observation_id":"181a9c72-693e-42ab-a64a-120af54a61bb","resolution":{"observed_at":"2026-08-03T14:40:36.781035Z","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-03T14:40:36.877610Z","title":"Algorand: Scaling byzantine agreements for cryptocurrencies","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:36.877610Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:6572484cea7f437ce994b7d9aef86effee777c195d0f84419b9d78f9df06da7c","observation_id":"d9216ed1-63b2-47de-bf93-3e101a3e5024","resolution":{"observed_at":"2026-08-03T14:40:36.877610Z","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-03T14:40:37.068587Z","title":"The knowledge complexity of interactive proof- systems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.068587Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:9a4d6b88c4ff0d79799aa17a2f655e510c1f1a45cb7cbd09e100073e397e4872","observation_id":"05f0a802-08c8-4519-bce8-04dffa372b3d","resolution":{"observed_at":"2026-08-03T14:40:37.068587Z","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-03T14:40:37.189285Z","title":"On expected constant-round protocols for byzantine agreement","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.189285Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:856c2862fb1a997cb2621e26ce9dcf27dafaf47321d8a2c8937f7e13646ba34e","observation_id":"a883cb26-0a73-4761-9e2f-5fdd98483842","resolution":{"observed_at":"2026-08-03T14:40:37.189285Z","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-03T14:40:37.248490Z","title":"Parallel Proof-of-Work with Concrete Bounds","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.248490Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:43062e3bd0ebf05d542dca3f046015207e52c4d2c4c12dfa3ea893fdaaf1c9d9","observation_id":"a101dc05-b32b-41ba-a73d-169a1edf5bd5","resolution":{"observed_at":"2026-08-03T14:40:37.248490Z","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-03T14:40:37.417611Z","title":"Short paper: Posh proof of staked hardware consensus.Cryptology ePrint Archive, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.417611Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:298aea60923667ae2743e8bad8acf73a639b039de45f6ba77c2275219be72fab","observation_id":"3c53ac4d-00a5-4d33-b60a-0acd193f8d71","resolution":{"observed_at":"2026-08-03T14:40:37.417611Z","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-03T14:40:37.503297Z","title":"Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.503297Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:4908bb04d6af14f6201e1570cb21c95bc590b49cdcaac58471dbcfa294ce04a8","observation_id":"964d7f47-a2bf-4777-be32-aa176b48849a","resolution":{"observed_at":"2026-08-03T14:40:37.503297Z","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-03T14:40:37.571821Z","title":"Time, clocks, and the ordering of events in a distributed system.Communications of the ACM, 21(7):558–565, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.571821Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:fec2d2395af664d967410da82857e487cb2e1ba0b98f79473488f3b5f0c39855","observation_id":"3b9a8893-3f6a-4969-9a03-86b17d2b893a","resolution":{"observed_at":"2026-08-03T14:40:37.571821Z","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-03T14:40:37.628017Z","title":"Byzantine generals in the permissionless setting","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.628017Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:19e06568e818ff1838ef07db20737163fd038a0d88996d66ab817cd5237a7fea","observation_id":"16c71abb-5ec7-4fba-9b75-8aeb1216c776","resolution":{"observed_at":"2026-08-03T14:40:37.628017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14701","last_updated":"2024-03-03T13:13:36Z","snapshot_observed_at":"2026-08-02T17:23:57.287033Z","submitted_at":"2023-04-28T09:15:55Z","title":"Permissionless Consensus","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.14701","snapshot_observed_at":"2026-08-03T14:40:37.668861Z","title":"Permissionless Consensus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.668861Z"},"links":{"cited_paper":"/paper/2304.14701","citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:07d8189cc61d2a9c54b5e80af72faf75767636f92bdd043bf237e22f356f5c5c","observation_id":"710b88b7-b4ca-434e-a1ca-52931811dc27","resolution":{"observed_at":"2026-08-03T14:40:37.668861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06394","last_updated":"2021-07-20T15:18:18Z","snapshot_observed_at":"2026-08-07T01:32:05.768653Z","submitted_at":"2019-08-18T08:11:21Z","title":"Nakamoto Consensus with Verifiable Delay Puzzle","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06394","snapshot_observed_at":"2026-08-03T14:40:37.705286Z","title":"Nakamoto consensus with verifiable delay puzzle.arXiv preprint arXiv:1908.06394, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.705286Z"},"links":{"cited_paper":"/paper/1908.06394","citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:37918b16deeaa2b9d228f65938641971d982a74670660157fe7a9526ba175476","observation_id":"56d6f03d-58fb-4d04-844e-8c4caab03bfd","resolution":{"observed_at":"2026-08-03T14:40:37.705286Z","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-03T14:40:37.775277Z","title":"Formal models of the Sieve-MMR protocol, October 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.775277Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:d35cddcb7004212ed7d01ed31b1078b44d96a4c5ccbb3f3b4047ad100afc7476","observation_id":"78fcb223-7d0a-491e-92c0-6e5a1114d707","resolution":{"observed_at":"2026-08-03T14:40:37.775277Z","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-03T14:40:37.845331Z","title":"Consensus in the Unknown-Participation Message-Adversary Model, October 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.845331Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:bd0c3b9722ac454e95d19d81e01746748f6275c5f87a70319e2e67ae4aa81360","observation_id":"1d74644f-be34-4823-a2d7-777b0ad3be85","resolution":{"observed_at":"2026-08-03T14:40:37.845331Z","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-03T14:40:37.914009Z","title":"Towards practical sleepy BFT","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:37.914009Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:84354976b0888e5cef02ca1f3ef99cf9f2e3b398bf3819dac0d2a1d4faf1dda6","observation_id":"a3b5592b-10d2-4a3c-a51a-faf985367b10","resolution":{"observed_at":"2026-08-03T14:40:37.914009Z","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-03T14:40:38.018485Z","title":"Towards Practical Sleepy BFT","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.018485Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:b1b171dc647526d433f917827fbb9c7310b3c243f3c44fa72ef51050f2699107","observation_id":"3672deea-8b6d-4875-9db9-e793075d97ff","resolution":{"observed_at":"2026-08-03T14:40:38.018485Z","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-03T14:40:38.055390Z","title":"Micali, M","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.055390Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:f5adf270d3a59f165229a9717e8ef6952a82e8307504e19a6473a56acfe515f1","observation_id":"77af7e4e-62a6-4b2a-99b9-de421f089e2b","resolution":{"observed_at":"2026-08-03T14:40:38.055390Z","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-03T14:40:38.144121Z","title":"Constant Latency in Sleepy Consensus","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.144121Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:579ca03773460211c542f955d0dab834dc47e65b875f71bf65802d3d9ab07eb1","observation_id":"a11f8229-7dc2-4bba-8b54-ece54140f725","resolution":{"observed_at":"2026-08-03T14:40:38.144121Z","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-03T14:40:38.201821Z","title":"Bitcoin: A peer-to-peer electronic cash system, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.201821Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:92033d4892c31f10f617ee729192e1d94b26e7c640391a482e0dcd70c22447f8","observation_id":"a94be348-b423-44cc-85dd-a8426051a3ec","resolution":{"observed_at":"2026-08-03T14:40:38.201821Z","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-03T14:40:38.285398Z","title":"The Sleepy Model of Consensus","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.285398Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:34ec74ffab5a4d2712067b7d306061686c12b3c55a85aeb3b5d2902428e7c5cf","observation_id":"c71a89b3-7657-480c-ae87-76c91502928a","resolution":{"observed_at":"2026-08-03T14:40:38.285398Z","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-03T14:40:38.507165Z","title":"Safe permissionless consensus","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.507165Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:7e334e6f00f97b104db6dfd6ce62c3f6d1f0f9501f957c173c3422df18af177f","observation_id":"598fb4c8-17d0-40da-96c3-383077e14099","resolution":{"observed_at":"2026-08-03T14:40:38.507165Z","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-03T14:40:38.568521Z","title":"Gorilla: Safe permissionless byzantine consensus","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.568521Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:119834d790bef7aa424647ea4c399a2a94ab03f905582013d8b308644e1b882c","observation_id":"52686577-a97e-482f-894e-e27a6b7dcd2e","resolution":{"observed_at":"2026-08-03T14:40:38.568521Z","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-03T14:40:38.716567Z","title":"Implementing fault-tolerant services using the state machine approach: A tutorial","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.716567Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:9df6a77eca4c34e8f97e335ba14c9c698a200f4feae9760b9e80a6f9d964dab7","observation_id":"d7774543-3515-435b-979e-0a81e1ffec62","resolution":{"observed_at":"2026-08-03T14:40:38.716567Z","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-03T14:40:38.783744Z","title":"Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.783744Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:138ee5ca1bc96c2a19a940fbdf332b067bbe5e50cc8c4a61935441c7bb152eee","observation_id":"448768f9-8fa9-41eb-87cc-073c0ff81ffa","resolution":{"observed_at":"2026-08-03T14:40:38.783744Z","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-03T14:40:38.860511Z","title":"Swiper: A new paradigm for efficient weighted distributed proto- cols","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.860511Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:240a392eb4a2056b599817fcb2f3b4361767455ebdbeda53b5da4f27ae663693","observation_id":"1411fd0f-b744-4ea9-8d37-d2a6b2a64ff9","resolution":{"observed_at":"2026-08-03T14:40:38.860511Z","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-03T14:40:38.891652Z","title":"the maximal grade-1 chain","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T14:40:38.891652Z"},"links":{"citing_paper":"/paper/2512.19968"},"observation_digest":"sha256:d699e0c14f566afa6d6c1af57c318ba655f1eed7fcd34aefa4982f754a344dda","observation_id":"fff0a02d-91a4-4ac8-8e08-2f490a9fb04b","resolution":{"observed_at":"2026-08-03T14:40:38.891652Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.19968","last_updated":"2026-06-02T21:55:12Z","latest_version":3,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T05:36:24.603816Z","submitted_at":"2025-12-23T01:32:00Z","title":"Fast Deterministically Safe Proof-of-Work Consensus"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2512.19968."}