{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B4NCC74AOKNQZFTQ25UG4YXGFS","short_pith_number":"pith:B4NCC74A","canonical_record":{"source":{"id":"1203.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-26T14:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"90f2b95341ddacac551d7c2d3924e67d7a7137bc3afee707d40e7821c0a24ba1","abstract_canon_sha256":"feb60fd6e7afe2612ca751ccd9b478a0d103a8245198bb288827d0b0cdbf9338"},"schema_version":"1.0"},"canonical_sha256":"0f1a217f80729b0c9670d7686e62e62c8c72f9c5618138919722d8f53c67f311","source":{"kind":"arxiv","id":"1203.5683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5683","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5683v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5683","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"B4NCC74AOKNQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B4NCC74AOKNQZFTQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B4NCC74A","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B4NCC74AOKNQZFTQ25UG4YXGFS","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-26T14:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"90f2b95341ddacac551d7c2d3924e67d7a7137bc3afee707d40e7821c0a24ba1","abstract_canon_sha256":"feb60fd6e7afe2612ca751ccd9b478a0d103a8245198bb288827d0b0cdbf9338"},"schema_version":"1.0"},"canonical_sha256":"0f1a217f80729b0c9670d7686e62e62c8c72f9c5618138919722d8f53c67f311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:14.450215Z","signature_b64":"AN4iHq5jIyAaESIpOMcP96idxl+oyKVFGVZ6YaTAwQonhpuUTFA+5GjN5ds8qYHv8jY7Ful4+f+xYY+HCJcCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1a217f80729b0c9670d7686e62e62c8c72f9c5618138919722d8f53c67f311","last_reissued_at":"2026-05-18T03:59:14.449760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:14.449760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5683","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:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I58xjnK1qs/KsHbqWVcOvP6ClnBYH3hgkE8LPyeskUsY9f89e6ktmZeqbnOSrOIxRBow63UC6DHM0z1trOAjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:15:55.218231Z"},"content_sha256":"bfc30aebc0423c2caa7937c3d47590a20fdc335276ef3abeca679995246703c2","schema_version":"1.0","event_id":"sha256:bfc30aebc0423c2caa7937c3d47590a20fdc335276ef3abeca679995246703c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B4NCC74AOKNQZFTQ25UG4YXGFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Constrained Temporal Logic Control of Multi-Affine Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Calin Belta, Ebru Aydin Gol","submitted_at":"2012-03-26T14:37:28Z","abstract_excerpt":"In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5683","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:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+DnRhe/GdzfJbnldNPokyhuT7bKGkSibRY8Cj3Xu+ingL97pOmL3fS8pOUMdgWrHUTh7ZqqIw+IrqgZzMQdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:15:55.218589Z"},"content_sha256":"a69341cba2790e6f2d352b955d483260dee36026701d4933ca8887b653d9109c","schema_version":"1.0","event_id":"sha256:a69341cba2790e6f2d352b955d483260dee36026701d4933ca8887b653d9109c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/bundle.json","state_url":"https://pith.science/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/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-03T01:15:55Z","links":{"resolver":"https://pith.science/pith/B4NCC74AOKNQZFTQ25UG4YXGFS","bundle":"https://pith.science/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/bundle.json","state":"https://pith.science/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4NCC74AOKNQZFTQ25UG4YXGFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B4NCC74AOKNQZFTQ25UG4YXGFS","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":"feb60fd6e7afe2612ca751ccd9b478a0d103a8245198bb288827d0b0cdbf9338","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-26T14:37:28Z","title_canon_sha256":"90f2b95341ddacac551d7c2d3924e67d7a7137bc3afee707d40e7821c0a24ba1"},"schema_version":"1.0","source":{"id":"1203.5683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5683","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5683v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5683","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"B4NCC74AOKNQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B4NCC74AOKNQZFTQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B4NCC74A","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:a69341cba2790e6f2d352b955d483260dee36026701d4933ca8887b653d9109c","target":"graph","created_at":"2026-05-18T03:59:14Z","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 controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random opti","authors_text":"Calin Belta, Ebru Aydin Gol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-26T14:37:28Z","title":"Time-Constrained Temporal Logic Control of Multi-Affine Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5683","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:bfc30aebc0423c2caa7937c3d47590a20fdc335276ef3abeca679995246703c2","target":"record","created_at":"2026-05-18T03:59:14Z","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":"feb60fd6e7afe2612ca751ccd9b478a0d103a8245198bb288827d0b0cdbf9338","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-26T14:37:28Z","title_canon_sha256":"90f2b95341ddacac551d7c2d3924e67d7a7137bc3afee707d40e7821c0a24ba1"},"schema_version":"1.0","source":{"id":"1203.5683","kind":"arxiv","version":1}},"canonical_sha256":"0f1a217f80729b0c9670d7686e62e62c8c72f9c5618138919722d8f53c67f311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1a217f80729b0c9670d7686e62e62c8c72f9c5618138919722d8f53c67f311","first_computed_at":"2026-05-18T03:59:14.449760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:14.449760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AN4iHq5jIyAaESIpOMcP96idxl+oyKVFGVZ6YaTAwQonhpuUTFA+5GjN5ds8qYHv8jY7Ful4+f+xYY+HCJcCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:14.450215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfc30aebc0423c2caa7937c3d47590a20fdc335276ef3abeca679995246703c2","sha256:a69341cba2790e6f2d352b955d483260dee36026701d4933ca8887b653d9109c"],"state_sha256":"9819776e440cbf1f1c5049324644aa6ba316c0c73a72fc0b600540b480833611"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KN6MIGejvY43g3Ur4/OCP+/n9GCMYYI1NqGZiUszZ7LX8J+LI63vjTYER46HL+NYLM0tDSSAvwp9UKq8lsjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:15:55.220470Z","bundle_sha256":"4dc4e87cef4b7b69490613c06d6eaeb74ea2438ee04beebe1a278be90cafacca"}}