Pith. sign in

Paper Citation Record · LEDGER

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference

As of 12 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2412.15750.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.15750 v1

Coverage vector

measured 26 of 26 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T11:12:57.956319Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

26 of 26 outbound references displayed

  • verified exact1
  • verified fuzzy7
  • unresolved18
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ddad7123-beb5-4ad5-a409-fe0906be8c9a · outbound

This paper cites Frantar, E.; and Alistarh, D.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Frantar, E.; and Alistarh, D

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.264660Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.871916Z digest=sha256:5abc3e390cec01242d99cd6843c52f4b3696eae16cf8b413da0372f005577f2a

Observation 169fcbef-6b05-4749-acbf-4032fac2c4c6 · outbound

This paper cites Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanisms.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanisms

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.875562Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.875562Z digest=sha256:c2cc0e5c71217558d95cb265a0a5509dc3c117cfca765a1632ae9fd5c991b6e5

Observation 45df0b4a-33ca-4c9c-958a-3fa98f7bc5a5 · outbound

This paper cites In-context Learning Distillation: Transferring Few-shot Learning Ability of Pre-trained Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference In-context Learning Distillation: Transferring Few-shot Learning Ability of Pre-trained Language Models

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.883145Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.883145Z digest=sha256:7b7a2e8e5f5be058c27476751a067c1d121519fccbcad6f2708f65435500b74c

Observation 60ec9166-0ce8-4f13-b9ff-68134fd3d618 · outbound

This paper cites In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 8046–8056.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 8046–8056

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.253991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.887908Z digest=sha256:29db14e8725fd9b60e70279829f03dc773b654ebb2d1e5587386d8c4e40124aa

Observation 4651da23-7547-414d-8e37-7ec3e2c67bcf · outbound

This paper cites Scaling Laws for Neural Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Scaling Laws for Neural Language Models

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.891817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.891817Z digest=sha256:2ed6ef4afa1e1f2d321427e92aa597623c9f55a81ef1735a92c19aa4d60b7554

Observation 3ac5574f-07ba-4730-b1b8-de3cf0bf1b3c · outbound

This paper cites LLM-QAT: Data-Free Quantization Aware Training for Large Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference LLM-QAT: Data-Free Quantization Aware Training for Large Language Models

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.899535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.899535Z digest=sha256:4abf1e404f6a87929415b7ab06e94026fa1b09db5320cc2fd519ba59e2beccbb

Observation 3ab1cce8-5160-4710-b4e9-d7e339452e26 · outbound

This paper cites The Hydra Effect: Emergent Self-repair in Language Model Computations.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference The Hydra Effect: Emergent Self-repair in Language Model Computations

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.903041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.903041Z digest=sha256:7194ae66a24e7331c36386a8f355a6edd730937947e76d8d74acf6ac982b2d7a

Observation 72e91eb0-6257-4452-906c-18a85d60044c · outbound

This paper cites Advances in Neural Information Processing Systems, NeurIPS 2022 , 35: 17359–17372.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Advances in Neural Information Processing Systems, NeurIPS 2022 , 35: 17359–17372

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.242297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.906974Z digest=sha256:9ad3f64dff80d5dae1c2d2075e1ad4601716bbbc5fe37016b84bf3823ac2ad91

Observation b6e721a2-b73f-46c6-ab9e-eeb311cc3ebc · outbound

This paper cites Https://transformer-circuits.pub/2022/in-context- learning-and-induction-heads/index.html.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Https://transformer-circuits.pub/2022/in-context- learning-and-induction-heads/index.html

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.229590Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.910929Z digest=sha256:6499a98366f798b0f3140ce144219f75e128d4c71227910831e128dcd06c6ed7

Observation d55f039c-770e-4a77-89ff-9c17ddc0b075 · outbound

This paper cites LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.915322Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.915322Z digest=sha256:f4fb4734a33c0dd68b7f71b3a9335c2610fc5fcbf142a2977bd568911e27e415

Observation 09b759b7-c049-45ed-b124-21e351c3c0c9 · outbound

This paper cites What Matters In The Structured Pruning of Generative Language Models?.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference What Matters In The Structured Pruning of Generative Language Models?

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.923654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.923654Z digest=sha256:fe67a36d7960323274ac264f205b949438e5442b02983b546f6287716caad031

Observation c7483f48-7b7c-400d-adac-bd1bc89fa158 · outbound

This paper cites In Rogers, A.; Boyd-Graber, J.; and Okazaki, N., eds., Find- ings of the Association for Computational Linguistics: ACL 2023, 7059–7073.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference In Rogers, A.; Boyd-Graber, J.; and Okazaki, N., eds., Find- ings of the Association for Computational Linguistics: ACL 2023, 7059–7073

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.205408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.928649Z digest=sha256:5fddda72c12487994df9fa3af29b710e626e9ff56fa45057e57993de1a1c4b4b

Observation 70a7926c-4bda-4bdc-9b7c-f379e1663fdb · outbound

This paper cites A Simple and Effective Pruning Approach for Large Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference A Simple and Effective Pruning Approach for Large Language Models

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.932676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.932676Z digest=sha256:0a47250d5a5555e5505eb5e0b36996aaff40c173b763ac606c108cf7e7a3c99b

Observation 5471bffd-e177-4bf7-bffa-59f1c0a4fbe2 · outbound

This paper cites LaMDA: Language Models for Dialog Applications.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference LaMDA: Language Models for Dialog Applications

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.940954Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.940954Z digest=sha256:5e502a8ad387b9a66d2129f2f2a0984cd7f14602a33897426ac6a6d4cb20e2f8

Observation 1feb37e5-379d-44d0-b937-ca86ba6afdbc · outbound

This paper cites In Proceedings of the 2020 Confer- ence on Empirical Methods in Natural Language Process- ing: System Demonstrations, 38–45.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference In Proceedings of the 2020 Confer- ence on Empirical Methods in Natural Language Process- ing: System Demonstrations, 38–45

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.180697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.949315Z digest=sha256:8a4074b8c6f71b3edec2a7a73fd8bfb8064550c747b1bd89307ad9987fd82f83

Observation 86e9b979-4933-4fda-8396-03b73a1673aa · outbound

This paper cites LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.952950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.952950Z digest=sha256:321a35b1927dfaec986d4d4579bbad70bb0ed7c22e01d37d8449a99830d847d3

Observation 1587f2f9-a5d6-4e24-9ea5-e37b9dc581d4 · outbound

This paper cites A Survey on Model Compression for Large Language Models.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference A Survey on Model Compression for Large Language Models

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.956319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.956319Z digest=sha256:455b79f45dfbdfc93b393fb62e94b227eeb564d90275b0996bb0a259d99a99a7

Observation 684f48ae-0f98-47cc-bc33-1835c2e87470 · outbound

This paper cites Adam: A Method for Stochastic Optimization.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Adam: A Method for Stochastic Optimization

Reference 2014

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.895877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.895877Z digest=sha256:2d0ae3a26a1f58c58ef67c69b6e6e00670ae960af543cd6dd47d0d2e17e91bd3

Observation 87063ed9-9559-4f93-9fa7-a1577da29aa9 · outbound

This paper cites Distilling the Knowledge in a Neural Network.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Distilling the Knowledge in a Neural Network

Reference 2015

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.879496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.879496Z digest=sha256:51a3c23ce4aad860c76f758971693872baaa19bc64687cc8b70a4bb3fdd122c5

Observation 3d5e3cc3-a973-4bc7-acf8-76a7662710b9 · outbound

This paper cites an unresolved cited work.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Unresolved cited work

Reference 2017

Resolution
unresolved
raw_fallback, observed 2026-08-11T11:12:58.193208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.945435Z digest=sha256:615f24e5b703f9450ff957adc8b43d207575f62e185f371aced73ba021adfde0

Observation fe72f192-da06-46d1-bef3-e84268b28754 · outbound

This paper cites an unresolved cited work.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Unresolved cited work

Reference 2018

Resolution
unresolved
raw_fallback, observed 2026-08-11T11:12:58.217338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.919349Z digest=sha256:8936a9ff48d14e5dd76cabfbf0cab2f1b3b40ca569e2697f180bd28316aec428

Observation 623c61a6-7a4c-4037-95d7-babf3dc0cf0d · outbound

This paper cites Distilling Task-Specific Knowledge from BERT into Simple Neural Networks.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Distilling Task-Specific Knowledge from BERT into Simple Neural Networks

Reference 2019

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.936739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.936739Z digest=sha256:ecf09f6d7581b6c9a5faba76b81eec505f1a265589fc3f3d665cf44d2e265c2a

Observation bc1a2462-150c-45b5-b790-efb8293bb271 · outbound

This paper cites Ad- vances in Neural Information Processing Systems, NeurIPS 2020, 33: 1877–1901.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Ad- vances in Neural Information Processing Systems, NeurIPS 2020, 33: 1877–1901

Reference 2020

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T11:12:58.275830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.864079Z digest=sha256:18eb7560530051d5ff2357acb970230b90a5c24e5d94579116d4b3817741ada7

Observation 224feb25-e902-4a3b-9169-ff53d94157e8 · outbound

This paper cites Toy Models of Superposition.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Toy Models of Superposition

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.868130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.868130Z digest=sha256:0fd839ccb59841c54b544d515bebc9cc9bf42409faf4b641b1ff7864eb5f23fc

Observation c994f6d3-a967-47ea-82b0-c7969aa1c62c · outbound

This paper cites GPT-4 Technical Report.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference GPT-4 Technical Report

Reference 2023

Resolution
unresolved
no resolver link, observed 2026-08-11T11:12:57.854841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T11:12:57.854841Z digest=sha256:f1da87b4fe3d9fb03b4a795856fb250dadc5f787770c1fa396c237d6cc85c7dd

Observation 0e75e75f-8280-42d0-af80-4d9fcdd79c3e · outbound

This paper cites Finding Transformer Circuits with Edge Pruning.

Extracting Interpretable Task-Specific Circuits from Large Language Models for Faster Inference Finding Transformer Circuits with Edge Pruning

Reference 2024

Resolution
verified exact
local_arxiv, observed 2026-08-11T11:12:58.155851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-11T11:12:57.859721Z digest=sha256:c0300434b033cc9144366c14e08213772215c7ebf32182b60b9e1cc4864c65cb

Pith citing papers

No inbound Pith citation observations are available.