{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZWTYSSPZD3NSD2CME23OROZY26","short_pith_number":"pith:ZWTYSSPZ","canonical_record":{"source":{"id":"1902.07461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T09:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"30030b035fdbf521177c65416e2db359a0c958ac121181699d45cc6d5169b97a","abstract_canon_sha256":"c9235a0c475589937b360395dbbe01206225b0999dd9b76787118e82ffbc7ff7"},"schema_version":"1.0"},"canonical_sha256":"cda78949f91edb21e84c26b6e8bb38d7a4d0e07bc0528404949be038c3a8b129","source":{"kind":"arxiv","id":"1902.07461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07461","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07461v1","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07461","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTYSSPZD3NS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTYSSPZD3NSD2CM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTYSSPZ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZWTYSSPZD3NSD2CME23OROZY26","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T09:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"30030b035fdbf521177c65416e2db359a0c958ac121181699d45cc6d5169b97a","abstract_canon_sha256":"c9235a0c475589937b360395dbbe01206225b0999dd9b76787118e82ffbc7ff7"},"schema_version":"1.0"},"canonical_sha256":"cda78949f91edb21e84c26b6e8bb38d7a4d0e07bc0528404949be038c3a8b129","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:07.826414Z","signature_b64":"43G2/EnkEPPChOagwwY/FnKT7ZGPueog15fxtostSnzv2E/6CBF+xFASP9fZclDMn1lvcABygetE1bDIQTbUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda78949f91edb21e84c26b6e8bb38d7a4d0e07bc0528404949be038c3a8b129","last_reissued_at":"2026-05-17T23:53:07.825613Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:07.825613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07461","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-17T23:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JeQGxLXYJJG4ZAzk4tlbN7UOmH98SG0bEf5gXsu9tJtN+1sOuTDqw0C+fo2NY2j0gV3YlKAY3lcd3HpFc6YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:22.176960Z"},"content_sha256":"dd5a3ac6d70d8f9d17de91bc6776ef0f5b40a296c8711426193adf6d97d8d7cc","schema_version":"1.0","event_id":"sha256:dd5a3ac6d70d8f9d17de91bc6776ef0f5b40a296c8711426193adf6d97d8d7cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZWTYSSPZD3NSD2CME23OROZY26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesizing communication plans for reachability and safety specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimos V. Dimarogonas, Kazumune Hashimoto","submitted_at":"2019-02-20T09:18:57Z","abstract_excerpt":"We propose control and communication strategies for nonlinear networked control systems subject to state and input constraints. The objective is to steer the state of the system towards a prescribed target set in finite time (\\textit{reachability}), while at the same time remaining inside a safety set for all time (\\textit{safety}). By leveraging the notion of $\\delta$-ISS control Lyapunov function, we derive a sufficient condition to generate a communication scheduling, such that the resulting state trajectory guarantees reachability and safety. Moreover, in order to alleviate computational b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07461","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-17T23:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3FdET66AqVhyvdbscjfyh+g1XvZ9iOhuApi8hBnpGJTlTv6BhIVzk0y2nPMGBPWWkIrzsJBoCFL2P+XxnzJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:22.177301Z"},"content_sha256":"7e8b0208cf183069584d8b414ad66649d9101a45154d77efa1931cf5e47c40ff","schema_version":"1.0","event_id":"sha256:7e8b0208cf183069584d8b414ad66649d9101a45154d77efa1931cf5e47c40ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWTYSSPZD3NSD2CME23OROZY26/bundle.json","state_url":"https://pith.science/pith/ZWTYSSPZD3NSD2CME23OROZY26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWTYSSPZD3NSD2CME23OROZY26/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-03T18:59:22Z","links":{"resolver":"https://pith.science/pith/ZWTYSSPZD3NSD2CME23OROZY26","bundle":"https://pith.science/pith/ZWTYSSPZD3NSD2CME23OROZY26/bundle.json","state":"https://pith.science/pith/ZWTYSSPZD3NSD2CME23OROZY26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWTYSSPZD3NSD2CME23OROZY26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZWTYSSPZD3NSD2CME23OROZY26","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":"c9235a0c475589937b360395dbbe01206225b0999dd9b76787118e82ffbc7ff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T09:18:57Z","title_canon_sha256":"30030b035fdbf521177c65416e2db359a0c958ac121181699d45cc6d5169b97a"},"schema_version":"1.0","source":{"id":"1902.07461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07461","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07461v1","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07461","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTYSSPZD3NS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTYSSPZD3NSD2CM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTYSSPZ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7e8b0208cf183069584d8b414ad66649d9101a45154d77efa1931cf5e47c40ff","target":"graph","created_at":"2026-05-17T23:53:07Z","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 propose control and communication strategies for nonlinear networked control systems subject to state and input constraints. The objective is to steer the state of the system towards a prescribed target set in finite time (\\textit{reachability}), while at the same time remaining inside a safety set for all time (\\textit{safety}). By leveraging the notion of $\\delta$-ISS control Lyapunov function, we derive a sufficient condition to generate a communication scheduling, such that the resulting state trajectory guarantees reachability and safety. Moreover, in order to alleviate computational b","authors_text":"Dimos V. Dimarogonas, Kazumune Hashimoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T09:18:57Z","title":"Synthesizing communication plans for reachability and safety specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07461","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:dd5a3ac6d70d8f9d17de91bc6776ef0f5b40a296c8711426193adf6d97d8d7cc","target":"record","created_at":"2026-05-17T23:53:07Z","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":"c9235a0c475589937b360395dbbe01206225b0999dd9b76787118e82ffbc7ff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T09:18:57Z","title_canon_sha256":"30030b035fdbf521177c65416e2db359a0c958ac121181699d45cc6d5169b97a"},"schema_version":"1.0","source":{"id":"1902.07461","kind":"arxiv","version":1}},"canonical_sha256":"cda78949f91edb21e84c26b6e8bb38d7a4d0e07bc0528404949be038c3a8b129","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cda78949f91edb21e84c26b6e8bb38d7a4d0e07bc0528404949be038c3a8b129","first_computed_at":"2026-05-17T23:53:07.825613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:07.825613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"43G2/EnkEPPChOagwwY/FnKT7ZGPueog15fxtostSnzv2E/6CBF+xFASP9fZclDMn1lvcABygetE1bDIQTbUBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:07.826414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd5a3ac6d70d8f9d17de91bc6776ef0f5b40a296c8711426193adf6d97d8d7cc","sha256:7e8b0208cf183069584d8b414ad66649d9101a45154d77efa1931cf5e47c40ff"],"state_sha256":"770fa68ed7686fa98145d90bc5949821f40efac69de015766bad603d955f48ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEZZbDkOjXrbUqDqZS/m7cq1YUAeHQO2ytJcrXxnJTHSK6R1x/cdGZVxj8mDyiO+/YB0OV2hQMC7WjnzCcybCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:59:22.179210Z","bundle_sha256":"cacd370f9bda0c52245eefb93dabd948b8b114c55024c790550304086beebfc6"}}