{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VMM24HWRDQGV4NYKQ7ECRSLDUP","short_pith_number":"pith:VMM24HWR","schema_version":"1.0","canonical_sha256":"ab19ae1ed11c0d5e370a87c828c963a3d077403f9b2deac57f3e7fb09603d6ce","source":{"kind":"arxiv","id":"1709.03395","version":1},"attestation_state":"computed","paper":{"title":"Low-memory GEMM-based convolution algorithms for deep neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew Anderson, Aravind Vasudevan, Cormac Keane, David Gregg","submitted_at":"2017-09-08T06:32:33Z","abstract_excerpt":"Deep neural networks (DNNs) require very large amounts of computation both for training and for inference when deployed in the field. A common approach to implementing DNNs is to recast the most computationally expensive operations as general matrix multiplication (GEMM). However, as we demonstrate in this paper, there are a great many different ways to express DNN convolution operations using GEMM. Although different approaches all perform the same number of operations, the size of temporary data structures differs significantly. Convolution of an input matrix with dimensions $C \\times H \\tim"},"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":"1709.03395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-08T06:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"b1f8bb24810486e6c316a3e93e01bd61bcfdacc06336b8bb50638848480fc198","abstract_canon_sha256":"9c4c02c716f45c755466b893262f2980775d761fc8744f2d29456b090bf54492"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:38.546631Z","signature_b64":"lQnc8Vm6Q4ITB7rzSEuhRApwVoirCEDa7gVZSQJKG1qP3onLgYRhCc7vzHPiq3B2u0crXPxdY85LiszMiw6QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab19ae1ed11c0d5e370a87c828c963a3d077403f9b2deac57f3e7fb09603d6ce","last_reissued_at":"2026-05-18T00:35:38.546039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:38.546039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-memory GEMM-based convolution algorithms for deep neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew Anderson, Aravind Vasudevan, Cormac Keane, David Gregg","submitted_at":"2017-09-08T06:32:33Z","abstract_excerpt":"Deep neural networks (DNNs) require very large amounts of computation both for training and for inference when deployed in the field. A common approach to implementing DNNs is to recast the most computationally expensive operations as general matrix multiplication (GEMM). However, as we demonstrate in this paper, there are a great many different ways to express DNN convolution operations using GEMM. Although different approaches all perform the same number of operations, the size of temporary data structures differs significantly. Convolution of an input matrix with dimensions $C \\times H \\tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03395","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":"1709.03395","created_at":"2026-05-18T00:35:38.546133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03395v1","created_at":"2026-05-18T00:35:38.546133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03395","created_at":"2026-05-18T00:35:38.546133+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMM24HWRDQGV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMM24HWRDQGV4NYK","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMM24HWR","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.11096","citing_title":"Mapped Convolutions","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02129","citing_title":"The Indirect Convolution Algorithm","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP","json":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP.json","graph_json":"https://pith.science/api/pith-number/VMM24HWRDQGV4NYKQ7ECRSLDUP/graph.json","events_json":"https://pith.science/api/pith-number/VMM24HWRDQGV4NYKQ7ECRSLDUP/events.json","paper":"https://pith.science/paper/VMM24HWR"},"agent_actions":{"view_html":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP","download_json":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP.json","view_paper":"https://pith.science/paper/VMM24HWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03395&json=true","fetch_graph":"https://pith.science/api/pith-number/VMM24HWRDQGV4NYKQ7ECRSLDUP/graph.json","fetch_events":"https://pith.science/api/pith-number/VMM24HWRDQGV4NYKQ7ECRSLDUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP/action/storage_attestation","attest_author":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP/action/author_attestation","sign_citation":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP/action/citation_signature","submit_replication":"https://pith.science/pith/VMM24HWRDQGV4NYKQ7ECRSLDUP/action/replication_record"}},"created_at":"2026-05-18T00:35:38.546133+00:00","updated_at":"2026-05-18T00:35:38.546133+00:00"}