{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TRA6JABR2SKPUFHLZLJEDXORWA","short_pith_number":"pith:TRA6JABR","schema_version":"1.0","canonical_sha256":"9c41e48031d494fa14ebcad241ddd1b0271b6b46cf62bc9ec7a65361e255f9f7","source":{"kind":"arxiv","id":"1902.10298","version":3},"attestation_state":"computed","paper":{"title":"ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Gholami, George Biros, Kurt Keutzer","submitted_at":"2019-02-27T01:48:32Z","abstract_excerpt":"Residual neural networks can be viewed as the forward Euler discretization of an Ordinary Differential Equation (ODE) with a unit time step. This has recently motivated researchers to explore other discretization approaches and train ODE based networks. However, an important challenge of neural ODEs is their prohibitive memory cost during gradient backpropogation. Recently a method proposed in [8], claimed that this memory overhead can be reduced from O(LN_t), where N_t is the number of time steps, down to O(L) by solving forward ODE backwards in time, where L is the depth of the network. Howe"},"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":"1902.10298","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T01:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"d3d4e265ad7109e83bb1372da33801eb39567491c27d26455b92245575e2e4eb","abstract_canon_sha256":"2ae3818abb568a21bd2d87b4165e1e5c08efbf42958964667cc247ba898ca0c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:53.364952Z","signature_b64":"XK7YU8mIpCBDCUVzDqBHxVaAroFd6Oms616d2/X7qTUj8/q4445WHUYQGKms9nnRXxeaqGcRZkebuieIj6QGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c41e48031d494fa14ebcad241ddd1b0271b6b46cf62bc9ec7a65361e255f9f7","last_reissued_at":"2026-05-17T23:41:53.364348Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:53.364348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Gholami, George Biros, Kurt Keutzer","submitted_at":"2019-02-27T01:48:32Z","abstract_excerpt":"Residual neural networks can be viewed as the forward Euler discretization of an Ordinary Differential Equation (ODE) with a unit time step. This has recently motivated researchers to explore other discretization approaches and train ODE based networks. However, an important challenge of neural ODEs is their prohibitive memory cost during gradient backpropogation. Recently a method proposed in [8], claimed that this memory overhead can be reduced from O(LN_t), where N_t is the number of time steps, down to O(L) by solving forward ODE backwards in time, where L is the depth of the network. Howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10298","kind":"arxiv","version":3},"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":"1902.10298","created_at":"2026-05-17T23:41:53.364445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10298v3","created_at":"2026-05-17T23:41:53.364445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10298","created_at":"2026-05-17T23:41:53.364445+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRA6JABR2SKP","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRA6JABR2SKPUFHL","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRA6JABR","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2001.04385","citing_title":"Universal Differential Equations for Scientific Machine Learning","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2511.05757","citing_title":"Zero-Shot Function Encoder-Based Differentiable Predictive Control","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA","json":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA.json","graph_json":"https://pith.science/api/pith-number/TRA6JABR2SKPUFHLZLJEDXORWA/graph.json","events_json":"https://pith.science/api/pith-number/TRA6JABR2SKPUFHLZLJEDXORWA/events.json","paper":"https://pith.science/paper/TRA6JABR"},"agent_actions":{"view_html":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA","download_json":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA.json","view_paper":"https://pith.science/paper/TRA6JABR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10298&json=true","fetch_graph":"https://pith.science/api/pith-number/TRA6JABR2SKPUFHLZLJEDXORWA/graph.json","fetch_events":"https://pith.science/api/pith-number/TRA6JABR2SKPUFHLZLJEDXORWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA/action/storage_attestation","attest_author":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA/action/author_attestation","sign_citation":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA/action/citation_signature","submit_replication":"https://pith.science/pith/TRA6JABR2SKPUFHLZLJEDXORWA/action/replication_record"}},"created_at":"2026-05-17T23:41:53.364445+00:00","updated_at":"2026-05-17T23:41:53.364445+00:00"}