{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3277EYEIVMSOLXKJKQS2RW7OTJ","short_pith_number":"pith:3277EYEI","canonical_record":{"source":{"id":"1109.3772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-17T11:06:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b6814deb6e9fe82ed1c7637359b1f64bd43df7359b6732270810cd8e15aa0a9c","abstract_canon_sha256":"4777bd6710bf24dd30af76d81700d4c129b94f149d16c4346d2f5930f6862a78"},"schema_version":"1.0"},"canonical_sha256":"debff26088ab24e5dd495425a8dbee9a736e868cde738afe36c1e5c6ab9b8171","source":{"kind":"arxiv","id":"1109.3772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3772","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3772v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3772","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"3277EYEIVMSO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3277EYEIVMSOLXKJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3277EYEI","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3277EYEIVMSOLXKJKQS2RW7OTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-17T11:06:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b6814deb6e9fe82ed1c7637359b1f64bd43df7359b6732270810cd8e15aa0a9c","abstract_canon_sha256":"4777bd6710bf24dd30af76d81700d4c129b94f149d16c4346d2f5930f6862a78"},"schema_version":"1.0"},"canonical_sha256":"debff26088ab24e5dd495425a8dbee9a736e868cde738afe36c1e5c6ab9b8171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.540564Z","signature_b64":"NTRVRdLVjp055h7NwC4cmPJmz7yxkkfoYgIOqPhrgpv2dw4L6lu6eRb/7s61pDjuZFqnuRSAAJmeGY1a2ZWzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debff26088ab24e5dd495425a8dbee9a736e868cde738afe36c1e5c6ab9b8171","last_reissued_at":"2026-05-18T02:21:36.540046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.540046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3772","source_version":2,"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVMq+yo27xF3OZXqhg7gbwn0+vQZr/x7yjOiP23d0n5pzzrKx+LkBTp5A9579FfXUYyeNIdh2VNXLPqa6RTHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:30:56.607556Z"},"content_sha256":"c094aa3ca8056da6608c4a2ab1a4e07a8789f1d2ac1494c0e168ccc69ac239e4","schema_version":"1.0","event_id":"sha256:c094aa3ca8056da6608c4a2ab1a4e07a8789f1d2ac1494c0e168ccc69ac239e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3277EYEIVMSOLXKJKQS2RW7OTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A numerical solution to the minimum-time control problem for linear discrete-time systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Dulin Chen, Laurent Bako, St\\'ephane Lecoeuche","submitted_at":"2011-09-17T11:06:49Z","abstract_excerpt":"The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging problem in optimal control theory for which closed-form solutions exist only for a few systems of small dimensions. This paper presents a very generic solution to the minimum-time problem for arbitrary discrete-time linear systems. It is a numerical solution based on sparse optimization, that is the minimization of the number of nonzero elements in the state s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3772","kind":"arxiv","version":2},"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRtnuQgvMbDpBHtVVLBP1gtG6pGM3FSmypXjb5iP1+1uWo3L7ga8VJ7sbHKFzSMwZvl/e8EfAbfsGDakD134Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:30:56.607910Z"},"content_sha256":"a9fcee45cd72e0dba44e034bf04a5e5bb92435e38fb6e0c5cf18cb4ada8ddaef","schema_version":"1.0","event_id":"sha256:a9fcee45cd72e0dba44e034bf04a5e5bb92435e38fb6e0c5cf18cb4ada8ddaef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/bundle.json","state_url":"https://pith.science/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/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-07-03T13:30:56Z","links":{"resolver":"https://pith.science/pith/3277EYEIVMSOLXKJKQS2RW7OTJ","bundle":"https://pith.science/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/bundle.json","state":"https://pith.science/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3277EYEIVMSOLXKJKQS2RW7OTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3277EYEIVMSOLXKJKQS2RW7OTJ","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":"4777bd6710bf24dd30af76d81700d4c129b94f149d16c4346d2f5930f6862a78","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-17T11:06:49Z","title_canon_sha256":"b6814deb6e9fe82ed1c7637359b1f64bd43df7359b6732270810cd8e15aa0a9c"},"schema_version":"1.0","source":{"id":"1109.3772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3772","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3772v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3772","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"3277EYEIVMSO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3277EYEIVMSOLXKJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3277EYEI","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:a9fcee45cd72e0dba44e034bf04a5e5bb92435e38fb6e0c5cf18cb4ada8ddaef","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging problem in optimal control theory for which closed-form solutions exist only for a few systems of small dimensions. This paper presents a very generic solution to the minimum-time problem for arbitrary discrete-time linear systems. It is a numerical solution based on sparse optimization, that is the minimization of the number of nonzero elements in the state s","authors_text":"Dulin Chen, Laurent Bako, St\\'ephane Lecoeuche","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-17T11:06:49Z","title":"A numerical solution to the minimum-time control problem for linear discrete-time systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3772","kind":"arxiv","version":2},"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:c094aa3ca8056da6608c4a2ab1a4e07a8789f1d2ac1494c0e168ccc69ac239e4","target":"record","created_at":"2026-05-18T02:21:36Z","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":"4777bd6710bf24dd30af76d81700d4c129b94f149d16c4346d2f5930f6862a78","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-17T11:06:49Z","title_canon_sha256":"b6814deb6e9fe82ed1c7637359b1f64bd43df7359b6732270810cd8e15aa0a9c"},"schema_version":"1.0","source":{"id":"1109.3772","kind":"arxiv","version":2}},"canonical_sha256":"debff26088ab24e5dd495425a8dbee9a736e868cde738afe36c1e5c6ab9b8171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"debff26088ab24e5dd495425a8dbee9a736e868cde738afe36c1e5c6ab9b8171","first_computed_at":"2026-05-18T02:21:36.540046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.540046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NTRVRdLVjp055h7NwC4cmPJmz7yxkkfoYgIOqPhrgpv2dw4L6lu6eRb/7s61pDjuZFqnuRSAAJmeGY1a2ZWzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.540564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c094aa3ca8056da6608c4a2ab1a4e07a8789f1d2ac1494c0e168ccc69ac239e4","sha256:a9fcee45cd72e0dba44e034bf04a5e5bb92435e38fb6e0c5cf18cb4ada8ddaef"],"state_sha256":"08e78740db9807d64d93eecab4227b738313369b1e4a24f95ef2abd78a8538c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jW16NU/W5vKv+VuJvEWiJRJEh2WOOlqN75MfX1xuS0znRBDQIFOUrzKPZN1T6IGRxOa4hBMjOgf9i9MtCS3rAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:30:56.609902Z","bundle_sha256":"4b5fb65d973696a262bbf329a457ebf5ed45f0648028249f7076bdc3b5d38b7c"}}