{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OXWMQWAWOUXT6UI3VIFUW33EFC","short_pith_number":"pith:OXWMQWAW","schema_version":"1.0","canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","source":{"kind":"arxiv","id":"1703.05085","version":3},"attestation_state":"computed","paper":{"title":"Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Didier Henrion, Pierre-Loic Garoche, Victor Magron, Xavier Thirioux","submitted_at":"2017-03-15T11:25:48Z","abstract_excerpt":"We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box or an ellipsoid, we provide a method to compute certified outer approximations of the reachable set.\n  The proposed method consists of building a hierarchy of relaxations for an infinite-dimensional moment problem. Under certain assumptions, the optimal value of this problem is the volume of the reachable set and the optimum solution is the restriction of th"},"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":"1703.05085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T11:25:48Z","cross_cats_sorted":[],"title_canon_sha256":"f6ae02f6fd84df5a29db2747a5b3dd14badadd2e60a80b4e258565092f6a098b","abstract_canon_sha256":"31bf25730717d05a1e4d8882c08434b57e197e8a91a28762fab4a9a7f984a22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:10.460852Z","signature_b64":"JjbXF8XqPywK9N07RBOdGl4K6QcwD9H7EcguZjjf1iwSYFlPoevJy1z6a/7JSflz7lQDplsjdDeva4C/xQUXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","last_reissued_at":"2026-05-17T23:44:10.460194Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:10.460194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Didier Henrion, Pierre-Loic Garoche, Victor Magron, Xavier Thirioux","submitted_at":"2017-03-15T11:25:48Z","abstract_excerpt":"We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box or an ellipsoid, we provide a method to compute certified outer approximations of the reachable set.\n  The proposed method consists of building a hierarchy of relaxations for an infinite-dimensional moment problem. Under certain assumptions, the optimal value of this problem is the volume of the reachable set and the optimum solution is the restriction of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05085","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":"1703.05085","created_at":"2026-05-17T23:44:10.460295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05085v3","created_at":"2026-05-17T23:44:10.460295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05085","created_at":"2026-05-17T23:44:10.460295+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXWMQWAWOUXT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXWMQWAWOUXT6UI3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXWMQWAW","created_at":"2026-05-18T12:31:34.259226+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/OXWMQWAWOUXT6UI3VIFUW33EFC","json":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC.json","graph_json":"https://pith.science/api/pith-number/OXWMQWAWOUXT6UI3VIFUW33EFC/graph.json","events_json":"https://pith.science/api/pith-number/OXWMQWAWOUXT6UI3VIFUW33EFC/events.json","paper":"https://pith.science/paper/OXWMQWAW"},"agent_actions":{"view_html":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC","download_json":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC.json","view_paper":"https://pith.science/paper/OXWMQWAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05085&json=true","fetch_graph":"https://pith.science/api/pith-number/OXWMQWAWOUXT6UI3VIFUW33EFC/graph.json","fetch_events":"https://pith.science/api/pith-number/OXWMQWAWOUXT6UI3VIFUW33EFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/action/storage_attestation","attest_author":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/action/author_attestation","sign_citation":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/action/citation_signature","submit_replication":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/action/replication_record"}},"created_at":"2026-05-17T23:44:10.460295+00:00","updated_at":"2026-05-17T23:44:10.460295+00:00"}