{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OXWMQWAWOUXT6UI3VIFUW33EFC","short_pith_number":"pith:OXWMQWAW","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"},"canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","source":{"kind":"arxiv","id":"1703.05085","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05085","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05085v3","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05085","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"OXWMQWAWOUXT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXWMQWAWOUXT6UI3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXWMQWAW","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OXWMQWAWOUXT6UI3VIFUW33EFC","target":"record","payload":{"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"},"canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","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"},"source_kind":"arxiv","source_id":"1703.05085","source_version":3,"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-05-17T23:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTaMNU0U1jvmNhsA02Ibxmqd4GD5z630Tr96+DVgzdaXKEnytJb9B6r/XxH6snPq53YVKqxAnXHO7vC/AojOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:06:03.787618Z"},"content_sha256":"1795b588494778323db32eda342c206663968f9466e0716eb986fea91010c032","schema_version":"1.0","event_id":"sha256:1795b588494778323db32eda342c206663968f9466e0716eb986fea91010c032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OXWMQWAWOUXT6UI3VIFUW33EFC","target":"graph","payload":{"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"},"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-05-17T23:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tiCDbzIcFCrl5LumivCZitCTMVT5h1PvGLnDev7aMwpJPGHX5BokJCtSlR+KleeywBYXpE/8UrWQ3zhk95TLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:06:03.788299Z"},"content_sha256":"9676776a6e68e5c11c538de1dfd1cc8d84ff85d69c73a70a2fa61d713f4bbdb0","schema_version":"1.0","event_id":"sha256:9676776a6e68e5c11c538de1dfd1cc8d84ff85d69c73a70a2fa61d713f4bbdb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/bundle.json","state_url":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/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-05-19T08:06:03Z","links":{"resolver":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC","bundle":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/bundle.json","state":"https://pith.science/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXWMQWAWOUXT6UI3VIFUW33EFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OXWMQWAWOUXT6UI3VIFUW33EFC","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":"31bf25730717d05a1e4d8882c08434b57e197e8a91a28762fab4a9a7f984a22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T11:25:48Z","title_canon_sha256":"f6ae02f6fd84df5a29db2747a5b3dd14badadd2e60a80b4e258565092f6a098b"},"schema_version":"1.0","source":{"id":"1703.05085","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05085","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05085v3","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05085","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"OXWMQWAWOUXT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXWMQWAWOUXT6UI3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXWMQWAW","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:9676776a6e68e5c11c538de1dfd1cc8d84ff85d69c73a70a2fa61d713f4bbdb0","target":"graph","created_at":"2026-05-17T23:44:10Z","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"},"paper":{"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","authors_text":"Didier Henrion, Pierre-Loic Garoche, Victor Magron, Xavier Thirioux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T11:25:48Z","title":"Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05085","kind":"arxiv","version":3},"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:1795b588494778323db32eda342c206663968f9466e0716eb986fea91010c032","target":"record","created_at":"2026-05-17T23:44:10Z","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":"31bf25730717d05a1e4d8882c08434b57e197e8a91a28762fab4a9a7f984a22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T11:25:48Z","title_canon_sha256":"f6ae02f6fd84df5a29db2747a5b3dd14badadd2e60a80b4e258565092f6a098b"},"schema_version":"1.0","source":{"id":"1703.05085","kind":"arxiv","version":3}},"canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75ecc85816752f3f511baa0b4b6f6428b3db40d1bb0a155ce29c76f9786f84d0","first_computed_at":"2026-05-17T23:44:10.460194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:10.460194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JjbXF8XqPywK9N07RBOdGl4K6QcwD9H7EcguZjjf1iwSYFlPoevJy1z6a/7JSflz7lQDplsjdDeva4C/xQUXBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:10.460852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05085","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1795b588494778323db32eda342c206663968f9466e0716eb986fea91010c032","sha256:9676776a6e68e5c11c538de1dfd1cc8d84ff85d69c73a70a2fa61d713f4bbdb0"],"state_sha256":"afba65f8a6115db44cea5173d7b3bea85cd41fda59d47e10e18b89fee316b6b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BP1cy/sj4zs3KvbcYy0Wl0J9E/xXMma1IrLBQy9ZBxq31+jy7Sa3N8Q7jVcRSiKOeHECpmEl4tEXkErTexs6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:06:03.791997Z","bundle_sha256":"ff425420c08b91d7c08ef9b9cb3a34abdf5f2b0b1dd9012faa0421ee5b44b9c0"}}