{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IHGIRJNEEOYOR7HPIL3RTZT7QT","short_pith_number":"pith:IHGIRJNE","schema_version":"1.0","canonical_sha256":"41cc88a5a423b0e8fcef42f719e67f84d09b3db08c6e04bda8d090f8336f1a5f","source":{"kind":"arxiv","id":"2204.08279","version":1},"attestation_state":"computed","paper":{"title":"Communication Bounds for Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Anthony Chen, Grace Dinh, James Demmel, Mason Haberle, Olga Holtz","submitted_at":"2022-04-18T12:19:27Z","abstract_excerpt":"Convolutional neural networks (CNNs) are important in a wide variety of machine learning tasks and applications, so optimizing their performance is essential. Moving words of data between levels of a memory hierarchy or between processors on a network is much more expensive than the cost of arithmetic, so minimizing communication is critical to optimizing performance. In this paper, we present new lower bounds on data movement for mixed precision convolutions in both single-processor and parallel distributed memory models, as well as algorithms that outperform current implementations such as I"},"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":"2204.08279","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-04-18T12:19:27Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"278822f6a4d0cb6852170a8f04ca7c5f083a1b7ac3694278a8c9ddbc6970fafe","abstract_canon_sha256":"838db2e0bdb5f99da36e23b62cdb2374b7d6209f538eed8fec26e54ec5129f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:01.563171Z","signature_b64":"tZg7VNAiqOby6kRsTd679Ke4JsqaisjRsj+Fb7LnUkERjPu8n90lDsoWDGdNm49CU/4SsIhFSIEl/2HARgASAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41cc88a5a423b0e8fcef42f719e67f84d09b3db08c6e04bda8d090f8336f1a5f","last_reissued_at":"2026-07-05T04:40:01.562724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:01.562724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Bounds for Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Anthony Chen, Grace Dinh, James Demmel, Mason Haberle, Olga Holtz","submitted_at":"2022-04-18T12:19:27Z","abstract_excerpt":"Convolutional neural networks (CNNs) are important in a wide variety of machine learning tasks and applications, so optimizing their performance is essential. Moving words of data between levels of a memory hierarchy or between processors on a network is much more expensive than the cost of arithmetic, so minimizing communication is critical to optimizing performance. In this paper, we present new lower bounds on data movement for mixed precision convolutions in both single-processor and parallel distributed memory models, as well as algorithms that outperform current implementations such as I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08279","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/2204.08279/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":"2204.08279","created_at":"2026-07-05T04:40:01.562786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.08279v1","created_at":"2026-07-05T04:40:01.562786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08279","created_at":"2026-07-05T04:40:01.562786+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHGIRJNEEOYO","created_at":"2026-07-05T04:40:01.562786+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHGIRJNEEOYOR7HP","created_at":"2026-07-05T04:40:01.562786+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHGIRJNE","created_at":"2026-07-05T04:40:01.562786+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17476","citing_title":"Privatar: Scalable Privacy-preserving Multi-user VR via Secure Offloading","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT","json":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT.json","graph_json":"https://pith.science/api/pith-number/IHGIRJNEEOYOR7HPIL3RTZT7QT/graph.json","events_json":"https://pith.science/api/pith-number/IHGIRJNEEOYOR7HPIL3RTZT7QT/events.json","paper":"https://pith.science/paper/IHGIRJNE"},"agent_actions":{"view_html":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT","download_json":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT.json","view_paper":"https://pith.science/paper/IHGIRJNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.08279&json=true","fetch_graph":"https://pith.science/api/pith-number/IHGIRJNEEOYOR7HPIL3RTZT7QT/graph.json","fetch_events":"https://pith.science/api/pith-number/IHGIRJNEEOYOR7HPIL3RTZT7QT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT/action/storage_attestation","attest_author":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT/action/author_attestation","sign_citation":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT/action/citation_signature","submit_replication":"https://pith.science/pith/IHGIRJNEEOYOR7HPIL3RTZT7QT/action/replication_record"}},"created_at":"2026-07-05T04:40:01.562786+00:00","updated_at":"2026-07-05T04:40:01.562786+00:00"}