{"as_of":"2026-08-10T04:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:413ca50cd549b34fb5446188dd87f3f848c26954af1d9f60e4fcf07d147e2ab8","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":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":24,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T22:07:19.822306Z","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-05-24T23:45:06.096833Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"1907.04805","last_updated":"2019-07-10T15:53:07Z","snapshot_observed_at":"2026-08-02T17:51:25.264339Z","submitted_at":"2019-07-10T15:53:07Z","title":"Quantifying Error in the Presence of Confounders for Causal Inference","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T23:43:26.320712Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/1907.04805"},"observation_digest":"sha256:ab7eac2589a83631976eb30d6f63bc613da97fdc2d730aa161c1ce6e0075648b","observation_id":"cbfe9c08-2933-472f-b2de-2dab5da33be6","resolution":{"observed_at":"2026-05-24T23:45:06.100073Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-09T22:07:19.822306Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-09T21:57:29.774118Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.822306Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:1b56bc8821cdaedc0e6d29445e8428147f772dbd79c90e68752f223e4226482a","observation_id":"6af6a658-1e63-4fe2-ba24-732d35bd06ca","resolution":{"observed_at":"2026-08-09T22:07:19.822306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-08T20:58:04.045264Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.04949","last_updated":"2025-05-20T07:32:07Z","snapshot_observed_at":"2026-08-08T20:50:08.930698Z","submitted_at":"2025-02-07T14:13:51Z","title":"Does Unsupervised Domain Adaptation Improve the Robustness of Amortized Bayesian Inference? A Systematic Evaluation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T20:58:04.045264Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2502.04949"},"observation_digest":"sha256:025cf79faf553140109a33da87ff0ec331f3f0341ecf53000f7beea053ff2779","observation_id":"cbff4516-464b-4687-b40f-b15601b44d84","resolution":{"observed_at":"2026-08-08T20:58:04.045264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T15:42:27.225168Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14083","last_updated":"2025-05-20T08:41:24Z","snapshot_observed_at":"2026-08-09T13:39:53.072710Z","submitted_at":"2025-05-20T08:41:24Z","title":"Computational Efficiency under Covariate Shift in Kernel Ridge Regression","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:27.225168Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2505.14083"},"observation_digest":"sha256:d727fc9d702c028b3d70c0b97ae76584a83ed6761470234a5d56be95c1683c29","observation_id":"31780883-f6ca-4c98-ae2e-04a56342927f","resolution":{"observed_at":"2026-08-07T15:42:27.225168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T13:55:27.160532Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.20970","last_updated":"2025-06-12T06:21:35Z","snapshot_observed_at":"2026-08-09T13:38:53.401298Z","submitted_at":"2025-05-27T10:04:00Z","title":"Measuring Representational Shifts in Continual Learning: A Linear Transformation Perspective","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T13:55:27.160532Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2505.20970"},"observation_digest":"sha256:9f52a2ff8cf4499c48800e9f9b79327798021a3351621f8e77a7edbf08a16b70","observation_id":"d5ee8f53-8ef7-493a-a06e-f6b87a8640a0","resolution":{"observed_at":"2026-08-07T13:55:27.160532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T13:42:12.443220Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21363","last_updated":"2025-07-14T00:36:39Z","snapshot_observed_at":"2026-08-09T13:40:37.589876Z","submitted_at":"2025-05-27T15:52:58Z","title":"Subgroups Matter for Robust Bias Mitigation","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T13:42:12.443220Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2505.21363"},"observation_digest":"sha256:1527461f5fb5e2da869b2048e2b392066ea07dce73b2a45181485104e764a13b","observation_id":"b25bc6d7-d8dc-4a2d-97a9-54cd21cd1f2d","resolution":{"observed_at":"2026-08-07T13:42:12.443220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T13:23:17.886810Z","title":"Domain adaptation: Learning bounds and algorithms,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.22099","last_updated":"2025-05-28T08:24:43Z","snapshot_observed_at":"2026-08-09T11:36:11.797513Z","submitted_at":"2025-05-28T08:24:43Z","title":"On the Transferability and Discriminability of Repersentation Learning in Unsupervised Domain Adaptation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:23:17.886810Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2505.22099"},"observation_digest":"sha256:44d71a9ae7f95ae185b6444df12c851dc0aeced542e4e21b414f7f574d38e2c4","observation_id":"2b1e2d32-60ce-467f-aef2-4ede4053c6cd","resolution":{"observed_at":"2026-08-07T13:23:17.886810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T13:07:12.935573Z","title":"Domain adaptation: Learning bounds and al- gorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23165","last_updated":"2025-05-29T06:58:49Z","snapshot_observed_at":"2026-08-09T13:40:11.410845Z","submitted_at":"2025-05-29T06:58:49Z","title":"Best Arm Identification with Possibly Biased Offline Data","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:12.935573Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2505.23165"},"observation_digest":"sha256:4f98a442e48f2d6c74e837bb337dec7414e002b13ac147848cb032aa483af430","observation_id":"9481205b-e373-49c5-82f5-0a4e7dcd13b4","resolution":{"observed_at":"2026-08-07T13:07:12.935573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-07T05:32:23.040252Z","title":"Domain adaptation: Learning bounds and algorithms.arXiv preprint arXiv:0902.3430,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07769","last_updated":"2025-06-09T13:46:10Z","snapshot_observed_at":"2026-08-09T13:40:48.780770Z","submitted_at":"2025-06-09T13:46:10Z","title":"Clustered Federated Learning via Embedding Distributions","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T05:32:23.040252Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2506.07769"},"observation_digest":"sha256:7f1569ef14ac6bcc04ca9a15446b229ce47060529328f3d82f4da4483e21c6c4","observation_id":"2df69bac-029e-42b8-a26c-3ad6bd9e8518","resolution":{"observed_at":"2026-08-07T05:32:23.040252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T22:40:16.219111Z","title":"Domain adaptation: Learning bounds and algorithms,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.21165","last_updated":"2025-06-26T11:53:59Z","snapshot_observed_at":"2026-08-09T13:40:14.099626Z","submitted_at":"2025-06-26T11:53:59Z","title":"Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:40:16.219111Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2506.21165"},"observation_digest":"sha256:0cd1722b4701ad809a3fedb7a94d15936d6d74e2d93cacaffb8aabb076eb9ce3","observation_id":"28549a2c-7a88-4722-82f4-9cadd45fa681","resolution":{"observed_at":"2026-08-06T22:40:16.219111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T21:19:14.080173Z","title":"Mohri, and A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.00889","last_updated":"2025-07-01T15:55:27Z","snapshot_observed_at":"2026-08-09T13:40:39.694925Z","submitted_at":"2025-07-01T15:55:27Z","title":"Phase Transition in Nonparametric Minimax Rates for Covariate Shifts on Approximate Manifolds","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T21:19:14.080173Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2507.00889"},"observation_digest":"sha256:bdd2f8a450363b766ae9319f7f8039044d7f7c16627e5cda0347cfe5fc49c0af","observation_id":"569ce701-0b4e-48db-acc8-540baf285871","resolution":{"observed_at":"2026-08-06T21:19:14.080173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T20:02:30.745648Z","title":"Domain adaptation: Learning bounds and algo- rithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.04194","last_updated":"2025-07-06T00:03:34Z","snapshot_observed_at":"2026-08-09T13:40:49.065307Z","submitted_at":"2025-07-06T00:03:34Z","title":"Mixed-Sample SGD: an End-to-end Analysis of Supervised Transfer Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:02:30.745648Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2507.04194"},"observation_digest":"sha256:386dbb6c2132d02192df3e9ab0590b1307bc7bc0746d4af203766c6b150ae280","observation_id":"44f7e6a2-fae2-4885-9516-c65a429bf70e","resolution":{"observed_at":"2026-08-06T20:02:30.745648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T15:27:22.587873Z","title":"Mansour, M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.16859","last_updated":"2026-06-17T14:33:23Z","snapshot_observed_at":"2026-08-09T13:40:13.637858Z","submitted_at":"2025-07-21T17:22:18Z","title":"Enhancing Fatigue Detection through Heterogeneous Multi-Source Data Integration and Cross-Domain Modality Imputation","version":5},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T15:27:22.587873Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2507.16859"},"observation_digest":"sha256:bf4085720b79d7bcf2aa72795ac606ce0a7097e4f810cf5429b22607e4c4c8cf","observation_id":"e8adc932-6f43-457c-8189-c16732318cad","resolution":{"observed_at":"2026-08-06T15:27:22.587873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-04T21:33:24.040136Z","title":"Domain adaptation: Learning bounds and algorithms.CoRR, abs/0902.3430, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.07955","last_updated":"2025-09-09T17:43:05Z","snapshot_observed_at":"2026-08-04T21:33:17.673048Z","submitted_at":"2025-09-09T17:43:05Z","title":"ACE and Diverse Generalization via Selective Disagreement","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T21:33:24.040136Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2509.07955"},"observation_digest":"sha256:8ada05453a38a8a6c6443e12e28805e73919efd94b9ba1853c990c4b219b8ca0","observation_id":"958cd435-629c-445e-807e-0b77ef17da02","resolution":{"observed_at":"2026-08-04T21:33:24.040136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2602.18679","last_updated":"2026-04-12T07:14:48Z","snapshot_observed_at":"2026-07-06T22:46:35.212918Z","submitted_at":"2026-02-21T01:03:15Z","title":"Transformers for dynamical systems learn transfer operators in-context","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-15T20:19:10.613541Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2602.18679"},"observation_digest":"sha256:722a0a8bf88126e4524ee93365f0111523d5a78b3cc4fbe1204b025365c409f6","observation_id":"9a042263-49c4-4283-8830-8179dd6f09b9","resolution":{"observed_at":"2026-05-15T20:20:17.461053Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2604.14090","last_updated":"2026-04-15T17:06:25Z","snapshot_observed_at":"2026-07-06T23:01:55.698452Z","submitted_at":"2026-04-15T17:06:25Z","title":"From Weights to Activations: Is Steering the Next Frontier of Adaptation?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T12:52:58.193141Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2604.14090"},"observation_digest":"sha256:2c0fd0533e73e794951c690431404922466cfd5847c16808b721ada0f2eb7b94","observation_id":"b3bab9e1-470a-4492-836e-ca402ed8bcd0","resolution":{"observed_at":"2026-05-10T12:55:24.630408Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2605.00906","last_updated":"2026-04-29T02:54:33Z","snapshot_observed_at":"2026-08-03T01:43:45.088258Z","submitted_at":"2026-04-29T02:54:33Z","title":"Generalized Category Discovery under Domain Shifts: From Vision to Vision-Language Models","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:20.864444Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2605.00906"},"observation_digest":"sha256:63d966a3c95acd5e1f122be07f578776dc3d27e564befaa9ea7500c9a380e54c","observation_id":"4d69bd2d-f04b-4996-aaea-881c8b4ca873","resolution":{"observed_at":"2026-05-11T15:16:11.107354Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2605.09183","last_updated":"2026-05-16T18:02:16Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-09T21:48:04Z","title":"Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-12T03:27:41.845716Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2605.09183"},"observation_digest":"sha256:f5843025ae3d1a60cbec0a9fa0825932ef865f01b98739c36ad6d4c9828d6630","observation_id":"7553708b-914b-41ab-9149-8c5cd7be24d8","resolution":{"observed_at":"2026-05-12T07:21:25.323129Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2605.09183","last_updated":"2026-05-16T18:02:16Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-09T21:48:04Z","title":"Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-20T22:04:57.245024Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2605.09183"},"observation_digest":"sha256:63fb1fde89b4c04ccf7e60600fd60edb992efd5da9912de0668a9fcc6706963d","observation_id":"113ca521-dcf3-4100-8af5-37f0d3b2a36e","resolution":{"observed_at":"2026-05-20T22:09:07.596724Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2605.11806","last_updated":"2026-05-12T09:00:26Z","snapshot_observed_at":"2026-07-06T23:23:34.924221Z","submitted_at":"2026-05-12T09:00:26Z","title":"Adaptive Kernel Ridge Regression with Linear Structure: Sharp Oracle Inequalities and Minimax Optimality","version":1},"reference_index":139,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:28.262509Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2605.11806"},"observation_digest":"sha256:083a9b9b5394a052462a53224ad040640693832a9f5396f8bbd0126ebd3bb771","observation_id":"08d34ace-8d5f-4eab-a170-50ab8cdad6a2","resolution":{"observed_at":"2026-05-13T04:57:17.811846Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":"0902.3430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"c1103ff0-fec9-4fc0-be2e-04fba067ad1a","year":2009},"citing_paper":{"arxiv_id":"2605.12803","last_updated":"2026-05-12T22:53:03Z","snapshot_observed_at":"2026-07-06T23:24:27.821980Z","submitted_at":"2026-05-12T22:53:03Z","title":"Pitfalls of Unlabeled Disagreement-Based Drift Detection in Streaming Tree Ensembles","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-14T20:32:12.744422Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2605.12803"},"observation_digest":"sha256:001330a330e0ed2cf10dc607a770d13ecb993bbd7aa2886845ccabdd7d9e7618","observation_id":"7c8644b0-ecdd-4a19-a25c-afe7822e0a09","resolution":{"observed_at":"2026-05-14T20:32:56.546502Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T18:10:14.750205Z","title":"Domain adaptation: Learning bounds and algorithms.arXiv preprint arXiv:0902.3430, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.04720","last_updated":"2026-08-07T05:16:40Z","snapshot_observed_at":"2026-08-10T04:23:34.182026Z","submitted_at":"2026-08-05T11:39:06Z","title":"YOLOv14: Adaptive Real-Time Object Detection for Diverse Imaging Conditions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:14.750205Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2608.04720"},"observation_digest":"sha256:b44ee1123b757aa16088cb3fb70d5e9bed17df1cc4b5d0e5471fbdb19253624d","observation_id":"c99a2ecb-1c2b-42dc-9dcf-b629ae709e9e","resolution":{"observed_at":"2026-08-06T18:10:14.750205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-06T14:53:47.163424Z","title":"arXiv preprint arXiv:0902.3430 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04860","last_updated":"2026-08-06T01:11:45Z","snapshot_observed_at":"2026-08-09T23:10:10.455831Z","submitted_at":"2026-08-05T13:51:43Z","title":"Nonparametric Goodness-of-fit Testing under Covariate Shift","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:53:47.163424Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2608.04860"},"observation_digest":"sha256:8bc6515dbb51b20e12fc0bdc69b8604f65c68492dc56bb1f66d6fe4dee837291","observation_id":"ec45fb42-8b33-4a96-9cd5-53a3755cb8d2","resolution":{"observed_at":"2026-08-06T14:53:47.163424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-08T17:40:03.491642Z","title":"arXiv preprint arXiv:0902.3430 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04860","last_updated":"2026-08-06T01:11:45Z","snapshot_observed_at":"2026-08-09T23:10:10.455831Z","submitted_at":"2026-08-05T13:51:43Z","title":"Nonparametric Goodness-of-fit Testing under Covariate Shift","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T17:40:03.491642Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2608.04860"},"observation_digest":"sha256:6c1044b127ee4468299b047c72e3ac564487f894ff7fd0264761e37f94cd28e7","observation_id":"27e0666c-9ee9-4d84-a3c9-ea6612f3577f","resolution":{"observed_at":"2026-08-08T17:40:03.491642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/0902.3430/citation-record","integrity":"/paper/0902.3430/integrity","json":"/paper/0902.3430/citation-record.json","paper":"/paper/0902.3430"},"outbound":[],"paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T13:39:30.582087Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 24 inbound Pith citation observations for arXiv:0902.3430."}