{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7WX5LH5S3AGJF5DIN2OHSB6XBF","short_pith_number":"pith:7WX5LH5S","schema_version":"1.0","canonical_sha256":"fdafd59fb2d80c92f4686e9c7907d7095020bda9788d0111f28102751cbe359c","source":{"kind":"arxiv","id":"2212.04825","version":2},"attestation_state":"computed","paper":{"title":"A Whac-A-Mole Dilemma: Shortcuts Come in Multiples Where Mitigating One Amplifies Others","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Albert Gordo, Caner Hazirbas, Chenliang Xu, Cristian Canton Ferrer, Ivan Evtimov, Mark Ibrahim, Tal Hassner, Zhiheng Li","submitted_at":"2022-12-09T18:59:57Z","abstract_excerpt":"Machine learning models have been found to learn shortcuts -- unintended decision rules that are unable to generalize -- undermining models' reliability. Previous works address this problem under the tenuous assumption that only a single shortcut exists in the training data. Real-world images are rife with multiple visual cues from background to texture. Key to advancing the reliability of vision systems is understanding whether existing methods can overcome multiple shortcuts or struggle in a Whac-A-Mole game, i.e., where mitigating one shortcut amplifies reliance on others. To address this s"},"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":"2212.04825","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2022-12-09T18:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"f6a3482288fa30d7bd42ecf446df93c2df7033943417cdf32f2c2d72db4af903","abstract_canon_sha256":"00f4ad6796457a09385472156f0d4194c2a8e9c8e91194e56c7ac9b8503f0fa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:53:08.665547Z","signature_b64":"8KnZAhlporGVdAH+SQNd9hslrNZL1FAsfDUEeKaU+i0y8FHZbc1ffvtDWueGRhPQOtB7SM/8C17+2MTn7CokDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdafd59fb2d80c92f4686e9c7907d7095020bda9788d0111f28102751cbe359c","last_reissued_at":"2026-07-05T05:53:08.664263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:53:08.664263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Whac-A-Mole Dilemma: Shortcuts Come in Multiples Where Mitigating One Amplifies Others","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Albert Gordo, Caner Hazirbas, Chenliang Xu, Cristian Canton Ferrer, Ivan Evtimov, Mark Ibrahim, Tal Hassner, Zhiheng Li","submitted_at":"2022-12-09T18:59:57Z","abstract_excerpt":"Machine learning models have been found to learn shortcuts -- unintended decision rules that are unable to generalize -- undermining models' reliability. Previous works address this problem under the tenuous assumption that only a single shortcut exists in the training data. Real-world images are rife with multiple visual cues from background to texture. Key to advancing the reliability of vision systems is understanding whether existing methods can overcome multiple shortcuts or struggle in a Whac-A-Mole game, i.e., where mitigating one shortcut amplifies reliance on others. To address this s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04825","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/2212.04825/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":"2212.04825","created_at":"2026-07-05T05:53:08.664324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.04825v2","created_at":"2026-07-05T05:53:08.664324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04825","created_at":"2026-07-05T05:53:08.664324+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WX5LH5S3AGJ","created_at":"2026-07-05T05:53:08.664324+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WX5LH5S3AGJF5DI","created_at":"2026-07-05T05:53:08.664324+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WX5LH5S","created_at":"2026-07-05T05:53:08.664324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20732","citing_title":"Deep Attention Reweighting: Post-Hoc Attention-Based Feature Aggregation in CNNs for Disentangling Core and Spurious Features under Spurious Correlations","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF","json":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF.json","graph_json":"https://pith.science/api/pith-number/7WX5LH5S3AGJF5DIN2OHSB6XBF/graph.json","events_json":"https://pith.science/api/pith-number/7WX5LH5S3AGJF5DIN2OHSB6XBF/events.json","paper":"https://pith.science/paper/7WX5LH5S"},"agent_actions":{"view_html":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF","download_json":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF.json","view_paper":"https://pith.science/paper/7WX5LH5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.04825&json=true","fetch_graph":"https://pith.science/api/pith-number/7WX5LH5S3AGJF5DIN2OHSB6XBF/graph.json","fetch_events":"https://pith.science/api/pith-number/7WX5LH5S3AGJF5DIN2OHSB6XBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF/action/storage_attestation","attest_author":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF/action/author_attestation","sign_citation":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF/action/citation_signature","submit_replication":"https://pith.science/pith/7WX5LH5S3AGJF5DIN2OHSB6XBF/action/replication_record"}},"created_at":"2026-07-05T05:53:08.664324+00:00","updated_at":"2026-07-05T05:53:08.664324+00:00"}