{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VNTOADWANBA7DKYCZKHRGQOGYO","short_pith_number":"pith:VNTOADWA","schema_version":"1.0","canonical_sha256":"ab66e00ec06841f1ab02ca8f1341c6c390e4010fcb32f1847d6cf20db0515760","source":{"kind":"arxiv","id":"2503.13236","version":2},"attestation_state":"computed","paper":{"title":"Gradient Extrapolation for Debiased Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ihab Asaad, Joachim Denzler, Maha Shadaydeh","submitted_at":"2025-03-17T14:48:57Z","abstract_excerpt":"Machine learning classification models trained with empirical risk minimization (ERM) often inadvertently rely on spurious correlations. When absent in the test data, these unintended associations between non-target attributes and target labels lead to poor generalization. This paper addresses this problem from a model optimization perspective and proposes a novel method, Gradient Extrapolation for Debiased Representation Learning (GERNE), designed to learn debiased representations in both known and unknown attribute training cases. GERNE uses two distinct batches with different amounts of spu"},"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":"2503.13236","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-17T14:48:57Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b686dc63cfb915b84facf0bca2b599174665d7944b002105f7dc369f4212d425","abstract_canon_sha256":"a109ea27b5220bd6c873bc550922407ebbea484cee26987ed25b3c3c44ba9dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:24.014451Z","signature_b64":"X8HFY2gOQ38Rnhd4BjqvCGLuOdlBQPlRnl5kUezNH9HkR9/3d23otIFTqWTvYrObiViMVSjNa1pgk88Q6KJKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab66e00ec06841f1ab02ca8f1341c6c390e4010fcb32f1847d6cf20db0515760","last_reissued_at":"2026-07-05T11:51:24.013944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:24.013944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Extrapolation for Debiased Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ihab Asaad, Joachim Denzler, Maha Shadaydeh","submitted_at":"2025-03-17T14:48:57Z","abstract_excerpt":"Machine learning classification models trained with empirical risk minimization (ERM) often inadvertently rely on spurious correlations. When absent in the test data, these unintended associations between non-target attributes and target labels lead to poor generalization. This paper addresses this problem from a model optimization perspective and proposes a novel method, Gradient Extrapolation for Debiased Representation Learning (GERNE), designed to learn debiased representations in both known and unknown attribute training cases. GERNE uses two distinct batches with different amounts of spu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13236","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.13236/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":"2503.13236","created_at":"2026-07-05T11:51:24.014006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13236v2","created_at":"2026-07-05T11:51:24.014006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13236","created_at":"2026-07-05T11:51:24.014006+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNTOADWANBA7","created_at":"2026-07-05T11:51:24.014006+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNTOADWANBA7DKYC","created_at":"2026-07-05T11:51:24.014006+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNTOADWA","created_at":"2026-07-05T11:51:24.014006+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24161","citing_title":"Dual-Branch Cross-Projection Debiasing through Diffusion-based Disentanglement","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11446","citing_title":"Low-rank Optimization Trajectories Modeling for LLM RLVR Acceleration","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO","json":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO.json","graph_json":"https://pith.science/api/pith-number/VNTOADWANBA7DKYCZKHRGQOGYO/graph.json","events_json":"https://pith.science/api/pith-number/VNTOADWANBA7DKYCZKHRGQOGYO/events.json","paper":"https://pith.science/paper/VNTOADWA"},"agent_actions":{"view_html":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO","download_json":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO.json","view_paper":"https://pith.science/paper/VNTOADWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13236&json=true","fetch_graph":"https://pith.science/api/pith-number/VNTOADWANBA7DKYCZKHRGQOGYO/graph.json","fetch_events":"https://pith.science/api/pith-number/VNTOADWANBA7DKYCZKHRGQOGYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO/action/storage_attestation","attest_author":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO/action/author_attestation","sign_citation":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO/action/citation_signature","submit_replication":"https://pith.science/pith/VNTOADWANBA7DKYCZKHRGQOGYO/action/replication_record"}},"created_at":"2026-07-05T11:51:24.014006+00:00","updated_at":"2026-07-05T11:51:24.014006+00:00"}