{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RXACGGSD3FADQTK6KLQ37IH5PK","short_pith_number":"pith:RXACGGSD","schema_version":"1.0","canonical_sha256":"8dc0231a43d940384d5e52e1bfa0fd7ab3835f2c545e625604e5a7b2330caee0","source":{"kind":"arxiv","id":"2010.01369","version":1},"attestation_state":"computed","paper":{"title":"Computational Separation Between Convolutional and Fully-Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eran Malach, Shai Shalev-Shwartz","submitted_at":"2020-10-03T14:24:59Z","abstract_excerpt":"Convolutional neural networks (CNN) exhibit unmatched performance in a multitude of computer vision tasks. However, the advantage of using convolutional networks over fully-connected networks is not understood from a theoretical perspective. In this work, we show how convolutional networks can leverage locality in the data, and thus achieve a computational advantage over fully-connected networks. Specifically, we show a class of problems that can be efficiently solved using convolutional networks trained with gradient-descent, but at the same time is hard to learn using a polynomial-size fully"},"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":"2010.01369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-03T14:24:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"178b5c29986ddc1a14d3e7bb58d543d58ef477e44f0dda3f75268b7a09157994","abstract_canon_sha256":"3be4708ff35ba85f8cd62bd93a7a4d902409c10a90598b8cb88c167c97c6fc11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:04.650680Z","signature_b64":"6mKhegojdvQUB/LkCcV3MuXB+m6RTqTFSSJqE+15Xeb+Zxl58IknBppACoYZQH9LtF8wVkXMJdR4+4Nk4tL+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc0231a43d940384d5e52e1bfa0fd7ab3835f2c545e625604e5a7b2330caee0","last_reissued_at":"2026-07-05T01:40:04.650190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:04.650190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Separation Between Convolutional and Fully-Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eran Malach, Shai Shalev-Shwartz","submitted_at":"2020-10-03T14:24:59Z","abstract_excerpt":"Convolutional neural networks (CNN) exhibit unmatched performance in a multitude of computer vision tasks. However, the advantage of using convolutional networks over fully-connected networks is not understood from a theoretical perspective. In this work, we show how convolutional networks can leverage locality in the data, and thus achieve a computational advantage over fully-connected networks. Specifically, we show a class of problems that can be efficiently solved using convolutional networks trained with gradient-descent, but at the same time is hard to learn using a polynomial-size fully"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01369","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/2010.01369/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":"2010.01369","created_at":"2026-07-05T01:40:04.650255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.01369v1","created_at":"2026-07-05T01:40:04.650255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01369","created_at":"2026-07-05T01:40:04.650255+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXACGGSD3FAD","created_at":"2026-07-05T01:40:04.650255+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXACGGSD3FADQTK6","created_at":"2026-07-05T01:40:04.650255+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXACGGSD","created_at":"2026-07-05T01:40:04.650255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10237","citing_title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK","json":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK.json","graph_json":"https://pith.science/api/pith-number/RXACGGSD3FADQTK6KLQ37IH5PK/graph.json","events_json":"https://pith.science/api/pith-number/RXACGGSD3FADQTK6KLQ37IH5PK/events.json","paper":"https://pith.science/paper/RXACGGSD"},"agent_actions":{"view_html":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK","download_json":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK.json","view_paper":"https://pith.science/paper/RXACGGSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.01369&json=true","fetch_graph":"https://pith.science/api/pith-number/RXACGGSD3FADQTK6KLQ37IH5PK/graph.json","fetch_events":"https://pith.science/api/pith-number/RXACGGSD3FADQTK6KLQ37IH5PK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK/action/storage_attestation","attest_author":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK/action/author_attestation","sign_citation":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK/action/citation_signature","submit_replication":"https://pith.science/pith/RXACGGSD3FADQTK6KLQ37IH5PK/action/replication_record"}},"created_at":"2026-07-05T01:40:04.650255+00:00","updated_at":"2026-07-05T01:40:04.650255+00:00"}