{"as_of":"2026-08-09T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:447afd6396f16ca8bb674fb951909662b0f70e8f6d7beb91d10ac5a74af88e4e","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:04:45.679663Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T19:52:35.842539Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.14152","last_updated":"2023-06-25T07:38:43Z","snapshot_observed_at":"2026-07-06T15:46:24.940417Z","submitted_at":"2023-06-25T07:38:43Z","title":"Low-Rank Prune-And-Factorize for Language Model Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14152","snapshot_observed_at":"2026-08-07T19:04:45.679663Z","title":"Ren and K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10216","last_updated":"2025-08-12T07:34:30Z","snapshot_observed_at":"2026-08-08T07:46:40.733541Z","submitted_at":"2025-02-14T15:10:43Z","title":"Forget the Data and Fine-Tuning! Just Fold the Network to Compress","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T19:04:45.679663Z"},"links":{"cited_paper":"/paper/2306.14152","citing_paper":"/paper/2502.10216"},"observation_digest":"sha256:addc71f283d2370ab27326eb1d79c2b206f9f235d4b2ed799983170c03993a5d","observation_id":"d5bde621-4b57-4d03-a51d-687dd0beeaa8","resolution":{"observed_at":"2026-08-07T19:04:45.679663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14152","last_updated":"2023-06-25T07:38:43Z","snapshot_observed_at":"2026-07-06T15:46:24.940417Z","submitted_at":"2023-06-25T07:38:43Z","title":"Low-Rank Prune-And-Factorize for Language Model Compression","version":1},"cited_work":{"arxiv_id":"2306.14152","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.14152","snapshot_observed_at":"2026-08-06T19:52:35.842539Z","title":"Low-Rank Prune-And-Factorize for Language Model Compression","venue":"cs.CL","work_id":"7e0b69ed-262f-44af-a54b-3b139ab35971","year":2023},"citing_paper":{"arxiv_id":"2507.04455","last_updated":"2025-07-06T16:27:27Z","snapshot_observed_at":"2026-08-06T19:44:48.327849Z","submitted_at":"2025-07-06T16:27:27Z","title":"GradOT: Training-free Gradient-preserving Offsite-tuning for Large Language Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T19:52:35.584322Z"},"links":{"cited_paper":"/paper/2306.14152","citing_paper":"/paper/2507.04455"},"observation_digest":"sha256:9347c0eea4b3eb949ad165234756b87740756856b77c8412e0e2aeebd1a463e9","observation_id":"6cc2ef41-5f7c-4614-af58-b1abd6d6fc14","resolution":{"observed_at":"2026-08-06T19:52:35.849855Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2306.14152/citation-record","integrity":"/paper/2306.14152/integrity","json":"/paper/2306.14152/citation-record.json","paper":"/paper/2306.14152"},"outbound":[],"paper":{"arxiv_id":"2306.14152","last_updated":"2023-06-25T07:38:43Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T15:46:24.940417Z","submitted_at":"2023-06-25T07:38:43Z","title":"Low-Rank Prune-And-Factorize for Language Model 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 2 inbound Pith citation observations for arXiv:2306.14152."}