{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UEANR2VOJTR2L7BDTR5QKIBRWN","short_pith_number":"pith:UEANR2VO","schema_version":"1.0","canonical_sha256":"a100d8eaae4ce3a5fc239c7b052031b35e6b074850b4cc3c6bed1ee2c59a2c88","source":{"kind":"arxiv","id":"2409.13652","version":3},"attestation_state":"computed","paper":{"title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Stephen Zhang, Vardan Papyan","submitted_at":"2024-09-20T17:02:00Z","abstract_excerpt":"The recent paradigm shift to large-scale foundation models has brought about a new era for deep learning that, while has found great success in practice, has also been plagued by prohibitively expensive costs in terms of high memory consumption and compute. To mitigate these issues, there has been a concerted effort in post-hoc neural network pruning techniques that do not require costly retraining. Despite the considerable progress being made, existing methods often exhibit a steady drop in model performance as the compression increases. In this paper, we present a novel approach to compressi"},"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":"2409.13652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-20T17:02:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"009fd861d2866c488fae56e22346d2d7f07c484de2f36b208020401b12897610","abstract_canon_sha256":"9d73470d15e9ee6b959a0029cc498205a2b42fff34104ae3f0e85c8217838a9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:34.900927Z","signature_b64":"NDZowlbLkDuDqpJXSFncaQb1dqvB6vT90LuTcWxOi0aO9NzBBqiQG4WsnPDAzjFcH70Yj6FgT/7huVcz6OyvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a100d8eaae4ce3a5fc239c7b052031b35e6b074850b4cc3c6bed1ee2c59a2c88","last_reissued_at":"2026-07-05T11:05:34.900461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:34.900461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Stephen Zhang, Vardan Papyan","submitted_at":"2024-09-20T17:02:00Z","abstract_excerpt":"The recent paradigm shift to large-scale foundation models has brought about a new era for deep learning that, while has found great success in practice, has also been plagued by prohibitively expensive costs in terms of high memory consumption and compute. To mitigate these issues, there has been a concerted effort in post-hoc neural network pruning techniques that do not require costly retraining. Despite the considerable progress being made, existing methods often exhibit a steady drop in model performance as the compression increases. In this paper, we present a novel approach to compressi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13652","kind":"arxiv","version":3},"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/2409.13652/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":"2409.13652","created_at":"2026-07-05T11:05:34.900519+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13652v3","created_at":"2026-07-05T11:05:34.900519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13652","created_at":"2026-07-05T11:05:34.900519+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEANR2VOJTR2","created_at":"2026-07-05T11:05:34.900519+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEANR2VOJTR2L7BD","created_at":"2026-07-05T11:05:34.900519+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEANR2VO","created_at":"2026-07-05T11:05:34.900519+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01412","citing_title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26632","citing_title":"RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03667","citing_title":"ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN","json":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN.json","graph_json":"https://pith.science/api/pith-number/UEANR2VOJTR2L7BDTR5QKIBRWN/graph.json","events_json":"https://pith.science/api/pith-number/UEANR2VOJTR2L7BDTR5QKIBRWN/events.json","paper":"https://pith.science/paper/UEANR2VO"},"agent_actions":{"view_html":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN","download_json":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN.json","view_paper":"https://pith.science/paper/UEANR2VO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13652&json=true","fetch_graph":"https://pith.science/api/pith-number/UEANR2VOJTR2L7BDTR5QKIBRWN/graph.json","fetch_events":"https://pith.science/api/pith-number/UEANR2VOJTR2L7BDTR5QKIBRWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN/action/storage_attestation","attest_author":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN/action/author_attestation","sign_citation":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN/action/citation_signature","submit_replication":"https://pith.science/pith/UEANR2VOJTR2L7BDTR5QKIBRWN/action/replication_record"}},"created_at":"2026-07-05T11:05:34.900519+00:00","updated_at":"2026-07-05T11:05:34.900519+00:00"}