{"as_of":"2026-08-08T09:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:397b3ff2dc6a1e16279a2fd3d41035a82b8abe95e6c910b38bab6ae6d4e83f8b","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-08T06:32:00.761636+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-07T12:27:46.656377Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":8,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.07474","last_updated":"2018-05-29T18:23:30Z","snapshot_observed_at":"2026-07-06T05:43:34.220578Z","submitted_at":"2017-05-21T16:49:36Z","title":"Why are Big Data Matrices Approximately Low Rank?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07474","snapshot_observed_at":"2026-08-07T12:27:46.656377Z","title":"URL: https://arxiv.org/abs/1705.07474","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24668","last_updated":"2025-05-30T14:58:02Z","snapshot_observed_at":"2026-08-07T12:13:32.929748Z","submitted_at":"2025-05-30T14:58:02Z","title":"Impact of Bottleneck Layers and Skip Connections on the Generalization of Linear Denoising Autoencoders","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:46.656377Z"},"links":{"cited_paper":"/paper/1705.07474","citing_paper":"/paper/2505.24668"},"observation_digest":"sha256:3ac912e1c9eac653b154cfa8b5dbefa9baabe1215b80e782c8721e358efe3347","observation_id":"a399c26f-aaff-4f3e-ac5c-dfcfc11cffc8","resolution":{"observed_at":"2026-08-07T12:27:46.656377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07474","last_updated":"2018-05-29T18:23:30Z","snapshot_observed_at":"2026-07-06T05:43:34.220578Z","submitted_at":"2017-05-21T16:49:36Z","title":"Why are Big Data Matrices Approximately Low Rank?","version":2},"cited_work":{"arxiv_id":"1705.07474","doi":"10.48550/arxiv.1705.07474","metadata_source":"arxiv_reference","pith_arxiv_id":"1705.07474","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"ed0f1a66-22f1-4f14-9719-ca82271c7b7c","year":null},"citing_paper":{"arxiv_id":"2605.11170","last_updated":"2026-06-02T13:57:02Z","snapshot_observed_at":"2026-08-02T02:13:17.912919Z","submitted_at":"2026-05-11T19:28:33Z","title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-13T05:56:38.042978Z"},"links":{"cited_paper":"/paper/1705.07474","citing_paper":"/paper/2605.11170"},"observation_digest":"sha256:e6043839ef5ea018b95fcaeaaa7dd219ac847e2d37b36d88f64511485e8619f3","observation_id":"db775097-22a3-4f96-836c-888dfbe3be6e","resolution":{"observed_at":"2026-07-04T22:48:26.405768Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1705.07474/citation-record","integrity":"/paper/1705.07474/integrity","json":"/paper/1705.07474/citation-record.json","paper":"/paper/1705.07474"},"outbound":[],"paper":{"arxiv_id":"1705.07474","last_updated":"2018-05-29T18:23:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:43:34.220578Z","submitted_at":"2017-05-21T16:49:36Z","title":"Why are Big Data Matrices Approximately Low Rank?"},"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 2 inbound Pith citation observations for arXiv:1705.07474."}