{"as_of":"2026-08-14T23:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:137b8e5727e3797149c088538addf3857c527f4bafb754af1f661109bb3d0ff3","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-14T06:32:32.682623+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-07-13T02:15:06.475238Z","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-06-30T23:35:07.699097Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0805.4471","last_updated":"2008-05-29T05:29:56Z","snapshot_observed_at":"2026-08-14T13:28:54.558436Z","submitted_at":"2008-05-29T05:29:56Z","title":"Exact Matrix Completion via Convex Optimization","version":1},"cited_work":{"arxiv_id":"0805.4471","doi":null,"metadata_source":"pith","pith_arxiv_id":"0805.4471","snapshot_observed_at":"2026-06-30T23:35:07.699097Z","title":"Exact Matrix Completion via Convex Optimization","venue":"cs.IT","work_id":"f550e53a-5814-4512-88ec-5f92d12246d1","year":2008},"citing_paper":{"arxiv_id":"2605.07096","last_updated":"2026-06-04T16:41:18Z","snapshot_observed_at":"2026-08-11T14:16:50.544261Z","submitted_at":"2026-05-08T01:24:06Z","title":"Query-efficient model evaluation using cached responses","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T23:28:47.530333Z"},"links":{"cited_paper":"/paper/0805.4471","citing_paper":"/paper/2605.07096"},"observation_digest":"sha256:27f75402753bc59a630e08ea5035ddd8131b2141b36319a03a4a096464900d4e","observation_id":"1bcb9700-6150-4029-b9b4-22499caa019d","resolution":{"observed_at":"2026-06-30T23:35:07.700241Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0805.4471","last_updated":"2008-05-29T05:29:56Z","snapshot_observed_at":"2026-08-14T13:28:54.558436Z","submitted_at":"2008-05-29T05:29:56Z","title":"Exact Matrix Completion via Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0805.4471","snapshot_observed_at":"2026-07-13T02:15:06.475238Z","title":"CoRR abs/0805.4471(2008) 0805.4471","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09546","last_updated":"2026-07-10T15:57:02Z","snapshot_observed_at":"2026-08-14T13:29:40.537447Z","submitted_at":"2026-07-10T15:57:02Z","title":"Graph-Regularized Low-Rank Matrix Completion by Variable Projection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T02:15:06.475238Z"},"links":{"cited_paper":"/paper/0805.4471","citing_paper":"/paper/2607.09546"},"observation_digest":"sha256:7ec0ebca54501e1e601041c72e979f8ce51ae962287622a813403e4aacf05b4a","observation_id":"750aaaa0-db7d-43e6-a559-daecec97d653","resolution":{"observed_at":"2026-07-13T02:15:06.475238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/0805.4471/citation-record","integrity":"/paper/0805.4471/integrity","json":"/paper/0805.4471/citation-record.json","paper":"/paper/0805.4471"},"outbound":[],"paper":{"arxiv_id":"0805.4471","last_updated":"2008-05-29T05:29:56Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T13:28:54.558436Z","submitted_at":"2008-05-29T05:29:56Z","title":"Exact Matrix Completion via Convex Optimization"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0805.4471."}