{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DVYHNZXGT5AQX657IHCPIL3WHQ","short_pith_number":"pith:DVYHNZXG","schema_version":"1.0","canonical_sha256":"1d7076e6e69f410bfbbf41c4f42f763c0622ed27667c5de1a3a094bd9f82c083","source":{"kind":"arxiv","id":"2007.05558","version":2},"attestation_state":"computed","paper":{"title":"The Computational Limits of Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel F. Manso, Keeheon Lee, Kristjan Greenewald, Neil C. Thompson","submitted_at":"2020-07-10T18:26:17Z","abstract_excerpt":"Deep learning's recent history has been one of achievement: from triumphing over humans in the game of Go to world-leading performance in image classification, voice recognition, translation, and other tasks. But this progress has come with a voracious appetite for computing power. This article catalogs the extent of this dependency, showing that progress across a wide variety of applications is strongly reliant on increases in computing power. Extrapolating forward this reliance reveals that progress along current lines is rapidly becoming economically, technically, and environmentally unsust"},"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":"2007.05558","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-10T18:26:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9fbbaac79b17e257f585702e62fcbef1415194c4fd65fb40589326ef6ddf111a","abstract_canon_sha256":"1a699797117c516ed82f7d31dbefd75f72a31cad4f8dff11379743ec223c6c83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:43:56.031993Z","signature_b64":"PsesZYKEqRLV2whRKZ4yid4ic/n0XleYPMvhlIUKnTTgQ0TDjdfMFSqc1z7SXHh+6cogGBDigZZ5v0ybWEplBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7076e6e69f410bfbbf41c4f42f763c0622ed27667c5de1a3a094bd9f82c083","last_reissued_at":"2026-07-05T04:43:56.031518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:43:56.031518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Limits of Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel F. Manso, Keeheon Lee, Kristjan Greenewald, Neil C. Thompson","submitted_at":"2020-07-10T18:26:17Z","abstract_excerpt":"Deep learning's recent history has been one of achievement: from triumphing over humans in the game of Go to world-leading performance in image classification, voice recognition, translation, and other tasks. But this progress has come with a voracious appetite for computing power. This article catalogs the extent of this dependency, showing that progress across a wide variety of applications is strongly reliant on increases in computing power. Extrapolating forward this reliance reveals that progress along current lines is rapidly becoming economically, technically, and environmentally unsust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05558","kind":"arxiv","version":2},"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/2007.05558/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":"2007.05558","created_at":"2026-07-05T04:43:56.031579+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.05558v2","created_at":"2026-07-05T04:43:56.031579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05558","created_at":"2026-07-05T04:43:56.031579+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVYHNZXGT5AQ","created_at":"2026-07-05T04:43:56.031579+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVYHNZXGT5AQX657","created_at":"2026-07-05T04:43:56.031579+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVYHNZXG","created_at":"2026-07-05T04:43:56.031579+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":18,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02158","citing_title":"Efficient PEFT Methods with Adaptive Checkpointing for Vision Models and VLMs on Resource Constrained Consumer-GPUs","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10969","citing_title":"A Functional Data Framework For Analyzing Shapes and Textures in Images","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23051","citing_title":"General-Purpose Photonic Computing Primitive for Contemporary Artificial Intelligence","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23656","citing_title":"Recursive Block-Diagonal Coupling for Resource-Efficient Training of Vision Models","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2503.08223","citing_title":"Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devices","ref_index":129,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03241","citing_title":"OptiLookUp: An Optical ROM-Based Lookup Table Engine for Photonic Accelerators","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2602.07618","citing_title":"Neural Networks With Dense Weights Are Not Universal Approximators","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2509.06086","citing_title":"From Membership-Privacy Leakage to Quantum Machine Unlearning","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2408.00724","citing_title":"Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models","ref_index":216,"is_internal_anchor":false},{"citing_arxiv_id":"2512.03915","citing_title":"A Theoretical Framework for Auxiliary-Loss-Free Load Balancing of Sparse Mixture-of-Experts in Large-Scale AI Models","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2602.07618","citing_title":"Neural Networks With Dense Weights Are Not Universal Approximators","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11733","citing_title":"Position: LLM Inference Should Be Evaluated as Energy-to-Token Production","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26507","citing_title":"Auto-Relational Reasoning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03241","citing_title":"OptiLookUp: An Optical ROM-Based Lookup Table Engine for Photonic Accelerators","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23108","citing_title":"Mixture of Heterogeneous Grouped Experts for Language Modeling","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06323","citing_title":"Blockchain and AI: Securing Intelligent Networks for the Future","ref_index":131,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04483","citing_title":"STRIDe: Cross-Coupled STT-MRAM Enabling Robust In-Memory-Computing for Deep Neural Network Accelerators","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20629","citing_title":"Rates of forgetting for the sequentially Markov coalescent","ref_index":152,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ","json":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ.json","graph_json":"https://pith.science/api/pith-number/DVYHNZXGT5AQX657IHCPIL3WHQ/graph.json","events_json":"https://pith.science/api/pith-number/DVYHNZXGT5AQX657IHCPIL3WHQ/events.json","paper":"https://pith.science/paper/DVYHNZXG"},"agent_actions":{"view_html":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ","download_json":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ.json","view_paper":"https://pith.science/paper/DVYHNZXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.05558&json=true","fetch_graph":"https://pith.science/api/pith-number/DVYHNZXGT5AQX657IHCPIL3WHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DVYHNZXGT5AQX657IHCPIL3WHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ/action/storage_attestation","attest_author":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ/action/author_attestation","sign_citation":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ/action/citation_signature","submit_replication":"https://pith.science/pith/DVYHNZXGT5AQX657IHCPIL3WHQ/action/replication_record"}},"created_at":"2026-07-05T04:43:56.031579+00:00","updated_at":"2026-07-05T04:43:56.031579+00:00"}