{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6IF4IUBBIBFFYSCWR23X2QDPRG","short_pith_number":"pith:6IF4IUBB","schema_version":"1.0","canonical_sha256":"f20bc45021404a5c48568eb77d406f898e547e28a41d2459f18061249e71d376","source":{"kind":"arxiv","id":"2010.03058","version":2},"attestation_state":"computed","paper":{"title":"Characterising Bias in Compressed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Emily Denton, Gregory Clark, Nyalleng Moorosi, Samy Bengio, Sara Hooker","submitted_at":"2020-10-06T22:02:46Z","abstract_excerpt":"The popularity and widespread use of pruning and quantization is driven by the severe resource constraints of deploying deep neural networks to environments with strict latency, memory and energy requirements. These techniques achieve high levels of compression with negligible impact on top-line metrics (top-1 and top-5 accuracy). However, overall accuracy hides disproportionately high errors on a small subset of examples; we call this subset Compression Identified Exemplars (CIE). We further establish that for CIE examples, compression amplifies existing algorithmic bias. Pruning disproportio"},"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":"2010.03058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-06T22:02:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a8c65d2af77fb14676f08f8580b399dd177bb928e652b2c870c23a0da95f9a97","abstract_canon_sha256":"06e69aa50e598ac3f45de953ed512269167f5073797b114b8e712ee8591c0677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:32.427746Z","signature_b64":"JIs0hLN1I2H7aiSjwm+tfesUM8OcCWvCyPcm3ytneBIGfYQUKpJuONTE48xDHk/Capwr05A4yQ5XD0OmSDnVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20bc45021404a5c48568eb77d406f898e547e28a41d2459f18061249e71d376","last_reissued_at":"2026-07-05T02:00:32.427393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:32.427393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterising Bias in Compressed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Emily Denton, Gregory Clark, Nyalleng Moorosi, Samy Bengio, Sara Hooker","submitted_at":"2020-10-06T22:02:46Z","abstract_excerpt":"The popularity and widespread use of pruning and quantization is driven by the severe resource constraints of deploying deep neural networks to environments with strict latency, memory and energy requirements. These techniques achieve high levels of compression with negligible impact on top-line metrics (top-1 and top-5 accuracy). However, overall accuracy hides disproportionately high errors on a small subset of examples; we call this subset Compression Identified Exemplars (CIE). We further establish that for CIE examples, compression amplifies existing algorithmic bias. Pruning disproportio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03058","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/2010.03058/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":"2010.03058","created_at":"2026-07-05T02:00:32.427455+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.03058v2","created_at":"2026-07-05T02:00:32.427455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03058","created_at":"2026-07-05T02:00:32.427455+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IF4IUBBIBFF","created_at":"2026-07-05T02:00:32.427455+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IF4IUBBIBFFYSCW","created_at":"2026-07-05T02:00:32.427455+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IF4IUBB","created_at":"2026-07-05T02:00:32.427455+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24970","citing_title":"Don't Go Breaking My LLM: The Impact of Pruning Attention Layers on Explanation Faithfulness and Confidence Calibration","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12234","citing_title":"On The Effectiveness-Fluency Trade-Off In LLM Conditioning: A Systematic Study","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00206","citing_title":"Quantized Reasoning Models Think They Need to Think Longer, but They Do Not","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2205.08809","citing_title":"Software Fairness: An Analysis and Survey","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2405.00892","citing_title":"Wake Vision: A Tailored Dataset and Benchmark Suite for TinyML Computer Vision Applications","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05582","citing_title":"Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Models","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08137","citing_title":"Weight Pruning Amplifies Bias: A Multi-Method Study of Compressed LLMs for Edge AI","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG","json":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG.json","graph_json":"https://pith.science/api/pith-number/6IF4IUBBIBFFYSCWR23X2QDPRG/graph.json","events_json":"https://pith.science/api/pith-number/6IF4IUBBIBFFYSCWR23X2QDPRG/events.json","paper":"https://pith.science/paper/6IF4IUBB"},"agent_actions":{"view_html":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG","download_json":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG.json","view_paper":"https://pith.science/paper/6IF4IUBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.03058&json=true","fetch_graph":"https://pith.science/api/pith-number/6IF4IUBBIBFFYSCWR23X2QDPRG/graph.json","fetch_events":"https://pith.science/api/pith-number/6IF4IUBBIBFFYSCWR23X2QDPRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG/action/storage_attestation","attest_author":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG/action/author_attestation","sign_citation":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG/action/citation_signature","submit_replication":"https://pith.science/pith/6IF4IUBBIBFFYSCWR23X2QDPRG/action/replication_record"}},"created_at":"2026-07-05T02:00:32.427455+00:00","updated_at":"2026-07-05T02:00:32.427455+00:00"}