{"as_of":"2026-08-18T09:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7146b3ddce655499d39ad612a8d7feddd0a461edb77582d29c98893030e4354c","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-18T06:34:40.430872+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-16T11:05:58.642087Z","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:9ff7bd836e271967fca8209bc3100c86a5cb0b493bae083d67d7f18ad5ba8e68","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-16T11:05:58.642087Z","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:679e60cbd21be91e5ce07c12e9ebd782ede85a34f0d7fd78ecc6d9a8f769b70b","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-16T11:05:58.642087Z","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:ce534526eca27d4f021a79e93a8a44c7aa19d734b93a514a236bcacc4e11dbd4","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-16T11:05:58.642087Z","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:c7e5f6edefa0c03dade0bccd4654af9be09b834f66a0e077e341281f57240517","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-16T11:05:58.642087Z","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:1e6f20db683ac4f236733ce38dca5ddf8f32b845ad2c2f5f3865d5d91f13abb1","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-16T11:05:58.642087Z","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:4a52c2acac8bf9a700887e39bd593eef85c610e87fcb92753c33a5fe94b49b13","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-16T11:05:58.642087Z","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:9610445175fea3b1eb6d2a5710cff17f12e28ff772f4fc34a300d584b300f21f","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-16T11:05:58.642087Z","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:ca5f32661561ae7e346b94547609218a7b29c0bd1ce6a9e9c5d81ec218143abe","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-16T11:05:58.642087Z","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:2cdf2f79f2dbb634908e37acddc84a106ab3ad602399a292e8777962d6bc257e","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-16T11:05:58.642087Z","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:f14f297dac024a8180d8669df0dbf4945bd8f9cf90611a70dc1ccee50bf0eb40","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-16T11:05:58.642087Z","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:d5a5f3ec9c94fcd66bea9cf517ba2f1b9bc0535be10bad8f28481268369cf22f","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-16T11:05:58.642087Z","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:426a850ada25f50c6cdeb7bc790ed6101665e4fbee91d61f710401f2852b0e10","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-16T11:05:58.642087Z","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:4cbfca8f9847955d1a1b0806675041e433af427e61f0e206c539e8bd90fc56ed","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-16T11:05:58.642087Z","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:101aa90586c906517746a6f628fe5a77e3e0338e13da023f67c626b751f7baf4","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-16T11:05:58.642087Z","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:bb3817ab65ef14b494fabe836a2530a70df9595b03479ad43efdb6c945ed5f3f","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-16T11:05:58.642087Z","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:2d6ff9198b85a26a02079d89a1acfc644550d647c811d51d9e4fe24b95bf704f","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-16T11:05:58.642087Z","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:7d454fd41e879adc4bbd3648be87c8a41ecac111208a060d19d16d7d86444d39","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-16T11:05:58.642087Z","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:c4d5d9998db5859a37534e6961b0abe0108897d4e614fc7b48091493979c0d2e","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-16T11:05:58.642087Z","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:8bfa1a9653a49608dad3266f5ddb36448cbf278acbf47550203c6a5a99ae2c3f","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-16T11:05:58.642087Z","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:9b86082aafbb99d80d77598b200ef15e910a60fcf9561a077355a1f9560a2ea4","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-16T11:05:58.642087Z","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:9f0fe7f3e50d1ac8117b50f256c434c66980230a4020b951d8b86a7821facec6","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-16T11:05:58.642087Z","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:3ecbbbba22417417d404b289c037dc93f8783fcdc72f0e56dc0c6e847303e1f4","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-16T11:05:58.642087Z","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:1badea8a8b135a8591ba02e925a2dd4b175219ab02e1f90f6913aa92ec213779","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-16T11:05:58.642087Z","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:6dafe785edbc6ffe707117a375561315b28705dd281985c04fb22d33c9a79699","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-16T11:05:58.642087Z","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:b0fabdb3a14d854a6c34c49a2d18b706537882e473712eea499e1e0545276ac0","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-16T11:05:58.642087Z","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:5294d07b7d461c84fb47b5521d2f1ebc81ca9c448aa031ca996adec7b70e506b","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-16T11:05:58.642087Z","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:f3a806aefff683e9c639ac34b3aa6aa9dda6c3f3eda780df07971dabb4bf4090","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-16T11:05:58.642087Z","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:52c473b2f4ebfe55213777df77b1d428775e82c2c27e4fe9e0e9b10c5fe152ca","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-16T11:05:58.642087Z","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:ba897287ffd0250f4cceef579bc0ee325aec700fbffd6b5aa316dd2df49d7120","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-16T11:05:58.642087Z","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:a43e2195662aeab5d1187ed32945c8c7ff6016802b9abbef257ff01460e13550","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-16T11:05:58.642087Z","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:0711ae733e5e36d1d26ffd2c9442deebeb66722aec01900cd1d23c931a0b95e1","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-16T15:37:02.619013Z","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-16T11:05:58.642087Z","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:6c6bd8fb0578dac8fc12c1ed9ac9b260ba56e2968e99cc5e30a469b7c853586a","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-17T19:53:56.001115Z","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-16T11:05:58.642087Z","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:03c0bb1dffe0f5ef85c14f3430d6426b58cc66141559d9084e63598792448352","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-16T11:05:58.642087Z","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:7360cc73d85c33e1154dfbf452b7876a88e48ab30419a61b243ea2488ec07f0c","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-16T11:05:58.642087Z","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:ef22abf6cc2133677a1b6bd717a0b3a08c4c07ba8bd54e65d594b6955d8da5ca","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-16T11:05:58.642087Z","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:c49035fe0bcc9b6acb635544d4bb8e900db78e4c3b9e64706cd4d01bda35db32","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-16T11:05:58.642087Z","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:f97465eb8db6d64709be9bfd11a559f22b2f482e86cfdad781283e26b7c4d547","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-16T11:05:58.642087Z","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:d40773a4c0057ea45633038343ae3c0839f398721a7eba4a583697e3b416bafc","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-16T11:05:58.642087Z","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:b40c0650b9ad2a5733356dfce2c61decb9783fab4227fa23039f12fbcd0f4b28","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-16T11:05:58.642087Z","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:a85dc363ab22014c4a58eda172dc08f17fd67ceb99bc308311bbd8fdfce69cae","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-16T11:05:58.642087Z","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:f96b213dec2a5ea54209d7a7f15a18c69b1758269cce61cae9ef9699d9a80159","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-16T11:05:58.642087Z","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:298f51f1dd60076f7303ea70ea89cb26cceff37d54976d765b8bea622ae2a892","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-16T11:05:58.642087Z","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:56f60f7ec3b9252efced4ed44adb5cbeb7e11fab7e9ab58148a776e25d563ab8","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-16T11:05:58.642087Z","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:b7cc00df3fef1625e00b57edef8c378fd490ba5f2f4fbcc646c7b9cd7c93c0ae","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-16T11:05:58.642087Z","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:2ef9c6d4139969f2d9c522b0dc15238029087602b134a4319aacda641ac77b78","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-16T11:05:58.642087Z","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:e64656f61ca515454c98dcbb8abb01d10098e7c99eede39f34baa777d00a71e6","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-16T11:05:58.642087Z","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:d413cc19dcf3e73405a251dbf660239218c851695e00bcd1b19dc17b7486cea1","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-16T11:05:58.642087Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2512.19968."}