{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:T5UENRJWPAKEPFFJHSQEW4LKRT","short_pith_number":"pith:T5UENRJW","schema_version":"1.0","canonical_sha256":"9f6846c53678144794a93ca04b716a8cd437e8db4f92845c42f4c01b6e1472ab","source":{"kind":"arxiv","id":"0902.3430","version":3},"attestation_state":"computed","paper":{"title":"Domain Adaptation: Learning Bounds and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Mehryar Mohri, Yishay Mansour","submitted_at":"2009-02-19T18:42:16Z","abstract_excerpt":"This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data. Building on previous work by Ben-David et al. (2007), we introduce a novel distance between distributions, discrepancy distance, that is tailored to adaptation problems with arbitrary loss functions. We give Rademacher complexity bounds for estimating the discrepancy distance from finite samples for different loss functions. Using this distance, we derive novel generalization bounds for domain"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0902.3430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-02-19T18:42:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9a8fe3bc5108de1a0e60a9df29db5a18b6a39ba8323d7cced0d4ad2d0bc859c7","abstract_canon_sha256":"2da9ed3da051e7541c40f9ef1b2b94dc7b45c67f6a8348537ce110a6ded4c933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:52.368081Z","signature_b64":"qKF/ffCppIDuG2xh78+v09wdjN0Y4QRkcugbh/O9R8nCzQtuNTmDry+tqNclCLxY1boRbChPAJIUet/xbaP8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6846c53678144794a93ca04b716a8cd437e8db4f92845c42f4c01b6e1472ab","last_reissued_at":"2026-07-05T07:18:52.367611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:52.367611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain Adaptation: Learning Bounds and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Mehryar Mohri, Yishay Mansour","submitted_at":"2009-02-19T18:42:16Z","abstract_excerpt":"This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data. Building on previous work by Ben-David et al. (2007), we introduce a novel distance between distributions, discrepancy distance, that is tailored to adaptation problems with arbitrary loss functions. We give Rademacher complexity bounds for estimating the discrepancy distance from finite samples for different loss functions. Using this distance, we derive novel generalization bounds for domain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3430","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0902.3430/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"0902.3430","created_at":"2026-07-05T07:18:52.367668+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.3430v3","created_at":"2026-07-05T07:18:52.367668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3430","created_at":"2026-07-05T07:18:52.367668+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5UENRJWPAKE","created_at":"2026-07-05T07:18:52.367668+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5UENRJWPAKEPFFJ","created_at":"2026-07-05T07:18:52.367668+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5UENRJW","created_at":"2026-07-05T07:18:52.367668+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.04805","citing_title":"Quantifying Error in the Presence of Confounders for Causal Inference","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09183","citing_title":"Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2602.18679","citing_title":"Transformers for dynamical systems learn transfer operators in-context","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12803","citing_title":"Pitfalls of Unlabeled Disagreement-Based Drift Detection in Streaming Tree Ensembles","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11806","citing_title":"Adaptive Kernel Ridge Regression with Linear Structure: Sharp Oracle Inequalities and Minimax Optimality","ref_index":139,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09183","citing_title":"Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00906","citing_title":"Generalized Category Discovery under Domain Shifts: From Vision to Vision-Language Models","ref_index":97,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14090","citing_title":"From Weights to Activations: Is Steering the Next Frontier of Adaptation?","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT","json":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT.json","graph_json":"https://pith.science/api/pith-number/T5UENRJWPAKEPFFJHSQEW4LKRT/graph.json","events_json":"https://pith.science/api/pith-number/T5UENRJWPAKEPFFJHSQEW4LKRT/events.json","paper":"https://pith.science/paper/T5UENRJW"},"agent_actions":{"view_html":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT","download_json":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT.json","view_paper":"https://pith.science/paper/T5UENRJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.3430&json=true","fetch_graph":"https://pith.science/api/pith-number/T5UENRJWPAKEPFFJHSQEW4LKRT/graph.json","fetch_events":"https://pith.science/api/pith-number/T5UENRJWPAKEPFFJHSQEW4LKRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT/action/storage_attestation","attest_author":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT/action/author_attestation","sign_citation":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT/action/citation_signature","submit_replication":"https://pith.science/pith/T5UENRJWPAKEPFFJHSQEW4LKRT/action/replication_record"}},"created_at":"2026-07-05T07:18:52.367668+00:00","updated_at":"2026-07-05T07:18:52.367668+00:00"}