{"as_of":"2026-08-09T23:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c6acd21ecbd44847fbde3f178613005c8322727ecc341df0724a64ba67b280a","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-09T06:31:02.800959+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-09T21:31:36.150249Z","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.609428Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":"2309.14021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lord: Low rank decomposi- tion of monolingual code llms for one-shot compression","venue":null,"work_id":"2211508b-3af4-48c2-8319-3407ccaaaebd","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":143,"source":"pdf_text","source_observed_at":"2026-05-15T02:39:33.007894Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2404.14294"},"observation_digest":"sha256:41ece96ddb6076c548bcdecae7798b37871afa9f0e33d1eb1c70bf9948acab9b","observation_id":"8e0718e9-60a7-47e9-9d80-6f4484754c16","resolution":{"observed_at":"2026-05-15T02:39:33.611914Z","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":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-08-09T21:31:36.150249Z","title":"Lord: Low rank decomposition of monolingual code llms for one-shot compression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.19090","last_updated":"2025-08-13T06:56:55Z","snapshot_observed_at":"2026-08-09T21:19:26.124607Z","submitted_at":"2025-01-31T12:36:31Z","title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T21:31:36.150249Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2501.19090"},"observation_digest":"sha256:69545e21a80750ec5953f23fb6ac6d5fde72f0ac7435f11f8990f4f4c408b907","observation_id":"3713a045-c1e5-4660-8a67-f72d086b1cc7","resolution":{"observed_at":"2026-08-09T21:31:36.150249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-08-06T20:21:04.421461Z","title":"Lord: Low rank decompo- sition of monolingual code llms for one-shot compression,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03294","last_updated":"2025-07-04T04:54:01Z","snapshot_observed_at":"2026-08-06T20:11:37.177918Z","submitted_at":"2025-07-04T04:54:01Z","title":"MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:21:04.421461Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2507.03294"},"observation_digest":"sha256:695863ab148d71ea0f8ed5ff4a51918a5c2ca93604452e3e6f65740253180e91","observation_id":"bb627705-85a2-4a3f-8b06-dec49fa1981e","resolution":{"observed_at":"2026-08-06T20:21:04.421461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-08-04T12:54:31.437126Z","title":"Lord: Low rank decomposition of monolingual code llms for one-shot compression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01718","last_updated":"2026-06-26T05:02:54Z","snapshot_observed_at":"2026-08-09T22:48:27.684783Z","submitted_at":"2025-10-02T06:58:10Z","title":"Accelerating Attention with Basis Decomposition","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T12:54:31.437126Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2510.01718"},"observation_digest":"sha256:32819f3c2e7046febc7336a5391effb20896976815cff25f168c3d0b17a85282","observation_id":"dedb3b3c-0143-447c-86ac-5a807bdcfb2e","resolution":{"observed_at":"2026-08-04T12:54:31.437126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":"2309.14021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lord: Low rank decomposi- tion of monolingual code llms for one-shot compression","venue":null,"work_id":"2211508b-3af4-48c2-8319-3407ccaaaebd","year":2023},"citing_paper":{"arxiv_id":"2603.29813","last_updated":"2026-06-24T12:09:03Z","snapshot_observed_at":"2026-08-07T20:31:27.965876Z","submitted_at":"2026-03-31T14:40:19Z","title":"Compiling Code LLMs into Lightweight Executables","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-13T23:26:03.943399Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2603.29813"},"observation_digest":"sha256:dbf52c72aad8122a0770f29db66874e40aa2d2631675d6c6ad7a3e7f58c0fec6","observation_id":"71e423b5-0655-4ac7-8669-23d751484858","resolution":{"observed_at":"2026-05-13T23:28:26.175147Z","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":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":"2309.14021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lord: Low rank decomposi- tion of monolingual code llms for one-shot compression","venue":null,"work_id":"2211508b-3af4-48c2-8319-3407ccaaaebd","year":2023},"citing_paper":{"arxiv_id":"2605.06216","last_updated":"2026-05-07T13:16:18Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T13:16:18Z","title":"TIDE: Every Layer Knows the Token Beneath the Context","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-08T10:35:46.447739Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2605.06216"},"observation_digest":"sha256:d9ef0f69794fc66d3de8245856688d2b77dd60c9bda84b779d0b9ea7d72e9c0f","observation_id":"9d8f594f-903d-48b4-8ac9-75bb6427829a","resolution":{"observed_at":"2026-05-11T19:56:10.084023Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2309.14021/citation-record","integrity":"/paper/2309.14021/integrity","json":"/paper/2309.14021/citation-record.json","paper":"/paper/2309.14021"},"outbound":[],"paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T11:20:14.506370Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot 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 6 inbound Pith citation observations for arXiv:2309.14021."}