Paper Citation Record · LEDGER

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:cs/0004001.

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

pith.paper-citation-record.v1
cs/0004001 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 9 of 9 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 9 of 9 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:45:52.092385Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-05-15T19:00:15.644660Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 082ed1cb-5272-44cc-b06d-b5a6aa2b7367 · inbound

The Rise and Potential of Large Language Model Based Agents: A Survey cites this paper.

The Rise and Potential of Large Language Model Based Agents: A Survey A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 232

Resolution: verified exact; arxiv_id, observed 2026-05-11T10:47:49.338268Z

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 c64f43a0-39e9-435f-915a-0f2382059d6c · inbound

Formalizing Embeddedness Failures in Universal Artificial Intelligence cites this paper.

Formalizing Embeddedness Failures in Universal Artificial Intelligence A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T14:45:52.092385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a838de9e-6f97-4248-9d9e-d7faa197cb09 · inbound

THE-Tree: Can Tracing Historical Evolution Enhance Scientific Verification and Reasoning? cites this paper.

THE-Tree: Can Tracing Historical Evolution Enhance Scientific Verification and Reasoning? A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T22:24:47.739076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a7df01b-d2b0-4320-85c3-8e0df84644da · inbound

A Model-Free Universal AI cites this paper.

A Model-Free Universal AI A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-05-15T19:00:15.647958Z

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 c853a114-2db6-4059-9077-6db6a8ea58be · inbound

A Model-Free Universal AI cites this paper.

A Model-Free Universal AI A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 1997

Resolution: unresolved; no resolver link, observed 2026-08-02T20:38:23.518311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afd8b132-9c08-4cf4-9fb5-576f58907618 · inbound

Decidable By Construction: Design-Time Verification for Trustworthy AI cites this paper.

Decidable By Construction: Design-Time Verification for Trustworthy AI A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-05-15T00:48:25.060070Z

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 1c99ddb0-dfa4-4cc3-9867-da90d8df68e2 · inbound

Intervention Complexity as a Canonical Reward and a Measure of Intelligence cites this paper.

Intervention Complexity as a Canonical Reward and a Measure of Intelligence A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-11T16:26:10.210291Z

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 9cacd677-ef6a-4e6e-a552-3b4e540d6da9 · inbound

Self-Improvements in Modern Agentic Systems: A Survey cites this paper.

Self-Improvements in Modern Agentic Systems: A Survey A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 2000

Resolution: unresolved; no resolver link, observed 2026-08-02T06:35:58.177861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e8b22ede-1363-43b2-8727-9b54bca2fbba · inbound

DeComp2: Description Complexity aware Decomposition cites this paper.

DeComp2: Description Complexity aware Decomposition A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-31T23:24:26.386671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.