{"as_of":"2026-08-06T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08ee94aa33b48ef548259d153af454e7016bf258bbeedd23d5082caf89eebd97","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T09:43:51.976205Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T22:12:50.908476Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.13868","last_updated":"2024-07-21T11:42:32Z","snapshot_observed_at":"2026-08-02T09:03:28.447459Z","submitted_at":"2024-05-22T17:50:04Z","title":"Automatically Identifying Local and Global Circuits with Linear Computation Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13868","snapshot_observed_at":"2026-08-03T09:43:51.976205Z","title":"Automatically identifying local and global circuits with linear computation graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.12879","last_updated":"2026-06-20T08:42:51Z","snapshot_observed_at":"2026-08-05T17:38:13.758328Z","submitted_at":"2026-01-19T09:34:10Z","title":"Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T09:43:51.976205Z"},"links":{"cited_paper":"/paper/2405.13868","citing_paper":"/paper/2601.12879"},"observation_digest":"sha256:0acccfe1a44f6fb152d55a45c7df33c02db95ce3a12e56f3c4104aec7ded6559","observation_id":"5654fa34-3495-42a0-9255-8f73d36c51b5","resolution":{"observed_at":"2026-08-03T09:43:51.976205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13868","last_updated":"2024-07-21T11:42:32Z","snapshot_observed_at":"2026-08-02T09:03:28.447459Z","submitted_at":"2024-05-22T17:50:04Z","title":"Automatically Identifying Local and Global Circuits with Linear Computation Graphs","version":2},"cited_work":{"arxiv_id":"2405.13868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13868","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.13868 , year=","venue":null,"work_id":"3029189a-5df8-4217-ae51-8c9dcf2a050c","year":2024},"citing_paper":{"arxiv_id":"2605.12207","last_updated":"2026-05-12T14:46:00Z","snapshot_observed_at":"2026-07-06T23:23:54.142937Z","submitted_at":"2026-05-12T14:46:00Z","title":"Not How Many, But Which: Parameter Placement in Low-Rank Adaptation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T06:13:55.497799Z"},"links":{"cited_paper":"/paper/2405.13868","citing_paper":"/paper/2605.12207"},"observation_digest":"sha256:a5fb33999c0268091811b7c6eef5b17f75ffa80d7fcb00db7803a50fc1ff6e81","observation_id":"9154bceb-b221-4115-a855-376a2453ddfb","resolution":{"observed_at":"2026-05-13T06:17:23.184070Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13868","last_updated":"2024-07-21T11:42:32Z","snapshot_observed_at":"2026-08-02T09:03:28.447459Z","submitted_at":"2024-05-22T17:50:04Z","title":"Automatically Identifying Local and Global Circuits with Linear Computation Graphs","version":2},"cited_work":{"arxiv_id":"2405.13868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13868","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.13868 , year=","venue":null,"work_id":"3029189a-5df8-4217-ae51-8c9dcf2a050c","year":2024},"citing_paper":{"arxiv_id":"2605.17704","last_updated":"2026-05-18T00:00:53Z","snapshot_observed_at":"2026-08-04T18:45:29.409331Z","submitted_at":"2026-05-18T00:00:53Z","title":"Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-19T22:09:53.796520Z"},"links":{"cited_paper":"/paper/2405.13868","citing_paper":"/paper/2605.17704"},"observation_digest":"sha256:835354efb974d19cfe661e5adbaa5cdaa7dcf453681b1f3c92323fbe46aadec9","observation_id":"c6454ff3-2567-497d-ac86-fcbc23f47603","resolution":{"observed_at":"2026-05-19T22:12:50.912477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13868","last_updated":"2024-07-21T11:42:32Z","snapshot_observed_at":"2026-08-02T09:03:28.447459Z","submitted_at":"2024-05-22T17:50:04Z","title":"Automatically Identifying Local and Global Circuits with Linear Computation Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13868","snapshot_observed_at":"2026-08-01T23:15:21.461651Z","title":"Auto- matically identifying local and global circuits with linear computation graphs.arXiv preprint arXiv:2405.13868, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15495","last_updated":"2026-07-16T22:54:30Z","snapshot_observed_at":"2026-08-02T21:55:43.700254Z","submitted_at":"2026-07-16T22:54:30Z","title":"Verbalizable Representations Form a Global Workspace in Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T23:15:21.461651Z"},"links":{"cited_paper":"/paper/2405.13868","citing_paper":"/paper/2607.15495"},"observation_digest":"sha256:63e8956ea66cb911b62444c0376c704eb492c73f302bfdc01489aab5fea57717","observation_id":"15905d18-feab-48cb-bb8c-1d6fa837c316","resolution":{"observed_at":"2026-08-01T23:15:21.461651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.13868/citation-record","integrity":"/paper/2405.13868/integrity","json":"/paper/2405.13868/citation-record.json","paper":"/paper/2405.13868"},"outbound":[],"paper":{"arxiv_id":"2405.13868","last_updated":"2024-07-21T11:42:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T09:03:28.447459Z","submitted_at":"2024-05-22T17:50:04Z","title":"Automatically Identifying Local and Global Circuits with Linear Computation Graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2405.13868."}