{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HMG7YSWHP6YVYXHWTCHYK6XOK7","short_pith_number":"pith:HMG7YSWH","schema_version":"1.0","canonical_sha256":"3b0dfc4ac77fb15c5cf6988f857aee57d4a722fffd3ca2ce95e9a22aa8e70f17","source":{"kind":"arxiv","id":"1702.05374","version":2},"attestation_state":"computed","paper":{"title":"Domain Adaptation for Visual Applications: A Comprehensive Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gabriela Csurka","submitted_at":"2017-02-17T15:07:40Z","abstract_excerpt":"The aim of this paper is to give an overview of domain adaptation and transfer learning with a specific view on visual applications. After a general motivation, we first position domain adaptation in the larger transfer learning problem. Second, we try to address and analyze briefly the state-of-the-art methods for different types of scenarios, first describing the historical shallow methods, addressing both the homogeneous and the heterogeneous domain adaptation methods. Third, we discuss the effect of the success of deep convolutional architectures which led to new type of domain adaptation "},"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":"1702.05374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T15:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"b1ed91597b0c9b7b76e1517d16ee433dc461afb6c30e6070da8680a021f85869","abstract_canon_sha256":"f6a5a0ca5fafbb7233fd035efde8e3b751d9d5c454cbfc48c899a4473e2c0069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:36.863524Z","signature_b64":"YtTdLofG4IW4bphiGq3pwp+ff9KjDriU17va9ldfJYHnTvQh2AL7EozZVejoDlGvcCsX83nvKSqgzgXNH6AYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0dfc4ac77fb15c5cf6988f857aee57d4a722fffd3ca2ce95e9a22aa8e70f17","last_reissued_at":"2026-05-18T00:47:36.862917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:36.862917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain Adaptation for Visual Applications: A Comprehensive Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gabriela Csurka","submitted_at":"2017-02-17T15:07:40Z","abstract_excerpt":"The aim of this paper is to give an overview of domain adaptation and transfer learning with a specific view on visual applications. After a general motivation, we first position domain adaptation in the larger transfer learning problem. Second, we try to address and analyze briefly the state-of-the-art methods for different types of scenarios, first describing the historical shallow methods, addressing both the homogeneous and the heterogeneous domain adaptation methods. Third, we discuss the effect of the success of deep convolutional architectures which led to new type of domain adaptation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05374","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1702.05374","created_at":"2026-05-18T00:47:36.863008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05374v2","created_at":"2026-05-18T00:47:36.863008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05374","created_at":"2026-05-18T00:47:36.863008+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMG7YSWHP6YV","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMG7YSWHP6YVYXHW","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMG7YSWH","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1906.08989","citing_title":"Data-Efficient Learning for Sim-to-Real Robotic Grasping using Deep Point Cloud Prediction Networks","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2403.15152","citing_title":"Caption-Matching: A Multimodal Approach for Cross-Domain Image Retrieval","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22800","citing_title":"The Matching Principle: A Geometric Theory of Loss Functions for Nuisance-Robust Representation Learning","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2205.14334","citing_title":"Teaching Models to Express Their Uncertainty in Words","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08230","citing_title":"Generalization Under Scrutiny: Cross-Domain Detection Progresses, Pitfalls, and Persistent Challenges","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7","json":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7.json","graph_json":"https://pith.science/api/pith-number/HMG7YSWHP6YVYXHWTCHYK6XOK7/graph.json","events_json":"https://pith.science/api/pith-number/HMG7YSWHP6YVYXHWTCHYK6XOK7/events.json","paper":"https://pith.science/paper/HMG7YSWH"},"agent_actions":{"view_html":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7","download_json":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7.json","view_paper":"https://pith.science/paper/HMG7YSWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05374&json=true","fetch_graph":"https://pith.science/api/pith-number/HMG7YSWHP6YVYXHWTCHYK6XOK7/graph.json","fetch_events":"https://pith.science/api/pith-number/HMG7YSWHP6YVYXHWTCHYK6XOK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7/action/storage_attestation","attest_author":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7/action/author_attestation","sign_citation":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7/action/citation_signature","submit_replication":"https://pith.science/pith/HMG7YSWHP6YVYXHWTCHYK6XOK7/action/replication_record"}},"created_at":"2026-05-18T00:47:36.863008+00:00","updated_at":"2026-05-18T00:47:36.863008+00:00"}