{"as_of":"2026-08-10T11:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee4ea0aa7ca01b86fb16dd4328e9fb84497e56a7b3e54d5dd0df151dfe0aa308","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:26:45.465953Z","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-06-29T19:43:54.742148Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.16325","last_updated":"2025-01-25T22:24:04Z","snapshot_observed_at":"2026-08-01T16:02:13.326628Z","submitted_at":"2024-05-25T18:43:05Z","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16325","snapshot_observed_at":"2026-08-09T17:26:45.465953Z","title":"Slope: Double-pruned sparse plus lazy low-rank adapter pretraining of llms.arXiv preprint arXiv:2405.16325, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00899","last_updated":"2025-02-02T20:23:32Z","snapshot_observed_at":"2026-08-10T08:47:48.270078Z","submitted_at":"2025-02-02T20:23:32Z","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T17:26:45.465953Z"},"links":{"cited_paper":"/paper/2405.16325","citing_paper":"/paper/2502.00899"},"observation_digest":"sha256:226f93ad49c075d3edb7be88472a8c4fb4cbf7c31655088e5f6ee932b4f0c179","observation_id":"7657d52f-6d28-451b-b329-5051d37c9f0c","resolution":{"observed_at":"2026-08-09T17:26:45.465953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16325","last_updated":"2025-01-25T22:24:04Z","snapshot_observed_at":"2026-08-01T16:02:13.326628Z","submitted_at":"2024-05-25T18:43:05Z","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16325","snapshot_observed_at":"2026-08-06T05:11:11.646741Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.02128","last_updated":"2025-08-04T07:22:36Z","snapshot_observed_at":"2026-08-08T06:49:38.643278Z","submitted_at":"2025-08-04T07:22:36Z","title":"Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T05:11:11.646741Z"},"links":{"cited_paper":"/paper/2405.16325","citing_paper":"/paper/2508.02128"},"observation_digest":"sha256:97db7acb7b72abdb3c1b72315c3bccb6e1174a56b416176c08002ef297d4cc75","observation_id":"dd92140d-b171-44ce-8c9d-0eb824125b5c","resolution":{"observed_at":"2026-08-06T05:11:11.646741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16325","last_updated":"2025-01-25T22:24:04Z","snapshot_observed_at":"2026-08-01T16:02:13.326628Z","submitted_at":"2024-05-25T18:43:05Z","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","version":3},"cited_work":{"arxiv_id":"2405.16325","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16325","snapshot_observed_at":"2026-06-29T19:43:54.742148Z","title":"Slope: Double-pruned sparse plus lazy low-rank adapter pretraining of llms.arXiv preprint arXiv:2405.16325, 2024","venue":null,"work_id":"067bd9b3-524f-4d13-ac52-6b985c778dff","year":2024},"citing_paper":{"arxiv_id":"2605.26632","last_updated":"2026-06-01T03:03:29Z","snapshot_observed_at":"2026-07-06T23:36:29.930024Z","submitted_at":"2026-05-26T07:09:49Z","title":"RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T19:40:42.033793Z"},"links":{"cited_paper":"/paper/2405.16325","citing_paper":"/paper/2605.26632"},"observation_digest":"sha256:9997a5680ddb6736ddc6528113085de780c654ebbb79e99cc48fc304a692c46e","observation_id":"78eec323-f019-409f-bcdc-798b2dbb9949","resolution":{"observed_at":"2026-06-29T19:43:54.743986Z","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":"2405.16325","last_updated":"2025-01-25T22:24:04Z","snapshot_observed_at":"2026-08-01T16:02:13.326628Z","submitted_at":"2024-05-25T18:43:05Z","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16325","snapshot_observed_at":"2026-08-01T10:32:05.695707Z","title":"2405.16325 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20214","last_updated":"2026-07-22T14:34:49Z","snapshot_observed_at":"2026-08-09T22:48:28.753893Z","submitted_at":"2026-07-22T14:34:49Z","title":"ELSAA: Efficient Low-Rank and Sparse Attention Approximation for Training Transformers","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T10:32:05.695707Z"},"links":{"cited_paper":"/paper/2405.16325","citing_paper":"/paper/2607.20214"},"observation_digest":"sha256:d9ac249c742f23956209bb55601af789843dfe94f1be4933aad506ff7939a393","observation_id":"c1eb0afa-b30c-49bd-b6dd-754ccc0131fa","resolution":{"observed_at":"2026-08-01T10:32:05.695707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.16325/citation-record","integrity":"/paper/2405.16325/integrity","json":"/paper/2405.16325/citation-record.json","paper":"/paper/2405.16325"},"outbound":[],"paper":{"arxiv_id":"2405.16325","last_updated":"2025-01-25T22:24:04Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T16:02:13.326628Z","submitted_at":"2024-05-25T18:43:05Z","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs"},"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 4 inbound Pith citation observations for arXiv:2405.16325."}