{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5RU36NRIFYD4AVLN7DKB5XZQ3L","short_pith_number":"pith:5RU36NRI","schema_version":"1.0","canonical_sha256":"ec69bf36282e07c0556df8d41edf30dac6a98e05904ecc6938f96c8321725391","source":{"kind":"arxiv","id":"1812.10588","version":3},"attestation_state":"computed","paper":{"title":"Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Bai Xue, Naijun Zhan, Qiuye Wang, Shijie Wang, Zhikun She","submitted_at":"2018-12-27T01:37:33Z","abstract_excerpt":"In this paper we propose a novel semi-definite programming based method to compute robust domains of attraction for state-constrained perturbed polynomial systems. A robust domain of attraction is a set of states such that every trajectory starting from it will approach an equilibrium while never violating a specified state constraint, regardless of the actual perturbation. The semi-definite program is constructed by relaxing a generalized Zubov's equation. The existence of solutions to the constructed semi-definite program is guaranteed and there exists a sequence of solutions such that their"},"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":"1812.10588","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-12-27T01:37:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"39f0bf82e00b1287761b51d89e6f7fd07c767d7e9c9c62453cf1c2c2869d031d","abstract_canon_sha256":"65feda455a42592c719c6fdf84e246f7f5b2ec47cbed0bbf7e5c53bf6e8058db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:50.472495Z","signature_b64":"Ub4YUDdHapnsdtRRHW30z44KNwgdEi7BUWGw1wnNDY00rpz5jnNJe/ARs6RKuJbpR4AWKDNDO1viQSEPJm5OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec69bf36282e07c0556df8d41edf30dac6a98e05904ecc6938f96c8321725391","last_reissued_at":"2026-06-04T20:13:50.471840Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:50.471840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Bai Xue, Naijun Zhan, Qiuye Wang, Shijie Wang, Zhikun She","submitted_at":"2018-12-27T01:37:33Z","abstract_excerpt":"In this paper we propose a novel semi-definite programming based method to compute robust domains of attraction for state-constrained perturbed polynomial systems. A robust domain of attraction is a set of states such that every trajectory starting from it will approach an equilibrium while never violating a specified state constraint, regardless of the actual perturbation. The semi-definite program is constructed by relaxing a generalized Zubov's equation. The existence of solutions to the constructed semi-definite program is guaranteed and there exists a sequence of solutions such that their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10588","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.10588/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.10588","created_at":"2026-06-04T20:13:50.471925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10588v3","created_at":"2026-06-04T20:13:50.471925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10588","created_at":"2026-06-04T20:13:50.471925+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RU36NRIFYD4","created_at":"2026-06-04T20:13:50.471925+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RU36NRIFYD4AVLN","created_at":"2026-06-04T20:13:50.471925+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RU36NRI","created_at":"2026-06-04T20:13:50.471925+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/5RU36NRIFYD4AVLN7DKB5XZQ3L","json":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L.json","graph_json":"https://pith.science/api/pith-number/5RU36NRIFYD4AVLN7DKB5XZQ3L/graph.json","events_json":"https://pith.science/api/pith-number/5RU36NRIFYD4AVLN7DKB5XZQ3L/events.json","paper":"https://pith.science/paper/5RU36NRI"},"agent_actions":{"view_html":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L","download_json":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L.json","view_paper":"https://pith.science/paper/5RU36NRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10588&json=true","fetch_graph":"https://pith.science/api/pith-number/5RU36NRIFYD4AVLN7DKB5XZQ3L/graph.json","fetch_events":"https://pith.science/api/pith-number/5RU36NRIFYD4AVLN7DKB5XZQ3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L/action/storage_attestation","attest_author":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L/action/author_attestation","sign_citation":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L/action/citation_signature","submit_replication":"https://pith.science/pith/5RU36NRIFYD4AVLN7DKB5XZQ3L/action/replication_record"}},"created_at":"2026-06-04T20:13:50.471925+00:00","updated_at":"2026-06-04T20:13:50.471925+00:00"}