{"as_of":"2026-08-08T08:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:555337289c2aec5ab51e7a4a57ef752cbb5a25019ab568ddd2acf438b60a9fb6","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:53:55.368683Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.09816/citation-record","integrity":"/paper/2507.09816/integrity","json":"/paper/2507.09816/citation-record.json","paper":"/paper/2507.09816"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2409.15318","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:53:55.531746Z","title":"On the complexity of neural computation in superposition","venue":null,"work_id":"d143b3ad-2331-431a-bbb5-50fdf033a4bd","year":2024},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:53.489960Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:a76ef50e50ef31c81c900f8f0b86a28efcba8a6391e2432743cb124eac8f57fd","observation_id":"71a5c1d4-4148-4df5-9926-97b58c867f62","resolution":{"observed_at":"2026-08-06T17:53:55.580595Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:53:54.864366Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:54.864366Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:8094f5c765068d3bf934c8afcae403eb29f12b865c69166093277e6ae2bfef64","observation_id":"f7054cad-78f1-487e-9ed0-1e8c044c18d0","resolution":{"observed_at":"2026-08-06T17:53:54.864366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14926","last_updated":"2025-02-07T19:22:32Z","snapshot_observed_at":"2026-08-02T04:19:16.503331Z","submitted_at":"2025-01-24T21:31:12Z","title":"Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14926","snapshot_observed_at":"2026-08-06T17:53:54.937410Z","title":"Interpretability in parameter space: Minimizing mechanistic description length with attribution-based parameter decomposition, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:54.937410Z"},"links":{"cited_paper":"/paper/2501.14926","citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:e55fe1844e4e95ba2fca151a9d39a022ac4895ec6485360b3e4747bfdbb001cc","observation_id":"9ba45641-6e74-4ebd-b363-e38974e2b928","resolution":{"observed_at":"2026-08-06T17:53:54.937410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:16.707683Z","title":"Circuits in superposition: Compressing many small neural networks into one","venue":null,"work_id":"52279677-b030-4277-9c6a-7ed4d181db1f","year":2024},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.048927Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:3cb78b8db6f82983bde2a55069eaf34ad66083bdbf5f5868793a894a409375c3","observation_id":"fed9004d-08cb-43df-828b-602d9feb7eb8","resolution":{"observed_at":"2026-08-06T17:54:16.748512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08600","last_updated":"2023-10-04T13:17:38Z","snapshot_observed_at":"2026-07-06T16:19:05.495349Z","submitted_at":"2023-09-15T17:56:55Z","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08600","snapshot_observed_at":"2026-08-06T17:53:55.144214Z","title":"Sparse autoencoders find highly interpretable features in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.144214Z"},"links":{"cited_paper":"/paper/2309.08600","citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:ce0c5a59b5245c14281838f597c6fa698f959a35b4825c4b9c5b99385e62bbb6","observation_id":"4846ebef-888c-4a28-a56f-e011087f2e5c","resolution":{"observed_at":"2026-08-06T17:53:55.144214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.10652","last_updated":"2022-09-21T20:49:26Z","snapshot_observed_at":"2026-07-06T13:54:56.779166Z","submitted_at":"2022-09-21T20:49:26Z","title":"Toy Models of Superposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.10652","snapshot_observed_at":"2026-08-06T17:53:55.181554Z","title":"Toy models of superposition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.181554Z"},"links":{"cited_paper":"/paper/2209.10652","citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:2442f071b1882c5c6e98cca5bda76e132e23bd042336af56acef2b5aa17c0741","observation_id":"6817375b-02dd-4521-b3d6-5bbe2e2ef6e4","resolution":{"observed_at":"2026-08-06T17:53:55.181554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:53:55.911253Z","title":"Mathematical models of computation in superposition","venue":null,"work_id":"66fc69b3-64de-46da-aedd-a59811f0add2","year":2024},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.223258Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:f515400f517ec29421c0be34fdd67509219a5a1c6d03498e0365b8a1689a88cd","observation_id":"bfc455dc-8430-4117-92f7-3462ad8d8a86","resolution":{"observed_at":"2026-08-06T17:54:16.063554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:53:55.770397Z","title":"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","venue":null,"work_id":"62b3a0ca-499b-4fb0-aaee-0152e2db7a10","year":2024},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.275486Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:7367a0e079f81c75df499f933497e5cd86a8f3e76a60c987407d624588a63eb3","observation_id":"dc87625f-60a2-4776-ba15-1f8aac7c95fe","resolution":{"observed_at":"2026-08-06T17:53:55.863983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:53:55.330953Z","title":"The linear representation hypothesis and the geometry of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.330953Z"},"links":{"citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:da033622fb4b96da3921f016600acaa2f245a9981203fb5fe9215d6c1dfb4034","observation_id":"c7e36060-e167-4dd9-ba58-3fee1753fbbb","resolution":{"observed_at":"2026-08-06T17:53:55.330953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01892","last_updated":"2025-03-25T05:19:03Z","snapshot_observed_at":"2026-08-05T02:48:54.383847Z","submitted_at":"2022-10-04T20:28:43Z","title":"Polysemanticity and Capacity in Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01892","snapshot_observed_at":"2026-08-06T17:53:55.368683Z","title":"Polysemanticity and capacity in neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:55.368683Z"},"links":{"cited_paper":"/paper/2210.01892","citing_paper":"/paper/2507.09816"},"observation_digest":"sha256:e0de8f56897841b2fa05d3cace2b69c4da14bd5f404bbb78b2210e01d7240134","observation_id":"881f5796-2c70-4e7c-8395-272972d4f4c1","resolution":{"observed_at":"2026-08-06T17:53:55.368683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.09816","last_updated":"2025-07-13T22:18:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T17:44:24.451300Z","submitted_at":"2025-07-13T22:18:15Z","title":"Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}