{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YPHE5HHTHRWYJB57XJ7AY6EBL3","short_pith_number":"pith:YPHE5HHT","canonical_record":{"source":{"id":"2203.06753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-13T20:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"d57da85e48431b7f9838b47688fffe15096a57c7956cec2009efc0befa9f12c5","abstract_canon_sha256":"04bd08ea462ac35e53d57c8fbfea21d948e97c76ce32e52235bf919abb0a58f0"},"schema_version":"1.0"},"canonical_sha256":"c3ce4e9cf33c6d8487bfba7e0c78815ec6d21b4e762f6523a19ca459854f89e0","source":{"kind":"arxiv","id":"2203.06753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.06753","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2203.06753v1","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06753","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"YPHE5HHTHRWY","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"YPHE5HHTHRWYJB57","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"YPHE5HHT","created_at":"2026-07-05T04:04:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YPHE5HHTHRWYJB57XJ7AY6EBL3","target":"record","payload":{"canonical_record":{"source":{"id":"2203.06753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-13T20:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"d57da85e48431b7f9838b47688fffe15096a57c7956cec2009efc0befa9f12c5","abstract_canon_sha256":"04bd08ea462ac35e53d57c8fbfea21d948e97c76ce32e52235bf919abb0a58f0"},"schema_version":"1.0"},"canonical_sha256":"c3ce4e9cf33c6d8487bfba7e0c78815ec6d21b4e762f6523a19ca459854f89e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:54.689225Z","signature_b64":"tz48Oomrt188FWxwB8fVEQqd8Otj8eBZyyk15KK5wa/f/N5baA4NQsA1X49HNIeKNyS3IKJkqBSF1ux2WnizBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3ce4e9cf33c6d8487bfba7e0c78815ec6d21b4e762f6523a19ca459854f89e0","last_reissued_at":"2026-07-05T04:04:54.688764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:54.688764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.06753","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-07-05T04:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23cGXSQFjBeU7Q64tWnNw+Gs1rHvwznx770ZAVhuvMzJXLkfh+YUa91VV58oM1tdURDQ2IbCfOe1yJ3WzEk0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:18:22.659640Z"},"content_sha256":"7773c46540c3e0d1cfcd11c17180a0fbadda9a47b1699e4e08f1dcd5bac615ec","schema_version":"1.0","event_id":"sha256:7773c46540c3e0d1cfcd11c17180a0fbadda9a47b1699e4e08f1dcd5bac615ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YPHE5HHTHRWYJB57XJ7AY6EBL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Machine Learning Enhanced Algorithm for the Optimal Landing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiequn Han, Jihao Long, Wei Hu, Weinan E, Xuanxi Zhang, Yaohua Zang","submitted_at":"2022-03-13T20:23:11Z","abstract_excerpt":"We propose a machine learning enhanced algorithm for solving the optimal landing problem. Using Pontryagin's minimum principle, we derive a two-point boundary value problem for the landing problem. The proposed algorithm uses deep learning to predict the optimal landing time and a space-marching technique to provide good initial guesses for the boundary value problem solver. The performance of the proposed method is studied using the quadrotor example, a reasonably high dimensional and strongly nonlinear system. Drastic improvement in reliability and efficiency is observed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06753","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/2203.06753/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"},"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-07-05T04:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYD78RmvsPmyUWFd8+55vt9OL7diANhDMkDeku/NoqYNou32ELjAJn+W9+so446GFggKZDRWuC2r1U8tVyBiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:18:22.659999Z"},"content_sha256":"cef6274e6d1a8f8f5725da30097f43f798987db5b25c02773443c1cbf17865f6","schema_version":"1.0","event_id":"sha256:cef6274e6d1a8f8f5725da30097f43f798987db5b25c02773443c1cbf17865f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/bundle.json","state_url":"https://pith.science/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/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-07-07T12:18:22Z","links":{"resolver":"https://pith.science/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3","bundle":"https://pith.science/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/bundle.json","state":"https://pith.science/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPHE5HHTHRWYJB57XJ7AY6EBL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YPHE5HHTHRWYJB57XJ7AY6EBL3","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":"04bd08ea462ac35e53d57c8fbfea21d948e97c76ce32e52235bf919abb0a58f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-13T20:23:11Z","title_canon_sha256":"d57da85e48431b7f9838b47688fffe15096a57c7956cec2009efc0befa9f12c5"},"schema_version":"1.0","source":{"id":"2203.06753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.06753","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2203.06753v1","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06753","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"YPHE5HHTHRWY","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"YPHE5HHTHRWYJB57","created_at":"2026-07-05T04:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"YPHE5HHT","created_at":"2026-07-05T04:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:cef6274e6d1a8f8f5725da30097f43f798987db5b25c02773443c1cbf17865f6","target":"graph","created_at":"2026-07-05T04:04:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.06753/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a machine learning enhanced algorithm for solving the optimal landing problem. Using Pontryagin's minimum principle, we derive a two-point boundary value problem for the landing problem. The proposed algorithm uses deep learning to predict the optimal landing time and a space-marching technique to provide good initial guesses for the boundary value problem solver. The performance of the proposed method is studied using the quadrotor example, a reasonably high dimensional and strongly nonlinear system. Drastic improvement in reliability and efficiency is observed.","authors_text":"Jiequn Han, Jihao Long, Wei Hu, Weinan E, Xuanxi Zhang, Yaohua Zang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-13T20:23:11Z","title":"A Machine Learning Enhanced Algorithm for the Optimal Landing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06753","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:7773c46540c3e0d1cfcd11c17180a0fbadda9a47b1699e4e08f1dcd5bac615ec","target":"record","created_at":"2026-07-05T04:04:54Z","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":"04bd08ea462ac35e53d57c8fbfea21d948e97c76ce32e52235bf919abb0a58f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-13T20:23:11Z","title_canon_sha256":"d57da85e48431b7f9838b47688fffe15096a57c7956cec2009efc0befa9f12c5"},"schema_version":"1.0","source":{"id":"2203.06753","kind":"arxiv","version":1}},"canonical_sha256":"c3ce4e9cf33c6d8487bfba7e0c78815ec6d21b4e762f6523a19ca459854f89e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3ce4e9cf33c6d8487bfba7e0c78815ec6d21b4e762f6523a19ca459854f89e0","first_computed_at":"2026-07-05T04:04:54.688764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:04:54.688764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tz48Oomrt188FWxwB8fVEQqd8Otj8eBZyyk15KK5wa/f/N5baA4NQsA1X49HNIeKNyS3IKJkqBSF1ux2WnizBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:04:54.689225Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.06753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7773c46540c3e0d1cfcd11c17180a0fbadda9a47b1699e4e08f1dcd5bac615ec","sha256:cef6274e6d1a8f8f5725da30097f43f798987db5b25c02773443c1cbf17865f6"],"state_sha256":"69334d61106fe83e675715cfc048f47f7a21fad94018a44a6d4372b23789030e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afgEpaQrJAnPUgjTOpTHW1r0n1Dkr2L0Ia0kB+d6WSycFt75iBaNy78dI79kKixQszD8pDJKwFpA69Pq3AKvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:18:22.661925Z","bundle_sha256":"f5f4fc7ebe46342bf0b43520339c26e09f577dcbf70130c8b9a92f1202f3b634"}}