{"as_of":"2026-08-23T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d218788bcae13015f3e6bbfaab87133dfe419634faa7839b6f841252ea68d27","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T06:39:03.623110Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.02847/citation-record","integrity":"/paper/2607.02847/integrity","json":"/paper/2607.02847/citation-record.json","paper":"/paper/2607.02847"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:39:03.623110Z","title":"A plausible approach to computer-aided cryptographic proofs,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:f4b2e0ec3df227d8781539ef65d18e608800066d1e1368413fe70ff721ab00b3","observation_id":"6cca3c41-4085-419a-b920-2ab461caa3fe","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"FIPS 202: SHA-3 standard: Permutation-based hash and extendable-output functions,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:7820b0aeffc6bc4f60bd56e84e5394fa9e607f3a4d234cc7c6c1dd0012784289","observation_id":"dabbff3d-a999-4ed8-859d-871f5a7be8a1","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"FIPS 197: Advanced encryption standard (AES),","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:c9acabd2b51cb289a9ae089f8786045d95d8fcfddef48a75f619b6e950c6ed02","observation_id":"da5ca71c-3c03-442a-8a7e-5000c76194dc","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"FIPS 203: Module- lattice-based key-encapsulation mechanism standard,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:7346caf33fa2ebe4b1361305f881134d3d40b49972ec15c66baae44354d99323","observation_id":"0305a24c-6af0-4303-9b66-3b2824b7b597","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The transport layer security (TLS) protocol version 1.3,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:38e43c8d14cf7cebbae868519cb4776161d13e415c99b61a64895f9e3c78febc","observation_id":"f6f07f7b-5f71-45dd-bdda-504b09f2f74d","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The security impact of a new cryptographic library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:b79e251010041b1ebc88b476efd749a547c56aed56b2ede71a337a7c1ca649d7","observation_id":"bd8e0411-e245-40b7-a7fd-4c1d828b1033","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"libsodium documentation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:22446958f40ca3e617d146da757fd7092bea9990ea826b4c51b2c572b63e44ab","observation_id":"bd7232fe-8839-431d-ab60-50097648cdf0","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"OpenSSL: Cryptography and SS- L/TLS toolkit,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:0eda313ab0d93748788377af31c215f1f2f6795b359f2d61c938749bba0abc97","observation_id":"e5ee4607-3860-4e9d-ba22-21af2a656938","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"EverCrypt: A fast, verified, cross-platform cryptographic provider,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:eac8696770b72b4b70711301bb2b3898b3195adb3711d1b5f672117743e55588","observation_id":"d782a99c-79c7-4d29-bfc4-2b85439ede42","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Using TLS to secure QUIC,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:21a9d48e84636742723e4b7046749b6879886fc8217578e8f77f2ca584e3b683","observation_id":"b9d63459-9b6a-415e-9e11-0c86e47329a4","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"A formal security analysis of the Signal messaging pro- tocol,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:a875cd8a897b4092d58189555eede16303221d131abde64f99682dccccb84fce","observation_id":"c4092476-5b11-454e-b566-9c2919876def","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"WireGuard: Next generation kernel network tun- nel,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:5ea829c8033a130f4960451b68f9d133d28fb3c130e65ccd898c6289efaf0e09","observation_id":"ac0ccf30-99a6-4ac3-a5da-584bbc17b2f4","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Artifact for formally verifying kyber episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:282f47bdbbaabf0f34b8a2799c28d627739b8ee4a5ba988f031b0daf4cfaa892","observation_id":"d9fd870f-0f80-47bf-8af6-bd5e7e3903b4","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"A tight security proof for SPHINCS+, formally verified,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:153e7c5b6a3632d39852914858fb4dd4b94e4badcee661def0aaf75f97c33fca","observation_id":"2b2f40fb-363a-448e-b07e-6c7637640a06","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Computer- aided security proofs for the working cryptographer,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:ef558e29a9b9963924d9761367ae1a6c24be51d4d389b7b5170756b3d744da1f","observation_id":"40b6aa0f-11a1-45c7-a5d2-ec6565faa667","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The Lean 4 theorem prover and programming language,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:649f67d0a242390d496ea53475440ef9410ba412279be1613473fe8e742212ea","observation_id":"443ba810-65b5-474d-b49f-5c48330b2991","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Bertot and P","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:a486461fb92b213a5a493a1d1c8e6f20fbdec3bd6332c5e97ceb2ea4b89c65c6","observation_id":"8cdd8fc0-bbcb-4d36-96b5-7d1bf40c2b2f","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Dependent types and multi-monadic effects in F*,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:f020b661d8382885e1a4663cd82f0d3cf0483a6ad6e8656c75da87c27c6bd87f","observation_id":"16cbaf93-7b2d-458c-a48b-86107711fa92","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Modeling and verifying security protocols with the applied pi calculus and ProVerif,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:64c2480850369318fe59e3fb8796e7e1348a5e062799799b91ba0fecae24c6f6","observation_id":"586f6cdc-97e0-4ed9-bcde-c1bbb10b218b","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The TAMARIN prover for the symbolic analysis of security protocols,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:6cf53156ac9e0371e6a8d960c4e5276ae9752c3dfa9e8e90af527989e50de573","observation_id":"ad2330e2-ebe3-47c9-a953-882b07814538","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Verifiable side-channel security of cryptographic implementations: Constant- time MEE-CBC,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:8d4a77c39e2eed7a944982c91aa4ebec058df22a28b6c5c3921dc801b92a8e7f","observation_id":"a8a8d4c0-37c2-41c9-a234-cff37e551f41","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"For- mal security proof of cmac and its variants,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:d7483c4f914d9f691b845b25142d96e246ced0f2319f6947a1352afab237d5ba","observation_id":"8280a33e-5b4f-4b03-8dd8-9eaf8775eca3","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The last mile: High-assurance and high-speed cryptographic implementations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:c1c572d497599269ccf24826ec34688353bea08aa1d63667ca3b2feca8e70b13","observation_id":"c314fddc-3e05-414b-ba11-387395244cbd","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Formally verifying kyber: Episode iv: Implementation correctness,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:7a276553e8bb7a525cae06aed556e1314b39de83f6c3fc203f99ef60fe8ad976","observation_id":"5f7dd728-c713-40f5-95e0-a74f44f92ece","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Formally verifying kyber episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:d0f1ceae6f61d43d16d3fe35a2695f21f96083e704c6489db3cd946ae886a797","observation_id":"938ad617-17b6-480c-a74c-3d6f29e42bde","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:233c190a18d4f156ddb0735544028cd33dcb16cd553aa2be004dc43f5308dbf6","observation_id":"3aec9840-14fa-47ad-9550-0cf7f6bb28be","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03393","last_updated":"2020-09-07T19:50:10Z","snapshot_observed_at":"2026-08-18T11:16:18.404679Z","submitted_at":"2020-09-07T19:50:10Z","title":"Generative Language Modeling for Automated Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03393","snapshot_observed_at":"2026-07-12T06:39:03.623110Z","title":"Generative language modeling for auto- mated theorem proving,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"cited_paper":"/paper/2009.03393","citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:5494afe45e7eeea4a79c2850b64ec98ab0c7f515c114a6da29220a76745076bb","observation_id":"4fd4f2c2-ec81-4a92-9dc9-0acaa47365d0","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"MiniF2F: A cross-system bench- mark for formal olympiad-level mathematics,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:1ab569f0e008475acce6572885cdb320c255de61b57fb23bbe43a3805dbd4f75","observation_id":"674c21db-40ac-4abb-9a75-5a451ee62b54","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Formal certification of code-based cryptographic proofs,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:f568eb125c4cf29d83d36b00c9b4a31712b9960386ee3df572f9cb460a59917d","observation_id":"12b775dd-f02b-4ab9-a697-9c7d733ac6f7","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Principles for pRHL proofs,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:af9b2b1766b75e4ef039b1b529ef497d81224bf2b7e08570cea1301092b3f91d","observation_id":"a780ea33-c2cf-416e-aba3-7a7d498ecff4","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"CryptHOL: Game- based proofs in higher-order logic,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:b2737895d4fee420ac5a4db6fdc2a127ceb67cbe7cab5dee8e989897c622ffa1","observation_id":"57eb88bd-f54a-4801-98ee-ec136e4cda7a","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Ssprove: A foundational framework for modular cryptographic proofs in coq,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:5831a55a877f3d57af5d0943e01c8554cd0bdc4a5830d4bfde6b010ac7eba9f0","observation_id":"015713e0-b4ea-4a8c-985d-627fb1a93799","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"The foundational cryptography frame- work,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:3905c58241e549a6f4fcb6f216b53ef318234883991c345363220d2a833debee","observation_id":"425a4314-a6ad-4d4a-a38f-48a5d2eeaf8d","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"A computationally sound mechanized prover for se- curity protocols,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:965e1bcb9b5e1826f775facb0e3acc7937e280a075b32255d37384bb57b6ae61","observation_id":"cb10e261-e1f9-4cce-bcfb-71704534bdc7","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"HACL*: A verified modern cryptographic library,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:7aa9f95b6962b99993e4e0665e3c5242039b8be136c771de90320f960d7f0462","observation_id":"9b8513db-d0a9-4777-aa23-781d21f1c099","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Jasmin: High-assurance and high-speed cryptography,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:a0abf491a3e25fa36879d958b523a8a993013c7937475724038bdbfe57c6b9c2","observation_id":"f601a50c-50c4-4c1a-a515-367aa8fd7bdf","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Machine-checked security for XMSS as in RFC 8391 and SPHINCS+,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:3bd513966c07a31c70ca43ca8a43570e7769f2a982dcd6e524113b2a5d7c4ce0","observation_id":"66610aac-7612-4869-b2a1-7556a2718962","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Machine-checked proofs for cryptographic standards: Indifferentia- bility of sponge and secure high-assurance implementations of SHA- 3,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:f3fc2243d17170890222ff91c4d30034ad7d4b31d9721d9a15eb1622497bc82d","observation_id":"c9dfefbb-c29b-4938-8b9b-03a4e4e8434a","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Vcvio: Veri- fied cryptography in lean via oracle effects and handlers,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:83b4c4297a3ac6809319cbc32bc75d2ada978c9b8e0be61e0c1a6bc0351005af","observation_id":"650f142f-2849-4f5f-9a40-7526de91c905","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Hypertree proof search for neural theorem proving,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:939c33bd56852ea0c67decc8a5f8931fa4273ea9b42df2680693b19950e33cd5","observation_id":"d0a8f56c-84f5-421f-a70a-3da966aa38ca","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08152","last_updated":"2024-08-15T13:40:03Z","snapshot_observed_at":"2026-08-20T13:55:12.013069Z","submitted_at":"2024-08-15T13:40:03Z","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08152","snapshot_observed_at":"2026-07-12T06:39:03.623110Z","title":"DeepSeek-Prover-V1.5: Harnessing proof assistant feedback for reinforcement learning and monte-carlo tree search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"cited_paper":"/paper/2408.08152","citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:5d9a7dc076298f3ce146160455133cac7c91efa93350c97d29d69272f08398be","observation_id":"5ca7d177-3904-4ede-adaa-05bf3a79e060","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21801","last_updated":"2025-07-18T08:20:23Z","snapshot_observed_at":"2026-08-02T11:46:58.603316Z","submitted_at":"2025-04-30T16:57:48Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-07-12T06:39:03.623110Z","title":"DeepSeek-Prover-V2: Advancing formal mathemati- cal reasoning via reinforcement learning for subgoal decomposition,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:47c79b9333678d292aa94caeb1a23fb8fa5b1510fc1640e9718286128e6ec2d2","observation_id":"698677e8-6876-4d31-a43f-8cd631742f87","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Goedel-prover: A frontier model for open-source automated theorem proving,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:be0cd18509594eed391b257e7d6bf9e213dd628183be8159c18e3e98dfb384b7","observation_id":"fad6f2d8-eef1-488c-8278-e8dc559ff182","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Olympiad-level formal mathematical reasoning with reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:5ecd3f48b543cb3e369ea244c73bd2686b18685afd2e33b38ab2c96527acd6fa","observation_id":"a1f7ad5b-d6da-4c5f-a485-b81a205e549a","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12433","last_updated":"2023-02-24T03:28:46Z","snapshot_observed_at":"2026-08-19T15:00:47.908932Z","submitted_at":"2023-02-24T03:28:46Z","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12433","snapshot_observed_at":"2026-07-12T06:39:03.623110Z","title":"ProofNet: Autoformalizing and formally proving undergraduate-level mathematics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"cited_paper":"/paper/2302.12433","citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:2eebae7ad9d88b182a70cf84b052504f9b5189ca47b736245819030bf24103d4","observation_id":"9d87cd1d-9b34-4928-8dc1-86f2bc6d1fea","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:84f5867885bb75dc7546655ddf5503f79aa6f2c9f1e8fbe68a6f7923b4f62283","observation_id":"4bf40e94-e3e6-49cb-b615-22f236e5d618","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Leandojo: Theorem proving with retrieval-augmented language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:416fedca6802247126ab57c20d2ddb40e218a244a1bf4b95085a7b8db39f4f04","observation_id":"8872da10-ac18-4a73-a159-784b82dbe2f7","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Thor: Wielding hammers to integrate language models and automated theorem provers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:211836e8ca4ec513b35b9498325807b88d19ec43347bb51c1d011fc2ffd58f57","observation_id":"949679d0-e7a3-4942-abcc-922ff17b04dd","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"Baldur: Whole-proof generation and repair with large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:afc09f2ed39463c6e526015e57925d8dd4a7cfb37af5dac8b4f7b494f123c4d6","observation_id":"d17029de-8200-4b13-83ad-57eb315b6b27","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","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-07-12T06:39:03.623110Z","title":"CatCrypt,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-12T06:39:03.623110Z"},"links":{"citing_paper":"/paper/2607.02847"},"observation_digest":"sha256:43fab54c3e1eb1929fb27791bbb14a2893e215a1bfc0ea5517a5a242638994de","observation_id":"b9cb2cbe-70d7-48fa-a9d3-b5ac37b09d71","resolution":{"observed_at":"2026-07-12T06:39:03.623110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.02847","last_updated":"2026-07-08T21:06:54Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-18T00:24:22.412061Z","submitted_at":"2026-07-03T00:50:51Z","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2607.02847."}