{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TSPFCXSHNHW7YFSBL3HDHTH47L","short_pith_number":"pith:TSPFCXSH","schema_version":"1.0","canonical_sha256":"9c9e515e4769edfc16415ece33ccfcfad70cf1c24e86a209f8ec3f789c31a343","source":{"kind":"arxiv","id":"1301.2115","version":1},"attestation_state":"computed","paper":{"title":"Domain Generalization via Invariant Feature Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernhard Sch\\\"olkopf, David Balduzzi, Krikamol Muandet","submitted_at":"2013-01-10T13:29:17Z","abstract_excerpt":"This paper investigates domain generalization: How to take knowledge acquired from an arbitrary number of related domains and apply it to previously unseen domains? We propose Domain-Invariant Component Analysis (DICA), a kernel-based optimization algorithm that learns an invariant transformation by minimizing the dissimilarity across domains, whilst preserving the functional relationship between input and output variables. A learning-theoretic analysis shows that reducing dissimilarity improves the expected generalization ability of classifiers on new domains, motivating the proposed algorith"},"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":"1301.2115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-10T13:29:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"003d56f1a0d3a8484f6fd569142a5a582627a7171dbce3ef9e7dc84b671da752","abstract_canon_sha256":"479baf00219404762e682d67ef07f39627029448617f2d1d92971f2191c5ec6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:47.455151Z","signature_b64":"N+qmMUMpqvGSzDW5uUr2Q4tLZv11/09mylgGWj7NspdyB366aaB6Bl9vO/Fwk7I9lk/PuR3LxwS7sfcm0/VcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c9e515e4769edfc16415ece33ccfcfad70cf1c24e86a209f8ec3f789c31a343","last_reissued_at":"2026-05-18T03:36:47.454686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:47.454686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain Generalization via Invariant Feature Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernhard Sch\\\"olkopf, David Balduzzi, Krikamol Muandet","submitted_at":"2013-01-10T13:29:17Z","abstract_excerpt":"This paper investigates domain generalization: How to take knowledge acquired from an arbitrary number of related domains and apply it to previously unseen domains? We propose Domain-Invariant Component Analysis (DICA), a kernel-based optimization algorithm that learns an invariant transformation by minimizing the dissimilarity across domains, whilst preserving the functional relationship between input and output variables. A learning-theoretic analysis shows that reducing dissimilarity improves the expected generalization ability of classifiers on new domains, motivating the proposed algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2115","kind":"arxiv","version":1},"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":"1301.2115","created_at":"2026-05-18T03:36:47.454761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2115v1","created_at":"2026-05-18T03:36:47.454761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2115","created_at":"2026-05-18T03:36:47.454761+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSPFCXSHNHW7","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSPFCXSHNHW7YFSB","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSPFCXSH","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00270","citing_title":"DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Tasks","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L","json":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L.json","graph_json":"https://pith.science/api/pith-number/TSPFCXSHNHW7YFSBL3HDHTH47L/graph.json","events_json":"https://pith.science/api/pith-number/TSPFCXSHNHW7YFSBL3HDHTH47L/events.json","paper":"https://pith.science/paper/TSPFCXSH"},"agent_actions":{"view_html":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L","download_json":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L.json","view_paper":"https://pith.science/paper/TSPFCXSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2115&json=true","fetch_graph":"https://pith.science/api/pith-number/TSPFCXSHNHW7YFSBL3HDHTH47L/graph.json","fetch_events":"https://pith.science/api/pith-number/TSPFCXSHNHW7YFSBL3HDHTH47L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L/action/storage_attestation","attest_author":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L/action/author_attestation","sign_citation":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L/action/citation_signature","submit_replication":"https://pith.science/pith/TSPFCXSHNHW7YFSBL3HDHTH47L/action/replication_record"}},"created_at":"2026-05-18T03:36:47.454761+00:00","updated_at":"2026-05-18T03:36:47.454761+00:00"}