{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MHS27ZKZYPQ42YVIUUK2S6OGHB","short_pith_number":"pith:MHS27ZKZ","schema_version":"1.0","canonical_sha256":"61e5afe559c3e1cd62a8a515a979c6386295a398f8c1f54e5462bf437482c5c6","source":{"kind":"arxiv","id":"2006.16971","version":2},"attestation_state":"computed","paper":{"title":"Improving robustness against common corruptions by covariate shift adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Evgenia Rusak, Luisa Eck, Matthias Bethge, Oliver Bringmann, Steffen Schneider, Wieland Brendel","submitted_at":"2020-06-30T17:01:37Z","abstract_excerpt":"Today's state-of-the-art machine vision models are vulnerable to image corruptions like blurring or compression artefacts, limiting their performance in many real-world applications. We here argue that popular benchmarks to measure model robustness against common corruptions (like ImageNet-C) underestimate model robustness in many (but not all) application scenarios. The key insight is that in many scenarios, multiple unlabeled examples of the corruptions are available and can be used for unsupervised online adaptation. Replacing the activation statistics estimated by batch normalization on th"},"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":"2006.16971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-30T17:01:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"a41a94229c7e8b9fc660afc3878417179eb813f9af862cfaabeb4429ee705cfe","abstract_canon_sha256":"80fd84a1aceabcb6fff448a882f63bea608b6bc58b6e35ac1dd6aa63e2f517c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:29.007756Z","signature_b64":"HajqsZg4TcUbA3EOIy3pr4BFgkr3fTkTpo0YnaMhe++Bcpj08npTvm2U/vGkUXw41beC3+8ucU6YL9wrQtfpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61e5afe559c3e1cd62a8a515a979c6386295a398f8c1f54e5462bf437482c5c6","last_reissued_at":"2026-07-05T01:45:29.007336Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:29.007336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving robustness against common corruptions by covariate shift adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Evgenia Rusak, Luisa Eck, Matthias Bethge, Oliver Bringmann, Steffen Schneider, Wieland Brendel","submitted_at":"2020-06-30T17:01:37Z","abstract_excerpt":"Today's state-of-the-art machine vision models are vulnerable to image corruptions like blurring or compression artefacts, limiting their performance in many real-world applications. We here argue that popular benchmarks to measure model robustness against common corruptions (like ImageNet-C) underestimate model robustness in many (but not all) application scenarios. The key insight is that in many scenarios, multiple unlabeled examples of the corruptions are available and can be used for unsupervised online adaptation. Replacing the activation statistics estimated by batch normalization on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.16971","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/2006.16971/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":"2006.16971","created_at":"2026-07-05T01:45:29.007404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.16971v2","created_at":"2026-07-05T01:45:29.007404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.16971","created_at":"2026-07-05T01:45:29.007404+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHS27ZKZYPQ4","created_at":"2026-07-05T01:45:29.007404+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHS27ZKZYPQ42YVI","created_at":"2026-07-05T01:45:29.007404+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHS27ZKZ","created_at":"2026-07-05T01:45:29.007404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.02671","citing_title":"Test-Time Distillation for Continual Model Adaptation","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2508.15452","citing_title":"DoSReMC: Domain Shift Resilient Mammography Classification using Batch Normalization Adaptation","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2512.10421","citing_title":"Neural Collapse in Test-Time Adaptation","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2006.10726","citing_title":"Tent: Fully Test-time Adaptation by Entropy Minimization","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB","json":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB.json","graph_json":"https://pith.science/api/pith-number/MHS27ZKZYPQ42YVIUUK2S6OGHB/graph.json","events_json":"https://pith.science/api/pith-number/MHS27ZKZYPQ42YVIUUK2S6OGHB/events.json","paper":"https://pith.science/paper/MHS27ZKZ"},"agent_actions":{"view_html":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB","download_json":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB.json","view_paper":"https://pith.science/paper/MHS27ZKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.16971&json=true","fetch_graph":"https://pith.science/api/pith-number/MHS27ZKZYPQ42YVIUUK2S6OGHB/graph.json","fetch_events":"https://pith.science/api/pith-number/MHS27ZKZYPQ42YVIUUK2S6OGHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB/action/storage_attestation","attest_author":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB/action/author_attestation","sign_citation":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB/action/citation_signature","submit_replication":"https://pith.science/pith/MHS27ZKZYPQ42YVIUUK2S6OGHB/action/replication_record"}},"created_at":"2026-07-05T01:45:29.007404+00:00","updated_at":"2026-07-05T01:45:29.007404+00:00"}