Paper Citation Record · LEDGER

Algorithmic causal structure emerging through compression

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

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

pith.paper-citation-record.v1
2502.04210 v3

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T23:15:19.606376Z

measured 13 of 13 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

13 of 13 outbound references displayed

verified exact0
verified fuzzy10
unresolved2
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f1a5f3ce-4cf7-4a9e-938b-7040a43ab7ed · outbound

This paper cites an unresolved cited work.

Algorithmic causal structure emerging through compression Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-08T23:15:19.747383Z

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 5cce46ba-0dea-4ca6-a405-04132b813a16 · outbound

This paper cites reject” such that TM halts on “reject.

Algorithmic causal structure emerging through compression reject” such that TM halts on “reject

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.737078Z

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 7dc8f0cc-8c1e-4da2-ab6d-b00ab37d4f41 · outbound

This paper cites By Corollary 41, the negative log marginal likelihood − log P is the coding length of a certain Shannon code over (X d)∗.

Algorithmic causal structure emerging through compression By Corollary 41, the negative log marginal likelihood − log P is the coding length of a certain Shannon code over (X d)∗

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.657804Z

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 69a13538-b569-42f1-9f61-ea72c465293a · outbound

This paper cites These two symbols will be given the longest codewords, which will have equal length and differ only in the last digit.

Algorithmic causal structure emerging through compression These two symbols will be given the longest codewords, which will have equal length and differ only in the last digit

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.717987Z

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 b133da2b-3d8f-45e2-a9c8-e9e72a61e71e · outbound

This paper cites Output: a tree-structured codebook.

Algorithmic causal structure emerging through compression Output: a tree-structured codebook

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.707733Z

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 5e7bd332-d82f-41c9-914c-ee87d2b407dd · outbound

This paper cites set a universal set of FCMs.).

Algorithmic causal structure emerging through compression set a universal set of FCMs.)

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.677016Z

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 ae627bdd-14fd-4fe3-9ed9-28b1978d1dee · outbound

This paper cites an unresolved cited work.

Algorithmic causal structure emerging through compression Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-08T23:15:19.667731Z

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 8bdbfe12-c4b1-4bd2-baba-fa026ee6d41d · outbound

This paper cites codebook.

Algorithmic causal structure emerging through compression codebook

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.727460Z

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 d07bba18-9007-40f2-9223-396482aefec3 · outbound

This paper cites independent causal mechanism.

Algorithmic causal structure emerging through compression independent causal mechanism

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.698337Z

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 4b08d808-5e64-4b8a-83c2-48ff32d67db0 · outbound

This paper cites 41 WENDONG BUCHHOLZ SCH ¨OLKOPF • Our output of model selection is different from Principle 48.

Algorithmic causal structure emerging through compression 41 WENDONG BUCHHOLZ SCH ¨OLKOPF • Our output of model selection is different from Principle 48

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.688357Z

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 7df999d6-0b89-4066-8e23-531447d29035 · outbound

This paper cites In the general case we can construct UBCC depending on (m, d) by inputting ⟨m, ⟨d, ⟨p⟩⟩⟩ and simulating the codebook for each (m, d) respectively.

Algorithmic causal structure emerging through compression In the general case we can construct UBCC depending on (m, d) by inputting ⟨m, ⟨d, ⟨p⟩⟩⟩ and simulating the codebook for each (m, d) respectively

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.646591Z

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 63b76e3a-6507-4fe7-8758-a990653b79b1 · outbound

This paper cites • Appendix § H contains remarks on the Minimum Description Length (MDL) principle and Bayesian model selection, their difference and relation to our approach.

Algorithmic causal structure emerging through compression • Appendix § H contains remarks on the Minimum Description Length (MDL) principle and Bayesian model selection, their difference and relation to our approach

Reference 2010

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T23:15:19.757019Z

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 0cc13461-b8dc-4ce9-9a53-a0bffa77a2b3 · outbound

This paper cites A Theory for Emergence of Complex Skills in Language Models.

Algorithmic causal structure emerging through compression A Theory for Emergence of Complex Skills in Language Models

Reference 2023

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:15:19.560541Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.