{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5SAN2IAE4BJZU7LVPW66BIALUH","short_pith_number":"pith:5SAN2IAE","schema_version":"1.0","canonical_sha256":"ec80dd2004e0539a7d757dbde0a00ba1c989f1037fe432a133fa480153244eaf","source":{"kind":"arxiv","id":"2606.21497","version":1},"attestation_state":"computed","paper":{"title":"Breaking chains with trees: Deep learning with $\\mathcal{O}(\\log N)$ parallel time complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Aditya Nagarsekar, Amit Kumar Pal, Anand Subramoney, Cabrel Teguemne Fokam, David Kappel, Neeraj Mohan Sushma, Robin Schiewer","submitted_at":"2026-06-19T14:44:07Z","abstract_excerpt":"Modern deep neural network architectures are trained via backpropagation, which requires errors to be sequentially propagated through all layers before parameters can be updated. This introduces two limitations: locking, where layer-wise updates are strictly interdependent and cannot proceed in parallel, and the weight transport problem, which requires symmetric forward and backward pathways for exact gradient computation. These constraints restrict parallelism, increase memory and communication overhead, and pose challenges for scalable learning. In this work, we propose Hierarchical Block-Lo"},"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":"2606.21497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T14:44:07Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"46a71ea4dbe2b732bd5fe0077096403ac3c8a93802827844407029e8f73c9335","abstract_canon_sha256":"6f32a1b33d1cfd48fe3b9bfb5b6e270be233f9ad8a98a4d9ed68cb1ef8feb79a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:12.506121Z","signature_b64":"5SsO2C34WK5hvwC+PB1LybhcEKLvhO/d44jePowWR31XXd2PYu2f7gwXQhbMBUAmwfOBfaTymsfPlyvVuB9uCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec80dd2004e0539a7d757dbde0a00ba1c989f1037fe432a133fa480153244eaf","last_reissued_at":"2026-06-23T01:13:12.505677Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:12.505677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking chains with trees: Deep learning with $\\mathcal{O}(\\log N)$ parallel time complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Aditya Nagarsekar, Amit Kumar Pal, Anand Subramoney, Cabrel Teguemne Fokam, David Kappel, Neeraj Mohan Sushma, Robin Schiewer","submitted_at":"2026-06-19T14:44:07Z","abstract_excerpt":"Modern deep neural network architectures are trained via backpropagation, which requires errors to be sequentially propagated through all layers before parameters can be updated. This introduces two limitations: locking, where layer-wise updates are strictly interdependent and cannot proceed in parallel, and the weight transport problem, which requires symmetric forward and backward pathways for exact gradient computation. These constraints restrict parallelism, increase memory and communication overhead, and pose challenges for scalable learning. In this work, we propose Hierarchical Block-Lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21497","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/2606.21497/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":"2606.21497","created_at":"2026-06-23T01:13:12.505750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21497v1","created_at":"2026-06-23T01:13:12.505750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21497","created_at":"2026-06-23T01:13:12.505750+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SAN2IAE4BJZ","created_at":"2026-06-23T01:13:12.505750+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SAN2IAE4BJZU7LV","created_at":"2026-06-23T01:13:12.505750+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SAN2IAE","created_at":"2026-06-23T01:13:12.505750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH","json":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH.json","graph_json":"https://pith.science/api/pith-number/5SAN2IAE4BJZU7LVPW66BIALUH/graph.json","events_json":"https://pith.science/api/pith-number/5SAN2IAE4BJZU7LVPW66BIALUH/events.json","paper":"https://pith.science/paper/5SAN2IAE"},"agent_actions":{"view_html":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH","download_json":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH.json","view_paper":"https://pith.science/paper/5SAN2IAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21497&json=true","fetch_graph":"https://pith.science/api/pith-number/5SAN2IAE4BJZU7LVPW66BIALUH/graph.json","fetch_events":"https://pith.science/api/pith-number/5SAN2IAE4BJZU7LVPW66BIALUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH/action/storage_attestation","attest_author":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH/action/author_attestation","sign_citation":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH/action/citation_signature","submit_replication":"https://pith.science/pith/5SAN2IAE4BJZU7LVPW66BIALUH/action/replication_record"}},"created_at":"2026-06-23T01:13:12.505750+00:00","updated_at":"2026-06-23T01:13:12.505750+00:00"}