{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6D2MWAWNESEUXG2K3H5PR7PFY7","short_pith_number":"pith:6D2MWAWN","schema_version":"1.0","canonical_sha256":"f0f4cb02cd24894b9b4ad9faf8fde5c7e2b7837c796adc392222c27d54172402","source":{"kind":"arxiv","id":"2411.14345","version":1},"attestation_state":"computed","paper":{"title":"Layer Pruning with Consensus: A Triple-Win Solution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Anna H. Reali Costa, Artur Jordao, Carolina Tavares Duarte, Leandro Giusti Mugnaini","submitted_at":"2024-11-21T17:41:27Z","abstract_excerpt":"Layer pruning offers a promising alternative to standard structured pruning, effectively reducing computational costs, latency, and memory footprint. While notable layer-pruning approaches aim to detect unimportant layers for removal, they often rely on single criteria that may not fully capture the complex, underlying properties of layers. We propose a novel approach that combines multiple similarity metrics into a single expressive measure of low-importance layers, called the Consensus criterion. Our technique delivers a triple-win solution: low accuracy drop, high-performance improvement, a"},"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":"2411.14345","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-21T17:41:27Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"1bb49f80c9f5ce37b61d4709137ac109b15aff7af4f66943569c2325deed704b","abstract_canon_sha256":"f580f0293d777178eaadba6923e58fa933fd016330545445a0b048c21e28d1d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:32.943858Z","signature_b64":"vtp1qr7UY/FyVum8Uypce8kYx7bQvKOPQM08cuWh+O4djIlvvGGpYvqe/YHDScT6m5n4auO6vqSqF5a7j1EWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f4cb02cd24894b9b4ad9faf8fde5c7e2b7837c796adc392222c27d54172402","last_reissued_at":"2026-07-05T11:57:32.943416Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:32.943416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layer Pruning with Consensus: A Triple-Win Solution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Anna H. Reali Costa, Artur Jordao, Carolina Tavares Duarte, Leandro Giusti Mugnaini","submitted_at":"2024-11-21T17:41:27Z","abstract_excerpt":"Layer pruning offers a promising alternative to standard structured pruning, effectively reducing computational costs, latency, and memory footprint. While notable layer-pruning approaches aim to detect unimportant layers for removal, they often rely on single criteria that may not fully capture the complex, underlying properties of layers. We propose a novel approach that combines multiple similarity metrics into a single expressive measure of low-importance layers, called the Consensus criterion. Our technique delivers a triple-win solution: low accuracy drop, high-performance improvement, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14345","kind":"arxiv","version":1},"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/2411.14345/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":"2411.14345","created_at":"2026-07-05T11:57:32.943478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14345v1","created_at":"2026-07-05T11:57:32.943478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14345","created_at":"2026-07-05T11:57:32.943478+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D2MWAWNESEU","created_at":"2026-07-05T11:57:32.943478+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D2MWAWNESEUXG2K","created_at":"2026-07-05T11:57:32.943478+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D2MWAWN","created_at":"2026-07-05T11:57:32.943478+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7","json":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7.json","graph_json":"https://pith.science/api/pith-number/6D2MWAWNESEUXG2K3H5PR7PFY7/graph.json","events_json":"https://pith.science/api/pith-number/6D2MWAWNESEUXG2K3H5PR7PFY7/events.json","paper":"https://pith.science/paper/6D2MWAWN"},"agent_actions":{"view_html":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7","download_json":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7.json","view_paper":"https://pith.science/paper/6D2MWAWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14345&json=true","fetch_graph":"https://pith.science/api/pith-number/6D2MWAWNESEUXG2K3H5PR7PFY7/graph.json","fetch_events":"https://pith.science/api/pith-number/6D2MWAWNESEUXG2K3H5PR7PFY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7/action/storage_attestation","attest_author":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7/action/author_attestation","sign_citation":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7/action/citation_signature","submit_replication":"https://pith.science/pith/6D2MWAWNESEUXG2K3H5PR7PFY7/action/replication_record"}},"created_at":"2026-07-05T11:57:32.943478+00:00","updated_at":"2026-07-05T11:57:32.943478+00:00"}