Paper Citation Record · LEDGER

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem

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

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

pith.paper-citation-record.v1
2507.09816 v1

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:53:55.368683Z

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

10 of 10 outbound references displayed

verified exact1
verified fuzzy3
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 71a5c1d4-4148-4df5-9926-97b58c867f62 · outbound

This paper cites On the complexity of neural computation in superposition.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem On the complexity of neural computation in superposition

Reference 1

Resolution: verified exact; doi, observed 2026-08-06T17:53:55.580595Z

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 f7054cad-78f1-487e-9ed0-1e8c044c18d0 · outbound

This paper cites an unresolved cited work.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:54.864366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ba45641-6e74-4ebd-b363-e38974e2b928 · outbound

This paper cites Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:54.937410Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fed9004d-08cb-43df-828b-602d9feb7eb8 · outbound

This paper cites Circuits in superposition: Compressing many small neural networks into one.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Circuits in superposition: Compressing many small neural networks into one

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:54:16.748512Z

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 4846ebef-888c-4a28-a56f-e011087f2e5c · outbound

This paper cites Sparse Autoencoders Find Highly Interpretable Features in Language Models.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Sparse Autoencoders Find Highly Interpretable Features in Language Models

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:55.144214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6817375b-02dd-4521-b3d6-5bbe2e2ef6e4 · outbound

This paper cites Toy Models of Superposition.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Toy Models of Superposition

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:55.181554Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bfc455dc-8430-4117-92f7-3462ad8d8a86 · outbound

This paper cites Mathematical models of computation in superposition.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Mathematical models of computation in superposition

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:54:16.063554Z

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 dc87625f-60a2-4776-ba15-1f8aac7c95fe · outbound

This paper cites What’s up with llms representing xors of arbitrary features? https://www.lesswrong.com/posts/hjJXCn9GsskysDceS/what-s-up-with-llms-representing-xors-of-arbitrary-features, 2024.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem What’s up with llms representing xors of arbitrary features? https://www.lesswrong.com/posts/hjJXCn9GsskysDceS/what-s-up-with-llms-representing-xors-of-arbitrary-features, 2024

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:53:55.863983Z

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 c7e36060-e167-4dd9-ba58-3fee1753fbbb · outbound

This paper cites The linear representation hypothesis and the geometry of large language models.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem The linear representation hypothesis and the geometry of large language models

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:55.330953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 881f5796-2c70-4e7c-8395-272972d4f4c1 · outbound

This paper cites Polysemanticity and Capacity in Neural Networks.

Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Polysemanticity and Capacity in Neural Networks

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T17:53:55.368683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.