{"as_of":"2026-08-07T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b41f266858d28969ee8682cdbc8d696e423e5240b80619d500a56080230c441","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:39:03.758616Z","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-07-03T02:17:35.261851Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":"2303.17765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-07-03T02:17:35.261851Z","title":"Learning from similar linear representations: Adaptivity, minimaxity, and robustness","venue":null,"work_id":"86ce3eda-762f-42b9-b46b-99bfe6e6333c","year":2023},"citing_paper":{"arxiv_id":"2409.02708","last_updated":"2026-05-13T15:34:31Z","snapshot_observed_at":"2026-08-02T18:21:57.809442Z","submitted_at":"2024-09-04T13:44:22Z","title":"Few-shot Multi-Task Learning of Linear Invariant Features with Meta Subspace Pursuit","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-23T20:52:48.702423Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2409.02708"},"observation_digest":"sha256:ee67b6bc475601bac5745045191e446d6d36b664859ecab51caff231f52bd3ca","observation_id":"54fd2c52-f0c7-4a6e-8367-ff37fe9f186a","resolution":{"observed_at":"2026-05-23T20:53:25.613392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-08-06T18:39:03.758616Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07941","last_updated":"2025-07-10T17:27:04Z","snapshot_observed_at":"2026-08-06T18:26:28.535022Z","submitted_at":"2025-07-10T17:27:04Z","title":"Late Fusion Multi-task Learning for Semiparametric Inference with Nuisance Parameters","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:39:03.758616Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2507.07941"},"observation_digest":"sha256:189d5bc73856af2de3acb7b566bee2ffe9f373452bb27077d275918604554fe7","observation_id":"1576a90e-fee5-4a16-8c0a-5cc82a3f4ce6","resolution":{"observed_at":"2026-08-06T18:39:03.758616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-08-04T19:18:48.876289Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09371","last_updated":"2026-07-19T17:07:43Z","snapshot_observed_at":"2026-08-04T19:18:43.472963Z","submitted_at":"2025-09-11T11:42:17Z","title":"Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Framework","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T19:18:48.876289Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2509.09371"},"observation_digest":"sha256:fc5601541fa57cec4adce817df1c9007e1ee497a4f8c98cd06400e19bf85c23d","observation_id":"13f0cb10-8f2f-49e2-a6f9-d4740b3aab6d","resolution":{"observed_at":"2026-08-04T19:18:48.876289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":"2303.17765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-07-03T02:17:35.261851Z","title":"Learning from similar linear representations: Adaptivity, minimaxity, and robustness","venue":null,"work_id":"86ce3eda-762f-42b9-b46b-99bfe6e6333c","year":2023},"citing_paper":{"arxiv_id":"2604.25845","last_updated":"2026-04-28T16:51:50Z","snapshot_observed_at":"2026-08-02T22:55:00.311841Z","submitted_at":"2026-04-28T16:51:50Z","title":"Model-agnostic information transfer and fusion for classification with label noise","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T15:28:44.884377Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2604.25845"},"observation_digest":"sha256:444036c7c50f692228af811f29f140916310480731283b5a8d3bca71a6f173f8","observation_id":"dee2d969-9a3e-4383-bfd4-c5565b1e2d39","resolution":{"observed_at":"2026-05-12T00:21:22.747582Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":"2303.17765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-07-03T02:17:35.261851Z","title":"Learning from similar linear representations: Adaptivity, minimaxity, and robustness","venue":null,"work_id":"86ce3eda-762f-42b9-b46b-99bfe6e6333c","year":2023},"citing_paper":{"arxiv_id":"2606.08981","last_updated":"2026-06-08T03:26:58Z","snapshot_observed_at":"2026-08-01T16:35:33.055973Z","submitted_at":"2026-06-08T03:26:58Z","title":"Divide-and-shrink: An efficient and heterogeneity-agnostic approach for transfer estimation using summary statistics","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-27T15:58:59.501627Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2606.08981"},"observation_digest":"sha256:4da8e074041982bca4fde2ff49cd7b00a7afd20b3ef85e189f46918a4bc4fa1b","observation_id":"f24317e2-c295-4ed1-aef2-a2a3e2bc99dd","resolution":{"observed_at":"2026-07-03T02:17:35.263274Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-07-12T07:46:03.995262Z","title":"arXiv preprint arXiv:2303.17765 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02681","last_updated":"2026-07-02T18:23:41Z","snapshot_observed_at":"2026-08-04T01:36:35.474781Z","submitted_at":"2026-07-02T18:23:41Z","title":"Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms","version":1},"reference_index":300,"source":"arxiv_source","source_observed_at":"2026-07-12T07:46:03.995262Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2607.02681"},"observation_digest":"sha256:3eef137f6f3222966bc88d5b67aa27cb23b4029648630e120fe4446fa3bf5ffc","observation_id":"50c993a8-f356-4547-999e-466b8b31c0ba","resolution":{"observed_at":"2026-07-12T07:46:03.995262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17765","snapshot_observed_at":"2026-07-31T23:10:34.874068Z","title":"arXiv preprint arXiv:2303.17765 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24115","last_updated":"2026-07-27T07:56:56Z","snapshot_observed_at":"2026-08-07T04:58:49.685706Z","submitted_at":"2026-07-27T07:56:56Z","title":"On Non-Stationary Dynamic Pricing: Adaptivity and Optimality","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T23:10:34.874068Z"},"links":{"cited_paper":"/paper/2303.17765","citing_paper":"/paper/2607.24115"},"observation_digest":"sha256:c51a9ae624e6739162c36ecae123f69329c186832ee1ae223bac61c6dc500ac7","observation_id":"0e13eba1-e843-46be-9f8c-5e81c9a23091","resolution":{"observed_at":"2026-07-31T23:10:34.874068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.17765/citation-record","integrity":"/paper/2303.17765/integrity","json":"/paper/2303.17765/citation-record.json","paper":"/paper/2303.17765"},"outbound":[],"paper":{"arxiv_id":"2303.17765","last_updated":"2025-07-06T20:36:55Z","latest_version":5,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T15:10:22.960066Z","submitted_at":"2023-03-31T01:56:13Z","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2303.17765."}