{"as_of":"2026-08-11T02:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8095ad68b522e57c0fedf81b1372a4c2bdbb621ef618ba65355c1e607480533","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T13:37:55.439169Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"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/2509.20587/citation-record","integrity":"/paper/2509.20587/integrity","json":"/paper/2509.20587/citation-record.json","paper":"/paper/2509.20587"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","submitted_at":"2019-07-05T15:26:26Z","title":"Invariant Risk Minimization","version":3},"cited_work":{"arxiv_id":"1907.02893","doi":"10.1038/s41591-023-02608-w","metadata_source":"pith","pith_arxiv_id":"1907.02893","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Invariant Risk Minimization","venue":"stat.ML","work_id":"d76c6842-b84d-44ec-bcea-b80cd8d07981","year":2019},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:430bba73a52037a85c6b1978dcbfc8574b80f14cdabb9531e3bec87949792bca","observation_id":"0a328c84-9073-42ff-972a-3469e2b25f53","resolution":{"observed_at":"2026-05-18T13:41:25.644939Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f9cc37b9-e200-4c58-b2e7-b6676029a142","year":1993},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:495104341a8352b37c14aba28c83bf81a515629f1dd85537184aa7dbbff92d37","observation_id":"6328c050-4a70-4bf6-9681-1195412f22b2","resolution":{"observed_at":"2026-05-18T13:42:39.219058Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06-05T21:23:00.469572Z","title":"This inequality is analogous to Hoeffding’s inequality and provides a non-asymptotic concentration bound on the estimation error","venue":null,"work_id":"b3ba1ddd-dbe0-4836-9b2b-727ec6fb0bf5","year":2022},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:7278edf104708e2acc1aa75f45ec59b50742864741dd65925a32125f679d2c09","observation_id":"1d773715-e097-4fe0-8ff5-ffdf5cd9b098","resolution":{"observed_at":"2026-05-18T13:42:39.211593Z","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-06-05T21:23:00.469572Z","title":"The term ∂β10 bL(f0,bb1,bβ10,bϱ): We have ∂β10 bL(f0,bb1,bβ10,bϱ) − ∂β10 bL(f0, b1,bβ10, ϱ) + ∂β10 bL(f0, b1,bβ10, ϱ) = ∂β10 bL(f0, b1,bβ10, ϱ) + Op(|bb1 − b1| + |bϱ − ϱ|)","venue":null,"work_id":"61d4c0e4-988c-4bfc-a861-e07d156936c0","year":2013},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:13f0931d5150d3d242d870483d45da1d5b43009337ea2d59698e8964a1adad95","observation_id":"3431db03-a761-4a95-b614-cf625affc870","resolution":{"observed_at":"2026-05-18T13:42:39.215450Z","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-06-05T21:23:00.469572Z","title":"(S.8) The proof is similar to Lemma A.3 of Maity et al","venue":null,"work_id":"7d9cbafa-9395-4ee0-8266-51acee8b2960","year":2022},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:75bd0c7944ef200144e37f13d24ec168f528e938538082edffaf7ca2c58c6277","observation_id":"bf8ce045-58cc-4f0e-8f0d-820f0c6ea668","resolution":{"observed_at":"2026-05-18T13:42:39.222500Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9b728172-d072-4286-9dbd-65acf221ecb4","year":2000},"citing_paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T13:37:55.439169Z"},"links":{"citing_paper":"/paper/2509.20587"},"observation_digest":"sha256:ba254390127ca8a41fd5755fd9455a6610d67267ea8f45e61088db7ff38c0128","observation_id":"46aae888-5a02-4b79-901a-39ac81ea9107","resolution":{"observed_at":"2026-05-18T13:42:39.226602Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2509.20587","last_updated":"2026-04-12T03:15:33Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T22:30:41.141182Z","submitted_at":"2025-09-24T22:00:49Z","title":"Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":6},"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 11 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2509.20587."}