{"as_of":"2026-08-08T06:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e541b9275cd33cc007fc7ade13b9434066c75fa11304212f81f0cf6b61b48fa","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-08T06:32:00.761636+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-04T12:54:36.066165Z","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-29T13:43:28.739717Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.11250","last_updated":"2024-01-01T03:43:41Z","snapshot_observed_at":"2026-08-06T13:53:33.999451Z","submitted_at":"2023-06-20T03:03:04Z","title":"InRank: Incremental Low-Rank Learning","version":2},"cited_work":{"arxiv_id":"2306.11250","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.11250","snapshot_observed_at":"2026-06-29T13:43:28.739717Z","title":"Inrank: Incremental low-rank learning","venue":null,"work_id":"c188f194-5584-4202-a035-7901b32dac6c","year":2023},"citing_paper":{"arxiv_id":"2403.03507","last_updated":"2024-06-02T21:24:12Z","snapshot_observed_at":"2026-07-06T17:40:15.746482Z","submitted_at":"2024-03-06T07:29:57Z","title":"GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projection","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-16T23:51:50.163520Z"},"links":{"cited_paper":"/paper/2306.11250","citing_paper":"/paper/2403.03507"},"observation_digest":"sha256:9117d6319dd4e6386a10df0a97001476116499756629846c27148b1ca2ab0d06","observation_id":"c3a48c4d-c29d-4cda-ba1e-8c3edf72f1b6","resolution":{"observed_at":"2026-05-16T23:51:50.300205Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11250","last_updated":"2024-01-01T03:43:41Z","snapshot_observed_at":"2026-08-06T13:53:33.999451Z","submitted_at":"2023-06-20T03:03:04Z","title":"InRank: Incremental Low-Rank Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11250","snapshot_observed_at":"2026-08-04T12:54:36.066165Z","title":"Inrank: Incremental low-rank learning","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-07T05:19:59.381823Z","submitted_at":"2025-10-02T06:58:10Z","title":"Accelerating Attention with Basis Decomposition","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-04T12:54:36.066165Z"},"links":{"cited_paper":"/paper/2306.11250","citing_paper":"/paper/2510.01718"},"observation_digest":"sha256:5eeec963c9cfe71735583e2512bd98afc25aa1f7020437efe0c38e7406f20c74","observation_id":"6dd34c8b-9224-430b-aadc-c57a7b72dc78","resolution":{"observed_at":"2026-08-04T12:54:36.066165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11250","last_updated":"2024-01-01T03:43:41Z","snapshot_observed_at":"2026-08-06T13:53:33.999451Z","submitted_at":"2023-06-20T03:03:04Z","title":"InRank: Incremental Low-Rank Learning","version":2},"cited_work":{"arxiv_id":"2306.11250","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.11250","snapshot_observed_at":"2026-06-29T13:43:28.739717Z","title":"Inrank: Incremental low-rank learning","venue":null,"work_id":"c188f194-5584-4202-a035-7901b32dac6c","year":2023},"citing_paper":{"arxiv_id":"2605.28573","last_updated":"2026-05-27T14:57:49Z","snapshot_observed_at":"2026-08-07T01:52:12.419182Z","submitted_at":"2026-05-27T14:57:49Z","title":"Efficient Pre-Training of LLMs through Truncated SVD Layers","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T13:39:53.206470Z"},"links":{"cited_paper":"/paper/2306.11250","citing_paper":"/paper/2605.28573"},"observation_digest":"sha256:c53bc30a99538ee3d13509f6389a06d7b1ca5210c58224d6b3ea24ec781d50af","observation_id":"ea414b5f-f6cc-46e0-9436-fbf34691dc6f","resolution":{"observed_at":"2026-06-29T13:43:28.741721Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11250","last_updated":"2024-01-01T03:43:41Z","snapshot_observed_at":"2026-08-06T13:53:33.999451Z","submitted_at":"2023-06-20T03:03:04Z","title":"InRank: Incremental Low-Rank Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11250","snapshot_observed_at":"2026-08-02T09:51:03.447212Z","title":"arXiv preprint arXiv:2306.11250 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16252","last_updated":"2026-06-27T03:25:36Z","snapshot_observed_at":"2026-08-08T02:31:05.095460Z","submitted_at":"2026-06-27T03:25:36Z","title":"SOS-LoRA: Static Orthogonal-Subspace Low-Rank Adaptation with Fixed Multi-Scale Scaling","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-02T09:51:03.447212Z"},"links":{"cited_paper":"/paper/2306.11250","citing_paper":"/paper/2607.16252"},"observation_digest":"sha256:53126bb426b52b1b0749d6944db0e2d130d10b077a644c78681398bce52f0d37","observation_id":"206ecc20-c551-482a-88d3-e2b995244b00","resolution":{"observed_at":"2026-08-02T09:51:03.447212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.11250/citation-record","integrity":"/paper/2306.11250/integrity","json":"/paper/2306.11250/citation-record.json","paper":"/paper/2306.11250"},"outbound":[],"paper":{"arxiv_id":"2306.11250","last_updated":"2024-01-01T03:43:41Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T13:53:33.999451Z","submitted_at":"2023-06-20T03:03:04Z","title":"InRank: Incremental Low-Rank Learning"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2306.11250."}