{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PNVBCU6FQWJ4WTQ7AX3K2INQCL","short_pith_number":"pith:PNVBCU6F","schema_version":"1.0","canonical_sha256":"7b6a1153c58593cb4e1f05f6ad21b012c1e0e8ce956c6e6ca511554299811566","source":{"kind":"arxiv","id":"1412.4446","version":2},"attestation_state":"computed","paper":{"title":"Domain-Adversarial Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Fran\\c{c}ois Laviolette, Hana Ajakan, Hugo Larochelle, Mario Marchand, Pascal Germain","submitted_at":"2014-12-15T02:16:07Z","abstract_excerpt":"We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predictions must be made based on a data representation that cannot discriminate between the training (source) and test (target) domains. We propose a training objective that implements this idea in the context of a neural network, whose hidden layer is trained to be predictive of the c"},"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":"1412.4446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-15T02:16:07Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"54f60cb7bc812714c719f74a1a25456b7a2fb8bdabb933d1cf6c5808e5222425","abstract_canon_sha256":"018193ac940aae4bae306e6794601f2c09b33083ef7061c217581aab1a50bfd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.958362Z","signature_b64":"gLiDpGvrPdsAfjditfo9ALu2/tb3WG42MJS//cAKc8Ll1YpksEulEUlrONv40MHafWXMH8LkIipC7w5L0iK7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b6a1153c58593cb4e1f05f6ad21b012c1e0e8ce956c6e6ca511554299811566","last_reissued_at":"2026-05-18T02:27:43.957832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.957832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain-Adversarial Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Fran\\c{c}ois Laviolette, Hana Ajakan, Hugo Larochelle, Mario Marchand, Pascal Germain","submitted_at":"2014-12-15T02:16:07Z","abstract_excerpt":"We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predictions must be made based on a data representation that cannot discriminate between the training (source) and test (target) domains. We propose a training objective that implements this idea in the context of a neural network, whose hidden layer is trained to be predictive of the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4446","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":"1412.4446","created_at":"2026-05-18T02:27:43.957918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4446v2","created_at":"2026-05-18T02:27:43.957918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4446","created_at":"2026-05-18T02:27:43.957918+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNVBCU6FQWJ4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNVBCU6FQWJ4WTQ7","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNVBCU6F","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.07480","citing_title":"Remaining Useful Lifetime Prediction via Deep Domain Adaptation","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"1907.07802","citing_title":"Multi-Purposing Domain Adaptation Discriminators for Pseudo Labeling Confidence","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2602.00656","citing_title":"DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"1606.06565","citing_title":"Concrete Problems in AI Safety","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16892","citing_title":"CrossFlowDG: Bridging the Modality Gap with Cross-modal Flow Matching for Domain Generalization","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL","json":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL.json","graph_json":"https://pith.science/api/pith-number/PNVBCU6FQWJ4WTQ7AX3K2INQCL/graph.json","events_json":"https://pith.science/api/pith-number/PNVBCU6FQWJ4WTQ7AX3K2INQCL/events.json","paper":"https://pith.science/paper/PNVBCU6F"},"agent_actions":{"view_html":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL","download_json":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL.json","view_paper":"https://pith.science/paper/PNVBCU6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4446&json=true","fetch_graph":"https://pith.science/api/pith-number/PNVBCU6FQWJ4WTQ7AX3K2INQCL/graph.json","fetch_events":"https://pith.science/api/pith-number/PNVBCU6FQWJ4WTQ7AX3K2INQCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL/action/storage_attestation","attest_author":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL/action/author_attestation","sign_citation":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL/action/citation_signature","submit_replication":"https://pith.science/pith/PNVBCU6FQWJ4WTQ7AX3K2INQCL/action/replication_record"}},"created_at":"2026-05-18T02:27:43.957918+00:00","updated_at":"2026-05-18T02:27:43.957918+00:00"}