Paper Citation Record · LEDGER

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.16533 v1

Coverage vector

measured 43 of 43 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T20:49:56.589484Z

measured 43 of 43 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

43 of 43 outbound references displayed

verified exact9
verified fuzzy0
unresolved32
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6b1cc396-7a4d-4917-9c97-af40211576ca · outbound

This paper cites 1995.Domain Theory.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary 1995.Domain Theory

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:51.948432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bf50431-6c62-4b6f-b5f3-a525f81bec86 · outbound

This paper cites Sequential composition adds consumption, branching forms take unions over possible branches, and nondeterministic choice adds one entry for the branch selection.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Sequential composition adds consumption, branching forms take unions over possible branches, and nondeterministic choice adds one entry for the branch selection

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:56.589484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62bc2671-4014-40b9-b7b1-a8ff46e5e521 · outbound

This paper cites InProgramming Languages and Systems, Viktor Vafeiadis (Ed.).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProgramming Languages and Systems, Viktor Vafeiadis (Ed.)

Reference 13

Resolution: verified exact; doi, observed 2026-08-01T20:53:35.200371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 84084fca-f7ac-474d-855d-91c17dff6298 · outbound

This paper cites Formal Specifications: Foundations, Methods, Tools and Applications.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Formal Specifications: Foundations, Methods, Tools and Applications

Reference 17

Resolution: verified exact; doi, observed 2026-08-01T20:53:35.012974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ed748714-9e48-4ee1-bc42-f555ae9827e6 · outbound

This paper cites InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(Mumbai, India)(POPL ’15).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(Mumbai, India)(POPL ’15)

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.062484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f99d4025-545b-49d7-b7bb-7767e97f7083 · outbound

This paper cites Total Outcome Logic: Unified Reasoning for a Taxonomy of Program Logics.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Total Outcome Logic: Unified Reasoning for a Taxonomy of Program Logics

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.189544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4a000ea-b9ab-4790-a162-75fdfa81fb5f · outbound

This paper cites doi:10.1007/BF01759073 Annabelle McIver and Carroll Morgan.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary doi:10.1007/BF01759073 Annabelle McIver and Carroll Morgan

Reference 26

Resolution: verified exact; doi, observed 2026-08-01T20:53:34.849853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 002201f7-512a-4143-835e-dc79d3805c1e · outbound

This paper cites In[1989] Proceedings.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary In[1989] Proceedings

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.560863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 147d885d-f207-4726-bd07-da2e4b260259 · outbound

This paper cites doi:10.1016/0890- 5401(91)90052-4 Rajeev Motwani and Prabhakar Raghavan.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary doi:10.1016/0890- 5401(91)90052-4 Rajeev Motwani and Prabhakar Raghavan

Reference 28

Resolution: malformed identifier; no resolver link, observed 2026-08-01T20:49:54.617932Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5243e6ce-e8bb-4bc4-8c84-9e8b62808c92 · outbound

This paper cites InCONCUR 2004 - Concurrency Theory.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InCONCUR 2004 - Concurrency Theory

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.818678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25c5752e-29fa-4c55-a6e8-8a245d45cd94 · outbound

This paper cites an unresolved cited work.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Unresolved cited work

Reference 32

Resolution: verified exact; doi, observed 2026-08-01T20:53:34.708663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 933bbdef-dc67-4a80-b60d-c3ad5ccdc125 · outbound

This paper cites Reducing urban traffic congestion due to localized routing decisions.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Reducing urban traffic congestion due to localized routing decisions

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:55.876537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c51efb1-624c-4680-bd75-f04fd79e3fdd · outbound

This paper cites ACM Trans.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Trans

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:55.976807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 806b11cf-cc36-496e-af63-abd021ba7281 · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:56.044998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a66010d-5bd0-4023-9d39-c9a2fa2de09b · outbound

This paper cites 348), Patricia Bouyer and Jaco van de Pol (Eds.).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary 348), Patricia Bouyer and Jaco van de Pol (Eds.)

Reference 41

Resolution: verified exact; doi, observed 2026-08-01T20:53:34.514332Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 51402753-e3d1-40fb-a5c4-2e900828a90d · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:56.426962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 47bf32f5-3391-4069-8907-28985f178147 · outbound

This paper cites Steve Selvin.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Steve Selvin

Reference 1971

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:55.290211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43fad6d4-b8ac-4085-98eb-3aac0d02d74b · outbound

This paper cites doi:10.1007/BF00288637 Lyle A.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary doi:10.1007/BF00288637 Lyle A

Reference 1974

Resolution: verified exact; doi, observed 2026-08-01T20:53:34.938772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 583cbb43-4693-4948-ad84-95f088ca76db · outbound

This paper cites doi:10.1080/00031305.1975.10479121 Joseph Tassarotti and Robert Harper.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary doi:10.1080/00031305.1975.10479121 Joseph Tassarotti and Robert Harper

Reference 1975

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:55.448293Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a250da1-1ec2-43b2-b2c8-e27cd1dc3479 · outbound

This paper cites ACM19, 5 (May 1976), 236–243.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM19, 5 (May 1976), 236–243

Reference 1976

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.235522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fdcfeaf5-b782-4148-86de-7a6ed9777f54 · outbound

This paper cites InProceedings of the 2nd ACM Symposium on Principles of Distributed Computing(Montreal, Quebec, Canada)(PODC ’83).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the 2nd ACM Symposium on Principles of Distributed Computing(Montreal, Quebec, Canada)(PODC ’83)

Reference 1983

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.840880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b7eb86a-03e1-45f0-875b-44f57dc7f170 · outbound

This paper cites ACM32, 2 (April 1985), 374–382.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM32, 2 (April 1985), 374–382

Reference 1985

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.739027Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f65341d-e694-49e4-99da-9cf665fc68fc · outbound

This paper cites ACM33, 4 (aug 1986), 724–767.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM33, 4 (aug 1986), 724–767

Reference 1986

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.063336Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ab893c4-e32e-4428-87ea-410eb90f1475 · outbound

This paper cites InFourth Annual Symposium on Logic in Computer Science.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InFourth Annual Symposium on Logic in Computer Science

Reference 1989

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.925165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0fdd261f-b671-4682-91dc-9b5fa46ba4ff · outbound

This paper cites InProceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing(Baltimore, Maryland, USA)(STOC ’90).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing(Baltimore, Maryland, USA)(STOC ’90)

Reference 1990

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.720427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 524c5051-6f9c-48d7-b5fd-78ecbadf5211 · outbound

This paper cites 1991), 685–699.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary 1991), 685–699

Reference 1991

Resolution: verified exact; doi, observed 2026-08-01T20:53:35.111154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f1b6db09-eefb-4761-a85e-7241feff24bd · outbound

This paper cites Comput.23, 4 (1994), 701–712.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Comput.23, 4 (1994), 701–712

Reference 1994

Resolution: verified exact; doi, observed 2026-08-01T20:53:35.286079Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f882fe11-dfd4-41f1-b2bc-d59bb7f58d1f · outbound

This paper cites InProceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing(Santa Barbara, California, USA)(PODC ’97).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing(Santa Barbara, California, USA)(PODC ’97)

Reference 1997

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.549821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54641f20-8f09-4f3a-a93e-cfba9c10039b · outbound

This paper cites InProceedings of the 15th International Workshop on Computer Science Logic (CSL ’01).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the 15th International Workshop on Computer Science Logic (CSL ’01)

Reference 2001

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.984373Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 776e8c09-8420-4a4d-9338-deffca079e7b · outbound

This paper cites InCONCUR 2004 - Concurrency Theory, Philippa Gardner and Nobuko Yoshida (Eds.).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InCONCUR 2004 - Concurrency Theory, Philippa Gardner and Nobuko Yoshida (Eds.)

Reference 2004

Resolution: malformed identifier; doi_truncated, observed 2026-08-01T20:53:35.350672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 7d44b637-d5ba-4db4-8a18-1348d64ea913 · outbound

This paper cites Electronic Notes in Theoretical Computer Science222 (2009), 3–99.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Electronic Notes in Theoretical Computer Science222 (2009), 3–99

Reference 2009

Resolution: verified exact; doi, observed 2026-08-01T20:53:34.580310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0cad63ce-2f88-48b3-8255-c7b0f222f56f · outbound

This paper cites In Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary In Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Reference 2010

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.180504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6457ce4-ec89-44e5-9b58-645f978874f1 · outbound

This paper cites InProceedings of the 2012 ACM Symposium on Principles of Distributed Computing(Madeira, Portugal)(PODC ’12).

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InProceedings of the 2012 ACM Symposium on Principles of Distributed Computing(Madeira, Portugal)(PODC ’12)

Reference 2012

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.303072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa6f0772-8753-419e-9f9a-2453141fe19f · outbound

This paper cites InAutomated Deduction - CADE-25, Amy P.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InAutomated Deduction - CADE-25, Amy P

Reference 2015

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.155359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96b48a7e-03b4-4c99-8c30-50e23d895b8d · outbound

This paper cites an unresolved cited work.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Unresolved cited work

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.106091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8591f7a9-7d3f-473d-bbb1-1b6c99352dce · outbound

This paper cites doi:10.1017/S0956796818000151 Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary doi:10.1017/S0956796818000151 Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer

Reference 2018

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:53.985652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4354d0a3-39dc-4cf5-8518-5ca3b9f8101d · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:55.586859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc01c519-e6da-4f32-a73d-a16924610edb · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.568224Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e41125e3-38c7-433f-8391-3f048d604320 · outbound

This paper cites InAutomated Deduction – CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary InAutomated Deduction – CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.696164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed8bea6c-c567-4c0b-b733-59b25878f878 · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.249406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5891b7fa-a6fb-48f5-bde7-12681055b512 · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:56.285858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ada62968-74d0-4999-b6b2-7da9b89c478c · outbound

This paper cites ACM Program.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary ACM Program

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:52.452128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7be3af3-ff01-4e9f-8cd3-0ebd59dc66d2 · outbound

This paper cites Technical Report.

Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary Technical Report

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-01T20:49:54.330346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.