{"as_of":"2026-08-22T07:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea275183f276d44f0f0d0f86f12ec507d5d3201d631238494a0ce7e5b40517cb","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:12:57.956319Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2412.15750/citation-record","integrity":"/paper/2412.15750/integrity","json":"/paper/2412.15750/citation-record.json","paper":"/paper/2412.15750"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:12:58.261173Z","title":"Frantar, E.; and Alistarh, D","venue":null,"work_id":"93ac2ae6-da67-42a9-b655-9e190d4e76f2","year":2021},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.871916Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:219de77087841ec52d26b83e53da26df314f3b109955619c97344d74d48726df","observation_id":"ddad7123-beb5-4ad5-a409-fe0906be8c9a","resolution":{"observed_at":"2026-08-11T11:12:58.264660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17806","last_updated":"2024-07-15T12:07:09Z","snapshot_observed_at":"2026-08-19T11:55:59.157722Z","submitted_at":"2024-03-26T15:44:58Z","title":"Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanisms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17806","snapshot_observed_at":"2026-08-11T11:12:57.875562Z","title":"arXiv preprint arXiv:2403.17806","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.875562Z"},"links":{"cited_paper":"/paper/2403.17806","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:ea02a515874c57c4aec56666a5d01c21b61730f634037c49e1aed5c6fec78212","observation_id":"169fcbef-6b05-4749-acbf-4032fac2c4c6","resolution":{"observed_at":"2026-08-11T11:12:57.875562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10670","last_updated":"2022-12-20T22:11:35Z","snapshot_observed_at":"2026-08-19T21:03:06.819470Z","submitted_at":"2022-12-20T22:11:35Z","title":"In-context Learning Distillation: Transferring Few-shot Learning Ability of Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10670","snapshot_observed_at":"2026-08-11T11:12:57.883145Z","title":"CoRR, abs/2212.10670","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.883145Z"},"links":{"cited_paper":"/paper/2212.10670","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:34cd4903c06001a804a96d8711a0c719cfcc305ac5de2c3d0cc35fa0746b96e4","observation_id":"45df0b4a-33ca-4c9c-958a-3fa98f7bc5a5","resolution":{"observed_at":"2026-08-11T11:12:57.883145Z","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-11T11:12:58.250333Z","title":"In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 8046–8056","venue":null,"work_id":"c9b80641-5afd-4925-ada5-df6cd0836de3","year":2020},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.887908Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:88a6802148443415f4651c8f3ea6b86d8af3edef35c041024add72c9d79c41e1","observation_id":"60ec9166-0ce8-4f13-b9ff-68134fd3d618","resolution":{"observed_at":"2026-08-11T11:12:58.253991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-11T11:12:57.891817Z","title":"arXiv preprint arXiv:2001.08361","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.891817Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:2e7aeaa0914cdd2536d70bc1069a948b155af4e5cfa1fd86567eaec0478f0656","observation_id":"4651da23-7547-414d-8e37-7ec3e2c67bcf","resolution":{"observed_at":"2026-08-11T11:12:57.891817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17888","last_updated":"2023-05-29T05:22:11Z","snapshot_observed_at":"2026-08-21T22:58:47.983191Z","submitted_at":"2023-05-29T05:22:11Z","title":"LLM-QAT: Data-Free Quantization Aware Training for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.17888","snapshot_observed_at":"2026-08-11T11:12:57.899535Z","title":"arXiv preprint arXiv:2305.17888","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.899535Z"},"links":{"cited_paper":"/paper/2305.17888","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:07a42b8a6bc89b4a61dd4a08c0d1dbd8b4415055e407228278e323bd1482c3aa","observation_id":"3ac5574f-07ba-4730-b1b8-de3cf0bf1b3c","resolution":{"observed_at":"2026-08-11T11:12:57.899535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15771","last_updated":"2023-07-28T19:13:26Z","snapshot_observed_at":"2026-08-16T15:12:24.353640Z","submitted_at":"2023-07-28T19:13:26Z","title":"The Hydra Effect: Emergent Self-repair in Language Model Computations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15771","snapshot_observed_at":"2026-08-11T11:12:57.903041Z","title":"arXiv preprint arXiv:2307.15771","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.903041Z"},"links":{"cited_paper":"/paper/2307.15771","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:06cd28bd9bcdc6e842c74b595f15d0a44b3e3e1e41e0b3bf7fd5dfb2aa0f6beb","observation_id":"3ab1cce8-5160-4710-b4e9-d7e339452e26","resolution":{"observed_at":"2026-08-11T11:12:57.903041Z","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-11T11:12:58.238060Z","title":"Advances in Neural Information Processing Systems, NeurIPS 2022 , 35: 17359–17372","venue":null,"work_id":"0423d862-683b-46d0-9832-2c77d45a23d1","year":2022},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.906974Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:ceb5e61ca749c7c4d101ebc118754ed8dc739b4fbbbbd466d8d9aee4aeb07424","observation_id":"72e91eb0-6257-4452-906c-18a85d60044c","resolution":{"observed_at":"2026-08-11T11:12:58.242297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T11:12:58.225319Z","title":"Https://transformer-circuits.pub/2022/in-context- learning-and-induction-heads/index.html","venue":null,"work_id":"57a03288-355f-4ec4-87de-2d68d92e2fae","year":2022},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.910929Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:d038ca5f27d3bf9c5f94f9f590ac28fd3b6a3d10e068bc8fb2ddd1ddc7d86e26","observation_id":"b6e721a2-b73f-46c6-ab9e-eeb311cc3ebc","resolution":{"observed_at":"2026-08-11T11:12:58.229590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09557","last_updated":"2024-04-01T06:09:41Z","snapshot_observed_at":"2026-08-16T16:51:52.635088Z","submitted_at":"2022-06-20T03:48:17Z","title":"LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09557","snapshot_observed_at":"2026-08-11T11:12:57.915322Z","title":"arXiv preprint arXiv:2206.09557","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.915322Z"},"links":{"cited_paper":"/paper/2206.09557","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:15a0dfef9854da056602afd384d0dcb4a4ec3ed9f5b6145a7f7eda9f7af80793","observation_id":"d55f039c-770e-4a77-89ff-9c17ddc0b075","resolution":{"observed_at":"2026-08-11T11:12:57.915322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03773","last_updated":"2023-02-07T22:05:55Z","snapshot_observed_at":"2026-08-20T19:41:37.979624Z","submitted_at":"2023-02-07T22:05:55Z","title":"What Matters In The Structured Pruning of Generative Language Models?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.03773","snapshot_observed_at":"2026-08-11T11:12:57.923654Z","title":"Shridhar, K.; Stolfo, A.; and Sachan, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.923654Z"},"links":{"cited_paper":"/paper/2302.03773","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:0e8fc0bb21cf84f9258ccda9075678e26071e72890c268a430a40f43a49f19e1","observation_id":"09b759b7-c049-45ed-b124-21e351c3c0c9","resolution":{"observed_at":"2026-08-11T11:12:57.923654Z","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-11T11:12:58.201201Z","title":"In Rogers, A.; Boyd-Graber, J.; and Okazaki, N., eds., Find- ings of the Association for Computational Linguistics: ACL 2023, 7059–7073","venue":null,"work_id":"a2223858-eb7d-4b48-be8c-9482d4470994","year":2023},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.928649Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:c4ca695da5b8e9e40d2aac27260ac4242c34dc5e35974f224df3cc90bdd1d74d","observation_id":"c7483f48-7b7c-400d-adac-bd1bc89fa158","resolution":{"observed_at":"2026-08-11T11:12:58.205408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-08-20T04:15:03.506960Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-11T11:12:57.932676Z","title":"arXiv preprint arXiv:2306.11695","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.932676Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:70c73e99e9a7cceb376b9c53db5ed0728067cad037e956508cee721d7467dbd8","observation_id":"70a7926c-4bda-4bdc-9b7c-f379e1663fdb","resolution":{"observed_at":"2026-08-11T11:12:57.932676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08239","last_updated":"2022-02-10T16:30:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-01-20T15:44:37Z","title":"LaMDA: Language Models for Dialog Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.08239","snapshot_observed_at":"2026-08-11T11:12:57.940954Z","title":"arXiv preprint arXiv:2201.08239","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.940954Z"},"links":{"cited_paper":"/paper/2201.08239","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:526a8c990ce2b1c13394b61783459b2196d9ece9294a0caf8058d48fbb9cdfee","observation_id":"5471bffd-e177-4bf7-bffa-59f1c0a4fbe2","resolution":{"observed_at":"2026-08-11T11:12:57.940954Z","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-11T11:12:58.175868Z","title":"In Proceedings of the 2020 Confer- ence on Empirical Methods in Natural Language Process- ing: System Demonstrations, 38–45","venue":null,"work_id":"443446ec-51ac-4131-8959-4a4c312d7d6f","year":2020},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.949315Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:d8456ee166fedd28d436368dcd94c8ed2a0b5c743546b27f403d0e86371ee776","observation_id":"1feb37e5-379d-44d0-b937-ca86ba6afdbc","resolution":{"observed_at":"2026-08-11T11:12:58.180697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-19T11:10:11.043461Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-11T11:12:57.952950Z","title":"arXiv preprint arXiv:2305.18403","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.952950Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:c103719e570e708c3c0ac9c6ba6bbdf6b3317a698b192c08d364369f988ecd4a","observation_id":"86e9b979-4933-4fda-8396-03b73a1673aa","resolution":{"observed_at":"2026-08-11T11:12:57.952950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07633","last_updated":"2024-07-30T13:14:55Z","snapshot_observed_at":"2026-08-21T13:56:58.738793Z","submitted_at":"2023-08-15T08:31:05Z","title":"A Survey on Model Compression for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07633","snapshot_observed_at":"2026-08-11T11:12:57.956319Z","title":"The Chief Executive Officer (CEO","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.956319Z"},"links":{"cited_paper":"/paper/2308.07633","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:8c8cb183558db6100ebf272b3120c0bc1b4b9c449c4387985d3c37c991030584","observation_id":"1587f2f9-a5d6-4e24-9ea5-e37b9dc581d4","resolution":{"observed_at":"2026-08-11T11:12:57.956319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T11:12:57.895877Z","title":"arXiv preprint arXiv:1412.6980","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.895877Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:3beedd32a7f856f9479406b99310fe307a0ba771333583b4ad7f27f7f5f3d60a","observation_id":"684f48ae-0f98-47cc-bc33-1835c2e87470","resolution":{"observed_at":"2026-08-11T11:12:57.895877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-08-16T18:00:58.008096Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-11T11:12:57.879496Z","title":"CoRR, abs/1503.02531","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.879496Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:3e2bfd96ef33749807779f29e2230773a8b7c48036ff1a757b7cb4aed34d4341","observation_id":"87063ed9-9559-4f93-9fa7-a1577da29aa9","resolution":{"observed_at":"2026-08-11T11:12:57.879496Z","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-11T11:12:58.189195Z","title":null,"venue":null,"work_id":"32811e4e-8b06-4118-a7de-c77741090834","year":2017},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.945435Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:b68f0215f079b56840a4bf289d5641a1b8d8abf9c84ec0813ba29e2f44717d29","observation_id":"3d5e3cc3-a973-4bc7-acf8-76a7662710b9","resolution":{"observed_at":"2026-08-11T11:12:58.193208Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T11:12:58.213434Z","title":null,"venue":null,"work_id":"15457e6c-6e01-40c8-b09f-fba4d0551a4a","year":2018},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.919349Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:5549e8bb44519df72ec9a8a27e460a2b2958071a1454a740b3b308ee0b13aa9f","observation_id":"fe72f192-da06-46d1-bef3-e84268b28754","resolution":{"observed_at":"2026-08-11T11:12:58.217338Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12136","last_updated":"2019-03-28T17:23:50Z","snapshot_observed_at":"2026-08-14T16:55:13.315157Z","submitted_at":"2019-03-28T17:23:50Z","title":"Distilling Task-Specific Knowledge from BERT into Simple Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.12136","snapshot_observed_at":"2026-08-11T11:12:57.936739Z","title":"arXiv preprint arXiv:1903.12136","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.936739Z"},"links":{"cited_paper":"/paper/1903.12136","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:b8930d5b9d69f5bc7b7c7c1299ffe858af7058b8eb9ad2666d436edd78dc8138","observation_id":"623c61a6-7a4c-4037-95d7-babf3dc0cf0d","resolution":{"observed_at":"2026-08-11T11:12:57.936739Z","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-11T11:12:58.271479Z","title":"Ad- vances in Neural Information Processing Systems, NeurIPS 2020, 33: 1877–1901","venue":null,"work_id":"05624db4-0009-42a5-81c5-0e21a074949b","year":2020},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.864079Z"},"links":{"citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:dc7394e5fae2189d49859254fb76b6d386ebfb6b609a787b62faa8f38ca33348","observation_id":"bc1a2462-150c-45b5-b790-efb8293bb271","resolution":{"observed_at":"2026-08-11T11:12:58.275830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-08-22T06:24:21.120481Z","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-11T11:12:57.868130Z","title":"arXiv preprint arXiv:2209.10652","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.868130Z"},"links":{"cited_paper":"/paper/2209.10652","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:f7cd27c9c0a27744ebbcab802289cb8f2c1a0d4ff95593bba600a4292ee5cfb7","observation_id":"224feb25-e902-4a3b-9169-ff53d94157e8","resolution":{"observed_at":"2026-08-11T11:12:57.868130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-11T11:12:57.854841Z","title":"arXiv preprint arXiv:2303.08774","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.854841Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:e8ea87ec2cdd25a58e2d1b242ac39ce3122e5f137840e0484699cde297324ee8","observation_id":"c994f6d3-a967-47ea-82b0-c7969aa1c62c","resolution":{"observed_at":"2026-08-11T11:12:57.854841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16778","last_updated":"2025-04-02T15:50:36Z","snapshot_observed_at":"2026-08-21T14:42:38.328805Z","submitted_at":"2024-06-24T16:40:54Z","title":"Finding Transformer Circuits with Edge Pruning","version":3},"cited_work":{"arxiv_id":"2406.16778","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.16778","snapshot_observed_at":"2026-08-11T11:12:58.150318Z","title":"Finding Transformer Circuits with Edge Pruning","venue":"cs.CL","work_id":"262d9b2b-e210-4358-9b01-36c077d4c668","year":2024},"citing_paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:57.859721Z"},"links":{"cited_paper":"/paper/2406.16778","citing_paper":"/paper/2412.15750"},"observation_digest":"sha256:55f964ef56e502c8fc0f8898870f64fc5e7244eab1cc4a03be86eedf9bb304fa","observation_id":"0e75e75f-8280-42d0-af80-4d9fcdd79c3e","resolution":{"observed_at":"2026-08-11T11:12:58.155851Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.15750","last_updated":"2024-12-20T10:11:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T08:35:07.340488Z","submitted_at":"2024-12-20T10:11:44Z","title":"Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":26},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2412.15750."}