Paper Citation Record · LEDGER

Algebras for Deterministic Computation Are Inherently Incomplete

As of 13 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2411.14284.

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

pith.paper-citation-record.v1
2411.14284 v2

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:37:37.903504Z

measured 30 of 30 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

30 of 30 outbound references displayed

verified exact7
verified fuzzy0
unresolved16
parse uncertain0
malformed identifier4
metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b1dbee64-aebd-44e2-ba2e-cc5ee57248ec · outbound

This paper cites KAT + B!.

Algebras for Deterministic Computation Are Inherently Incomplete KAT + B!

Reference 14

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T15:37:38.410429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fd09d4ed-9556-4800-9769-c4292cf6f2e5 · outbound

This paper cites A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests.

Algebras for Deterministic Computation Are Inherently Incomplete A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.834525Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fca41944-076c-4e95-af98-d9526fb9ea2e · outbound

This paper cites Kleene Algebra with Tests: Completeness and Decidability.

Algebras for Deterministic Computation Are Inherently Incomplete Kleene Algebra with Tests: Completeness and Decidability

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.861919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1336cc80-eb91-431c-b4c0-6328ec519d21 · outbound

This paper cites The Böhm-Jacopini Theorem Is False, Propositionally.

Algebras for Deterministic Computation Are Inherently Incomplete The Böhm-Jacopini Theorem Is False, Propositionally

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.866185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 666510ae-5e23-4d1a-b012-5be625f87a27 · outbound

This paper cites an unresolved cited work.

Algebras for Deterministic Computation Are Inherently Incomplete Unresolved cited work

Reference 24

Resolution: verified exact; doi, observed 2026-08-12T15:37:37.972625Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0c16c771-e974-470a-8322-c331a9a96397 · outbound

This paper cites On the Capabilities of While, Repeat, and Exit Statements.

Algebras for Deterministic Computation Are Inherently Incomplete On the Capabilities of While, Repeat, and Exit Statements

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.878953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a0651dd-7e13-4599-91a7-4f3cbe82a18e · outbound

This paper cites Kleene Algebra with Dynamic Tests: Completeness and Complexity.

Algebras for Deterministic Computation Are Inherently Incomplete Kleene Algebra with Dynamic Tests: Completeness and Complexity

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.894058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 897ffc2e-2c7a-4d7a-a9ff-268c4ca2ffe3 · outbound

This paper cites an unresolved cited work.

Algebras for Deterministic Computation Are Inherently Incomplete Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.903504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7eafae7e-acea-4ca4-b225-2d86d079a4d5 · outbound

This paper cites Derivatives of Regular Expressions.

Algebras for Deterministic Computation Are Inherently Incomplete Derivatives of Regular Expressions

Reference 1964

Resolution: malformed identifier; doi_truncated, observed 2026-08-12T15:37:38.112208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6cdb1443-d35b-4e69-bddc-644e254e6304 · outbound

This paper cites Flow diagrams, turing machines and languages with only two formation rules.

Algebras for Deterministic Computation Are Inherently Incomplete Flow diagrams, turing machines and languages with only two formation rules

Reference 1966

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T15:37:38.762516Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4efe190d-2fcc-48ac-bece-e51f129e6d6a · outbound

This paper cites Notes on Avoiding.

Algebras for Deterministic Computation Are Inherently Incomplete Notes on Avoiding

Reference 1971

Resolution: verified exact; doi, observed 2026-08-12T15:37:38.049014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 65a9427a-16a2-412b-8f63-191274cf84b2 · outbound

This paper cites Program Schemes, Recursion Schemes, and Formal Languages.

Algebras for Deterministic Computation Are Inherently Incomplete Program Schemes, Recursion Schemes, and Formal Languages

Reference 1973

Resolution: verified exact; doi, observed 2026-08-12T15:37:38.073067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2a6e0835-739d-444a-ba62-275b2c916e4f · outbound

This paper cites Analysis of Structured Programs.

Algebras for Deterministic Computation Are Inherently Incomplete Analysis of Structured Programs

Reference 1974

Resolution: malformed identifier; doi_truncated, observed 2026-08-12T15:37:38.035037Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fc01bcc9-4177-4a81-a92e-921d819a7950 · outbound

This paper cites Propositional Dynamic Logic of Regular Programs.

Algebras for Deterministic Computation Are Inherently Incomplete Propositional Dynamic Logic of Regular Programs

Reference 1979

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.811346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 860cd2c5-3930-4d18-bea8-0a0a8668922f · outbound

This paper cites A Complete Inference System for a Class of Regular Behaviours.

Algebras for Deterministic Computation Are Inherently Incomplete A Complete Inference System for a Class of Regular Behaviours

Reference 1984

Resolution: verified exact; doi, observed 2026-08-12T15:37:37.987902Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b0231f99-252a-4811-b5b0-764600c46cb0 · outbound

This paper cites Taming Control Flow: A Structured Approach to Eliminating Goto Statements.

Algebras for Deterministic Computation Are Inherently Incomplete Taming Control Flow: A Structured Approach to Eliminating Goto Statements

Reference 1994

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T15:37:38.616071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 30dbb699-9958-43d0-87f3-a373ed430765 · outbound

This paper cites Partial Derivatives of Regular Expressions and Finite Automaton Constructions.

Algebras for Deterministic Computation Are Inherently Incomplete Partial Derivatives of Regular Expressions and Finite Automaton Constructions

Reference 1996

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.776469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b8567c1-6182-4c18-ae1b-8d40020f3fee · outbound

This paper cites Kleene Algebra with Tests.

Algebras for Deterministic Computation Are Inherently Incomplete Kleene Algebra with Tests

Reference 1997

Resolution: malformed identifier; no resolver link, observed 2026-08-12T15:37:37.848374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2f85ad8-57a0-43c8-ac9c-27c18786e878 · outbound

This paper cites Certification of Compiler Optimizations Using Kleene Algebra with Tests.

Algebras for Deterministic Computation Are Inherently Incomplete Certification of Compiler Optimizations Using Kleene Algebra with Tests

Reference 2000

Resolution: verified exact; doi, observed 2026-08-12T15:37:38.020849Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b11fd932-c4fd-437e-8f5a-26656ea14a9a · outbound

This paper cites an unresolved cited work.

Algebras for Deterministic Computation Are Inherently Incomplete Unresolved cited work

Reference 2001

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:37:38.869813Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d6a23b96-092f-4e45-a5b7-bde45e446d1b · outbound

This paper cites A coalgebraic approach to Kleene algebra with tests.

Algebras for Deterministic Computation Are Inherently Incomplete A coalgebraic approach to Kleene algebra with tests

Reference 2004

Resolution: verified exact; doi, observed 2026-08-12T15:37:38.097841Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2a53a394-ef82-40b8-a1f1-3cfc7b66f239 · outbound

This paper cites Kleene algebra with domain.

Algebras for Deterministic Computation Are Inherently Incomplete Kleene algebra with domain

Reference 2006

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.801936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2596787-0339-4169-976f-3c735a793011 · outbound

This paper cites Nonlocal Flow of Control and Kleene Algebra with Tests.

Algebras for Deterministic Computation Are Inherently Incomplete Nonlocal Flow of Control and Kleene Algebra with Tests

Reference 2008

Resolution: malformed identifier; raw_fallback, observed 2026-08-12T15:37:38.855221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 634dd94f-7533-4faf-8a70-90b0975fa0ad · outbound

This paper cites NetKAT: semantic foundations for networks.

Algebras for Deterministic Computation Are Inherently Incomplete NetKAT: semantic foundations for networks

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.766851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61b55d64-42a4-4bec-a41c-d679a3192e35 · outbound

This paper cites Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests.

Algebras for Deterministic Computation Are Inherently Incomplete Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

Reference 2015

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.884005Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87d94f00-add0-40e0-b107-8a2338cde463 · outbound

This paper cites A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilar- ity.

Algebras for Deterministic Computation Are Inherently Incomplete A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilar- ity

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.825551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b66d9f5-c9f3-43c7-84b3-13862605366a · outbound

This paper cites Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.

Algebras for Deterministic Computation Are Inherently Incomplete Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.888247Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30b05f63-55cc-4362-86de-3d70556e47b8 · outbound

This paper cites Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete.

Algebras for Deterministic Computation Are Inherently Incomplete Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.821211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd87589b-12e6-48a7-abb8-d57b4a882007 · outbound

This paper cites Preservation theorems for Tarski's relation algebra.

Algebras for Deterministic Computation Are Inherently Incomplete Preservation theorems for Tarski's relation algebra

Reference 2023

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:37:38.133245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 74b4d3d1-2c39-4725-a62d-0bacdf87da9d · outbound

This paper cites CF-GKAT: Efficient Validation of Control-Flow Transformations.

Algebras for Deterministic Computation Are Inherently Incomplete CF-GKAT: Efficient Validation of Control-Flow Transformations

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-12T15:37:37.899189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.