{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B5P5PCPWMR36CPRBJ5FFSCCG5Z","short_pith_number":"pith:B5P5PCPW","schema_version":"1.0","canonical_sha256":"0f5fd789f66477e13e214f4a590846ee7452ec9aa313ee6475e77eed46856779","source":{"kind":"arxiv","id":"2605.05136","version":3},"attestation_state":"computed","paper":{"title":"CPCANet: Deep Unfolding Common Principal Component Analysis for Domain Generalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Unfolding the Flury-Gautschi algorithm into neural layers lets common principal component analysis discover domain-invariant subspaces directly inside end-to-end training.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Abd-Krim Seghouane, Yu-Hsi Chen","submitted_at":"2026-05-06T17:09:34Z","abstract_excerpt":"Domain Generalization (DG) aims to learn representations that remain robust under out-of-distribution (OOD) shifts and generalize effectively to unseen target domains. While recent invariant learning strategies and architectural advances have achieved strong performance, explicitly discovering a structured domain-invariant subspace through second-order statistics remains underexplored. In this work, we propose CPCANet, a novel framework grounded in Common Principal Component Analysis (CPCA), which unrolls the iterative Flury-Gautschi (FG) algorithm into fully differentiable neural layers. This"},"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":"2605.05136","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-06T17:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"411668754c7010b38d29a73dd4c891a3f9dae61ba2205434a488cd62286e41d5","abstract_canon_sha256":"8031470b3c6dc9b3e575efb0f1c883dd249f497c44634e4687fd04c887290c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:18.764768Z","signature_b64":"vCcYgtEesYNENxX8p5nnQM6ucRLSAVFlyXJXPX5CzEjKshts5vRPQRlNJITncI54FUp+dVmTfnGx11xzTeRxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5fd789f66477e13e214f4a590846ee7452ec9aa313ee6475e77eed46856779","last_reissued_at":"2026-06-09T01:05:18.764310Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:18.764310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CPCANet: Deep Unfolding Common Principal Component Analysis for Domain Generalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Unfolding the Flury-Gautschi algorithm into neural layers lets common principal component analysis discover domain-invariant subspaces directly inside end-to-end training.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Abd-Krim Seghouane, Yu-Hsi Chen","submitted_at":"2026-05-06T17:09:34Z","abstract_excerpt":"Domain Generalization (DG) aims to learn representations that remain robust under out-of-distribution (OOD) shifts and generalize effectively to unseen target domains. While recent invariant learning strategies and architectural advances have achieved strong performance, explicitly discovering a structured domain-invariant subspace through second-order statistics remains underexplored. In this work, we propose CPCANet, a novel framework grounded in Common Principal Component Analysis (CPCA), which unrolls the iterative Flury-Gautschi (FG) algorithm into fully differentiable neural layers. This"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on four standard DG benchmarks demonstrate that CPCANet achieves state-of-the-art (SOTA) performance in zero-shot transfer. Moreover, CPCANet is architecture-agnostic and requires no dataset-specific tuning.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the common principal components discovered by the unfolded Flury-Gautschi algorithm represent truly domain-invariant features that remain useful for the downstream task without losing critical information.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CPCANet deep-unfolds Common PCA to learn domain-invariant subspaces, achieving state-of-the-art zero-shot domain generalization on standard benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Unfolding the Flury-Gautschi algorithm into neural layers lets common principal component analysis discover domain-invariant subspaces directly inside end-to-end training.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"17f9fccccf46861731fc79d17de98564b5ece2d11167f40892b8df9df21678ec"},"source":{"id":"2605.05136","kind":"arxiv","version":3},"verdict":{"id":"d9d9376c-40cc-4d05-ba36-8e054d4b5963","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T17:03:23.602282Z","strongest_claim":"Experiments on four standard DG benchmarks demonstrate that CPCANet achieves state-of-the-art (SOTA) performance in zero-shot transfer. Moreover, CPCANet is architecture-agnostic and requires no dataset-specific tuning.","one_line_summary":"CPCANet deep-unfolds Common PCA to learn domain-invariant subspaces, achieving state-of-the-art zero-shot domain generalization on standard benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the common principal components discovered by the unfolded Flury-Gautschi algorithm represent truly domain-invariant features that remain useful for the downstream task without losing critical information.","pith_extraction_headline":"Unfolding the Flury-Gautschi algorithm into neural layers lets common principal component analysis discover domain-invariant subspaces directly inside end-to-end training."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.05136/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T10:36:11.817337Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.497039Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T13:49:12.022010Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e23b3a6db90cb96f80dbdac031e51b05477839bdfe84cdbb04c218f3f197c6ac"},"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":"2605.05136","created_at":"2026-06-09T01:05:18.764381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.05136v3","created_at":"2026-06-09T01:05:18.764381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05136","created_at":"2026-06-09T01:05:18.764381+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5P5PCPWMR36","created_at":"2026-06-09T01:05:18.764381+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5P5PCPWMR36CPRB","created_at":"2026-06-09T01:05:18.764381+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5P5PCPW","created_at":"2026-06-09T01:05:18.764381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z","json":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z.json","graph_json":"https://pith.science/api/pith-number/B5P5PCPWMR36CPRBJ5FFSCCG5Z/graph.json","events_json":"https://pith.science/api/pith-number/B5P5PCPWMR36CPRBJ5FFSCCG5Z/events.json","paper":"https://pith.science/paper/B5P5PCPW"},"agent_actions":{"view_html":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z","download_json":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z.json","view_paper":"https://pith.science/paper/B5P5PCPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.05136&json=true","fetch_graph":"https://pith.science/api/pith-number/B5P5PCPWMR36CPRBJ5FFSCCG5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/B5P5PCPWMR36CPRBJ5FFSCCG5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z/action/storage_attestation","attest_author":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z/action/author_attestation","sign_citation":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z/action/citation_signature","submit_replication":"https://pith.science/pith/B5P5PCPWMR36CPRBJ5FFSCCG5Z/action/replication_record"}},"created_at":"2026-06-09T01:05:18.764381+00:00","updated_at":"2026-06-09T01:05:18.764381+00:00"}