{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BUNGD6TWMQEP3U5BADDMVYZLAX","short_pith_number":"pith:BUNGD6TW","schema_version":"1.0","canonical_sha256":"0d1a61fa766408fdd3a100c6cae32b05eb63fa52cea52652b7946df226b577d6","source":{"kind":"arxiv","id":"1906.04509","version":1},"attestation_state":"computed","paper":{"title":"BasisConv: A method for compressed representation and learning in CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhijit Mahalanobis, Muhammad Tayyab","submitted_at":"2019-06-11T12:07:48Z","abstract_excerpt":"It is well known that Convolutional Neural Networks (CNNs) have significant redundancy in their filter weights. Various methods have been proposed in the literature to compress trained CNNs. These include techniques like pruning weights, filter quantization and representing filters in terms of a basis functions. Our approach falls in this latter class of strategies, but is distinct in that that we show both compressed learning and representation can be achieved without significant modifications of popular CNN architectures. Specifically, any convolution layer of the CNN is easily replaced by t"},"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":"1906.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T12:07:48Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"8747cc0a9bc7e3d4cf622114b6b291f3c992cfbceff044835adf741e2df51f03","abstract_canon_sha256":"28ba21f30006d5d8208b540d7c7e48e57884c54f718961c55aa189cdb8b20cd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:39.081649Z","signature_b64":"LWna3Xt0GKHkiqD5Jed/Vdhl8asSoanX9ck55FG0L1N2g60ZymuaGPJjX+cYqCM0L+PDbofsB+LLqLRd3hI1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1a61fa766408fdd3a100c6cae32b05eb63fa52cea52652b7946df226b577d6","last_reissued_at":"2026-05-17T23:43:39.081083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:39.081083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BasisConv: A method for compressed representation and learning in CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhijit Mahalanobis, Muhammad Tayyab","submitted_at":"2019-06-11T12:07:48Z","abstract_excerpt":"It is well known that Convolutional Neural Networks (CNNs) have significant redundancy in their filter weights. Various methods have been proposed in the literature to compress trained CNNs. These include techniques like pruning weights, filter quantization and representing filters in terms of a basis functions. Our approach falls in this latter class of strategies, but is distinct in that that we show both compressed learning and representation can be achieved without significant modifications of popular CNN architectures. Specifically, any convolution layer of the CNN is easily replaced by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04509","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":"1906.04509","created_at":"2026-05-17T23:43:39.081159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04509v1","created_at":"2026-05-17T23:43:39.081159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04509","created_at":"2026-05-17T23:43:39.081159+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUNGD6TWMQEP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUNGD6TWMQEP3U5B","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUNGD6TW","created_at":"2026-05-18T12:33:12.712433+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/BUNGD6TWMQEP3U5BADDMVYZLAX","json":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX.json","graph_json":"https://pith.science/api/pith-number/BUNGD6TWMQEP3U5BADDMVYZLAX/graph.json","events_json":"https://pith.science/api/pith-number/BUNGD6TWMQEP3U5BADDMVYZLAX/events.json","paper":"https://pith.science/paper/BUNGD6TW"},"agent_actions":{"view_html":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX","download_json":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX.json","view_paper":"https://pith.science/paper/BUNGD6TW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04509&json=true","fetch_graph":"https://pith.science/api/pith-number/BUNGD6TWMQEP3U5BADDMVYZLAX/graph.json","fetch_events":"https://pith.science/api/pith-number/BUNGD6TWMQEP3U5BADDMVYZLAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX/action/storage_attestation","attest_author":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX/action/author_attestation","sign_citation":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX/action/citation_signature","submit_replication":"https://pith.science/pith/BUNGD6TWMQEP3U5BADDMVYZLAX/action/replication_record"}},"created_at":"2026-05-17T23:43:39.081159+00:00","updated_at":"2026-05-17T23:43:39.081159+00:00"}