{"as_of":"2026-08-11T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9aca5e8b92f960afb002c174fc032ebb87879016dd629b0195ba12ada059c723","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-11T06:34:44.6726+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-10T23:25:15.794825Z","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-08-06T20:46:02.992822Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.00174","last_updated":"2025-02-28T20:40:00Z","snapshot_observed_at":"2026-08-10T10:48:55.222926Z","submitted_at":"2025-02-28T20:40:00Z","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00174","snapshot_observed_at":"2026-08-10T23:25:15.794825Z","title":"Optimal transfer learning for missing not-at-random matrix completion","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.20605","last_updated":"2025-08-18T19:25:08Z","snapshot_observed_at":"2026-08-11T06:11:56.855010Z","submitted_at":"2024-12-29T22:26:16Z","title":"LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T23:25:15.794825Z"},"links":{"cited_paper":"/paper/2503.00174","citing_paper":"/paper/2412.20605"},"observation_digest":"sha256:9d5413ab79b3d75980430f1f44caa8d86e8a9290d0a432d23ac4654e13c17a12","observation_id":"43088fcd-bba5-47e4-8b27-0c5d69854257","resolution":{"observed_at":"2026-08-10T23:25:15.794825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00174","last_updated":"2025-02-28T20:40:00Z","snapshot_observed_at":"2026-08-10T10:48:55.222926Z","submitted_at":"2025-02-28T20:40:00Z","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","version":1},"cited_work":{"arxiv_id":"2503.00174","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.00174","snapshot_observed_at":"2026-08-06T20:46:02.992822Z","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","venue":"cs.LG","work_id":"03dcd22f-6d81-40d0-9973-40b75ec1983b","year":2025},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-10T10:48:38.785437Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.923475Z"},"links":{"cited_paper":"/paper/2503.00174","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:aff1a50fc2183a17f0c49eca6b88fb1a34a8d3af026ecea212088befb779c01d","observation_id":"91b95c31-71aa-4936-bb16-ff8d46f74382","resolution":{"observed_at":"2026-08-06T20:46:02.996436Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.00174/citation-record","integrity":"/paper/2503.00174/integrity","json":"/paper/2503.00174/citation-record.json","paper":"/paper/2503.00174"},"outbound":[],"paper":{"arxiv_id":"2503.00174","last_updated":"2025-02-28T20:40:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T10:48:55.222926Z","submitted_at":"2025-02-28T20:40:00Z","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.00174."}