{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XIF7U5LKGKXRPN6CINVIEDI536","short_pith_number":"pith:XIF7U5LK","schema_version":"1.0","canonical_sha256":"ba0bfa756a32af17b7c2436a820d1ddf8eaa0a108362db636a5f3a56176d4299","source":{"kind":"arxiv","id":"1903.08634","version":1},"attestation_state":"computed","paper":{"title":"Aggressive Local Search for Constrained Optimal Control Problems with Many Local Minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Feng, Javad Lavaei, Yuhao Ding","submitted_at":"2019-03-20T17:42:43Z","abstract_excerpt":"This paper is concerned with numerically finding a global solution of constrained optimal control problems with many local minima. The focus is on the optimal decentralized control (ODC) problem, whose feasible set is recently shown to have an exponential number of connected components and consequently an exponential number of local minima. The rich literature of numerical algorithms for nonlinear optimization suggests that if a local search algorithm is initialized in an arbitrary connected component of the feasible set, it would search only within that component and find a stationary point t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.08634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"dd915fa52fec1763ad363b97376de18889d94ac83ad1a14519c286a78fdbd71c","abstract_canon_sha256":"3018f77090330fd4fd1e176773ea8055564b2297472bc341ed1f4e95bd4bc944"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.557344Z","signature_b64":"v6cGscySkNVpdFSPwu4BcwkaSGwvY0qqk69nZm/IOFGF0HlrHY0Lgu5qE5yuxXOhOXP0RloJil11HZLE6yzIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0bfa756a32af17b7c2436a820d1ddf8eaa0a108362db636a5f3a56176d4299","last_reissued_at":"2026-05-17T23:50:47.556056Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.556056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aggressive Local Search for Constrained Optimal Control Problems with Many Local Minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Feng, Javad Lavaei, Yuhao Ding","submitted_at":"2019-03-20T17:42:43Z","abstract_excerpt":"This paper is concerned with numerically finding a global solution of constrained optimal control problems with many local minima. The focus is on the optimal decentralized control (ODC) problem, whose feasible set is recently shown to have an exponential number of connected components and consequently an exponential number of local minima. The rich literature of numerical algorithms for nonlinear optimization suggests that if a local search algorithm is initialized in an arbitrary connected component of the feasible set, it would search only within that component and find a stationary point t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08634","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.08634","created_at":"2026-05-17T23:50:47.556350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08634v1","created_at":"2026-05-17T23:50:47.556350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08634","created_at":"2026-05-17T23:50:47.556350+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIF7U5LKGKXR","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIF7U5LKGKXRPN6C","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIF7U5LK","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536","json":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536.json","graph_json":"https://pith.science/api/pith-number/XIF7U5LKGKXRPN6CINVIEDI536/graph.json","events_json":"https://pith.science/api/pith-number/XIF7U5LKGKXRPN6CINVIEDI536/events.json","paper":"https://pith.science/paper/XIF7U5LK"},"agent_actions":{"view_html":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536","download_json":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536.json","view_paper":"https://pith.science/paper/XIF7U5LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08634&json=true","fetch_graph":"https://pith.science/api/pith-number/XIF7U5LKGKXRPN6CINVIEDI536/graph.json","fetch_events":"https://pith.science/api/pith-number/XIF7U5LKGKXRPN6CINVIEDI536/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536/action/storage_attestation","attest_author":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536/action/author_attestation","sign_citation":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536/action/citation_signature","submit_replication":"https://pith.science/pith/XIF7U5LKGKXRPN6CINVIEDI536/action/replication_record"}},"created_at":"2026-05-17T23:50:47.556350+00:00","updated_at":"2026-05-17T23:50:47.556350+00:00"}