{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QDI2JNX4YJ5SYKYG3WSU4BXCIK","short_pith_number":"pith:QDI2JNX4","schema_version":"1.0","canonical_sha256":"80d1a4b6fcc27b2c2b06dda54e06e242876b050b5cb5053184ecf9eb560477be","source":{"kind":"arxiv","id":"1811.01086","version":3},"attestation_state":"computed","paper":{"title":"Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bai Xue, Martin Fr\\\"anzle, Naijun Zhan","submitted_at":"2018-11-02T20:55:50Z","abstract_excerpt":"In this paper we propose a convex programming based method to address a long-standing problem of inner-approximating backward reachable sets of state-constrained polynomial systems subject to time-varying uncertainties. The backward reachable set is a set of states, from which all trajectories starting will surely enter a target region at the end of a given time horizon without violating a set of state constraints in spite of the actions of uncertainties. It is equal to the zero sub-level set of the unique Lipschitz viscosity solution to a Hamilton-Jacobi partial differential equation (HJE). W"},"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":"1811.01086","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T20:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"45b132b4b5271dc86cc058ec2973337789fa94aa765ad60ecb7679984904897c","abstract_canon_sha256":"7c31be6eff9e981e433a63c33cdea193d2863a0c95736af7b0e4fa2483786a47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:37.845791Z","signature_b64":"hwtp6L3Ts5Ktv4ZLTpeNZ2O9v9zaiP4JrkSrWQ7MUiqBdE+W6onMRpl+7V0gsBHDvIg5R3X6pRpUrtRXNfj8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d1a4b6fcc27b2c2b06dda54e06e242876b050b5cb5053184ecf9eb560477be","last_reissued_at":"2026-05-17T23:43:37.845098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:37.845098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bai Xue, Martin Fr\\\"anzle, Naijun Zhan","submitted_at":"2018-11-02T20:55:50Z","abstract_excerpt":"In this paper we propose a convex programming based method to address a long-standing problem of inner-approximating backward reachable sets of state-constrained polynomial systems subject to time-varying uncertainties. The backward reachable set is a set of states, from which all trajectories starting will surely enter a target region at the end of a given time horizon without violating a set of state constraints in spite of the actions of uncertainties. It is equal to the zero sub-level set of the unique Lipschitz viscosity solution to a Hamilton-Jacobi partial differential equation (HJE). W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01086","kind":"arxiv","version":3},"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":"1811.01086","created_at":"2026-05-17T23:43:37.845199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01086v3","created_at":"2026-05-17T23:43:37.845199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01086","created_at":"2026-05-17T23:43:37.845199+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDI2JNX4YJ5S","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDI2JNX4YJ5SYKYG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDI2JNX4","created_at":"2026-05-18T12:32:46.962924+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/QDI2JNX4YJ5SYKYG3WSU4BXCIK","json":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK.json","graph_json":"https://pith.science/api/pith-number/QDI2JNX4YJ5SYKYG3WSU4BXCIK/graph.json","events_json":"https://pith.science/api/pith-number/QDI2JNX4YJ5SYKYG3WSU4BXCIK/events.json","paper":"https://pith.science/paper/QDI2JNX4"},"agent_actions":{"view_html":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK","download_json":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK.json","view_paper":"https://pith.science/paper/QDI2JNX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01086&json=true","fetch_graph":"https://pith.science/api/pith-number/QDI2JNX4YJ5SYKYG3WSU4BXCIK/graph.json","fetch_events":"https://pith.science/api/pith-number/QDI2JNX4YJ5SYKYG3WSU4BXCIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK/action/storage_attestation","attest_author":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK/action/author_attestation","sign_citation":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK/action/citation_signature","submit_replication":"https://pith.science/pith/QDI2JNX4YJ5SYKYG3WSU4BXCIK/action/replication_record"}},"created_at":"2026-05-17T23:43:37.845199+00:00","updated_at":"2026-05-17T23:43:37.845199+00:00"}