{"as_of":"2026-08-05T05:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6f4cdbd045e367e8da4234e07e8ae9075edfc03ec8ac5df17225883e94aad8c","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T04:41:39.021333Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2606.15043/citation-record","integrity":"/paper/2606.15043/integrity","json":"/paper/2606.15043/citation-record.json","paper":"/paper/2606.15043"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3571195","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Step-indexed logical relations for countable nondeterminism and probabilistic choice.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"1c92598c-2901-44ec-b27e-d1e73b056c20","year":2023},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:1541c2ebf2aa2b293609b5f2386b8a15c7d2db5b9ec4b898c659b8209a773019","observation_id":"26bf08ff-9e0e-49a3-acf2-5ee4416144a4","resolution":{"observed_at":"2026-06-27T04:50:34.975923Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3674635","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Haselwarter, Markus de Medeiros, Kwing Hei Li, Simon Oddershede Gregersen, Joseph Tassarotti, and Lars Birkedal","venue":"Proceedings of the ACM on Programming Languages","work_id":"5c889e1a-dc6f-452a-88e8-4f642f1501bd","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:1b8d9a98004ef70ebf3e8cae61d5af7c6aa03a7cd112096a547e09596b0b5876","observation_id":"745ee102-7fab-4ebc-a765-9deaa6ab05df","resolution":{"observed_at":"2026-06-27T04:50:34.973022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-14T07:49:40.620563+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T07:49:40.620563+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-96145-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Chockler, H., Weissenbacher, G","venue":"Lecture notes in computer science","work_id":"e7af5efc-98f5-4b91-a2e4-3e16efe6bc9b","year":2018},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:fc38f3c213e2ad37a595750e136b1dc9f68648bec63a567d65c3d9a4ac9fbe6b","observation_id":"864fdd92-b9c8-4979-8f1c-0e0216047685","resolution":{"observed_at":"2026-06-27T04:50:35.010477Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-20T05:54:02.210514+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T05:54:02.210514+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3158146","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Synthesizing coupling proofs of differential privacy.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"8b050f82-3d2b-4f71-b5fa-85c146fe4d8d","year":2018},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f39249562f9accc21174e916af178ece481d0255732d8280ee310ebdab0c42d0","observation_id":"410cb1f8-9b17-4e38-8b9c-03e591215a71","resolution":{"observed_at":"2026-06-27T04:50:35.029342Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.11343","last_updated":"2019-08-23T14:38:36Z","snapshot_observed_at":"2026-07-06T08:17:47.401973Z","submitted_at":"2019-08-23T14:38:36Z","title":"Modular Runtime Complexity Analysis of Probabilistic While Programs","version":1},"cited_work":{"arxiv_id":"1908.11343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.11343","snapshot_observed_at":"2026-07-03T16:58:43.613463Z","title":"Modular runtime complexity analysis of probabilistic while programs.CoRR, abs/1908.11343, 2019","venue":null,"work_id":"01a5ff0a-b410-4dee-95f8-0afb2a9f9841","year":1908},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/1908.11343","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:05be986d0e612785bb5aa99feeba51e0ac957155fe1ef589de8894d095537755","observation_id":"c73b4bcc-5897-4fae-b2d6-d4679e887de5","resolution":{"observed_at":"2026-07-03T16:58:43.615541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3428240","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A modular cost analysis for probabilistic programs.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"5705e9ca-337b-48af-bfae-765f7fd3d4bd","year":2020},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e1296d62847e25fc1c7682e7c9ce7780a06ffcd866079cbbaad8cec4e0c7e7d8","observation_id":"a4f86436-f21a-4600-9cd4-0e22c556756e","resolution":{"observed_at":"2026-06-27T04:50:35.014726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T07:23:49.751048+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T07:23:49.751048+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3591263","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Automated expected value analysis of recursive programs","venue":"Proceedings of the ACM on Programming Languages","work_id":"b769f31a-4b9d-4f4f-9eea-ec3f23646c69","year":2023},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:efb17643f350c8170e46ecb241f5133e32bf938e4980d1262d59dac9ab9f12f8","observation_id":"a6171f89-5b52-4ef1-bb8a-75a9bc800c07","resolution":{"observed_at":"2026-06-27T04:50:35.085873Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T07:23:50.198782+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T07:23:50.198782+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Bahar, E.A","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:293fbdf6cd9ead06a77846d9928befcbe9865c6868cf28fb4ccf0b54b8b0cbb0","observation_id":"b3749183-ffd7-454f-ad3c-213cf29d1dab","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"MIT Press, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:74b48101dfe20cfefe7a131bca92c660b482158d7de685b6e3e6f670c010409b","observation_id":"09e2b115-4c30-4da9-99e7-074243705fe7","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Clarke, Vasiliki Hartonas-Garmhausen, Marta Z","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:c8a9249354afe91060ff79291a78f9182c6aac9aa9cf28982f68bf631660695f","observation_id":"b7f6e443-35fa-42fb-9eac-5b6951a7c6d2","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-13185-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: CA V ’22","venue":"Lecture notes in computer science","work_id":"bab09610-0be4-4e01-ab5c-5ca4250195c5","year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:fee23ad9d329a1f4f48f6ba08093062c0aca34c3ad52c096eda64bda2dad02b3","observation_id":"fca2e718-bd1e-49a6-9bcf-a4added74b90","resolution":{"observed_at":"2026-06-27T04:50:35.002797Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2023/712","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Data-driven invariant learning for probabilistic programs (extended abstract)","venue":null,"work_id":"1a4c05a8-e168-462f-87f1-861c5973665e","year":2023},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:2ae398ccd704930f0ff4333dae19cf7addbb37254be6b48353d04a17d4ee041a","observation_id":"0777df9d-caf2-4efb-84dd-dd8875f64903","resolution":{"observed_at":"2026-06-27T04:50:35.012113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704894","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning","venue":"Proceedings of the ACM on Programming Languages","work_id":"1becaa41-bf3a-4451-af56-2b62b56757f3","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:27001c3fe220928dfa2b8489ff23f065f4eb2810df25ad322d5d6f578a9277da","observation_id":"505cdc29-dd3d-491a-a5ec-677d21461fce","resolution":{"observed_at":"2026-06-27T04:50:34.990984Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-25T11:53:27.109583+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T11:53:27.109583+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10703-024-00466-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Data-driven invariant learning for probabilistic programs.Formal Methods Syst","venue":"Formal Methods in System Design","work_id":"728f2164-7bb1-4374-810d-d1b221e19ef5","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:83222faf01f8820f41ded852cbe93674f333feeb5ae7ca23c1c50feffe3d9df7","observation_id":"2f9c3578-2993-45cf-9730-5e6ccaa4f93f","resolution":{"observed_at":"2026-06-27T04:50:35.066095Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e9071dc56770c836da7b329087adf9271ea8e26f9e1fdbf9c36349bc045b525e","observation_id":"fa6f95ae-6cc2-4105-bd2b-1b681b74a163","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"The Satisfiability Modulo Theories Library (SMT-LIB)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f7566800f6f49cc341a35a43903b40b794c9f2efefe7bd771752cab0da0f8076","observation_id":"6d2dcfaa-845e-4313-a377-584b6061eb8e","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Barrett, Aaron Stump, and Cesare Tinelli","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:0ec186781a58b60a0ec3b1c63a8ce19cda44f7e3c6e9ccc35e6227a7e2b10533","observation_id":"3fd88c0d-5015-4439-a82b-db7819fc2fde","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Barrett, Roberto Sebastiani, Sanjit A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:825cdf85366eba9242cbb8dd71c4660147dc7cc34e434fa944d21a30a9dab6af","observation_id":"4ad0bd8a-4699-4193-bd2a-687857f41671","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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":"3656.210367","doi":"10.1145/2103656.2103670","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Probabilistic relational reasoning for differential privacy","venue":null,"work_id":"5c92e196-6bc3-48bb-b918-fbd6db6139d0","year":2012},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:75d9c8caa350a146e2ceae388d329dea2b44a2606e00274a15eb01de80cdf111","observation_id":"023a0171-90b3-46d6-9592-bb51a2711426","resolution":{"observed_at":"2026-06-27T04:50:35.019971Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9837.300989","doi":"10.1145/3009837.3009890","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: POPL, ACM, pp","venue":null,"work_id":"0daa8471-7657-483d-8c6b-f37e845b7cca","year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:7d50530e42605d6369109ddbd1cced25d90b02de6476aa7292789b960a522129","observation_id":"5677582b-df47-4ef9-b1bd-13b48e6a72cc","resolution":{"observed_at":"2026-06-27T04:50:35.046915Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"A probabilistic separation logic.Proc","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:c72b3fdaf6bcd3eecd40de81d5a62711a5a37a77419d28e9f4125f42c0a7a791","observation_id":"34d8e105-d9d5-4bf4-ad2a-51da5f0e4e74","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Latticed k-induction with an application to probabilistic programs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:a6a2f79708859f36f595c55e1d22e0536c62dccdc004167c3468794089227adf","observation_id":"2369bd39-ea34-4592-b073-6e26d6efb63e","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Probabilistic program verification via inductive synthesis of inductive invariants","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:703091917c002089c30fc6866b823e9e217ef5f54813295755da00ccbfe23372","observation_id":"0a6b42d0-42e8-4458-b8be-391b4640bea1","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"A calculus for amortized expected runtimes.Proc","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:778af1a79cb496af20696313fb69e4ca9830f5a772fb55533758dbe42e4ef8c8","observation_id":"64753571-4a1c-4304-8f08-2232f4824366","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Foundations for deductive verification of continuous probabilistic programs: From lebesgue to riemann and back.Proc","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:809a470f62f7ff327d645ce42f7e6a2da78f1ae621af8a273bd3b029812b7b2c","observation_id":"ad0fb331-ba8e-4b96-9e55-2cf72b888c38","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Boosting k-induction with continuously-refined invariants","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:375bbf5bb2df6f977286c570a49dede615c06a358cae789576beef405394b578","observation_id":"4ae1e97a-37af-4733-a99a-2122753c4de4","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:c13c1c92509dc57decb01b8907d1fa92766b22fd15835c4bb84bf4eb9933178a","observation_id":"a19a5e13-6463-4f3e-8f0f-611a54f01056","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Burch, Edmund M","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:58bd1033227783d1be828751754c747acc8951989bc04ab98aaeba5d441c30ce","observation_id":"265485f1-b878-4226-a788-a7f48ba697e5","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-41528-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: CA V ’16","venue":"Lecture notes in computer science","work_id":"dda30a51-f001-475f-a500-ce5ce205c01f","year":2016},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e9da0166b94e7ed7913d431e389e303c0b94605ebc63b807df114284fb7591e0","observation_id":"93e62c7d-a019-4c41-bb95-f5e6844678bf","resolution":{"observed_at":"2026-06-27T04:50:35.005290Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Sound and complete certificates for quantitative termination analysis of probabilistic programs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:0f9c74cea69460a2c0e1d9d1b7ac39e4e553c0d9f82a8691434d2d487481ca41","observation_id":"281a668b-13a6-4524-a08e-d9e3c6e1938f","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3649824","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantitative bounds on resource usage of probabilistic programs.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"52ee4184-ed2c-47ca-b75f-9ffeae2a12ac","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:498f1f9988d913885593c6f1b4a66d1e4e0c100f307cd743903e928252c086ec","observation_id":"917b26f3-7a98-40cf-8688-a1ae73ead42e","resolution":{"observed_at":"2026-06-27T04:50:34.993146Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Proving almost-sure termination by omega-regular decomposition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:b5e841c269c58e92264a87e54e16e33f03ec3f9444e21a35098adfcaaf4f5adb","observation_id":"815b223c-26f6-448d-9dc9-2c7764cd2ed2","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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":"5412.338600","doi":"10.1145/3385412.3386001","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Silq: A high-level quantum language with safe uncomputation and intuitive semantics","venue":null,"work_id":"dea401b1-086c-48eb-973e-44a3e97983fd","year":2020},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:0d346672647a12fe5a844c4d544cc823694d3fb22c0b6738c40e971613672764","observation_id":"4f37e34a-aebe-4de6-8475-43b3114d9b15","resolution":{"observed_at":"2026-06-27T04:50:34.996786Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Counterexample-guided polynomial loop invariant generation by lagrange interpolation","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:abe76cd1d6e2ada86f03698cdb53f7d46ef4a1dea3e739e13ad68957d649ece8","observation_id":"7e891223-a670-483b-a454-d49ea807fbd6","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-46681-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Baier, C., Tinelli, C","venue":"Lecture notes in computer science","work_id":"db9de152-4996-4704-8fdf-0d5ecec34ace","year":2015},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:70d3f2a7426588c05e74fb045f945243e0a1818ba1f14ff363a9353a2892a588","observation_id":"8bdb1eb8-c20d-44ff-9f8a-460db86b79b1","resolution":{"observed_at":"2026-06-27T04:50:35.007906Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-13T11:19:42.374649+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T11:19:42.374649+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00236-017-0297-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximate counting in smt and value estimation for probabilistic programs.Acta Informatica, 54(8):729–764, 2017","venue":"Acta Informatica","work_id":"a0dc4d0a-0fdc-4cf9-9755-886d59937fbd","year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:a2bc5dcb30ecaf48a0e021da16c27a1924cbb031b8626b63e057c561e6d51e0c","observation_id":"33b8a71a-54b0-4cf8-ba03-cd4b1324bdb4","resolution":{"observed_at":"2026-06-27T04:50:34.985557Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"D’Argenio, Bertrand Jeannet, Henrik Ejersbo Jensen, and Kim Guldstrand Larsen","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:24c315fefe218913b0e3d3e605b2283a2681274bf91238e641eb438681606457","observation_id":"81e3eb62-c624-4213-8f2d-f24896e1b6ee","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e2ea8cfa9cc80eb4bfcfb5617b4a8bc5ba3c595784acd763a1469fc866766282","observation_id":"163a65ae-70b1-4995-be8f-cb38dc1918e0","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Dijkstra.A Discipline of Programming","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:ad9ada4792abce7cba3bcbcd5273f276db456e9ab3804361d3e719f884e968ea","observation_id":"897a542a-d8fc-44dd-bc86-4fc10fad4428","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Donaldson, Leopold Haller, Daniel Kroening, and Philipp Rümmer","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:2a3d44de4689b80186337a8cd871804dc6e2c6a94424311d25fdb30de7279602","observation_id":"fd8c77ca-7f3f-4ed5-bbf9-7e7df87748b2","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3776691","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"800a6b55-41d8-4238-8f7a-f0ab603b1222","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:d6a6f71182e6f415361e4c3ae306edb788bac6e18d85c4a3e354fdce2eb312b4","observation_id":"cbf0a825-6048-431c-a341-43fa4b3788af","resolution":{"observed_at":"2026-06-27T04:50:35.064344Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T07:23:53.506568+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T07:23:53.506568+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-49498-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages , booktitle =","venue":"Lecture notes in computer science","work_id":"68d4c855-422e-4bbc-9ff6-2b4485b6997c","year":2016},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:53894968f77dca4021a9eb99bb47a6d2dff3902a5236fd3e214c052cce0e0820","observation_id":"b2706f15-af60-46bc-9dd8-feea0dc10be3","resolution":{"observed_at":"2026-06-27T04:50:35.054324Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Gallier.Logic for Computer Science: Foundations of Automatic Theorem Proving","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:efc682674475945d37cbccc144e561788723b763233250df93a52f0b4c6bbaa5","observation_id":"f73b0392-30b6-4720-8024-bd6142eb8afd","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:abb6c355223320bf980decc477cf7fb1b4f7a96b88bb1a85ada9a862138b1104","observation_id":"a09f813e-9ce4-4806-949b-849055f6ff51","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e831993c9ab8af30a9dea4baf005f449acf09ca5d313c42f37ac89385c952d17","observation_id":"68ffe63a-3a27-4da8-b8f5-7e21790d5a52","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3473595","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Probnv: probabilistic verification of network control planes","venue":"Proceedings of the ACM on Programming Languages","work_id":"3feb8695-bc02-4f93-8c95-8b92fd399ad2","year":2021},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:36a5d333f4c4888ba19dbc9681b8cbd367ed4d40c315ad12a579c558998cbe25","observation_id":"894b2418-2720-437c-900d-1a99b3d38229","resolution":{"observed_at":"2026-06-27T04:50:35.056256Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Gordon, Thomas A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:d4f72a0a1dd20c56db78b9d3e88c8828b432146240e94a0d496b5bf3a46888ac","observation_id":"9dfcf954-ac0e-43c9-8495-3983342bf946","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3674632","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Haselwarter, Joseph Tassarotti, and Lars Birkedal","venue":"Proceedings of the ACM on Programming Languages","work_id":"fcb14bd3-3d6d-4c09-9f84-95626e00271b","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:c89daaeb144772a437a6499e6f971f4ab6c9d50a85d6ea2908e52fe54963d29c","observation_id":"4ab960ed-f0fb-461e-9f9e-ab5d0bfdf1b5","resolution":{"observed_at":"2026-06-27T04:50:35.074966Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Haselwarter, Joseph Tassarotti, and Lars Birkedal","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:4df30f91b72d49e8925aa30f684db37f747c103f64b92120febf15635a5f7ed1","observation_id":"d45cd6e6-c67d-4103-90ac-0a1de3cd9a43","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-40196-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Prinsys - on a quest for probabilistic loop invariants","venue":"Lecture notes in computer science","work_id":"9724f76e-49f8-465e-a7b2-834d74d84faf","year":2013},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:6c927507bfcdff2b596fb3dd05f064c25de6aee04bbe5bca340ef7fac02de346","observation_id":"042b9452-d889-40c8-8824-c6538e5bba1b","resolution":{"observed_at":"2026-06-27T04:50:35.016524Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-68270-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"477d9363-6d99-4e2f-b46b-b9fbbb7ce712","year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:b40cde4b1b47a404517b5f31c34db469846e852e01a0b414a9343a0f7d0e4e02","observation_id":"e83210d4-aff0-4daf-9fb4-e1816370c2d4","resolution":{"observed_at":"2026-06-27T04:50:35.024950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Binary decision diagrams for first-order predicate logic.J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f48a1b8e77ac7f9d63ae539c905f6d23863819e2dec5dce8b5a1a4bcda5c9798","observation_id":"ef590a95-eaac-40df-bdcc-10f961cf84cf","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"K-induction without unrolling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:b00ef3423b13c3277f5e486996821960f620743630ee585e59dbb86d09e006e9","observation_id":"01178bf0-3a5b-4e5f-b88f-84be6269313e","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3689753","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Haselwarter and Kwing Hei Li and Markus de Medeiros and Simon Oddershede Gregersen and Alejandro Aguirre and Joseph Tassarotti and Lars Birkedal , title =","venue":"Proceedings of the ACM on Programming Languages","work_id":"bed397ee-d3a3-485e-8fa0-18325d3dc880","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f231e82c4348ddc032807822d4634ab1d48ad03361ea4d0ce942a4da4a6e74ac","observation_id":"a853c2fd-bb0b-4443-bc81-736588b6bf2d","resolution":{"observed_at":"2026-06-27T04:50:35.080322Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-14T07:49:44.189566+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T07:49:44.189566+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704877","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Haselwarter and Kwing Hei Li and Alejandro Aguirre and Simon Oddershede Gregersen and Joseph Tassarotti and Lars Birkedal , title =","venue":"Proceedings of the ACM on Programming Languages","work_id":"478062b4-ebc3-4af2-ae3b-b641ef949d07","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:028dcc9a4f990a01686fdbf9e6e6261e25db8524f72ad19e1d673d4fb483edaf","observation_id":"6ea3ede8-9daa-4200-bbe9-4056aecaf266","resolution":{"observed_at":"2026-06-27T04:50:35.088258Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.12713","last_updated":"2026-04-14T13:27:24Z","snapshot_observed_at":"2026-07-06T23:00:51.385974Z","submitted_at":"2026-04-14T13:27:24Z","title":"Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)","version":1},"cited_work":{"arxiv_id":"2604.12713","doi":"10.48550/arxiv.2604.12713","metadata_source":"pith","pith_arxiv_id":"2604.12713","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)","venue":"cs.PL","work_id":"3ddd3dd0-51d9-4c22-89e2-5ce893909ea6","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/2604.12713","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:7fa4a8b5dc72d007d6514c16f0cafd3c60969b73d53bd34f6e31894744bcb19c","observation_id":"65f3252a-ea02-49ed-98b1-bab1c725a11e","resolution":{"observed_at":"2026-06-27T04:50:35.073259Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"The probabilistic model checker storm.Int","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:db7d1b6971c307ef5e1328995f38c190feedfeee571002929665206b7ef05d26","observation_id":"0a42a27f-ffaf-48ff-8da6-d01127722f14","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3776696","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bayesian Separation Logic: A Logical Foundation and Axiomatic Semantics for Probabilistic Programming","venue":"Proceedings of the ACM on Programming Languages","work_id":"2f593749-9490-41f1-9bee-2d0345a388e6","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e814bcbc862cdbaa484f6ad293a406a8d7fdf4e32c035b0413ed4e47777b8f13","observation_id":"6344e5cd-0923-4217-863e-e3a501e366a8","resolution":{"observed_at":"2026-06-27T04:50:35.068645Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-25T11:53:26.693223+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T11:53:26.693223+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Millstein","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:c314816762570da49eafcd9bfcb288230be637eee281b22d17c72b4d538a7912","observation_id":"dfade6e3-9d06-4125-8ed5-77478548a66b","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3360555","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Modular verification for almost-sure termination of probabilistic programs.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"86859283-3b1c-48d7-aac8-4a4752b88b65","year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:401e75cfc325271a6a04fae6d4a6e5e5379ea5ef53f0418c3dd248cc6af1e8a3","observation_id":"cca16717-5b98-4792-954f-ddc5a1ed0107","resolution":{"observed_at":"2026-06-27T04:50:35.070403Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Property-directed k-induction","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:99caab33488a386a79a7db873a0497e647144fa637f0ca688d886d50988b414c","observation_id":"fbe41eed-075a-480d-a4a7-913635e86388","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"PhD thesis, RWTH Aachen University, Germany, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:62176f2b77a02619e1c31dbd91c106debf1d9941858e2f0bc8bd9fa295a8fef0","observation_id":"a0810ed1-5100-4b27-9724-6fec58384d03","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Weakest precondition reasoning for expected runtimes of randomized algorithms.J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:8ce24a8e40ac7e4cca8c19eead7ad58f272e98db29467e56950ea5e44b903a92","observation_id":"3b54f249-adf4-460e-8306-0bed91e611f3","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"On the hardness of analyzing probabilistic programs.Acta Informatica, 56(3):255–285, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:ff99f4f267d3b75f936bee057292f8e5276c905310d9f95eed936e799d5ee728","observation_id":"b1b03a39-d709-4338-9518-2243f00e5742","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-15769-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Cousot, R., Martel, M","venue":"Lecture notes in computer science","work_id":"ff4d0a99-2052-4757-a860-2b1c99a58932","year":2010},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:5319730b769f12d722d0cfc1267caac97ab85612d7d17624d0c038edafb499a9","observation_id":"7f874a0e-9a96-49a9-8e25-6d00b11366b0","resolution":{"observed_at":"2026-06-27T04:50:35.077455Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Barrett, and Cesare Tinelli","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:8113cd04ab7add24f7350bad1d7315b82d8fc77df6142d85442a08f0b79b4495","observation_id":"55f7a281-a1c7-49e7-a4ea-ae0c9847844a","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3674662","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Automated verification of higher-order probabilistic programs via a dependent refinement type system.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"cb687895-e78c-49fe-a3ef-dc3b40935698","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:6cb6fd8907af82d43e02cdcdc1697d311ef41b1c8194660a85db64aca7bc48b3","observation_id":"29d3ff46-b28b-440e-9269-67d7e2b554ce","resolution":{"observed_at":"2026-06-27T04:50:35.059976Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3808257","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A hierarchy of supermartingales for 𝜔-regular verification","venue":"Proceedings of the ACM on Programming Languages","work_id":"0e35c03b-23e3-4e52-a1a3-c6da953915dc","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:12714ea8566e390e1969d56d668253f74f9b7c2a916e6ebb4829fbed09e55c1d","observation_id":"95d981ae-065b-40b7-9319-1c3368d86bbe","resolution":{"observed_at":"2026-06-27T04:50:35.058155Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04132","last_updated":"2026-04-19T12:30:41Z","snapshot_observed_at":"2026-07-06T21:04:48.029541Z","submitted_at":"2025-04-05T10:49:36Z","title":"Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification","version":3},"cited_work":{"arxiv_id":"2504.04132","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04132","snapshot_observed_at":"2026-07-04T12:39:49.133295Z","title":"Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification","venue":"cs.LO","work_id":"3c85cb07-0ca3-49e0-b63b-cdd210715e45","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/2504.04132","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:66b0f36d009dfe0451b379bf6b9a2b7347687cbef617467103335f0bc80fe902","observation_id":"ce3405bf-c502-43b0-b2c4-7bd63a5800eb","resolution":{"observed_at":"2026-07-03T16:58:43.618161Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3808348","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Supermartingales for unique fixed points: A unified approach to lower bound verification.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"69757ef7-590b-4913-9e65-1261df520bf3","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f126d0c4e93ff0fe099c3ace0eccb832742f12600c9b20f3f4e246d4b26d8189","observation_id":"49db9e80-29a5-4465-a238-23665c5c60ab","resolution":{"observed_at":"2026-06-27T04:50:35.061906Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:8fad814be69da0a0d030f133473c0ad95cbdcbc8c38228110591e8378bbcdf36","observation_id":"6cee84ba-c709-421d-9ef1-9e7a5a99855b","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.04422","last_updated":"2022-03-08T21:56:31Z","snapshot_observed_at":"2026-07-06T12:45:47.261237Z","submitted_at":"2022-03-08T21:56:31Z","title":"ProbTA: A sound and complete proof rule for probabilistic verification","version":1},"cited_work":{"arxiv_id":"2203.04422","doi":"10.48550/arxiv.2203.04422","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.04422","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Probta: A sound and complete proof rule for probabilistic verification.CoRR, abs/2203.04422, 2022","venue":"arXiv (Cornell University)","work_id":"fb312df1-1096-4e0b-acf1-35f9ca07dcac","year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/2203.04422","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:3f89d9caef9a7c756d9de931d5b900c0c2c24773f839014f45671e0bfabdf029","observation_id":"34cb9b80-328c-4312-9db6-9d3f6beb9255","resolution":{"observed_at":"2026-06-27T04:50:35.083597Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.12344","last_updated":"2025-08-17T12:23:34Z","snapshot_observed_at":"2026-07-06T22:14:06.983137Z","submitted_at":"2025-08-17T12:23:34Z","title":"Structural Abstraction and Refinement for Probabilistic Programs","version":1},"cited_work":{"arxiv_id":"2508.12344","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.12344","snapshot_observed_at":"2026-07-03T16:58:43.608026Z","title":"Structural abstraction and refinement for probabilistic programs.CoRR, abs/2508.12344, 2025","venue":null,"work_id":"ad154ed6-3039-4746-bbc3-cab85c4d27e2","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/2508.12344","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:1ca4781cd4a15b577fac2df05a5b8a6bf23d11c38603a7a9014b4ba6dcd00eb9","observation_id":"e005e0e6-1688-4ddf-9105-2739292d19a7","resolution":{"observed_at":"2026-07-03T16:58:43.609597Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3763115","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Structural abstraction and refinement for probabilistic programs.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"253dd7d4-3296-4751-bd20-8af50556bfd1","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:0cb4985655730f4c6ad6bffb1c98d7b7738be8224ef27e6c70d557bdaa1e5088","observation_id":"e6cfc77a-ce55-4511-8c81-3eed9dd5014a","resolution":{"observed_at":"2026-06-27T04:50:35.031408Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3747514","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Tassarotti, Joseph and Birkedal, Lars , title =","venue":"Proceedings of the ACM on Programming Languages","work_id":"d69dac27-0e88-4c09-8b29-b8871c7cd173","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:62f798a7ca7ca1a113bf4b30183e829c70025655a46b2e9ae88fe54283d1ed00","observation_id":"617b22a7-974e-4bda-9617-782a00535cdb","resolution":{"observed_at":"2026-06-27T04:50:35.033906Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-14T07:49:45.992744+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T07:49:45.992744+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.10135","last_updated":"2026-04-27T08:45:27Z","snapshot_observed_at":"2026-07-06T22:35:41.533403Z","submitted_at":"2025-11-13T09:48:37Z","title":"Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)","version":4},"cited_work":{"arxiv_id":"2511.10135","doi":"10.48550/arxiv.2511.10135","metadata_source":"pith","pith_arxiv_id":"2511.10135","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)","venue":"cs.LO","work_id":"7bec8908-af62-4b41-a38a-d896bda6feaf","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/2511.10135","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:6124c387b934cc8075f38aefa6192f742b17196794f554094790abe88d54533e","observation_id":"1811f740-aa7b-4e6d-bbdf-9ef0fe20de72","resolution":{"observed_at":"2026-06-27T04:50:35.037063Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3632879","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"5e37404f-6840-4077-a597-7a4f7d69ed47","year":2024},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:641685f5a22433fd6ea7641bd4f34dfb7ba41293e50d6f634872882734785f06","observation_id":"633dbe7c-8b0c-465f-ba7f-f88ead8dba92","resolution":{"observed_at":"2026-06-27T04:50:35.039335Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704899","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"3703f19c-9108-4d7c-9b2a-564cddb84d6a","year":1902},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:ee7e06bd279da07dafe45b8e04043183ba28677852f93461689f5dc1b1f047c5","observation_id":"da2779f7-4733-4700-90be-2b6473819dc8","resolution":{"observed_at":"2026-06-27T04:50:35.041590Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T07:24:01.785492+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T07:24:01.785492+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9031.377910","doi":"10.1145/3779031.3779109","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic , year =","venue":null,"work_id":"a3ff97a7-fd45-495c-aae2-bf93060de5c1","year":2026},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:8e2d5bdfa66f25b3b19e2a7b3be7b43b3942a730adfc8b1b15dcbcfce54df4ef","observation_id":"41138806-d729-4cb8-8fc6-ed25f3103f0b","resolution":{"observed_at":"2026-06-27T04:50:35.050321Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Monographs in Computer Science","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:ad1aa5436fe9cf0f8b0d02267c53ef08a130d2a448c6dbdae63744836c601afa","observation_id":"4a68ad79-9b37-489e-88d1-9ef38af691a0","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Li, Brianna Marshall, and Steven Holtzen","venue":null,"work_id":null,"year":2081},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:beef03b41666a39ee276c9e7509971cc70c7cbd216a1c5cbdf6acb2c6736a430","observation_id":"abd0ccea-b3a3-401f-b20d-61394e83c7a0","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Conditioning in probabilistic programming.ACM Trans","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:4ca850c29bfbec8fb1a725caf817ee671a91d8989678a44bc48b856134092198","observation_id":"2975dc75-12b6-438e-b515-7e18ac9a19f4","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Practical solution techniques for first-order mdps.Artif","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:15972501941cf8fa23b6fb4cdcc57d594f4b42b3537a221232079ae4008e3a54","observation_id":"d7cf5b56-53c7-411c-a05d-6d9aefc5bea3","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Symbolic dynamic programming for discrete and continuous state mdps","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:70584cd6fc519d7a3faa8d3672af1e1fe0d3bced214bddb6f60c874ad95f355e","observation_id":"7d2d80be-13de-4cf8-85e3-4cb87a06b72c","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"A deductive verification infrastructure for probabilistic programs.Proc","venue":null,"work_id":null,"year":2052},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:4fbafcccf91c9614d243ed5eb5624671abfc3abe5af2ac7535894bf17a1387ff","observation_id":"cb3e8a85-6145-4903-8129-c08bea3d4ddf","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Checking safety properties using induction and a sat-solver","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:7abd21e74cc3da444d50b970ab8ae513a1cb5bad322c67cb08182738a2ece126","observation_id":"7947b51d-e768-423d-bf6b-674f9fd3ba93","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3290352","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trace abstraction modulo probability.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"604e9ef4-9f31-4023-a159-129dfd3aa935","year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:5ce29d53a1e08b9d4792a3cbf99e0dfd49d012f63df6e594d1dc78d9f7ad3e70","observation_id":"0f31a400-5f37-4668-a091-2ddac1673fc0","resolution":{"observed_at":"2026-06-27T04:50:35.052153Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.02772","last_updated":"2018-03-24T22:21:01Z","snapshot_observed_at":"2026-07-06T05:50:26.931161Z","submitted_at":"2017-07-10T09:30:21Z","title":"Probabilistic Program Equivalence for NetKAT","version":2},"cited_work":{"arxiv_id":"1707.02772","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.02772","snapshot_observed_at":"2026-07-03T16:58:43.619824Z","title":"Probabilistic Program Equivalence for NetKAT","venue":"cs.PL","work_id":"a8eefdbe-22ce-4fd7-a71c-8d6fd00b4b06","year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"cited_paper":"/paper/1707.02772","citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:297b9a19bc056be235b2b53c4e7e3424ef29f6edf69ccc940b8eef0d858e564e","observation_id":"786c916e-50f9-48c7-861d-8951ccaaa624","resolution":{"observed_at":"2026-07-03T16:58:43.621731Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9837.300984","doi":"10.1145/3009837.3009842","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards Automatic Resource Bound Analysis forOCaml","venue":null,"work_id":"4b5267dd-7141-4a48-81fd-b83cd74d1a52","year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f6242d1a75221eee94202ea572b25500961b4a19324b269517382fa845c008e3","observation_id":"27e6e88c-abcd-4f2d-8104-ade064409f68","resolution":{"observed_at":"2026-06-27T04:50:35.022566Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4221.331463","doi":"10.1145/3314221.3314633","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Im- plementation","venue":null,"work_id":"ea121b50-76e5-46aa-aeac-29e4bfbdce74","year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:15d647bfed32292dc3c8d55807725d243ca04979c88efba548f4f3fab3b0005d","observation_id":"07f1c68f-d85a-4993-9b79-03a5f8b5fc3d","resolution":{"observed_at":"2026-06-27T04:50:35.028103Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-20T21:22:12.471223+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T21:22:12.471223+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"Monotonicity in Markov Chains","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:41113014e6b68d998f677411f0b14cd0258840e27bc7e7ffac95569bce060fb2","observation_id":"45db6cd3-3153-4d45-8e68-d71d7c26c5d9","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704884","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Modelling recursion and probabilistic choice in guarded type theory.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"701860b0-be92-4887-8a06-954ce7917e73","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:b4f65a7704a89ad26a57a05c99d8ba1e48826628d78ef51fc63ca13ca5259882","observation_id":"79ca146b-8030-4f71-b87d-57f6cae1392b","resolution":{"observed_at":"2026-06-27T04:50:34.981557Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-37709-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Making IP = PSPACE practical: Efficient interactive protocols for BDD algorithms","venue":"Lecture notes in computer science","work_id":"08e1f031-b145-4ddd-ac8b-1a779dcea8ff","year":2023},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:e74e9a0ff76dff0fadb83fec811ee757bc2ec3e58142923253c3f202e82a38b7","observation_id":"5acec354-558d-47a4-883c-841ea4a0748e","resolution":{"observed_at":"2026-06-27T04:50:34.978586Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T22:23:09.572995+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T22:23:09.572995+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3563344","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Symbolic execution for randomized programs.Proc","venue":"Proceedings of the ACM on Programming Languages","work_id":"33fc55b0-8a0b-4a7f-a92e-e2ab22aabb99","year":2022},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:674cbefefdb4776ebc32024b70a308a3a96f23a78b7b28cc208c5a3767e26659","observation_id":"0ed8ae7f-5aaf-43d5-82cd-7cf6372d4ca3","resolution":{"observed_at":"2026-06-27T04:50:34.983696Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:41:39.021333Z","title":"American Mathematical Society, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:f7c422fe5cb4107a5c1de2648d3743bfa0d98c8a95660f2db8ae549c7520749c","observation_id":"58870df4-10eb-46c5-a4e7-5d8658d2b706","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"Sylvan: multi-core framework for decision diagrams.Int","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:bef95b3752927373c6195929942c90a8c3fe4bf9f098d913c6d73a27d04a12f6","observation_id":"0e937372-91fd-442b-9a0a-842ffe22ba99","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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-06-27T04:41:39.021333Z","title":"van de Pol","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:ca46445f8c921dc6121ed3ec0b1408bd0a2bb33308bb29ca286f899a28a94705","observation_id":"24a0e174-adec-4aef-bf44-c9d6c5543012","resolution":{"observed_at":"2026-06-27T04:41:39.021333Z","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":"3483.345410","doi":"10.1145/3453483.3454101","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"caller_id","venue":null,"work_id":"7ef76c23-77b2-421d-918e-196c8a1f8877","year":2021},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:cc47455dd14fea881901e6a87310ed773826d038eb2fc297af433008952b9d53","observation_id":"e79ea5df-eda0-4196-a960-9af805cd2291","resolution":{"observed_at":"2026-06-27T04:50:34.988419Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-11T03:19:21.77582+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T03:19:21.77582+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4221.331458","doi":"10.1145/3314221.3314581","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation(Phoenix, AZ, USA)(PLDI 2019)","venue":null,"work_id":"ef05f218-734e-4a7f-aa9f-c78db3f07c6c","year":2019},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:becc1658fd7d6f33f82c8f329ce26144eb80936eec7250579ecf17b553fd5aea","observation_id":"51c37478-be53-4597-99fd-4832375ecf24","resolution":{"observed_at":"2026-06-27T04:50:35.000321Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.11320","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T16:58:43.610755Z","title":"A denotational product construction for temporal verification of effectful higher-order programs.CoRR, abs/2510.11320, 2025","venue":null,"work_id":"7f6c9714-a10b-4bbc-9f17-da58e12b270e","year":2025},"citing_paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","version":3},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-06-27T04:41:39.021333Z"},"links":{"citing_paper":"/paper/2606.15043"},"observation_digest":"sha256:18d1d5c4e27dfb26067633107f6a0db0966f9b0712f58fea13bd937ca9987fba","observation_id":"d4313700-d5b7-4ad1-a361-460685464327","resolution":{"observed_at":"2026-07-03T16:58:43.612377Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.15043","last_updated":"2026-06-23T01:07:20Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-02T00:56:12.083711Z","submitted_at":"2026-06-13T01:02:26Z","title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":15,"parse_uncertain":0,"unresolved":48,"verified_exact":37,"verified_fuzzy":0},"total_outbound_references":102},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 0 inbound Pith citation observations for arXiv:2606.15043."}