Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:53:55.368683Z
Paper Citation Record · LEDGER
As of 8 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.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:53:55.368683Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
10 of 10 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 71a5c1d4-4148-4df5-9926-97b58c867f62 · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem On the complexity of neural computation in superposition
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f7054cad-78f1-487e-9ed0-1e8c044c18d0 · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Unresolved cited work
Reference 2
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9ba45641-6e74-4ebd-b363-e38974e2b928 · outbound
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
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fed9004d-08cb-43df-828b-602d9feb7eb8 · outbound
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
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4846ebef-888c-4a28-a56f-e011087f2e5c · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Sparse Autoencoders Find Highly Interpretable Features in Language Models
Reference 5
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6817375b-02dd-4521-b3d6-5bbe2e2ef6e4 · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Toy Models of Superposition
Reference 6
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bfc455dc-8430-4117-92f7-3462ad8d8a86 · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Mathematical models of computation in superposition
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation dc87625f-60a2-4776-ba15-1f8aac7c95fe · outbound
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
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c7e36060-e167-4dd9-ba58-3fee1753fbbb · outbound
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
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 881f5796-2c70-4e7c-8395-272972d4f4c1 · outbound
Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem Polysemanticity and Capacity in Neural Networks
Reference 10
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
No inbound Pith citation observations are available.