{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3TEA7LDUEORJADRIMPR54MOEJ7","short_pith_number":"pith:3TEA7LDU","canonical_record":{"source":{"id":"1805.08034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-21T13:08:31Z","cross_cats_sorted":["cs.LG","cs.NA","cs.NE"],"title_canon_sha256":"5359a4ff96c7b37f05a4e62c861109b713a7ab39d80a41e2e2cb77e3d748c87a","abstract_canon_sha256":"ec67ae9795ad4493d211cb72b65ae3215803fc9c7b2cf6f312184ba716b66c6f"},"schema_version":"1.0"},"canonical_sha256":"dcc80fac7423a2900e2863e3de31c44fc1b87274c77176a8780c45bd9c11fb20","source":{"kind":"arxiv","id":"1805.08034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08034","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08034v2","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08034","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"3TEA7LDUEORJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3TEA7LDUEORJADRI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3TEA7LDU","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3TEA7LDUEORJADRIMPR54MOEJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-21T13:08:31Z","cross_cats_sorted":["cs.LG","cs.NA","cs.NE"],"title_canon_sha256":"5359a4ff96c7b37f05a4e62c861109b713a7ab39d80a41e2e2cb77e3d748c87a","abstract_canon_sha256":"ec67ae9795ad4493d211cb72b65ae3215803fc9c7b2cf6f312184ba716b66c6f"},"schema_version":"1.0"},"canonical_sha256":"dcc80fac7423a2900e2863e3de31c44fc1b87274c77176a8780c45bd9c11fb20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:33.698042Z","signature_b64":"nkFbexNixOhf9hX8GgGrB2LpWggncijI0EOWAd3W8UIh0btydFa7PFvq1kaE1jrNThKPGhPMoJm2aEqQ6o1/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcc80fac7423a2900e2863e3de31c44fc1b87274c77176a8780c45bd9c11fb20","last_reissued_at":"2026-05-18T00:14:33.697464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:33.697464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08034","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7bVasRfCD60VQLlHbT9C4n+1GoWVau/gg/aGbRD4APNy5ypr75WXWvjEIby2pJa0XEEUiKdjVaRzC/pGTgWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:49:28.458852Z"},"content_sha256":"59a40f99f9604341c318b8590df42f9b0b586359fd785536296f5a482de135ee","schema_version":"1.0","event_id":"sha256:59a40f99f9604341c318b8590df42f9b0b586359fd785536296f5a482de135ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3TEA7LDUEORJADRIMPR54MOEJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Never look back - A modified EnKF method and its application to the training of neural networks without back propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","cs.NE"],"primary_cat":"math.NA","authors_text":"Eldad Haber, Felix Lucka, Lars Ruthotto","submitted_at":"2018-05-21T13:08:31Z","abstract_excerpt":"In this work, we present a new derivative-free optimization method and investigate its use for training neural networks. Our method is motivated by the Ensemble Kalman Filter (EnKF), which has been used successfully for solving optimization problems that involve large-scale, highly nonlinear dynamical systems. A key benefit of the EnKF method is that it requires only the evaluation of the forward propagation but not its derivatives. Hence, in the context of neural networks, it alleviates the need for back propagation and reduces the memory consumption dramatically. However, the method is not a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08034","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9p+ukCtpuNG/dzxdorXOp5EkX254HeW5v02AakYd6n6HJF0g/azEdDecS5gp9ifeDk++ahPVmhBMyxa9dufBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:49:28.459654Z"},"content_sha256":"2d38bab14a803ce8823baa1b877790c5181c63d606075dd5926e3ea3064d3f53","schema_version":"1.0","event_id":"sha256:2d38bab14a803ce8823baa1b877790c5181c63d606075dd5926e3ea3064d3f53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TEA7LDUEORJADRIMPR54MOEJ7/bundle.json","state_url":"https://pith.science/pith/3TEA7LDUEORJADRIMPR54MOEJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TEA7LDUEORJADRIMPR54MOEJ7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T21:49:28Z","links":{"resolver":"https://pith.science/pith/3TEA7LDUEORJADRIMPR54MOEJ7","bundle":"https://pith.science/pith/3TEA7LDUEORJADRIMPR54MOEJ7/bundle.json","state":"https://pith.science/pith/3TEA7LDUEORJADRIMPR54MOEJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TEA7LDUEORJADRIMPR54MOEJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3TEA7LDUEORJADRIMPR54MOEJ7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ec67ae9795ad4493d211cb72b65ae3215803fc9c7b2cf6f312184ba716b66c6f","cross_cats_sorted":["cs.LG","cs.NA","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-21T13:08:31Z","title_canon_sha256":"5359a4ff96c7b37f05a4e62c861109b713a7ab39d80a41e2e2cb77e3d748c87a"},"schema_version":"1.0","source":{"id":"1805.08034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08034","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08034v2","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08034","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"3TEA7LDUEORJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3TEA7LDUEORJADRI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3TEA7LDU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:2d38bab14a803ce8823baa1b877790c5181c63d606075dd5926e3ea3064d3f53","target":"graph","created_at":"2026-05-18T00:14:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this work, we present a new derivative-free optimization method and investigate its use for training neural networks. Our method is motivated by the Ensemble Kalman Filter (EnKF), which has been used successfully for solving optimization problems that involve large-scale, highly nonlinear dynamical systems. A key benefit of the EnKF method is that it requires only the evaluation of the forward propagation but not its derivatives. Hence, in the context of neural networks, it alleviates the need for back propagation and reduces the memory consumption dramatically. However, the method is not a","authors_text":"Eldad Haber, Felix Lucka, Lars Ruthotto","cross_cats":["cs.LG","cs.NA","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-21T13:08:31Z","title":"Never look back - A modified EnKF method and its application to the training of neural networks without back propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08034","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59a40f99f9604341c318b8590df42f9b0b586359fd785536296f5a482de135ee","target":"record","created_at":"2026-05-18T00:14:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ec67ae9795ad4493d211cb72b65ae3215803fc9c7b2cf6f312184ba716b66c6f","cross_cats_sorted":["cs.LG","cs.NA","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-21T13:08:31Z","title_canon_sha256":"5359a4ff96c7b37f05a4e62c861109b713a7ab39d80a41e2e2cb77e3d748c87a"},"schema_version":"1.0","source":{"id":"1805.08034","kind":"arxiv","version":2}},"canonical_sha256":"dcc80fac7423a2900e2863e3de31c44fc1b87274c77176a8780c45bd9c11fb20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcc80fac7423a2900e2863e3de31c44fc1b87274c77176a8780c45bd9c11fb20","first_computed_at":"2026-05-18T00:14:33.697464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:33.697464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkFbexNixOhf9hX8GgGrB2LpWggncijI0EOWAd3W8UIh0btydFa7PFvq1kaE1jrNThKPGhPMoJm2aEqQ6o1/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:33.698042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59a40f99f9604341c318b8590df42f9b0b586359fd785536296f5a482de135ee","sha256:2d38bab14a803ce8823baa1b877790c5181c63d606075dd5926e3ea3064d3f53"],"state_sha256":"75e17a599abe7dd542b835fd27a8f306bc439185b031227bbf4bad7e971f3db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8/da8kxATQGpTLu+bUz9LMWuraEo6nvS0waPXUkMo3TqrekY/dCJmM2jyuW6MFTkuprTfa1sRiPD6XYMskRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:49:28.463962Z","bundle_sha256":"b936e9314ab1809d997ca50f50580ec80bed576f116a75bc59d8f624223d232c"}}