{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DDPADHPGCCJ3IT33NR37TQ26YD","short_pith_number":"pith:DDPADHPG","canonical_record":{"source":{"id":"1805.09430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T21:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"48cf3eb79b8bd2b225a9777121c1a20c088b623aa9f10a22714e7c4f034bfdf8","abstract_canon_sha256":"fb6fb4e89d58de6d8787146767dbd48e62fc4beaa34fb314ec10e095e2633b80"},"schema_version":"1.0"},"canonical_sha256":"18de019de61093b44f7b6c77f9c35ec0db31a80d6a06527c83a1d345084b275e","source":{"kind":"arxiv","id":"1805.09430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09430","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09430v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09430","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"DDPADHPGCCJ3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DDPADHPGCCJ3IT33","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DDPADHPG","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DDPADHPGCCJ3IT33NR37TQ26YD","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T21:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"48cf3eb79b8bd2b225a9777121c1a20c088b623aa9f10a22714e7c4f034bfdf8","abstract_canon_sha256":"fb6fb4e89d58de6d8787146767dbd48e62fc4beaa34fb314ec10e095e2633b80"},"schema_version":"1.0"},"canonical_sha256":"18de019de61093b44f7b6c77f9c35ec0db31a80d6a06527c83a1d345084b275e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.970954Z","signature_b64":"l+E/AYsWkm4vB839V28oVY1G6mueDqGa3FxAj55hAbULyk/Tq63num8MkCx7bHMmqlakDIVCpLZFzQRgRDC/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18de019de61093b44f7b6c77f9c35ec0db31a80d6a06527c83a1d345084b275e","last_reissued_at":"2026-05-18T00:15:03.970292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.970292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09430","source_version":1,"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:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vwi3FKHevKoFGnEEgEZ72rxnq6qeotd8s8CaWm0yfmJfjjAEqmUwfspFV0xgJ14JCgf6evim17LFSuiO1yFACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:39:35.947587Z"},"content_sha256":"78f977183073964faf5aa0dc8a9d94741c08cf5e64b4976536044b1c487bc357","schema_version":"1.0","event_id":"sha256:78f977183073964faf5aa0dc8a9d94741c08cf5e64b4976536044b1c487bc357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DDPADHPGCCJ3IT33NR37TQ26YD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Stage Subspace Trust Region Approach for Deep Neural Network Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Emilie Chouzenoux, Giovanni Chierchia, Jean-Christophe Pesquet, Viacheslav Dudar, Vladimir Semenov","submitted_at":"2018-05-23T21:12:48Z","abstract_excerpt":"In this paper, we develop a novel second-order method for training feed-forward neural nets. At each iteration, we construct a quadratic approximation to the cost function in a low-dimensional subspace. We minimize this approximation inside a trust region through a two-stage procedure: first inside the embedded positive curvature subspace, followed by a gradient descent step. This approach leads to a fast objective function decay, prevents convergence to saddle points, and alleviates the need for manually tuning parameters. We show the good performance of the proposed algorithm on benchmark da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09430","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"},"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:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1w521NeiUxK2CY8bJ4eRgw8kvQlN+Ybiw2LE7B+GunOHGIGzP7AkC/qlKJRMME0Gf3QEi08TnOhCW5VRhnWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:39:35.947931Z"},"content_sha256":"1519a88a7042b4911ecc2d9b6c5d68c0696bc53aab43d3b3c6a4009a54f6563d","schema_version":"1.0","event_id":"sha256:1519a88a7042b4911ecc2d9b6c5d68c0696bc53aab43d3b3c6a4009a54f6563d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDPADHPGCCJ3IT33NR37TQ26YD/bundle.json","state_url":"https://pith.science/pith/DDPADHPGCCJ3IT33NR37TQ26YD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDPADHPGCCJ3IT33NR37TQ26YD/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-06-27T06:39:35Z","links":{"resolver":"https://pith.science/pith/DDPADHPGCCJ3IT33NR37TQ26YD","bundle":"https://pith.science/pith/DDPADHPGCCJ3IT33NR37TQ26YD/bundle.json","state":"https://pith.science/pith/DDPADHPGCCJ3IT33NR37TQ26YD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDPADHPGCCJ3IT33NR37TQ26YD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DDPADHPGCCJ3IT33NR37TQ26YD","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":"fb6fb4e89d58de6d8787146767dbd48e62fc4beaa34fb314ec10e095e2633b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T21:12:48Z","title_canon_sha256":"48cf3eb79b8bd2b225a9777121c1a20c088b623aa9f10a22714e7c4f034bfdf8"},"schema_version":"1.0","source":{"id":"1805.09430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09430","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09430v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09430","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"DDPADHPGCCJ3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DDPADHPGCCJ3IT33","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DDPADHPG","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:1519a88a7042b4911ecc2d9b6c5d68c0696bc53aab43d3b3c6a4009a54f6563d","target":"graph","created_at":"2026-05-18T00:15:03Z","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 paper, we develop a novel second-order method for training feed-forward neural nets. At each iteration, we construct a quadratic approximation to the cost function in a low-dimensional subspace. We minimize this approximation inside a trust region through a two-stage procedure: first inside the embedded positive curvature subspace, followed by a gradient descent step. This approach leads to a fast objective function decay, prevents convergence to saddle points, and alleviates the need for manually tuning parameters. We show the good performance of the proposed algorithm on benchmark da","authors_text":"Emilie Chouzenoux, Giovanni Chierchia, Jean-Christophe Pesquet, Viacheslav Dudar, Vladimir Semenov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T21:12:48Z","title":"A Two-Stage Subspace Trust Region Approach for Deep Neural Network Training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09430","kind":"arxiv","version":1},"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:78f977183073964faf5aa0dc8a9d94741c08cf5e64b4976536044b1c487bc357","target":"record","created_at":"2026-05-18T00:15:03Z","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":"fb6fb4e89d58de6d8787146767dbd48e62fc4beaa34fb314ec10e095e2633b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T21:12:48Z","title_canon_sha256":"48cf3eb79b8bd2b225a9777121c1a20c088b623aa9f10a22714e7c4f034bfdf8"},"schema_version":"1.0","source":{"id":"1805.09430","kind":"arxiv","version":1}},"canonical_sha256":"18de019de61093b44f7b6c77f9c35ec0db31a80d6a06527c83a1d345084b275e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18de019de61093b44f7b6c77f9c35ec0db31a80d6a06527c83a1d345084b275e","first_computed_at":"2026-05-18T00:15:03.970292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:03.970292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l+E/AYsWkm4vB839V28oVY1G6mueDqGa3FxAj55hAbULyk/Tq63num8MkCx7bHMmqlakDIVCpLZFzQRgRDC/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:03.970954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78f977183073964faf5aa0dc8a9d94741c08cf5e64b4976536044b1c487bc357","sha256:1519a88a7042b4911ecc2d9b6c5d68c0696bc53aab43d3b3c6a4009a54f6563d"],"state_sha256":"acf6d248135971996415b59123f71a4c75181310e4d7dee496b3b024041acd8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwxN/A9hFgQ80Z2UU5vdJsSNlJcWbuhmxOX7s7hkng0527Di9fvS8pBrJIAXTyG12J60L7CJH4L223MRq0STBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:39:35.949851Z","bundle_sha256":"667cb5f405ee0174212a4f36ee96fad1446dc7700669d86fbb679eb9409af3b4"}}