{"as_of":"2026-08-08T13:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0828e9d0a6010f8e365afe61751f87bc08590648b7c5f689c3ad2bb33f498b7b","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:46:02.943626Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.02248/citation-record","integrity":"/paper/2507.02248/integrity","json":"/paper/2507.02248/citation-record.json","paper":"/paper/2507.02248"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.070696Z","title":null,"venue":null,"work_id":"e092427d-1a9a-4c6d-8984-f2dcd1d181bf","year":null},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.914022Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:f1f5898259638afcfd71eda5a74fefb4964e9f73a937353628ef3f439de1cac1","observation_id":"ec4649f3-e611-4707-8835-3b381930f5be","resolution":{"observed_at":"2026-08-06T20:46:03.073711Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1703.09179","last_updated":"2017-09-13T16:20:26Z","snapshot_observed_at":"2026-07-06T05:35:22.518259Z","submitted_at":"2017-03-27T16:48:03Z","title":"Transfer learning for music classification and regression tasks","version":4},"cited_work":{"arxiv_id":"1703.09179","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.09179","snapshot_observed_at":"2026-08-06T20:46:03.013903Z","title":"Transfer learning for music classification and regression tasks","venue":"cs.CV","work_id":"4c25bd5f-ed59-480e-b373-f94a07613ccb","year":2017},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.916838Z"},"links":{"cited_paper":"/paper/1703.09179","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:1f6e9e1396a0d09b84060c8625754d7d856aa4191e01f00a5dd7b16ece1942d3","observation_id":"985975d6-4997-4d3f-9026-2bd7380803d6","resolution":{"observed_at":"2026-08-06T20:46:03.017567Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.061333Z","title":null,"venue":null,"work_id":"859b4a36-eaae-428f-a82c-defee0e8fad7","year":2011},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.926809Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:204f9dc8e591aed208d8175721b1c6060865dd0bd5964f96c657aa0cead477d3","observation_id":"4b4d8bc6-0a12-4e69-9148-7c807320eca5","resolution":{"observed_at":"2026-08-06T20:46:03.064451Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.051626Z","title":null,"venue":null,"work_id":"6d752a07-2f43-4be4-89f8-d2e30a48f59f","year":2018},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.933581Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:673a2efdb4508158a397edb3dee808822b0be4291304e54131bd93f87a54f639","observation_id":"8465d63f-6716-4b09-80f7-a65c6d5e9092","resolution":{"observed_at":"2026-08-06T20:46:03.054999Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2401.12272","last_updated":"2024-01-22T16:24:04Z","snapshot_observed_at":"2026-07-06T17:19:00.228875Z","submitted_at":"2024-01-22T16:24:04Z","title":"Transfer Learning for Nonparametric Regression: Non-asymptotic Minimax Analysis and Adaptive Procedure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12272","snapshot_observed_at":"2026-08-06T20:46:02.910592Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.910592Z"},"links":{"cited_paper":"/paper/2401.12272","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:bf7836f90282fc3404a88163e3b40b718fbff9cfb3155757786ef90aa7c21429","observation_id":"aceb3654-e42c-45d4-9fb6-3f274be5be7e","resolution":{"observed_at":"2026-08-06T20:46:02.910592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04398","last_updated":"2024-10-06T08:30:37Z","snapshot_observed_at":"2026-07-06T19:28:35.110264Z","submitted_at":"2024-10-06T08:30:37Z","title":"Transfer Learning with General Estimating Equations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04398","snapshot_observed_at":"2026-08-06T20:46:02.940155Z","title":"Yan and S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.940155Z"},"links":{"cited_paper":"/paper/2410.04398","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:c2f1f374d770550daa316a4e0e2ad8dd2e11a5e0276b6fca09cffe15b9164191","observation_id":"5118f3a6-45e2-4049-a192-534eb5b99d6d","resolution":{"observed_at":"2026-08-06T20:46:02.940155Z","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-07T17:38:21.761745Z","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-06T20:31:39.014065Z","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:453f63584cf55a56a1799170538b5a5c149c0f24a2f8dc7d9279e9e7ecdcab39","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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.042649Z","title":"Weng and X","venue":null,"work_id":"fbbb2d64-cc96-4c3e-83f3-dbf009871cdb","year":2012},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.936938Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:3a586991d3324a5b8788557e5384ad976482f41af0eed051dceb5e046b6fec8c","observation_id":"49438a36-f360-46d5-bac5-a57f5cadbf26","resolution":{"observed_at":"2026-08-06T20:46:03.045853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.033119Z","title":null,"venue":null,"work_id":"23e5b1a3-279c-44db-aea1-fa82c47c8742","year":2011},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.943626Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:0a0e79096c4e1110c76a04b756bf5627aa9e8f3173da951bbd84d99ecddea24c","observation_id":"145904b9-a6e8-4a9b-9ef8-397c69f7239a","resolution":{"observed_at":"2026-08-06T20:46:03.036693Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2412.06233","last_updated":"2024-12-09T06:14:47Z","snapshot_observed_at":"2026-07-06T20:03:42.903210Z","submitted_at":"2024-12-09T06:14:47Z","title":"Representational Transfer Learning for Matrix Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06233","snapshot_observed_at":"2026-08-06T20:46:02.920269Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.920269Z"},"links":{"cited_paper":"/paper/2412.06233","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:067573bad1bf2bfbfe534ed93fa678f2cac011d773ddf4f5c0deb724cd8fd757","observation_id":"c67848cb-4602-41c8-9189-529074840eda","resolution":{"observed_at":"2026-08-06T20:46:02.920269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20605","last_updated":"2025-08-18T19:25:08Z","snapshot_observed_at":"2026-07-06T20:14:27.082070Z","submitted_at":"2024-12-29T22:26:16Z","title":"LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation","version":2},"cited_work":{"arxiv_id":"2412.20605","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.20605","snapshot_observed_at":"2026-08-06T20:46:02.977709Z","title":"LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation","venue":"stat.ME","work_id":"e669b15e-3e89-4d57-83ef-9b2a020c179e","year":2024},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.929955Z"},"links":{"cited_paper":"/paper/2412.20605","citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:c52070cc4e747076e33f14ae0fca4ac731431e13a5d626358e1f27da5d8add0d","observation_id":"2211776d-35e3-410c-b13a-75996a9213c3","resolution":{"observed_at":"2026-08-06T20:46:02.983685Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:46:03.079445Z","title":null,"venue":null,"work_id":"360c9def-6db3-4dfc-b0b4-2295ff7a51c4","year":1956},"citing_paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T20:46:02.906769Z"},"links":{"citing_paper":"/paper/2507.02248"},"observation_digest":"sha256:a6aca3ee57f059d8ba8675c08990e5059b136b0813703a4b9503a7836c27a832","observation_id":"0b4721ae-cfd2-41cf-8b42-087d26a10516","resolution":{"observed_at":"2026-08-06T20:46:03.082941Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2507.02248","last_updated":"2025-07-03T02:43:40Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T20:31:39.014065Z","submitted_at":"2025-07-03T02:43:40Z","title":"Transfer Learning for Matrix Completion"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":1},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2507.02248."}