{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y2YZPP5RZIJVACKEPJOWNGVSRJ","short_pith_number":"pith:Y2YZPP5R","canonical_record":{"source":{"id":"1803.01299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-04T04:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"173c720be92a4ad460d5626e460a9d8b2978640aea5b5912e836440b3aaf30d5","abstract_canon_sha256":"1218f4b7a2a51007f1f1ae4c0ff124ab0a8f2355a196ebb68db8cb0ce77df4dd"},"schema_version":"1.0"},"canonical_sha256":"c6b197bfb1ca135009447a5d669ab28a694eb3ee9d10830497bc2f914e3aa3b1","source":{"kind":"arxiv","id":"1803.01299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01299","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01299v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01299","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"Y2YZPP5RZIJV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2YZPP5RZIJVACKE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2YZPP5R","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y2YZPP5RZIJVACKEPJOWNGVSRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-04T04:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"173c720be92a4ad460d5626e460a9d8b2978640aea5b5912e836440b3aaf30d5","abstract_canon_sha256":"1218f4b7a2a51007f1f1ae4c0ff124ab0a8f2355a196ebb68db8cb0ce77df4dd"},"schema_version":"1.0"},"canonical_sha256":"c6b197bfb1ca135009447a5d669ab28a694eb3ee9d10830497bc2f914e3aa3b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.674325Z","signature_b64":"L+dO/4cfnUJ/tj4gweDhw/E/KxuUAmYLZkSRNxWd+39sNmQmAvrbjWVRjrYA9rWEiKAJfimsSEQ81OtGJt1SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b197bfb1ca135009447a5d669ab28a694eb3ee9d10830497bc2f914e3aa3b1","last_reissued_at":"2026-05-18T00:14:21.673756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.673756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01299","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CePgRBePMGBj/U39JBJ0PTa77NbckIX1KD42tm2G+YGfSY2VYt15ER7/GXOe+tcZsEvNoTFz6AZoMVMM5XzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:31:16.201185Z"},"content_sha256":"4f9aed56b829d8cc0e58e2b6ea7ef939f0f52380d580898a2fe1c849e7feaceb","schema_version":"1.0","event_id":"sha256:4f9aed56b829d8cc0e58e2b6ea7ef939f0f52380d580898a2fe1c849e7feaceb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y2YZPP5RZIJVACKEPJOWNGVSRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Control Approach to Deep Learning and Applications to Discrete-Weight Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Qianxiao Li, Shuji Hao","submitted_at":"2018-03-04T04:37:49Z","abstract_excerpt":"Deep learning is formulated as a discrete-time optimal control problem. This allows one to characterize necessary conditions for optimality and develop training algorithms that do not rely on gradients with respect to the trainable parameters. In particular, we introduce the discrete-time method of successive approximations (MSA), which is based on the Pontryagin's maximum principle, for training neural networks. A rigorous error estimate for the discrete MSA is obtained, which sheds light on its dynamics and the means to stabilize the algorithm. The developed methods are applied to train, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01299","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aWlDJWd3cdujav8Ip6V5hhKz5EVwhu0ccmwPPNN69NLZSQYKesQ/Q/AhM0RWPkw9Bng4ZNiBzrCblZhzQEKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:31:16.201551Z"},"content_sha256":"72b6cbcfb3ba52a70269da994b9c3eac8202529b344c1a646e4fbb22642119d6","schema_version":"1.0","event_id":"sha256:72b6cbcfb3ba52a70269da994b9c3eac8202529b344c1a646e4fbb22642119d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/bundle.json","state_url":"https://pith.science/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/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-29T18:31:16Z","links":{"resolver":"https://pith.science/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ","bundle":"https://pith.science/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/bundle.json","state":"https://pith.science/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2YZPP5RZIJVACKEPJOWNGVSRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y2YZPP5RZIJVACKEPJOWNGVSRJ","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":"1218f4b7a2a51007f1f1ae4c0ff124ab0a8f2355a196ebb68db8cb0ce77df4dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-04T04:37:49Z","title_canon_sha256":"173c720be92a4ad460d5626e460a9d8b2978640aea5b5912e836440b3aaf30d5"},"schema_version":"1.0","source":{"id":"1803.01299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01299","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01299v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01299","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"Y2YZPP5RZIJV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2YZPP5RZIJVACKE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2YZPP5R","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:72b6cbcfb3ba52a70269da994b9c3eac8202529b344c1a646e4fbb22642119d6","target":"graph","created_at":"2026-05-18T00:14:21Z","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":"Deep learning is formulated as a discrete-time optimal control problem. This allows one to characterize necessary conditions for optimality and develop training algorithms that do not rely on gradients with respect to the trainable parameters. In particular, we introduce the discrete-time method of successive approximations (MSA), which is based on the Pontryagin's maximum principle, for training neural networks. A rigorous error estimate for the discrete MSA is obtained, which sheds light on its dynamics and the means to stabilize the algorithm. The developed methods are applied to train, in ","authors_text":"Qianxiao Li, Shuji Hao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-04T04:37:49Z","title":"An Optimal Control Approach to Deep Learning and Applications to Discrete-Weight Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01299","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:4f9aed56b829d8cc0e58e2b6ea7ef939f0f52380d580898a2fe1c849e7feaceb","target":"record","created_at":"2026-05-18T00:14:21Z","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":"1218f4b7a2a51007f1f1ae4c0ff124ab0a8f2355a196ebb68db8cb0ce77df4dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-04T04:37:49Z","title_canon_sha256":"173c720be92a4ad460d5626e460a9d8b2978640aea5b5912e836440b3aaf30d5"},"schema_version":"1.0","source":{"id":"1803.01299","kind":"arxiv","version":2}},"canonical_sha256":"c6b197bfb1ca135009447a5d669ab28a694eb3ee9d10830497bc2f914e3aa3b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6b197bfb1ca135009447a5d669ab28a694eb3ee9d10830497bc2f914e3aa3b1","first_computed_at":"2026-05-18T00:14:21.673756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:21.673756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L+dO/4cfnUJ/tj4gweDhw/E/KxuUAmYLZkSRNxWd+39sNmQmAvrbjWVRjrYA9rWEiKAJfimsSEQ81OtGJt1SBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:21.674325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f9aed56b829d8cc0e58e2b6ea7ef939f0f52380d580898a2fe1c849e7feaceb","sha256:72b6cbcfb3ba52a70269da994b9c3eac8202529b344c1a646e4fbb22642119d6"],"state_sha256":"e7995c7775a3265a60a0da73d2ce8173e7217e1551b3db14af7580e2e470b8a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ai6xeAuQWd7Q4AbO9Lpe+N9jLlb7SqlWMUxnPl3OAxV+PZuYhA5BqUANyudgYjdCXKCmy7CWzKdiVD5rkidFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:31:16.203963Z","bundle_sha256":"29214d74c6ef7feb5999a0e57c722d68e8fb2e82906222744ba4ab13de8fe5cf"}}