{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FL77XHB7WZNXAYYX4R6TX3J2ZP","short_pith_number":"pith:FL77XHB7","schema_version":"1.0","canonical_sha256":"2afffb9c3fb65b706317e47d3bed3acbf412c85daec30ff7376610d1f67b08b4","source":{"kind":"arxiv","id":"1405.3866","version":1},"attestation_state":"computed","paper":{"title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Andrew Zisserman, Max Jaderberg","submitted_at":"2014-05-15T14:41:06Z","abstract_excerpt":"The focus of this paper is speeding up the evaluation of convolutional neural networks. While delivering impressive results across a range of computer vision and machine learning tasks, these networks are computationally demanding, limiting their deployability. Convolutional layers generally consume the bulk of the processing time, and so in this work we present two simple schemes for drastically speeding up these layers. This is achieved by exploiting cross-channel or filter redundancy to construct a low rank basis of filters that are rank-1 in the spatial domain. Our methods are architecture"},"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":"1405.3866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-15T14:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"0608e55cf1ea5afe1bfd6637d686327b0bdf12ffeb87789baa39368d721b6ebf","abstract_canon_sha256":"0b2ef8198dca78be92b225942dc5cf327905cbba1d3cbf7d51b8892f576c045c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.138079Z","signature_b64":"y9s2pj061Vzh2KwAFI+sb6lyO4Zme6y+0rLZeZ5z/8eZN38ITQ3mkR5K4Y8CyNdbx4V3+cNJ+SkYKnLDyE4yAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afffb9c3fb65b706317e47d3bed3acbf412c85daec30ff7376610d1f67b08b4","last_reissued_at":"2026-05-18T02:51:49.137640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.137640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Andrew Zisserman, Max Jaderberg","submitted_at":"2014-05-15T14:41:06Z","abstract_excerpt":"The focus of this paper is speeding up the evaluation of convolutional neural networks. While delivering impressive results across a range of computer vision and machine learning tasks, these networks are computationally demanding, limiting their deployability. Convolutional layers generally consume the bulk of the processing time, and so in this work we present two simple schemes for drastically speeding up these layers. This is achieved by exploiting cross-channel or filter redundancy to construct a low rank basis of filters that are rank-1 in the spatial domain. Our methods are architecture"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3866","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":""},"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":"1405.3866","created_at":"2026-05-18T02:51:49.137706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3866v1","created_at":"2026-05-18T02:51:49.137706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3866","created_at":"2026-05-18T02:51:49.137706+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL77XHB7WZNX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL77XHB7WZNXAYYX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL77XHB7","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2312.05821","citing_title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23375","citing_title":"Hierarchical Spatio-Channel Clustering for Efficient Model Compression in Medical Image Analysis","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01627","citing_title":"Importance-Guided Basis Selection for Low-Rank Decomposition of Large Language Models","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"1704.04861","citing_title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06297","citing_title":"FedSpy-LLM: Towards Scalable and Generalizable Data Reconstruction Attacks from Gradients on LLMs","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2106.09685","citing_title":"LoRA: Low-Rank Adaptation of Large Language Models","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP","json":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP.json","graph_json":"https://pith.science/api/pith-number/FL77XHB7WZNXAYYX4R6TX3J2ZP/graph.json","events_json":"https://pith.science/api/pith-number/FL77XHB7WZNXAYYX4R6TX3J2ZP/events.json","paper":"https://pith.science/paper/FL77XHB7"},"agent_actions":{"view_html":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP","download_json":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP.json","view_paper":"https://pith.science/paper/FL77XHB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3866&json=true","fetch_graph":"https://pith.science/api/pith-number/FL77XHB7WZNXAYYX4R6TX3J2ZP/graph.json","fetch_events":"https://pith.science/api/pith-number/FL77XHB7WZNXAYYX4R6TX3J2ZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP/action/storage_attestation","attest_author":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP/action/author_attestation","sign_citation":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP/action/citation_signature","submit_replication":"https://pith.science/pith/FL77XHB7WZNXAYYX4R6TX3J2ZP/action/replication_record"}},"created_at":"2026-05-18T02:51:49.137706+00:00","updated_at":"2026-05-18T02:51:49.137706+00:00"}