{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:POHVSHDYV4OKAPNDFUYF7N2YDF","short_pith_number":"pith:POHVSHDY","canonical_record":{"source":{"id":"1908.07615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"2c75076d62e766fe0fa0e5bd5000057226b8edd1332c7ea2c8cf16fbc45f0d58","abstract_canon_sha256":"b478a79ff7a2d0f2f1bd6cee87594c02d4d373e72d7eefa731254cc0746f7578"},"schema_version":"1.0"},"canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","source":{"kind":"arxiv","id":"1908.07615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07615","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07615v1","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07615","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"POHVSHDYV4OK","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"POHVSHDYV4OKAPND","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"POHVSHDY","created_at":"2026-07-04T23:58:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:POHVSHDYV4OKAPNDFUYF7N2YDF","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"2c75076d62e766fe0fa0e5bd5000057226b8edd1332c7ea2c8cf16fbc45f0d58","abstract_canon_sha256":"b478a79ff7a2d0f2f1bd6cee87594c02d4d373e72d7eefa731254cc0746f7578"},"schema_version":"1.0"},"canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:59.673927Z","signature_b64":"sqVVvN/IhxPgk7Un8uduyD3LuJObtlc811VQGlJWKkMi5M/DvjFbDlg+R7sc5LIgnmp4OlZONagmkeXk8Cw6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","last_reissued_at":"2026-07-04T23:58:59.673566Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:59.673566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07615","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-04T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFUsTPJsuvxWtlIdzdd7pwjf7c+agdZLjdYIW7MzOOn6+KEb84rKk45N2UmoQH/EjzUX6bfjl6twWQG+6pg/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:38:54.160008Z"},"content_sha256":"6f5c967b31d9ee41b88ddc50582f8989994b4afa35b92bc4b6f1110b6e7be759","schema_version":"1.0","event_id":"sha256:6f5c967b31d9ee41b88ddc50582f8989994b4afa35b92bc4b6f1110b6e7be759"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:POHVSHDYV4OKAPNDFUYF7N2YDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Linearized Control: Stable Algorithms and Complexity Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmitriy Drusvyatskiy, Siddhartha Srinivasa, Vincent Roulet, Zaid Harchaoui","submitted_at":"2019-08-20T21:25:24Z","abstract_excerpt":"We examine popular gradient-based algorithms for nonlinear control in the light of the modern complexity analysis of first-order optimization algorithms. The examination reveals that the complexity bounds can be clearly stated in terms of calls to a computational oracle related to dynamic programming and implementable by gradient back-propagation using machine learning software libraries such as PyTorch or TensorFlow. Finally, we propose a regularized Gauss-Newton algorithm enjoying worst-case complexity bounds and improved convergence behavior in practice. The software library based on PyTorc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07615","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/1908.07615/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-04T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2kHwTTCW4a2bzQ1V2iSFOPTQlMEUOBPqooHprqPr/O46B9rgkcFLDqkHtUmsICe5Ow2ZJatsbqArBlrcHkrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:38:54.160534Z"},"content_sha256":"28a4d9d243be952e7b40b9453269d3d4df7b16d04afa0efe7f60b9aadae94358","schema_version":"1.0","event_id":"sha256:28a4d9d243be952e7b40b9453269d3d4df7b16d04afa0efe7f60b9aadae94358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/bundle.json","state_url":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/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-08-16T04:38:54Z","links":{"resolver":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF","bundle":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/bundle.json","state":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:POHVSHDYV4OKAPNDFUYF7N2YDF","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":"b478a79ff7a2d0f2f1bd6cee87594c02d4d373e72d7eefa731254cc0746f7578","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","title_canon_sha256":"2c75076d62e766fe0fa0e5bd5000057226b8edd1332c7ea2c8cf16fbc45f0d58"},"schema_version":"1.0","source":{"id":"1908.07615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07615","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07615v1","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07615","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"POHVSHDYV4OK","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"POHVSHDYV4OKAPND","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"POHVSHDY","created_at":"2026-07-04T23:58:59Z"}],"graph_snapshots":[{"event_id":"sha256:28a4d9d243be952e7b40b9453269d3d4df7b16d04afa0efe7f60b9aadae94358","target":"graph","created_at":"2026-07-04T23:58:59Z","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/1908.07615/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We examine popular gradient-based algorithms for nonlinear control in the light of the modern complexity analysis of first-order optimization algorithms. The examination reveals that the complexity bounds can be clearly stated in terms of calls to a computational oracle related to dynamic programming and implementable by gradient back-propagation using machine learning software libraries such as PyTorch or TensorFlow. Finally, we propose a regularized Gauss-Newton algorithm enjoying worst-case complexity bounds and improved convergence behavior in practice. The software library based on PyTorc","authors_text":"Dmitriy Drusvyatskiy, Siddhartha Srinivasa, Vincent Roulet, Zaid Harchaoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","title":"Iterative Linearized Control: Stable Algorithms and Complexity Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07615","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:6f5c967b31d9ee41b88ddc50582f8989994b4afa35b92bc4b6f1110b6e7be759","target":"record","created_at":"2026-07-04T23:58:59Z","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":"b478a79ff7a2d0f2f1bd6cee87594c02d4d373e72d7eefa731254cc0746f7578","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","title_canon_sha256":"2c75076d62e766fe0fa0e5bd5000057226b8edd1332c7ea2c8cf16fbc45f0d58"},"schema_version":"1.0","source":{"id":"1908.07615","kind":"arxiv","version":1}},"canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","first_computed_at":"2026-07-04T23:58:59.673566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:59.673566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sqVVvN/IhxPgk7Un8uduyD3LuJObtlc811VQGlJWKkMi5M/DvjFbDlg+R7sc5LIgnmp4OlZONagmkeXk8Cw6DQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:59.673927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f5c967b31d9ee41b88ddc50582f8989994b4afa35b92bc4b6f1110b6e7be759","sha256:28a4d9d243be952e7b40b9453269d3d4df7b16d04afa0efe7f60b9aadae94358"],"state_sha256":"c2291f2bd1934786a9f175e771cbfba703fa0a26938fee73f688333d0dc48c5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OD0Pd7nPWxfa0ASLCe33BKTsgT0E2u8aoxJgE1QhwKEG/EhOv/KbVQcC+CpwtW3LEJkDiQH9+IKmiZ9SyATKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:38:54.164541Z","bundle_sha256":"b46b8aec4220283d9a0ecc939a0a2e816298d599aca26a0e753b924587cb1f51"}}