Paper Citation Record · LEDGER

Completeness for Probabilistic Boolean Tapes

As of 14 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2606.19017.

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

pith.paper-citation-record.v1
2606.19017 v1

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-11T11:50:26.030339Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-31T21:02:17.918796Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

37 of 37 outbound references displayed

verified exact13
verified fuzzy0
unresolved10
parse uncertain0
malformed identifier1
metadata mismatch13

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3dc740f6-ef15-420c-a84b-d3589efaf117 · outbound

This paper cites What are the fundamental structures of concurrency? We still don't know!.

Completeness for Probabilistic Boolean Tapes What are the fundamental structures of concurrency? We still don't know!

Reference 1

Resolution: metadata mismatch; local_arxiv, observed 2026-07-04T02:49:24.900030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 8a838be7-eeba-4614-80de-617e8abaa496 · outbound

This paper cites Sufficient incorrectness logic: SIL and separation SIL.

Completeness for Probabilistic Boolean Tapes Sufficient incorrectness logic: SIL and separation SIL

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.908667Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 09896f51-a944-4070-b46e-1b5f39e6f978 · outbound

This paper cites Tripp and J.

Completeness for Probabilistic Boolean Tapes Tripp and J

Reference 3

Resolution: metadata mismatch; doi, observed 2026-06-26T19:09:48.008293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 8767bbc1-ea6c-408c-8064-50cd8489eac2 · outbound

This paper cites 8 Filippo Bonchi, Cipriano Junior Cioffo, Alessandro Di Giorgio, and Elena Di Lavore.

Completeness for Probabilistic Boolean Tapes 8 Filippo Bonchi, Cipriano Junior Cioffo, Alessandro Di Giorgio, and Elena Di Lavore

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.909422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 0ad50641-6268-4509-ba5a-6597deb56885 · outbound

This paper cites In: Cîrstea, C., Knapp, A.

Completeness for Probabilistic Boolean Tapes In: Cîrstea, C., Knapp, A

Reference 5

Resolution: metadata mismatch; doi, observed 2026-06-26T19:09:47.988391Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f967a15a-89de-4330-bf29-cc7dfdee4e7c · outbound

This paper cites Separation and definability in fragments of two-variable first-order logic with counting.

Completeness for Probabilistic Boolean Tapes Separation and definability in fragments of two-variable first-order logic with counting

Reference 6

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.021966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f9622ccf-f01e-42ce-8bc6-eac05b0cbb46 · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 7

Resolution: verified exact; doi, observed 2026-06-26T19:09:48.010099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation ed9312a3-252e-4d31-af68-c1c145238e49 · outbound

This paper cites InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.

Completeness for Probabilistic Boolean Tapes InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Reference 8

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.027726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 3262eca6-85b2-48f7-b16d-87e8b592657a · outbound

This paper cites An Introduction to Effectus Theory.

Completeness for Probabilistic Boolean Tapes An Introduction to Effectus Theory

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-07-04T02:49:24.910891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 60c53a99-8d87-4c5d-bd0c-762216e2d75c · outbound

This paper cites Two Roads to Classicality.

Completeness for Probabilistic Boolean Tapes Two Roads to Classicality

Reference 10

Resolution: metadata mismatch; local_arxiv, observed 2026-06-26T19:09:48.003320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 4e5e79ef-5c3b-4e3a-b75d-09ac2fee9ac8 · outbound

This paper cites Automatic inference of necessary preconditions.

Completeness for Probabilistic Boolean Tapes Automatic inference of necessary preconditions

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b054a5c-7758-4f9d-944e-4f2f8c4319d3 · outbound

This paper cites Springer, 2013.doi:10.1007/978-3-642-35873-9\_10.

Completeness for Probabilistic Boolean Tapes Springer, 2013.doi:10.1007/978-3-642-35873-9\_10

Reference 12

Resolution: verified exact; doi, observed 2026-06-26T19:09:47.990037Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 3da2da4a-bb8a-483d-a58a-3ecb699f7e3e · outbound

This paper cites Evidential Decision Theory via Partial Markov Categories.

Completeness for Probabilistic Boolean Tapes Evidential Decision Theory via Partial Markov Categories

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.912038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 07bcbd53-2fcc-4789-8c1c-cc528be5308a · outbound

This paper cites Evidential Decision Theory via Partial Markov Categories.

Completeness for Probabilistic Boolean Tapes Evidential Decision Theory via Partial Markov Categories

Reference 14

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.006356Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 9018bf1c-9f43-4585-ba49-2210ce738cad · outbound

This paper cites Partial Markov categories.

Completeness for Probabilistic Boolean Tapes Partial Markov categories

Reference 15

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.000683Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 43c9a8f0-9856-42d3-824d-7773039d95d6 · outbound

This paper cites A categorical approach to open and interconnected dynamical systems.

Completeness for Probabilistic Boolean Tapes A categorical approach to open and interconnected dynamical systems

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d46d0f8-3b8c-4026-997d-ddfe728a2c3c · outbound

This paper cites String diagrams for regular logic (extended abstract).

Completeness for Probabilistic Boolean Tapes String diagrams for regular logic (extended abstract)

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b07119c2-ced8-4c7a-8a5d-f8d1244da5dd · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 18

Resolution: verified exact; doi, observed 2026-06-26T19:09:47.994429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation caad1fa9-bd76-4b72-b2ff-ea1786be12c6 · outbound

This paper cites Weakly Markov categories and weakly affine monads.

Completeness for Probabilistic Boolean Tapes Weakly Markov categories and weakly affine monads

Reference 19

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.906644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 6a3f7c40-6648-45e9-b4a1-016ae2a51963 · outbound

This paper cites De Finetti's Theorem in Categorical Probability.

Completeness for Probabilistic Boolean Tapes De Finetti's Theorem in Categorical Probability

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.905751Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 23206609-1989-4652-b199-1ec55cc47c5e · outbound

This paper cites doi:10.1109/FMCAD.2016.7886655 , url =.

Completeness for Probabilistic Boolean Tapes doi:10.1109/FMCAD.2016.7886655 , url =

Reference 21

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:47.995098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation cd7b52bd-7e02-464f-9514-f3a110899738 · outbound

This paper cites Bimonoidal Categories, $E_n$-Monoidal Categories, and Algebraic $K$-Theory.

Completeness for Probabilistic Boolean Tapes Bimonoidal Categories, $E_n$-Monoidal Categories, and Algebraic $K$-Theory

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-07-04T02:49:24.887530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 043a6af9-a33c-433c-96a0-06482c800a5e · outbound

This paper cites The geometry of tensor calculus, I.Advances in Mathematics, 88(1):55–112, July 1991.doi:10.1016/0001-8708(91)90003-P.

Completeness for Probabilistic Boolean Tapes The geometry of tensor calculus, I.Advances in Mathematics, 88(1):55–112, July 1991.doi:10.1016/0001-8708(91)90003-P

Reference 23

Resolution: verified exact; doi, observed 2026-06-26T19:09:48.013853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation eeda6282-0f93-482c-a460-db0391030060 · outbound

This paper cites [Law63] F.

Completeness for Probabilistic Boolean Tapes [Law63] F

Reference 24

Resolution: metadata mismatch; doi, observed 2026-06-26T19:09:48.011905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 35594e94-d5fd-44a6-89ee-23a4cb379fc7 · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 195a6428-2e21-472d-9b46-378bb4b17f28 · outbound

This paper cites In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp.

Completeness for Probabilistic Boolean Tapes In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp

Reference 26

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.017033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation cc98cee4-427d-456b-9c58-0291e164b5fe · outbound

This paper cites A complete axiomatisation of equivalence for discrete probabilistic programming.

Completeness for Probabilistic Boolean Tapes A complete axiomatisation of equivalence for discrete probabilistic programming

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d72634e1-3b64-46d8-b0b4-dc59e745c2ef · outbound

This paper cites A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming.

Completeness for Probabilistic Boolean Tapes A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming

Reference 28

Resolution: metadata mismatch; arxiv_id, observed 2026-07-04T02:49:24.902861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 2796fc35-b4c0-417e-8fac-a76df532b60a · outbound

This paper cites doi:10.1007/978-3-030-71995-1_24.

Completeness for Probabilistic Boolean Tapes doi:10.1007/978-3-030-71995-1_24

Reference 29

Resolution: verified exact; doi, observed 2026-06-26T19:09:48.019014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation ab469944-c782-4293-bf4f-4f584776b3b4 · outbound

This paper cites Thilikos, and Alexandre Vigny.

Completeness for Probabilistic Boolean Tapes Thilikos, and Alexandre Vigny

Reference 30

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T19:09:48.024875Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation a5e27819-d95e-4dca-90f5-49064ee0ef34 · outbound

This paper cites Selinger.

Completeness for Probabilistic Boolean Tapes Selinger

Reference 31

Resolution: verified exact; doi, observed 2026-06-26T19:09:47.996091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 151d3c55-2793-4530-b5cc-6a0a5607189d · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be2cf552-948e-4051-9f83-8632541b9939 · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c29985a0-b98a-4cd1-a7de-77901d24d08d · outbound

This paper cites an unresolved cited work.

Completeness for Probabilistic Boolean Tapes Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c0c0af4-6731-4790-9116-6c898b465fc5 · outbound

This paper cites The base case c = p is proved before the statement of the proposition.

Completeness for Probabilistic Boolean Tapes The base case c = p is proved before the statement of the proposition

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7f3cd61-351e-46fa-a806-c885d0bc171d · outbound

This paper cites Proof.It follows from (17), Theorem 17 and Proposition 10.◀ Proof of Lemma.

Completeness for Probabilistic Boolean Tapes Proof.It follows from (17), Theorem 17 and Proposition 10.◀ Proof of Lemma

Reference 36

Resolution: malformed identifier; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 934ab3a3-cbc9-4734-b0f8-43fd0cbc4d67 · outbound

This paper cites By Lemma 11, each partial Boolean circuit in DiagPB[A0,A m] is either a Boolean circuit in DiagB[1,A m] or it is of the form ⊥ m.

Completeness for Probabilistic Boolean Tapes By Lemma 11, each partial Boolean circuit in DiagPB[A0,A m] is either a Boolean circuit in DiagB[1,A m] or it is of the form ⊥ m

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-26T19:03:40.635333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation da3fb1b3-ff0a-4d9b-b36e-b6fc124b056c · inbound

Convex Biproducts, Stochastic Matrices and Tape Diagrams cites this paper.

Convex Biproducts, Stochastic Matrices and Tape Diagrams Completeness for Probabilistic Boolean Tapes

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-31T21:02:17.918796Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.