{"as_of":"2026-08-17T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e6a37d463bf7040a987e8d24963b9d473cbb679f4dedc75290dfbb8e6193c04","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-17T06:30:58.91139+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-14T15:42:46.882701Z","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-22T07:06:11.782361Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.06291","last_updated":"2020-02-20T03:19:41Z","snapshot_observed_at":"2026-08-16T23:28:40.179510Z","submitted_at":"2018-04-17T14:41:52Z","title":"Efficient Solvers for Sparse Subspace Clustering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06291","snapshot_observed_at":"2026-08-14T15:42:46.882701Z","title":"Efficient solvers for sparse subspace clustering,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00683","last_updated":"2019-08-02T02:39:40Z","snapshot_observed_at":"2026-08-16T09:54:16.245507Z","submitted_at":"2019-08-02T02:39:40Z","title":"Large-Scale Sparse Subspace Clustering Using Landmarks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:42:46.882701Z"},"links":{"cited_paper":"/paper/1804.06291","citing_paper":"/paper/1908.00683"},"observation_digest":"sha256:e49179000be1d7997c5bc5f5fa2c982e08998178702b64df9205de1923a4524c","observation_id":"3aa9dc57-6780-4f96-b95d-dfc992223479","resolution":{"observed_at":"2026-08-14T15:42:46.882701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06291","last_updated":"2020-02-20T03:19:41Z","snapshot_observed_at":"2026-08-16T23:28:40.179510Z","submitted_at":"2018-04-17T14:41:52Z","title":"Efficient Solvers for Sparse Subspace Clustering","version":2},"cited_work":{"arxiv_id":"1804.06291","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1804.06291","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient Solvers for Sparse Subspace Clustering , journal =","venue":null,"work_id":"1fcc1e42-f40b-4a05-8dab-f1105cf041bd","year":2018},"citing_paper":{"arxiv_id":"2605.22743","last_updated":"2026-05-21T17:13:49Z","snapshot_observed_at":"2026-08-12T18:09:06.435612Z","submitted_at":"2026-05-21T17:13:49Z","title":"SeqLoRA: Bilevel Orthogonal Adaptation for Continual Multi-Concept Generation","version":1},"reference_index":226,"source":"arxiv_source","source_observed_at":"2026-05-22T07:05:08.338351Z"},"links":{"cited_paper":"/paper/1804.06291","citing_paper":"/paper/2605.22743"},"observation_digest":"sha256:a2af0b818d7342fe50b5b1816adca278950182f2ca6b6f59a44db7771e7a6b00","observation_id":"a8501850-2001-4095-b0c3-db1973dca27e","resolution":{"observed_at":"2026-05-22T07:06:11.784949Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.06291/citation-record","integrity":"/paper/1804.06291/integrity","json":"/paper/1804.06291/citation-record.json","paper":"/paper/1804.06291"},"outbound":[],"paper":{"arxiv_id":"1804.06291","last_updated":"2020-02-20T03:19:41Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T23:28:40.179510Z","submitted_at":"2018-04-17T14:41:52Z","title":"Efficient Solvers for Sparse Subspace Clustering"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1804.06291."}