{"as_of":"2026-08-12T13:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20e8fef48645dac0ceff9eaba69c3f39afb258bd79074566ce88a692b156a1f6","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T01:27:56.855130Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2606.18383/citation-record","integrity":"/paper/2606.18383/integrity","json":"/paper/2606.18383/citation-record.json","paper":"/paper/2606.18383"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.05296","last_updated":"2018-11-26T19:31:00Z","snapshot_observed_at":"2026-08-01T23:11:41.726828Z","submitted_at":"2018-02-14T19:38:07Z","title":"Stronger generalization bounds for deep nets via a compression approach","version":4},"cited_work":{"arxiv_id":"1802.05296","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.05296","snapshot_observed_at":"2026-07-03T20:18:56.763722Z","title":"Stronger generalization bounds for deep nets via a compression approach","venue":"cs.LG","work_id":"d852187f-01c8-49b5-8731-a37313eae0a4","year":2018},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1802.05296","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:f7cb0f0628a389f3c9234dda92f456f7a4a3f4732fcb6fa876f8508264d32df5","observation_id":"89eeac66-55ea-4a5c-a881-22a886e1167a","resolution":{"observed_at":"2026-07-03T20:18:56.766065Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11641","last_updated":"2019-11-26T15:31:46Z","snapshot_observed_at":"2026-08-08T00:48:01.603669Z","submitted_at":"2019-11-26T15:31:46Z","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","version":1},"cited_work":{"arxiv_id":"1911.11641","doi":"10.48550/arxiv.1911.11641","metadata_source":"pith","pith_arxiv_id":"1911.11641","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","venue":"cs.CL","work_id":"0d865a62-6376-4606-8d3a-eeb3b6e9ba6d","year":2019},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1911.11641","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:8855b7fd6a7654d49c6718e58e8a06e98a90dc204912f75837753d3e325bcc7f","observation_id":"b3b37222-46dd-459d-966b-cc9f53167cb8","resolution":{"observed_at":"2026-07-03T20:18:56.761844Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(87)90114-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Information Processing Let- ters 24, 377–380","venue":"Information Processing Letters","work_id":"29e792eb-3817-40eb-ab27-a4a03aab6642","year":1987},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:5eb732aece07ed7fde6915988078dccfcb7b095ec9e0090488b13b03bc79503c","observation_id":"63153587-eed2-4108-9ade-f962d7f6d679","resolution":{"observed_at":"2026-06-27T01:30:20.471021Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06-27T01:27:56.855130Z","title":"Cunningham, H., Ewart, A., Riggs, L., Huben, R., and Sharkey, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:51b23662fe540c1a84af84bb89c3292d21a1e23cbf9128a4765d67971eadaa01","observation_id":"016c58c8-7493-4db0-b855-bfafed6d5424","resolution":{"observed_at":"2026-06-27T01:27:56.855130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08600","last_updated":"2023-10-04T13:17:38Z","snapshot_observed_at":"2026-08-11T07:21:14.568175Z","submitted_at":"2023-09-15T17:56:55Z","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","version":3},"cited_work":{"arxiv_id":"2309.08600","doi":"10.1145/1390156.1390191","metadata_source":"pith","pith_arxiv_id":"2309.08600","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","venue":"cs.LG","work_id":"51960d72-c69f-4db8-8efd-e90e8b4d9524","year":2023},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/2309.08600","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:560ce8f1f0816c070ec9af1d8a9baebc8bc28a35d103b6e7d4ddca7728fe6938","observation_id":"c273ea77-c7e6-4d28-a8dd-06b0ca044a85","resolution":{"observed_at":"2026-07-03T20:18:56.776980Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T22:49:19.66582+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T22:49:19.66582+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2209.10652","doi":"10.48550/arxiv.2209.10652","metadata_source":"pith","pith_arxiv_id":"2209.10652","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Toy Models of Superposition","venue":"cs.LG","work_id":"43875dbe-bc2d-4ab5-af63-744411533ff7","year":2022},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/2209.10652","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:17e616c7dde93bc34367c988f85d045154de4d19f291f9e17d336c36d9dc84ac","observation_id":"12e20681-664f-488e-bab0-08a5f8e6a0cc","resolution":{"observed_at":"2026-07-03T20:18:56.785092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:82776cc0647e1a9a4804d5c114a1ae0142db7f0faa56d67768d527688c9b3c59","observation_id":"f24754c5-fc76-489b-88db-d4dc9f5640d5","resolution":{"observed_at":"2026-07-03T20:18:56.781308Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04742","last_updated":"2021-10-17T20:04:09Z","snapshot_observed_at":"2026-07-06T07:32:46.883175Z","submitted_at":"2019-02-13T05:09:38Z","title":"Uniform convergence may be unable to explain generalization in deep learning","version":4},"cited_work":{"arxiv_id":"1902.04742","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.04742","snapshot_observed_at":"2026-07-04T05:39:41.017391Z","title":"arXiv preprint arXiv:1902.04742 , year =","venue":null,"work_id":"4efeb755-f45c-43f6-a6a6-41fb52b6d478","year":1902},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1902.04742","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:f93ec56a081b62c477e94d4bbb444e305a3203f3013f4f4370755a4510192dc4","observation_id":"59979a45-5c0e-41ff-815a-42c9a1485825","resolution":{"observed_at":"2026-07-03T20:18:56.775223Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0005-1098(78)90005-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"year =","venue":"Automatica","work_id":"7b2ad1fb-41f8-4020-b17c-2d075330815c","year":1978},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:856fd818391a5492fd53f264fc4df620643a789cdf547e0e391648ac58188f97","observation_id":"a61ff091-af2c-4660-86c4-fbeb22877652","resolution":{"observed_at":"2026-06-27T01:30:20.472795Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-12T22:20:34.058673+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T22:20:34.058673+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10641","last_updated":"2019-11-21T19:01:32Z","snapshot_observed_at":"2026-07-06T08:09:59.842324Z","submitted_at":"2019-07-24T18:11:59Z","title":"WinoGrande: An Adversarial Winograd Schema Challenge at Scale","version":2},"cited_work":{"arxiv_id":"1907.10641","doi":"10.48550/arxiv.1907.10641","metadata_source":"pith","pith_arxiv_id":"1907.10641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"WinoGrande: An Adversarial Winograd Schema Challenge at Scale","venue":"cs.CL","work_id":"9587a902-54ad-434e-9cbc-bdfe54b5d3bf","year":2019},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1907.10641","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:4816835207c10715e801071a40de387f546b746962ca234b3ec9b1bcd23f02ae","observation_id":"edcbd50a-56c8-4630-93d1-403290c8e64f","resolution":{"observed_at":"2026-07-03T20:18:56.780715Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":"2408.00118","doi":"10.48550/arxiv.2408.00118","metadata_source":"pith","pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","venue":"cs.CL","work_id":"4dd94e2f-2b27-4cbf-88a0-4910f0772a57","year":2024},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:50b0034c5a816c333b38c81e86d51aae543be9512601613b90cf316eb100874e","observation_id":"cd3f17b6-ca41-4e8f-904c-5d481a0fb1e6","resolution":{"observed_at":"2026-07-03T20:18:56.784873Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-01T04:38:46.183082+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T04:38:46.183082+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11667","last_updated":"2025-02-24T03:37:44Z","snapshot_observed_at":"2026-08-07T17:54:26.489901Z","submitted_at":"2025-02-24T03:37:44Z","title":"LogitLens4LLMs: Extending Logit Lens Analysis to Modern Large Language Models","version":1},"cited_work":{"arxiv_id":"2503.11667","doi":"10.48550/arxiv.2503.11667","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11667","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CoRR , volume =","venue":"arXiv (Cornell University)","work_id":"8ead94a1-1d7a-4334-ac36-fa780d18da10","year":2025},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/2503.11667","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:a570bbc1846a786798e587e33641cea32d4d976543eab6515a2f1f495593d378","observation_id":"5a6623b3-a7fa-4cfa-aafd-57709c3d4a37","resolution":{"observed_at":"2026-07-03T20:18:56.788813Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-08-10T16:18:23.994244Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":"1905.07830","doi":"10.48550/arxiv.1905.07830","metadata_source":"pith","pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","venue":"cs.CL","work_id":"79f44c0c-96f4-4edb-bc50-a3c9d6b85936","year":2019},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:c2d6997303306b19d034aed80f83ea38d10de9663e0c512ec70ee823d0578b74","observation_id":"469dadfe-9cfc-4d8e-8c6c-50b1da48d80e","resolution":{"observed_at":"2026-07-03T20:18:56.769655Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03530","last_updated":"2017-02-26T19:36:40Z","snapshot_observed_at":"2026-08-01T16:56:59.989486Z","submitted_at":"2016-11-10T22:02:36Z","title":"Understanding deep learning requires rethinking generalization","version":2},"cited_work":{"arxiv_id":"1611.03530","doi":"10.48550/arxiv.1611.03530","metadata_source":"pith","pith_arxiv_id":"1611.03530","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Understanding deep learning requires rethinking generalization","venue":"cs.LG","work_id":"b260f96a-16f6-4936-8f3b-440917a19b34","year":2016},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"cited_paper":"/paper/1611.03530","citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:d245efa1bc57fcd4915915d2c1f1e418705f9984d863e1e2f93a080699beb864","observation_id":"495947bf-f51c-4794-bd4f-7889bedf59e2","resolution":{"observed_at":"2026-07-03T20:18:56.764563Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:49:49.910618+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:49:49.910618+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-06-27T01:27:56.855130Z","title":"The layerwise sweeps in Section 5.2 and Appendix E use additional layer-specific checkpoints where needed","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:49bceb3443ed9ed391e7e45f79127621e413a66ff0edb484452ff368540ebcf9","observation_id":"08355557-7e21-45bc-b1c3-77ce3d9fc0e0","resolution":{"observed_at":"2026-06-27T01:27:56.855130Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T01:27:56.855130Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T01:27:56.855130Z"},"links":{"citing_paper":"/paper/2606.18383"},"observation_digest":"sha256:94ede5ef464e14ae1762dd501743ab8288abe832bffb97d9d5e16568d72e7b00","observation_id":"e71a5b84-83a1-4501-940e-1c384eb3c1cc","resolution":{"observed_at":"2026-06-27T01:27:56.855130Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.18383","last_updated":"2026-06-16T18:28:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T13:43:49.186788Z","submitted_at":"2026-06-16T18:28:23Z","title":"From Sparse Features to Trustworthy Proxies: Certifying SAE-Based Interpretability"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":1,"metadata_mismatch":9,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":16},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2606.18383."}