{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4GAKK43OWSWY5GQUEQO27YHV6R","short_pith_number":"pith:4GAKK43O","canonical_record":{"source":{"id":"1611.01051","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T14:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"8dc8cedde52b40162dc693ea94cf1419e19891ea9003680e15b38e37883c59e1","abstract_canon_sha256":"c32b668a3a694f915c16ba473c9105f72bcb1d4d41e9bcd202b393faeb3585f1"},"schema_version":"1.0"},"canonical_sha256":"e180a5736eb4ad8e9a14241dafe0f5f44330a76529cbbc6169f7ce5d253af238","source":{"kind":"arxiv","id":"1611.01051","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01051","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01051v3","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01051","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"4GAKK43OWSWY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GAKK43OWSWY5GQU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GAKK43O","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4GAKK43OWSWY5GQUEQO27YHV6R","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01051","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T14:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"8dc8cedde52b40162dc693ea94cf1419e19891ea9003680e15b38e37883c59e1","abstract_canon_sha256":"c32b668a3a694f915c16ba473c9105f72bcb1d4d41e9bcd202b393faeb3585f1"},"schema_version":"1.0"},"canonical_sha256":"e180a5736eb4ad8e9a14241dafe0f5f44330a76529cbbc6169f7ce5d253af238","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:42.238777Z","signature_b64":"5tLwIdgi43DKM0P50wo5RP47sB5C4rcxxzWeVmcSLme0CN5PbC0rhUChQcRgXV1T+B48zQL7EhHD/3UGWIgZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e180a5736eb4ad8e9a14241dafe0f5f44330a76529cbbc6169f7ce5d253af238","last_reissued_at":"2026-05-18T00:34:42.237989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:42.237989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01051","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-18T00:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lr5aQTwjhPeoaRWzV/VG4xAt5FG7mM7hLJvuoXkbMPxCWyYIsJdlO74DwKof/Or4KNGqzXssWzaZFvk/fiJSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:39:42.574111Z"},"content_sha256":"8a25c9e6f1a5239ef3e21a579df6275998bf2e8461c61ec78f249323f78b0c12","schema_version":"1.0","event_id":"sha256:8a25c9e6f1a5239ef3e21a579df6275998bf2e8461c61ec78f249323f78b0c12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4GAKK43OWSWY5GQUEQO27YHV6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Reachability Problems by a Scalable Constrained Optimization Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan Kuratko, Stefan Ratschan","submitted_at":"2016-11-03T14:57:38Z","abstract_excerpt":"In this paper we consider the problem of finding an evolution of a dynamical system that originates and terminates in given sets of states. However, if such an evolution exists then it is usually not unique. We investigate this problem and find a scalable approach for solving it. To this end we formulate an equality constrained nonlinear program that addresses the non-uniqueness of the solution of the original problem. In addition, the resulting saddle-point matrix is sparse. We exploit the structure in order to reach an efficient implementation of our method. In computational experiments we c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01051","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-18T00:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wWBSYnKNwyiMwdUKmgJzdOLNLaor/7Bp5WCVQpsqBnC/iimUce3Ip1HjsgkCv0IoDAhNuSCIwAh9QW2w/bKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:39:42.574841Z"},"content_sha256":"98becd06660948050e94ee9f6bdd838a147c57c9f173fd0e059679fc361e85d7","schema_version":"1.0","event_id":"sha256:98becd06660948050e94ee9f6bdd838a147c57c9f173fd0e059679fc361e85d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GAKK43OWSWY5GQUEQO27YHV6R/bundle.json","state_url":"https://pith.science/pith/4GAKK43OWSWY5GQUEQO27YHV6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GAKK43OWSWY5GQUEQO27YHV6R/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-06-09T08:39:42Z","links":{"resolver":"https://pith.science/pith/4GAKK43OWSWY5GQUEQO27YHV6R","bundle":"https://pith.science/pith/4GAKK43OWSWY5GQUEQO27YHV6R/bundle.json","state":"https://pith.science/pith/4GAKK43OWSWY5GQUEQO27YHV6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GAKK43OWSWY5GQUEQO27YHV6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4GAKK43OWSWY5GQUEQO27YHV6R","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":"c32b668a3a694f915c16ba473c9105f72bcb1d4d41e9bcd202b393faeb3585f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T14:57:38Z","title_canon_sha256":"8dc8cedde52b40162dc693ea94cf1419e19891ea9003680e15b38e37883c59e1"},"schema_version":"1.0","source":{"id":"1611.01051","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01051","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01051v3","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01051","created_at":"2026-05-18T00:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"4GAKK43OWSWY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GAKK43OWSWY5GQU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GAKK43O","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:98becd06660948050e94ee9f6bdd838a147c57c9f173fd0e059679fc361e85d7","target":"graph","created_at":"2026-05-18T00:34:42Z","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":"In this paper we consider the problem of finding an evolution of a dynamical system that originates and terminates in given sets of states. However, if such an evolution exists then it is usually not unique. We investigate this problem and find a scalable approach for solving it. To this end we formulate an equality constrained nonlinear program that addresses the non-uniqueness of the solution of the original problem. In addition, the resulting saddle-point matrix is sparse. We exploit the structure in order to reach an efficient implementation of our method. In computational experiments we c","authors_text":"Jan Kuratko, Stefan Ratschan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T14:57:38Z","title":"Solving Reachability Problems by a Scalable Constrained Optimization Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01051","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:8a25c9e6f1a5239ef3e21a579df6275998bf2e8461c61ec78f249323f78b0c12","target":"record","created_at":"2026-05-18T00:34:42Z","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":"c32b668a3a694f915c16ba473c9105f72bcb1d4d41e9bcd202b393faeb3585f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T14:57:38Z","title_canon_sha256":"8dc8cedde52b40162dc693ea94cf1419e19891ea9003680e15b38e37883c59e1"},"schema_version":"1.0","source":{"id":"1611.01051","kind":"arxiv","version":3}},"canonical_sha256":"e180a5736eb4ad8e9a14241dafe0f5f44330a76529cbbc6169f7ce5d253af238","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e180a5736eb4ad8e9a14241dafe0f5f44330a76529cbbc6169f7ce5d253af238","first_computed_at":"2026-05-18T00:34:42.237989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:42.237989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tLwIdgi43DKM0P50wo5RP47sB5C4rcxxzWeVmcSLme0CN5PbC0rhUChQcRgXV1T+B48zQL7EhHD/3UGWIgZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:42.238777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01051","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a25c9e6f1a5239ef3e21a579df6275998bf2e8461c61ec78f249323f78b0c12","sha256:98becd06660948050e94ee9f6bdd838a147c57c9f173fd0e059679fc361e85d7"],"state_sha256":"e50fb89cb6598ddaf45fb541fdbb66995a111f4106851315488a022a3088f4ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lZIY72qORbOvYGOxLJfWPlyjg8+61fqYbWIOEzIQvLF7dX9pRknNeeeyc87O7OFbtmU9+ynmr8o+63iblCjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:39:42.578222Z","bundle_sha256":"558ebf512d397e30ba3c4e79c55be76b4d8fd4ad945c193ea541d670ff95f1a8"}}