{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4PMIURGZTJYH6TPDM5ENWLI7AN","short_pith_number":"pith:4PMIURGZ","schema_version":"1.0","canonical_sha256":"e3d88a44d99a707f4de36748db2d1f03744cdcc13bd940dec246928a08162b71","source":{"kind":"arxiv","id":"1511.05946","version":5},"attestation_state":"computed","paper":{"title":"ACDC: A Structured Efficient Linear Layer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Jeremy Appleyard, Marcin Moczulski, Misha Denil, Nando de Freitas","submitted_at":"2015-11-18T20:52:17Z","abstract_excerpt":"The linear layer is one of the most pervasive modules in deep learning representations. However, it requires $O(N^2)$ parameters and $O(N^2)$ operations. These costs can be prohibitive in mobile applications or prevent scaling in many domains. Here, we introduce a deep, differentiable, fully-connected neural network module composed of diagonal matrices of parameters, $\\mathbf{A}$ and $\\mathbf{D}$, and the discrete cosine transform $\\mathbf{C}$. The core module, structured as $\\mathbf{ACDC^{-1}}$, has $O(N)$ parameters and incurs $O(N log N )$ operations. We present theoretical results showing "},"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":"1511.05946","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T20:52:17Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"ad694c9d72823f03d0c31a4af6632f503573d381b9a28f2381a15a73c34f4acf","abstract_canon_sha256":"f7295759f0eff6def6036645f476f9e0b8edb11f38dce1a0e404ed995947103e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.357024Z","signature_b64":"Nl5puk1RuJ5srD417QMxLGYtM4MKy7BfhFFKRj1u1DmC47ICqHc4Trl67PR6k618JKMHbnfmVKfRG+6BPtdABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d88a44d99a707f4de36748db2d1f03744cdcc13bd940dec246928a08162b71","last_reissued_at":"2026-05-18T01:18:52.356445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.356445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ACDC: A Structured Efficient Linear Layer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Jeremy Appleyard, Marcin Moczulski, Misha Denil, Nando de Freitas","submitted_at":"2015-11-18T20:52:17Z","abstract_excerpt":"The linear layer is one of the most pervasive modules in deep learning representations. However, it requires $O(N^2)$ parameters and $O(N^2)$ operations. These costs can be prohibitive in mobile applications or prevent scaling in many domains. Here, we introduce a deep, differentiable, fully-connected neural network module composed of diagonal matrices of parameters, $\\mathbf{A}$ and $\\mathbf{D}$, and the discrete cosine transform $\\mathbf{C}$. The core module, structured as $\\mathbf{ACDC^{-1}}$, has $O(N)$ parameters and incurs $O(N log N )$ operations. We present theoretical results showing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05946","kind":"arxiv","version":5},"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":"1511.05946","created_at":"2026-05-18T01:18:52.356507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05946v5","created_at":"2026-05-18T01:18:52.356507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05946","created_at":"2026-05-18T01:18:52.356507+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PMIURGZTJYH","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PMIURGZTJYH6TPD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PMIURGZ","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN","json":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN.json","graph_json":"https://pith.science/api/pith-number/4PMIURGZTJYH6TPDM5ENWLI7AN/graph.json","events_json":"https://pith.science/api/pith-number/4PMIURGZTJYH6TPDM5ENWLI7AN/events.json","paper":"https://pith.science/paper/4PMIURGZ"},"agent_actions":{"view_html":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN","download_json":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN.json","view_paper":"https://pith.science/paper/4PMIURGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05946&json=true","fetch_graph":"https://pith.science/api/pith-number/4PMIURGZTJYH6TPDM5ENWLI7AN/graph.json","fetch_events":"https://pith.science/api/pith-number/4PMIURGZTJYH6TPDM5ENWLI7AN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN/action/storage_attestation","attest_author":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN/action/author_attestation","sign_citation":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN/action/citation_signature","submit_replication":"https://pith.science/pith/4PMIURGZTJYH6TPDM5ENWLI7AN/action/replication_record"}},"created_at":"2026-05-18T01:18:52.356507+00:00","updated_at":"2026-05-18T01:18:52.356507+00:00"}