{"as_of":"2026-08-10T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6fe86d9c9866cadf2d38baf5306b4f16cceeb9a81c0535446c422374f605175e","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:13:37.869556Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.06552/citation-record","integrity":"/paper/2507.06552/integrity","json":"/paper/2507.06552/citation-record.json","paper":"/paper/2507.06552"},"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-06T19:13:43.637659Z","title":"f-domain adversarial learning: Theory and algorithms","venue":null,"work_id":"dd2d642a-baeb-45bd-8a89-6de34bf0d7c6","year":2021},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:33.681057Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:ed5f5e11091ea10c3efacd6996efcbd790f96bd1a9c56705418fe9f625bd4980","observation_id":"c70f844f-b35e-42d6-af84-c4fcf7e68ed9","resolution":{"observed_at":"2026-08-06T19:13:43.820751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:43.377688Z","title":"A model of inductive bias learning","venue":null,"work_id":"5f4da382-dec9-4ed7-b07e-b58a3e8ac393","year":2000},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:33.843332Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:5b81f64bfdf799b0039fc0065c9271c05caa89e3f1ee8964e54a674e77f9a554","observation_id":"a7b71a5b-affb-4572-b917-cb1bec9846bc","resolution":{"observed_at":"2026-08-06T19:13:43.433760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:43.217855Z","title":"On the hardness of domain adaptation and the utility of unlabeled target samples","venue":null,"work_id":"33ae6b67-d17a-4e62-802a-bf071eb0b396","year":2012},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.014342Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:267e139aa4e6532c12baf6174a7f82ee25c43dc3abf2425783023bc663c1ef12","observation_id":"e40ec06f-16c0-4911-a51d-e14f5964acc6","resolution":{"observed_at":"2026-08-06T19:13:43.289599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:43.096416Z","title":"Domain adaptation--can quantity compensate for quality? Annals of Mathematics and Artificial Intelligence, 70: 0 185--202, 2014","venue":null,"work_id":"b9547aa2-a9f3-40c5-8481-092e83163628","year":2014},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.163856Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:d69c56df3d2f02ee30f0a04cddd126c19ea305231593d469d382732c2a22fc5a","observation_id":"6d9028f7-b7f0-46ad-9f71-10336461ef05","resolution":{"observed_at":"2026-08-06T19:13:43.145922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:34.335970Z","title":"Analysis of representations for domain adaptation","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.335970Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:3bb9919d4405bb78e81e264918b4c4063a9326d3132a03a12c0ab386955341ba","observation_id":"e4092aa2-12e5-45aa-88cc-68afa273875d","resolution":{"observed_at":"2026-08-06T19:13:34.335970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:42.938420Z","title":"A theory of learning from different domains","venue":null,"work_id":"cb569012-1c49-44b7-828b-3e352c020a00","year":2010},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.483827Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:21b6c0161b9bd99fd81c9b2265d652af4dd5d3fe0cbfb5c6566d7dafe6f4d33b","observation_id":"67dd3507-bcfb-401d-a230-183586a31a45","resolution":{"observed_at":"2026-08-06T19:13:43.034751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:42.788418Z","title":"Learning bounds for domain adaptation","venue":null,"work_id":"cf4dc77e-ff8e-49de-8466-5df43534450a","year":2007},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.621081Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:2aaa8557ee368982a569471612e9b4a44766d4549be4cd2741628d8149dbf51c","observation_id":"f12033cd-2300-4209-b514-aecf50efb7ef","resolution":{"observed_at":"2026-08-06T19:13:42.853302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:42.664014Z","title":"Learning bounds for importance weighting","venue":null,"work_id":"ab3ed2b9-e615-40c3-9fd5-0cf0eb25e4e9","year":2010},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.807842Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:0c9cdf4e4da2322f93a01622bf1984740329311ee22a451865f5c6f340be3cd5","observation_id":"e67010d0-42a6-4b6d-bf17-95201146a2de","resolution":{"observed_at":"2026-08-06T19:13:42.709674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:34.958980Z","title":"Elements of information theory","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:34.958980Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:8959783ac0b13272a96b31ef385e01a57e139c33260f68902d9c26e130b5c567","observation_id":"d2c7b4c9-00d4-46f8-9376-01dd35f21655","resolution":{"observed_at":"2026-08-06T19:13:34.958980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:42.495036Z","title":"Eine information’s theoretische ungleichung und ihre anwendung auf den beweis der ergodizitat von markoschen ketten, magyar tud","venue":null,"work_id":"a267b77c-a34d-4044-97b7-64f2c0a09d8d","year":1963},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.110747Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:fa468eb54f707b50608dfba8cc9d82fe433ba9f33f947c7619533b3b122c8437","observation_id":"927f3974-77eb-4054-a256-badc7ea9038d","resolution":{"observed_at":"2026-08-06T19:13:42.551325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:42.352685Z","title":"The value of out-of-distribution data","venue":null,"work_id":"8e923937-beec-4117-ac09-56f892060b7a","year":2023},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.229924Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:b8b299d080239c7807b8706f61bbb13ded318e3eb44e7cee3e0174345233e01e","observation_id":"f59e820a-1f25-43e2-b586-bbe0357e808a","resolution":{"observed_at":"2026-08-06T19:13:42.423854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:42.184863Z","title":"Class notes for course 6.574: Transmission of information","venue":null,"work_id":"ab59a3fe-32c6-4dc9-aa5b-1167d8b5d6f5","year":1952},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.284699Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:9ac4bb3199ca790c444ee36996d89b4ee7afb16d69712ed67df1d72897c30109","observation_id":"b31d7916-fadf-4c90-a938-3096736a1350","resolution":{"observed_at":"2026-08-06T19:13:42.265495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:42.016923Z","title":"Unsupervised domain adaptation by backpropagation","venue":null,"work_id":"51f0df04-c9a9-43bb-8139-cbac9f89a248","year":2015},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.375904Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:6a175febb2ab423a7f6f824febed9f694a90bcacdb60097b002178ce97034388","observation_id":"ba5b2c5d-0ca7-4d4e-8e67-39a08b9efbec","resolution":{"observed_at":"2026-08-06T19:13:42.094321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.875914Z","title":"Ghosh, and Aad W","venue":null,"work_id":"511a1832-7455-4ce4-acea-5ec6c9cd7544","year":2000},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.454212Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:3c65526b288711f036e457a7ec5e7768acc2a865475f20f1863881d1dcd6da9d","observation_id":"c5ac5a2f-ad8f-46cb-83ca-7b663f728afa","resolution":{"observed_at":"2026-08-06T19:13:41.930096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.729972Z","title":"On the value of target data in transfer learning","venue":null,"work_id":"eac7ef61-78b9-465f-a5ad-5fbf9dbdcd63","year":2019},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.556376Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:37e5f7b5a7e4fe8c96761a9c602f0a54915d64cf13af1cc18f6a5fff61badb5b","observation_id":"dfc33a29-55c7-46d8-bfd8-db2ad85c929b","resolution":{"observed_at":"2026-08-06T19:13:41.791545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.597499Z","title":"Algorithms and theory for multiple-source adaptation","venue":null,"work_id":"80ead9c9-fd8b-4a0e-a2a6-9b4579d41475","year":2018},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.646555Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:aa2842a0f83490b62687e697060f8431e888a697ae71d25465fc643f68b259d2","observation_id":"1cb3fb59-0ee0-48ce-a23d-1b878f95777c","resolution":{"observed_at":"2026-08-06T19:13:41.657842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.468401Z","title":"Correcting sample selection bias by unlabeled data","venue":null,"work_id":"6e89258d-3528-4224-9e1e-4cc9d0e5df59","year":2006},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.745634Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:a749e5970c847e9c860512bd769e4ab2709831680415379c065a396b72e73495","observation_id":"a0d4d770-fa09-4140-ad77-4d819660e714","resolution":{"observed_at":"2026-08-06T19:13:41.527408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.320480Z","title":"Unsupervised domain adaptation based on source-guided discrepancy","venue":null,"work_id":"dabc20f2-e69c-450f-be7e-4041af68ceb0","year":2019},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.839312Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:31ccdd2fe6472038b19cf60b1042c6c2f3061eb6cfa678c4737de5b27f22ce6e","observation_id":"e40827e3-5dfa-4206-9a9c-6772d763651e","resolution":{"observed_at":"2026-08-06T19:13:41.388164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.194316Z","title":"Coupled generative adversarial networks","venue":null,"work_id":"957855fb-4aa8-4158-b0b6-3bf16d9a9703","year":2016},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.918327Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:cd021fd57becf10d3587a11452361a1a2f92a6ea2c8a3c1c73dce7dfb7af5a74","observation_id":"f498d22c-de05-4972-8dfd-6a73a6f39a7a","resolution":{"observed_at":"2026-08-06T19:13:41.251392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:41.071674Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"9ae1dbb9-a051-4b76-8a93-7516ecd8099a","year":2009},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:35.994075Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:188e4a194a8eb8e70c4f4bcc0982979f48a1be093e13cc19beb7bc669dfa4344","observation_id":"60f80765-787f-4ec7-8534-122daabeaf5d","resolution":{"observed_at":"2026-08-06T19:13:41.112499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2628","last_updated":"2012-05-09T17:15:45Z","snapshot_observed_at":"2026-08-08T12:46:29.170301Z","submitted_at":"2012-05-09T17:15:45Z","title":"Multiple Source Adaptation and the Renyi Divergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2628","snapshot_observed_at":"2026-08-06T19:13:36.072642Z","title":"Multiple source adaptation and the r \\'e nyi divergence","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.072642Z"},"links":{"cited_paper":"/paper/1205.2628","citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:4bdef68b1905998de85eb0d763e07be8ddee12e8dfd802f16dfcfe85b79f2d60","observation_id":"a857e9e3-52b1-4f17-809a-56bda5ea20a0","resolution":{"observed_at":"2026-08-06T19:13:36.072642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:36.187088Z","title":"Some pac-bayesian theorems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.187088Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:00a94c3a5b21de0f78aef5c68c018ea53557af7fc28a006de67c0b1b8a922c07","observation_id":"ac252a57-a5fe-4828-9a29-6cdb9a45ecb4","resolution":{"observed_at":"2026-08-06T19:13:36.187088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:40.869650Z","title":"New analysis and algorithm for learning with drifting distributions","venue":null,"work_id":"be986aa1-1c22-4b68-aaa0-d534a61b46f0","year":2012},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.271530Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:40a27570cfb7ef032888c5c0d1a0444074e346571c5f4cb644a071394bd0eff6","observation_id":"6f880ff2-045d-48d1-9e92-b8a08f57cd02","resolution":{"observed_at":"2026-08-06T19:13:40.956367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07780","last_updated":"2022-03-14T16:02:24Z","snapshot_observed_at":"2026-08-06T01:29:06.514195Z","submitted_at":"2021-06-14T22:24:23Z","title":"KL Guided Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.07780","snapshot_observed_at":"2026-08-06T19:13:36.352742Z","title":"Kl guided domain adaptation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.352742Z"},"links":{"cited_paper":"/paper/2106.07780","citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:1c5ec37e2ccc1ffbe00e4d490eb5981d7bb5f507a976d4c9c0f1397d68d8da89","observation_id":"d1a6b658-7067-418e-89f3-38c5b267efa5","resolution":{"observed_at":"2026-08-06T19:13:36.352742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:40.668896Z","title":"Statistical aspects of wasserstein distances","venue":null,"work_id":"cf3c595b-80e7-48ff-99a2-f99a66fdf35d","year":2019},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.458296Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:7a18de4547ddc278f945ea4040fff33e7d97c37d44e206a101e9a3d98c5e853d","observation_id":"50debcdb-63c2-4a60-98e6-a15f0599675c","resolution":{"observed_at":"2026-08-06T19:13:40.778479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:40.232511Z","title":"A pac analysis of a bayesian estimator","venue":null,"work_id":"0e18ad7f-1383-440f-850f-49de5176ad24","year":1997},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.549083Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:6d31b32046daa2d1f3af6eaa3466b9b3c9d47dd9bb430af5e7b108805286b65c","observation_id":"2595e68e-0fa1-44d1-b457-9185dddce85f","resolution":{"observed_at":"2026-08-06T19:13:40.447985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:39.899700Z","title":"Wasserstein distance guided representation learning for domain adaptation","venue":null,"work_id":"27e1b1a6-ffe7-40f2-a058-5731ed8db0c3","year":2018},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.649606Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:3e4d954113f370b2e1e2489d1a5afccaa169eda1b94a7c2dc86f84a617b7601d","observation_id":"57752e0d-885d-4e2a-a19c-37e12534b151","resolution":{"observed_at":"2026-08-06T19:13:40.089042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:39.528120Z","title":"Improving predictive inference under covariate shift by weighting the log-likelihood function","venue":null,"work_id":"0bb2d1e1-416b-41d8-a8c5-d457534c5bbe","year":2000},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.731986Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:9ffb473c52b4d72f3270a0b41831f8183883997feaa60500087b78c8b2a0925a","observation_id":"d1851e09-14ab-4332-a2ae-61817d419d45","resolution":{"observed_at":"2026-08-06T19:13:39.692852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:39.105819Z","title":"A novel domain adaptation theory with jensen--shannon divergence","venue":null,"work_id":"4da9bdc1-ab02-4323-819b-2521fed18630","year":2022},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.804784Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:16f619c77ffecb8d1309107f1cae9a82cf136ee04898dc2807337ec002f55c41","observation_id":"d98a9308-1361-4163-94b3-7c9e36c7f674","resolution":{"observed_at":"2026-08-06T19:13:39.307253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:38.795600Z","title":"Bridging the gap between f-gans and wasserstein gans","venue":null,"work_id":"d8927886-7d2b-4196-bc27-97aede18f643","year":2020},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.888345Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:6bd07a2366aff74d7e851bd18e7830d1e9213cccd8d4b6bf966ba4c05c43fa2d","observation_id":"0c9765b2-f8eb-493c-a111-be904a071207","resolution":{"observed_at":"2026-08-06T19:13:38.923280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:36.989904Z","title":"A theory of the learnable","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:36.989904Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:5ecc086a5d32b41770e9ef7e1cb6340bf5c26fda5d40447c08b087e0a82cd3ff","observation_id":"9f3b4c54-1a96-4df4-aa5a-3c79d52147ea","resolution":{"observed_at":"2026-08-06T19:13:36.989904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00706","last_updated":"2023-03-02T04:51:10Z","snapshot_observed_at":"2026-08-07T17:04:28.514546Z","submitted_at":"2022-10-03T04:16:54Z","title":"Information-Theoretic Analysis of Unsupervised Domain Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00706","snapshot_observed_at":"2026-08-06T19:13:37.083956Z","title":"Information-theoretic analysis of unsupervised domain adaptation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.083956Z"},"links":{"cited_paper":"/paper/2210.00706","citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:751e0a3ee0e06511c85796b839ab1b92c0e06e03ff1ef1646e50bf11f7d7dff4","observation_id":"3d34f2ac-8279-4c08-b4d6-6bd2e4296b33","resolution":{"observed_at":"2026-08-06T19:13:37.083956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:38.511722Z","title":"On f -divergence principled domain adaptation: An improved framework","venue":null,"work_id":"1be290c6-36d3-4c2f-8451-bc7fa708eb21","year":2025},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.279641Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:40486c33d23c497de8b981ef75ff23da3845a142001bac67f1bd13871b85a57a","observation_id":"8c0eebcb-48bd-4aca-9e10-cccb51d85d25","resolution":{"observed_at":"2026-08-06T19:13:38.676071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T19:13:38.144412Z","title":"Bridging theory and algorithm for domain adaptation","venue":null,"work_id":"5d8ccc9b-64bc-4632-8f14-a67256ad6ee0","year":2019},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.374877Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:c26eaa36e143e051b3ad754b82f4694f97dd69be2e37275bf6ab3512d7053342","observation_id":"330ddda7-004e-4159-903a-805c3079c5ff","resolution":{"observed_at":"2026-08-06T19:13:38.326412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:37.497246Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.497246Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:d8b9d02b4b2152b9116243498afdcb1a728e4c9e0aa56281e4859247d81dab64","observation_id":"fcdd5b2a-7d20-4a58-b878-13e344206d48","resolution":{"observed_at":"2026-08-06T19:13:37.497246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:37.621821Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.621821Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:2ec7adca22f959f64e73263975885342d04247cf2ade8a8dfd92eff242b2d4d0","observation_id":"f94b6c14-742e-47df-a6b7-a3d5ea5888b0","resolution":{"observed_at":"2026-08-06T19:13:37.621821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:37.700906Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.700906Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:b0157d448048d6f1092e40c9d4e22baabf94a5e041876031d05506e9f8950d97","observation_id":"b4abf589-6c14-4569-b7ed-37cc803121d8","resolution":{"observed_at":"2026-08-06T19:13:37.700906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:13:37.869556Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T19:13:37.869556Z"},"links":{"citing_paper":"/paper/2507.06552"},"observation_digest":"sha256:34b73526a1377f365694967a66813b3fe44b47c651544176a20c57861468ee81","observation_id":"ab11ddca-f38a-4954-a76f-0708eed8c3fe","resolution":{"observed_at":"2026-08-06T19:13:37.869556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.06552","last_updated":"2025-07-09T05:11:19Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T18:58:14.607742Z","submitted_at":"2025-07-09T05:11:19Z","title":"On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":38},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2507.06552."}