{"as_of":"2026-08-09T06:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bea886b5903be43f11bffc5b2e887ed9dd15b95f8984312be28161b7f2780f9e","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:49:56.589484Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16533/citation-record","integrity":"/paper/2607.16533/integrity","json":"/paper/2607.16533/citation-record.json","paper":"/paper/2607.16533"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:51.948432Z","title":"1995.Domain Theory","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:51.948432Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:9b9e0b29ac0edd8fda2c71aaaea8060b22cab8f914a08e0ea33175f7a974cdc2","observation_id":"6b1cc396-7a4d-4917-9c97-af40211576ca","resolution":{"observed_at":"2026-08-01T20:49:51.948432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:56.589484Z","title":"Sequential composition adds consumption, branching forms take unions over possible branches, and nondeterministic choice adds one entry for the branch selection","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:56.589484Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:4a5225fedb74b21bc65a74636831397e6e68e74dd5bef03f8921a321537d2d55","observation_id":"1bf50431-6c62-4b6f-b5f3-a525f81bec86","resolution":{"observed_at":"2026-08-01T20:49:56.589484Z","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-91118-7_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InProgramming Languages and Systems, Viktor Vafeiadis (Ed.)","venue":"Lecture notes in computer science","work_id":"43626d86-598a-46d4-8629-08a6acd2c80d","year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.389040Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:30a4795bcae260e7f3402cb0deb45d1833f21e2a4da255e13295d49142f2521d","observation_id":"62bc2671-4014-40b9-b7b1-a8ff46e5e521","resolution":{"observed_at":"2026-08-01T20:53:35.200371Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-6423(96)00019-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Formal Specifications: Foundations, Methods, Tools and Applications","venue":"Science of Computer Programming","work_id":"fc25dc74-0af7-4371-8287-78b8bf77c672","year":1997},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.837025Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:30c4c0eb4f217aea64bed1ebfa2d801f08571cda23e0dd3f8c0d5fa46ec88b44","observation_id":"84084fca-f7ac-474d-855d-91c17dff6298","resolution":{"observed_at":"2026-08-01T20:53:35.012974Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.062484Z","title":"InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(Mumbai, India)(POPL ’15)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.062484Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:f8ae02ceb4b1c5d0b6c2f9a0c587a1501cdb7ef33cc187311e064163ccf8f2be","observation_id":"ed748714-9e48-4ee1-bc42-f555ae9827e6","resolution":{"observed_at":"2026-08-01T20:49:54.062484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00197","last_updated":"2025-06-23T17:04:48Z","snapshot_observed_at":"2026-08-08T19:53:39.320181Z","submitted_at":"2024-10-31T20:28:01Z","title":"Total Outcome Logic: Unified Reasoning for a Taxonomy of Program Logics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00197","snapshot_observed_at":"2026-08-01T20:49:54.189544Z","title":"arXiv:2411.00197 [cs.LO] https://arxiv.org/abs/2411.00197 John M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.189544Z"},"links":{"cited_paper":"/paper/2411.00197","citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:1ac7f110647e186e321adf7ba622fca73d9041bda1e92851407c740ee2572bf8","observation_id":"f99d4025-545b-49d7-b7bb-7767e97f7083","resolution":{"observed_at":"2026-08-01T20:49:54.189544Z","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/bf01759073","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/BF01759073 Annabelle McIver and Carroll Morgan","venue":"Algorithmica","work_id":"51954a69-d256-4b3b-89be-da5f1ff135d6","year":1991},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.473310Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:c3857d75c944a11b369b29fe087ac0868608edc55ac7ad20364e86fe05ecdd0c","observation_id":"f4a000ea-b9ab-4790-a162-75fdfa81fb5f","resolution":{"observed_at":"2026-08-01T20:53:34.849853Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.560863Z","title":"In[1989] Proceedings","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.560863Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:84f66d0fcdca88e2e52d8ebf6735e0772564a74f034ff17f25bde14508322149","observation_id":"002201f7-512a-4143-835e-dc79d3805c1e","resolution":{"observed_at":"2026-08-01T20:49:54.560863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.617932Z","title":"doi:10.1016/0890- 5401(91)90052-4 Rajeev Motwani and Prabhakar Raghavan","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.617932Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:f1a8acc8894eba7a86fb982088f2a480a82e44f93c70ea5949aef6eaafe988fd","observation_id":"147d885d-f207-4726-bd07-da2e4b260259","resolution":{"observed_at":"2026-08-01T20:49:54.617932Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.818678Z","title":"InCONCUR 2004 - Concurrency Theory","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.818678Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:bcb751c865a167dfde8e915657365e1e6a733785c2f2a1c59c21b4c0cab4f60c","observation_id":"5243e6ce-e8bb-4bc4-8c84-9e8b62808c92","resolution":{"observed_at":"2026-08-01T20:49:54.818678Z","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.1147/rd.386.0683","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"IBM Journal of Research and Development","work_id":"95b83c62-5e96-4d48-b636-d5089119735e","year":1994},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.093819Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:77afdc022b62844590a9069d4f0355643d7f057375a7661aab29a42cffcc1531","observation_id":"25c5752e-29fa-4c55-a6e8-8a245d45cd94","resolution":{"observed_at":"2026-08-01T20:53:34.708663Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10298","last_updated":"2020-09-03T20:58:25Z","snapshot_observed_at":"2026-07-06T08:59:36.401601Z","submitted_at":"2020-02-24T14:58:39Z","title":"Reducing urban traffic congestion due to localized routing decisions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10298","snapshot_observed_at":"2026-08-01T20:49:55.876537Z","title":"InProceedings 17th Annual IEEE Symposium on Logic in Computer Science","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.876537Z"},"links":{"cited_paper":"/paper/2002.10298","citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:5989b151dcdfafeca5f5b4d60876cd774c1c65fc0b94f92f162c3d4cfacde2d2","observation_id":"933bbdef-dc67-4a80-b60d-c3ad5ccdc125","resolution":{"observed_at":"2026-08-01T20:49:55.876537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:55.976807Z","title":"ACM Trans","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.976807Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:adf0026d4de7d93e05ab2c77ef64c49635d04628ce568e5b8bbdc8a4d411d9e5","observation_id":"6c51efb1-624c-4680-bd75-f04fd79e3fdd","resolution":{"observed_at":"2026-08-01T20:49:55.976807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:56.044998Z","title":"ACM Program","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:56.044998Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:8b0fcfde3f2ebd4fb90ba23f36ebbddd42769dae555dc15743805de0216d48b7","observation_id":"806b11cf-cc36-496e-af63-abd021ba7281","resolution":{"observed_at":"2026-08-01T20:49:56.044998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.concur.2025.39","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"348), Patricia Bouyer and Jaco van de Pol (Eds.)","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"d76f7871-6c65-48cc-bdcf-c7c950c00309","year":2025},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:56.168625Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:7f1151b9f4831d67f5384be48b0774ecb1f2ebcb0dc0dad6b64cfa0a864ab0f4","observation_id":"2a66010d-5bd0-4023-9d39-c9a2fa2de09b","resolution":{"observed_at":"2026-08-01T20:53:34.514332Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:56.426962Z","title":"ACM Program","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:56.426962Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:41f0ccc5638b46f13aa8155e4a51577f98ff6585feea9bb2a48a5239f3c5edc0","observation_id":"51402753-e3d1-40fb-a5c4-2e900828a90d","resolution":{"observed_at":"2026-08-01T20:49:56.426962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:55.290211Z","title":"Steve Selvin","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1971,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.290211Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:8485469c8d2eb18a9f4ccb2b887d7ffaec9e564cef44adb5a25bb1d36cb9614a","observation_id":"47bf32f5-3391-4069-8907-28985f178147","resolution":{"observed_at":"2026-08-01T20:49:55.290211Z","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/bf00288637","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/BF00288637 Lyle A","venue":"Acta Informatica","work_id":"e4ed5c94-9861-458b-a114-5535dacb61c1","year":1974},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1974,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.391301Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:6130af5353fc076f82eb3875ecd92827cd13ac13d4a03dc44f18fa7ad817be3c","observation_id":"43fad6d4-b8ac-4085-98eb-3aac0d02d74b","resolution":{"observed_at":"2026-08-01T20:53:34.938772Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:55.448293Z","title":"doi:10.1080/00031305.1975.10479121 Joseph Tassarotti and Robert Harper","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1975,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.448293Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:dab57764a79d0b6e8fa1723bd81573799b26d2c62d75481267a68b1b4135a8e9","observation_id":"583cbb43-4693-4948-ad84-95f088ca76db","resolution":{"observed_at":"2026-08-01T20:49:55.448293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.235522Z","title":"ACM19, 5 (May 1976), 236–243","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1976,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.235522Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:771d2bd30cc88fd26044120a6175bb39beb6fc6d432112471609e258ba9131c9","observation_id":"3a250da1-1ec2-43b2-b2c8-e27cd1dc3479","resolution":{"observed_at":"2026-08-01T20:49:53.235522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.840880Z","title":"InProceedings of the 2nd ACM Symposium on Principles of Distributed Computing(Montreal, Quebec, Canada)(PODC ’83)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.840880Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:6964f9e47ba0f9766198d308aa7513e9950323a45e60e68d88e19eb5a1c2d2ab","observation_id":"fdcfeaf5-b782-4148-86de-7a6ed9777f54","resolution":{"observed_at":"2026-08-01T20:49:52.840880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.739027Z","title":"ACM32, 2 (April 1985), 374–382","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.739027Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:3ecc3ec179a0c2c1755229f3896e540e9344fa306d6aec0ca7e1cdd327b9f304","observation_id":"5b7eb86a-03e1-45f0-875b-44f57dc7f170","resolution":{"observed_at":"2026-08-01T20:49:53.739027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.063336Z","title":"ACM33, 4 (aug 1986), 724–767","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.063336Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:cdfb81fd9b3d80c5ca4c6a6c5844b44023156b1ffef8d17bf2d77e71c206f571","observation_id":"2f65341d-e694-49e4-99da-9cf665fc68fc","resolution":{"observed_at":"2026-08-01T20:49:52.063336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.925165Z","title":"InFourth Annual Symposium on Logic in Computer Science","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.925165Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:35b5d622bc2258f8722fa9b8ac9389b8fb3f830d0c9113a7ff66ef0dddb94dd8","observation_id":"5ab893c4-e32e-4428-87ea-410eb90f1475","resolution":{"observed_at":"2026-08-01T20:49:53.925165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.720427Z","title":"InProceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing(Baltimore, Maryland, USA)(STOC ’90)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.720427Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:0a01360150caa2cc186961b95f3296503bbc2517c14bfaf10b77fe02e25f7e45","observation_id":"0fdd261f-b671-4682-91dc-9b5fa46ba4ff","resolution":{"observed_at":"2026-08-01T20:49:52.720427Z","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.1016/0196-6774(91)90041-v","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1991), 685–699","venue":"Journal of Algorithms","work_id":"9606bb40-827d-41dd-a591-d34b9cfd101c","year":1991},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.646068Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:afa49797a74b0bcc706dd12c28501e28d47805c4123cfc42355c55121e9b5e55","observation_id":"524c5051-6f9c-48d7-b5fd-78ecbadf5211","resolution":{"observed_at":"2026-08-01T20:53:35.111154Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539790192635","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Comput.23, 4 (1994), 701–712","venue":"SIAM Journal on Computing","work_id":"8dc421b2-efbf-44c1-9438-c55adb3b2db9","year":1994},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.095754Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:6dc93a904e0fddc09b297fbb0b39ca57e268a1b08d17b61915ac629f47a9a38f","observation_id":"f1b6db09-eefb-4761-a85e-7241feff24bd","resolution":{"observed_at":"2026-08-01T20:53:35.286079Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.549821Z","title":"InProceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing(Santa Barbara, California, USA)(PODC ’97)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.549821Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:0ed545c427ccc9d3db12d7ecb4c32151b5111cfa1b89f0af0b49bf6d637bdf3a","observation_id":"f882fe11-dfd4-41f1-b2bc-d59bb7f58d1f","resolution":{"observed_at":"2026-08-01T20:49:53.549821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.984373Z","title":"InProceedings of the 15th International Workshop on Computer Science Logic (CSL ’01)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.984373Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:57b2061d435d220107010782b79249bc39300be33c611fc217cfc18ba9c0aaa6","observation_id":"54641f20-8f09-4f3a-a93e-cfba9c10039b","resolution":{"observed_at":"2026-08-01T20:49:54.984373Z","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-540-28644-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:53:35.300889Z","title":"InCONCUR 2004 - Concurrency Theory, Philippa Gardner and Nobuko Yoshida (Eds.)","venue":null,"work_id":"d3740b4a-ef9b-42d0-92ee-257bd41ea295","year":2004},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.963693Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:15f19b16c030cec08ecdf09445d94219d9d4cf6757d6155f42e2d8ccb526f969","observation_id":"776e8c09-8420-4a4d-9338-deffca079e7b","resolution":{"observed_at":"2026-08-01T20:53:35.350672Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2009.01.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Electronic Notes in Theoretical Computer Science222 (2009), 3–99","venue":"Electronic Notes in Theoretical Computer Science","work_id":"21e867ba-26c9-4737-aac4-6fc95701e40f","year":2009},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.735525Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:7ebe56236d26b9fb37dde04575791620546bf6ff9ecf5faa472611c9da821138","observation_id":"7d44b637-d5ba-4db4-8a18-1348d64ea913","resolution":{"observed_at":"2026-08-01T20:53:34.580310Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.180504Z","title":"In Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.180504Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:cfad4a72781589594aae4084b58b786f7119b961bc00f08759bb1811c88c6bcc","observation_id":"0cad63ce-2f88-48b3-8255-c7b0f222f56f","resolution":{"observed_at":"2026-08-01T20:49:52.180504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.303072Z","title":"InProceedings of the 2012 ACM Symposium on Principles of Distributed Computing(Madeira, Portugal)(PODC ’12)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.303072Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:61b2049dfa9dbb430b909339059ca1cd4e514da13c59ea997d763fee955e9c99","observation_id":"b6457ce4-ec89-44e5-9b58-645f978874f1","resolution":{"observed_at":"2026-08-01T20:49:52.303072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.155359Z","title":"InAutomated Deduction - CADE-25, Amy P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.155359Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:abf9d551f35a468f5a9fa421895d3097777ff15f36f089401722a3d5b233bb06","observation_id":"fa6f0772-8753-419e-9f9a-2453141fe19f","resolution":{"observed_at":"2026-08-01T20:49:53.155359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.106091Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.106091Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:054288ad515532eca3c60f4f1121bb7023080096dc43aa29f1f3debdb558381d","observation_id":"96b48a7e-03b4-4c99-8c30-50e23d895b8d","resolution":{"observed_at":"2026-08-01T20:49:54.106091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:53.985652Z","title":"doi:10.1017/S0956796818000151 Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:53.985652Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:235f9ff8314fdbc4087f102f53e3d5516f83ab563cea99707eb09ddec27d6009","observation_id":"8591f7a9-7d3f-473d-bbb1-1b6c99352dce","resolution":{"observed_at":"2026-08-01T20:49:53.985652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:55.586859Z","title":"ACM Program","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:55.586859Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:6fb047913f246104ba230785df6ee9b73de0b88fe4bed3d473eac18294040ea2","observation_id":"4354d0a3-39dc-4cf5-8518-5ca3b9f8101d","resolution":{"observed_at":"2026-08-01T20:49:55.586859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.568224Z","title":"ACM Program","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.568224Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:61f0f2422b5695ebde987f3eb58a87ed509e984748acd939c6bb2d9ef63d1cd0","observation_id":"dc01c519-e6da-4f32-a73d-a16924610edb","resolution":{"observed_at":"2026-08-01T20:49:52.568224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.696164Z","title":"InAutomated Deduction – CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.696164Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:f81ba74dd09ea36fcf646559e791adb5758f4e8f00cec3477b69092c5fce8b23","observation_id":"e41125e3-38c7-433f-8391-3f048d604320","resolution":{"observed_at":"2026-08-01T20:49:54.696164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.249406Z","title":"ACM Program","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.249406Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:2197c361da0f22ff6b17350ac5e66f2d7dbf9690d75c233c01a9d68bae9d69d0","observation_id":"ed8bea6c-c567-4c0b-b733-59b25878f878","resolution":{"observed_at":"2026-08-01T20:49:54.249406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:56.285858Z","title":"ACM Program","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:56.285858Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:d92aeb01add488a265d87405d93e3109cf31fc00d80828b91002d6d8b730fb2b","observation_id":"5891b7fa-a6fb-48f5-bde7-12681055b512","resolution":{"observed_at":"2026-08-01T20:49:56.285858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:52.452128Z","title":"ACM Program","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:52.452128Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:71728687d765f80a0d4f0876a5279b5562c9bd834451a9127de1e2058ccd0d81","observation_id":"ada62968-74d0-4999-b6b2-7da9b89c478c","resolution":{"observed_at":"2026-08-01T20:49:52.452128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:49:54.330346Z","title":"Technical Report","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T20:49:54.330346Z"},"links":{"citing_paper":"/paper/2607.16533"},"observation_digest":"sha256:55d6014614b9fac458328d7e42b25e8baa74bd241eb21d53ea492b3d0b707122","observation_id":"f7be3af3-ff01-4e9f-8cd3-0ebd59dc66d2","resolution":{"observed_at":"2026-08-01T20:49:54.330346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16533","last_updated":"2026-07-17T22:16:17Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-06T16:19:17.367528Z","submitted_at":"2026-07-17T22:16:17Z","title":"Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":43},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2607.16533."}