{"as_of":"2026-08-09T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d68c01c2f0d9bc858d105d734dc0ccc9ea252a389ac413f6003645a337bd2dd9","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:00:19.552626Z","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-07-03T20:28:55.274633Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-08-06T23:00:19.552626Z","title":"Decoding compressed trust: Scrutinizing the trust- worthiness of efficient llms under compression.arXiv preprint arXiv:2403.15447,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20251","last_updated":"2025-06-25T08:52:22Z","snapshot_observed_at":"2026-08-07T22:24:27.303298Z","submitted_at":"2025-06-25T08:52:22Z","title":"Q-resafe: Assessing Safety Risks and Quantization-aware Safety Patching for Quantized Large Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:00:19.552626Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2506.20251"},"observation_digest":"sha256:83c750c7d824da6b3c52064cd99ab29c15ff446f99b8a74b454eb2c04bee63bb","observation_id":"56b4a5db-6959-4436-9fa4-fb83cdcf6016","resolution":{"observed_at":"2026-08-06T23:00:19.552626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-08-06T15:24:45.734894Z","title":"Decoding compressed trust: Scrutinizing the trustworthiness of efficient llms under compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15977","last_updated":"2025-07-21T18:17:18Z","snapshot_observed_at":"2026-08-08T15:45:05.019347Z","submitted_at":"2025-07-21T18:17:18Z","title":"On the transferability of Sparse Autoencoders for interpreting compressed models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T15:24:45.734894Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2507.15977"},"observation_digest":"sha256:56e0219c9b5448a9f4b53434c4f72ebfeda5c2d488eba68b93217e9c502aeb11","observation_id":"3dab2165-8a15-405d-bcf5-f46909beadd2","resolution":{"observed_at":"2026-08-06T15:24:45.734894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-08-06T10:26:17.914249Z","title":"arXiv preprint arXiv:2403.15447 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.00128","last_updated":"2025-07-31T19:28:31Z","snapshot_observed_at":"2026-08-09T10:58:21.162653Z","submitted_at":"2025-07-31T19:28:31Z","title":"How Quantization Impacts Privacy Risk on LLMs for Code?","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T10:26:17.914249Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2508.00128"},"observation_digest":"sha256:3ac234947434b1ae4cd74a4b7eba42185e7146ce0b78419999da1da1b74cd993","observation_id":"9ce397ed-3948-4a62-beb0-506452dbb77d","resolution":{"observed_at":"2026-08-06T10:26:17.914249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-08-05T15:52:44.936368Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19432","last_updated":"2025-08-26T21:01:45Z","snapshot_observed_at":"2026-08-09T00:35:46.151432Z","submitted_at":"2025-08-26T21:01:45Z","title":"Quantized but Deceptive? A Multi-Dimensional Truthfulness Evaluation of Quantized LLMs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T15:52:44.936368Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2508.19432"},"observation_digest":"sha256:f51d4ea00a979ee6c1acaa8f7c1788b38ab688c941d96c5ad099d3f49689a7c0","observation_id":"ff60a444-4908-4f31-8bb4-749cd00c70f8","resolution":{"observed_at":"2026-08-05T15:52:44.936368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":"2403.15447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-07-03T20:28:55.274633Z","title":"Decoding compressed trust: Scrutinizing the trustworthiness of efficient llms under compression.arXiv preprint arXiv:2403.15447","venue":null,"work_id":"de9622bf-0335-4820-93fa-3693c28d3912","year":2024},"citing_paper":{"arxiv_id":"2604.04120","last_updated":"2026-04-05T13:43:12Z","snapshot_observed_at":"2026-07-06T22:53:10.816748Z","submitted_at":"2026-04-05T13:43:12Z","title":"Shorter, but Still Trustworthy? An Empirical Study of Chain-of-Thought Compression","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T17:16:47.284564Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2604.04120"},"observation_digest":"sha256:cc64702d5ede4451c054c5fc12798f8abbfb32d91ff81861d38969273afb7b8a","observation_id":"573f5d4d-6763-488d-983f-16706c633623","resolution":{"observed_at":"2026-05-13T17:18:01.260249Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":"2403.15447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-07-03T20:28:55.274633Z","title":"Decoding compressed trust: Scrutinizing the trustworthiness of efficient llms under compression.arXiv preprint arXiv:2403.15447","venue":null,"work_id":"de9622bf-0335-4820-93fa-3693c28d3912","year":2024},"citing_paper":{"arxiv_id":"2605.27763","last_updated":"2026-05-26T23:22:55Z","snapshot_observed_at":"2026-07-31T18:23:26.053584Z","submitted_at":"2026-05-26T23:22:55Z","title":"A Paired Testing Protocol for Batch-Conditioned Refusal Robustness in LLM Serving","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-29T18:03:19.798168Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2605.27763"},"observation_digest":"sha256:08f6aa3a7be5cb82fd25c2c62cce2661e9e143fb6a42648e186607412db4497b","observation_id":"569ee176-4188-4169-8660-27bf3f78e9fb","resolution":{"observed_at":"2026-06-29T18:03:47.856776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":"2403.15447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-07-03T20:28:55.274633Z","title":"Decoding compressed trust: Scrutinizing the trustworthiness of efficient llms under compression.arXiv preprint arXiv:2403.15447","venue":null,"work_id":"de9622bf-0335-4820-93fa-3693c28d3912","year":2024},"citing_paper":{"arxiv_id":"2606.17872","last_updated":"2026-06-16T12:43:18Z","snapshot_observed_at":"2026-08-07T21:33:36.960727Z","submitted_at":"2026-06-16T12:43:18Z","title":"AnchorKV: Safety-Aware KV Cache Compression via Soft Penalty with a Refusal Anchor","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T01:23:23.488555Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2606.17872"},"observation_digest":"sha256:be0fb13c05e297918151eb5d04ec66c38fee607db0c197f83dbe8135e3ba5fb3","observation_id":"516efbc7-7755-4a30-930a-8a33197cb019","resolution":{"observed_at":"2026-07-03T20:28:55.276676Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-07-14T08:45:52.855783Z","title":"arXiv preprint arXiv:2403.15447 , 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":71,"source":"arxiv_source","source_observed_at":"2026-07-14T08:45:52.855783Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2607.10855"},"observation_digest":"sha256:6c1b212bfc085d73518604f738e3a0f6ace84c8f080d426723a6348df35a35be","observation_id":"0d583f19-c883-4c53-8ce3-53e973e39cf9","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":"2403.15447","last_updated":"2024-06-04T05:40:12Z","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15447","snapshot_observed_at":"2026-08-02T06:50:15.020939Z","title":"Decoding compressed trust: Scrutinizing the trustworthiness of efficient llms under compression.arXiv preprint arXiv:2403.15447, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13088","last_updated":"2026-07-13T16:45:04Z","snapshot_observed_at":"2026-08-02T21:33:36.438557Z","submitted_at":"2026-07-13T16:45:04Z","title":"Securing LLMs in the Wild: Privacy and Security Challenges at the Edge","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-02T06:50:15.020939Z"},"links":{"cited_paper":"/paper/2403.15447","citing_paper":"/paper/2607.13088"},"observation_digest":"sha256:9baf39e2694e849c33d84461a33ab4fa5fe58cbdbc30fd181094af40202ca9cd","observation_id":"0f4f0e1a-a9fc-4678-8c71-5b184f558fc6","resolution":{"observed_at":"2026-08-02T06:50:15.020939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.15447/citation-record","integrity":"/paper/2403.15447/integrity","json":"/paper/2403.15447/citation-record.json","paper":"/paper/2403.15447"},"outbound":[],"paper":{"arxiv_id":"2403.15447","last_updated":"2024-06-04T05:40:12Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:49:11.762370Z","submitted_at":"2024-03-18T01:38:19Z","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2403.15447."}