{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MFLDJUHCXABPYJ4HMQYXNMLHJS","short_pith_number":"pith:MFLDJUHC","canonical_record":{"source":{"id":"1307.8232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T06:22:34Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"4bbda4c37dfe0f4c4b12ffc3268522ea9e5e6e6e82491d9016228bb0f7b46295","abstract_canon_sha256":"5874999860b8bad2c2d11e9da5c37e25b17b21ee20fa9d35c17c1b3b52ea82ff"},"schema_version":"1.0"},"canonical_sha256":"615634d0e2b802fc2787643176b1674c98fcd0a9c0b44d9ef3ebd79baaba1682","source":{"kind":"arxiv","id":"1307.8232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8232","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8232v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8232","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"MFLDJUHCXABP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFLDJUHCXABPYJ4H","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFLDJUHC","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MFLDJUHCXABPYJ4HMQYXNMLHJS","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T06:22:34Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"4bbda4c37dfe0f4c4b12ffc3268522ea9e5e6e6e82491d9016228bb0f7b46295","abstract_canon_sha256":"5874999860b8bad2c2d11e9da5c37e25b17b21ee20fa9d35c17c1b3b52ea82ff"},"schema_version":"1.0"},"canonical_sha256":"615634d0e2b802fc2787643176b1674c98fcd0a9c0b44d9ef3ebd79baaba1682","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:50.846793Z","signature_b64":"fpUqopFlRNEKggjt5TO2sJS6xyhy0pUs2OvZVbnRCSIAug6xmgQsYZUCulr/7zfrzHAmd2FNhAfLZI8DzQd4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"615634d0e2b802fc2787643176b1674c98fcd0a9c0b44d9ef3ebd79baaba1682","last_reissued_at":"2026-05-18T03:16:50.846289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:50.846289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8232","source_version":1,"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-18T03:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDQX8kAXz9WKtfWeHUDM0bx+DIif7EWPwxgn5I8a3DALaa3VfP3J24EFCBUgrMszZhFAX0vjQkWRtaGR0HWbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:24.312788Z"},"content_sha256":"4947fb90e0a741e791902ea556ec132979757f89b30eaabb9c2ecf8e6b7b50db","schema_version":"1.0","event_id":"sha256:4947fb90e0a741e791902ea556ec132979757f89b30eaabb9c2ecf8e6b7b50db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MFLDJUHCXABPYJ4HMQYXNMLHJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum-Hands-Off Control and L1 Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Daniel E. Quevedo, Dragan Nesic, Masaaki Nagahara","submitted_at":"2013-07-31T06:22:34Z","abstract_excerpt":"In this article, we propose a new paradigm of control, called a maximum-hands-off control. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum-hands-off control is the minimum-support (or sparsest) control among all admissible controls. We first prove that a solution to an L1-optimal control problem gives a maximum-hands-off control, and vice versa. This result rationalizes the use of L1 optimality in computing a maximum-hands-off control. The solution has in general the \"bang-off-bang\" property, and hence the control may be disconti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8232","kind":"arxiv","version":1},"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-18T03:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvUMiuAio5cFRYFHUkTl2SNTtzk5UNqYw2R2n9r/RsLUT2eldkjR0tkLUnTK13v42lrA6qILhPl7wNpBPW3BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:24.313296Z"},"content_sha256":"984bd7d64fa3acbe49b12e514ccb2990b136e6621d67bb1f59336902d61f905e","schema_version":"1.0","event_id":"sha256:984bd7d64fa3acbe49b12e514ccb2990b136e6621d67bb1f59336902d61f905e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/bundle.json","state_url":"https://pith.science/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/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-27T19:43:24Z","links":{"resolver":"https://pith.science/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS","bundle":"https://pith.science/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/bundle.json","state":"https://pith.science/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFLDJUHCXABPYJ4HMQYXNMLHJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MFLDJUHCXABPYJ4HMQYXNMLHJS","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":"5874999860b8bad2c2d11e9da5c37e25b17b21ee20fa9d35c17c1b3b52ea82ff","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T06:22:34Z","title_canon_sha256":"4bbda4c37dfe0f4c4b12ffc3268522ea9e5e6e6e82491d9016228bb0f7b46295"},"schema_version":"1.0","source":{"id":"1307.8232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8232","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8232v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8232","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"MFLDJUHCXABP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFLDJUHCXABPYJ4H","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFLDJUHC","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:984bd7d64fa3acbe49b12e514ccb2990b136e6621d67bb1f59336902d61f905e","target":"graph","created_at":"2026-05-18T03:16:50Z","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 article, we propose a new paradigm of control, called a maximum-hands-off control. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum-hands-off control is the minimum-support (or sparsest) control among all admissible controls. We first prove that a solution to an L1-optimal control problem gives a maximum-hands-off control, and vice versa. This result rationalizes the use of L1 optimality in computing a maximum-hands-off control. The solution has in general the \"bang-off-bang\" property, and hence the control may be disconti","authors_text":"Daniel E. Quevedo, Dragan Nesic, Masaaki Nagahara","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T06:22:34Z","title":"Maximum-Hands-Off Control and L1 Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8232","kind":"arxiv","version":1},"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:4947fb90e0a741e791902ea556ec132979757f89b30eaabb9c2ecf8e6b7b50db","target":"record","created_at":"2026-05-18T03:16:50Z","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":"5874999860b8bad2c2d11e9da5c37e25b17b21ee20fa9d35c17c1b3b52ea82ff","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T06:22:34Z","title_canon_sha256":"4bbda4c37dfe0f4c4b12ffc3268522ea9e5e6e6e82491d9016228bb0f7b46295"},"schema_version":"1.0","source":{"id":"1307.8232","kind":"arxiv","version":1}},"canonical_sha256":"615634d0e2b802fc2787643176b1674c98fcd0a9c0b44d9ef3ebd79baaba1682","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"615634d0e2b802fc2787643176b1674c98fcd0a9c0b44d9ef3ebd79baaba1682","first_computed_at":"2026-05-18T03:16:50.846289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:50.846289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fpUqopFlRNEKggjt5TO2sJS6xyhy0pUs2OvZVbnRCSIAug6xmgQsYZUCulr/7zfrzHAmd2FNhAfLZI8DzQd4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:50.846793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4947fb90e0a741e791902ea556ec132979757f89b30eaabb9c2ecf8e6b7b50db","sha256:984bd7d64fa3acbe49b12e514ccb2990b136e6621d67bb1f59336902d61f905e"],"state_sha256":"286198b26578a86e2553ece9183cdc31e871f692963197b0c3e8d69f80c26a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzC4lcJrzXQGE/oDjKHMOA2KNSd9dXJ5HHmuRRtNFw5J5AMVTWgciIt2QoHeOqvVDHbpkKWnMGEpg3NY0Dd4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:43:24.317330Z","bundle_sha256":"109670508466cc5fce44b9e9c05dd5cbcf88ff759b366eb37e97c6c260034b22"}}