{"as_of":"2026-08-10T07:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:592992ac6fcfba3b5928c44c6c1b276370f050955605b66f254e49ff95b8f58f","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:37:39.615850Z","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-15T02:39:33.333826Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":"2310.01382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compressing llms: The truth is rarely pure and never simple","venue":null,"work_id":"6cdc36eb-e3fe-4002-9a5a-4d1d2ef34396","year":2023},"citing_paper":{"arxiv_id":"2404.14294","last_updated":"2024-07-19T04:47:36Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T15:53:08Z","title":"A Survey on Efficient Inference for Large Language Models","version":3},"reference_index":235,"source":"pdf_text","source_observed_at":"2026-05-15T02:39:33.007894Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2404.14294"},"observation_digest":"sha256:de2aa9801f4c5dcec1deab87a322bbdf2c285e52c38b0bb1db82d7e9f61b0dd6","observation_id":"afabfb92-2e9f-46d1-8e15-a93e896d6897","resolution":{"observed_at":"2026-05-15T02:39:33.335929Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-08-09T17:37:39.615850Z","title":"Compressing llms: The truth is rarely pure and never simple","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00840","last_updated":"2025-06-10T17:24:15Z","snapshot_observed_at":"2026-08-10T00:46:53.798153Z","submitted_at":"2025-02-02T16:25:48Z","title":"Activation Approximations Can Incur Safety Vulnerabilities Even in Aligned LLMs: Comprehensive Analysis and Defense","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-09T17:37:39.615850Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2502.00840"},"observation_digest":"sha256:4ea6a9f53e882a9bd3f64ccb82a71df8e5026c02b99b08d93365167d04040d62","observation_id":"6a15da23-7dd0-4138-8b6c-b2475b3ffc78","resolution":{"observed_at":"2026-08-09T17:37:39.615850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-08-04T16:19:25.244046Z","title":"Compressing llms: The truth is rarely pure and never simple","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.15206","last_updated":"2026-07-06T11:20:29Z","snapshot_observed_at":"2026-08-10T03:24:35.405561Z","submitted_at":"2025-09-18T17:56:16Z","title":"Fair-GPTQ: Bias-Aware Quantization for Large Language Models","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T16:19:25.244046Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2509.15206"},"observation_digest":"sha256:08f69d07b6825061a6bbd10d53fa13b2209e6e809c86f121453012cceb7f82d0","observation_id":"7635ee2f-f159-473c-9459-a4a3901a698e","resolution":{"observed_at":"2026-08-04T16:19:25.244046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":"2310.01382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compressing llms: The truth is rarely pure and never simple","venue":null,"work_id":"6cdc36eb-e3fe-4002-9a5a-4d1d2ef34396","year":2023},"citing_paper":{"arxiv_id":"2604.17396","last_updated":"2026-04-19T11:59:58Z","snapshot_observed_at":"2026-08-01T18:23:32.699442Z","submitted_at":"2026-04-19T11:59:58Z","title":"Representation-Guided Parameter-Efficient LLM Unlearning","version":1},"reference_index":133,"source":"arxiv_source","source_observed_at":"2026-05-10T06:01:46.885030Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2604.17396"},"observation_digest":"sha256:700d5b75daddc7cc243770cb9346376b09fbdca0be0a147047323e35d145c88e","observation_id":"1467d78d-fc7b-4f0f-a6fd-d449913b343f","resolution":{"observed_at":"2026-05-10T06:06:19.144781Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-07-14T08:45:52.855783Z","title":"arXiv preprint arXiv:2310.01382 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10855","last_updated":"2026-07-12T17:39:09Z","snapshot_observed_at":"2026-08-06T03:10:18.618115Z","submitted_at":"2026-07-12T17:39:09Z","title":"Reliability Scaling Laws for Quantized Large Language Models","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-14T08:45:52.855783Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2607.10855"},"observation_digest":"sha256:ea4b915fc1e8320295ab889e4383d7ef37407fd67ecc52d6f6fe09dbc2c936f3","observation_id":"e35a557c-3005-4627-8394-4ae1d31ca258","resolution":{"observed_at":"2026-07-14T08:45:52.855783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01382","snapshot_observed_at":"2026-08-01T16:42:30.129066Z","title":"arXiv preprint arXiv:2310.01382 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26404","last_updated":"2026-07-29T02:35:55Z","snapshot_observed_at":"2026-08-03T19:06:45.585998Z","submitted_at":"2026-07-29T02:35:55Z","title":"Examining the Efficacy of Graph Neural Network Message-Passing in Regression Contexts","version":1},"reference_index":241,"source":"arxiv_source","source_observed_at":"2026-08-01T16:42:30.129066Z"},"links":{"cited_paper":"/paper/2310.01382","citing_paper":"/paper/2607.26404"},"observation_digest":"sha256:112487bb769fed42534e8e462d1da038046b7088664bb1dbaa2f4c566eeabc02","observation_id":"239c5939-5447-4848-9b24-f0ccbe8fa40a","resolution":{"observed_at":"2026-08-01T16:42:30.129066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.01382/citation-record","integrity":"/paper/2310.01382/integrity","json":"/paper/2310.01382/citation-record.json","paper":"/paper/2310.01382"},"outbound":[],"paper":{"arxiv_id":"2310.01382","last_updated":"2024-03-17T00:38:59Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T03:24:03.444561Z","submitted_at":"2023-10-02T17:42:37Z","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2310.01382."}