{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GQHURGGZ6Y4WNHUUBHLFEWXUME","short_pith_number":"pith:GQHURGGZ","canonical_record":{"source":{"id":"1805.00847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-02T14:51:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e7adc16adc923ccef9f3244ec2df70d16e2710d5cae598488668674697d205ce","abstract_canon_sha256":"1275450003245d70a2f0fe7f057b214a826be4fa2562d8aaf4c45c961b78a551"},"schema_version":"1.0"},"canonical_sha256":"340f4898d9f639669e9409d6525af461118bd7888a42da603354f495dcab826e","source":{"kind":"arxiv","id":"1805.00847","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00847","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00847v2","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00847","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"GQHURGGZ6Y4W","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQHURGGZ6Y4WNHUU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQHURGGZ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GQHURGGZ6Y4WNHUUBHLFEWXUME","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-02T14:51:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e7adc16adc923ccef9f3244ec2df70d16e2710d5cae598488668674697d205ce","abstract_canon_sha256":"1275450003245d70a2f0fe7f057b214a826be4fa2562d8aaf4c45c961b78a551"},"schema_version":"1.0"},"canonical_sha256":"340f4898d9f639669e9409d6525af461118bd7888a42da603354f495dcab826e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:53.074647Z","signature_b64":"6xVkN5kqbO8hTnJdi1zbVh9xOVVm4Wc9qgFbpoeCbhCG6PtGb1+Iyn3FynLgAUry0VmP+M3LRzfA8TIgvqFWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"340f4898d9f639669e9409d6525af461118bd7888a42da603354f495dcab826e","last_reissued_at":"2026-05-18T00:16:53.073782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:53.073782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00847","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-18T00:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9f8zEedEt6D8EXTCzWGWN9vNlbpRrudVBSnwlPRcUKT2ueRMbB/8XBFcekpsWoQGPfebQOAz/hWXfYmUOT/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:57.753822Z"},"content_sha256":"46c4420d6aebe71721a0eb5f28185e6972adf36621885afae7437139366ce623","schema_version":"1.0","event_id":"sha256:46c4420d6aebe71721a0eb5f28185e6972adf36621885afae7437139366ce623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GQHURGGZ6Y4WNHUUBHLFEWXUME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal and Robust Controller Synthesis: using Energy Timed Automata with Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.FL","authors_text":"Giovanni Bacci, Kim G. Larsen, Nicolas Markey, Patricia Bouyer, Pierre-Alain Reynier, Uli Fahrenberg","submitted_at":"2018-05-02T14:51:46Z","abstract_excerpt":"In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing constraints and variable energy rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy rates. We also consider the optimization problem of identifying the minimal upper bound that will permit the existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmeti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00847","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-18T00:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jET1IYYZF2+GwvfaioMDZh6Q/TriZfUdX8gQpIyo9XQAQ0DzROZl3p1IvUAIh76wVBI5aUKh4C2vcmS4MMeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:57.754298Z"},"content_sha256":"12eff041b2612db4e07f48a8a8be346e7cdb695877b413ad4d4a9e0de7ce9e75","schema_version":"1.0","event_id":"sha256:12eff041b2612db4e07f48a8a8be346e7cdb695877b413ad4d4a9e0de7ce9e75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/bundle.json","state_url":"https://pith.science/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/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:22:57Z","links":{"resolver":"https://pith.science/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME","bundle":"https://pith.science/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/bundle.json","state":"https://pith.science/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQHURGGZ6Y4WNHUUBHLFEWXUME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GQHURGGZ6Y4WNHUUBHLFEWXUME","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":"1275450003245d70a2f0fe7f057b214a826be4fa2562d8aaf4c45c961b78a551","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-02T14:51:46Z","title_canon_sha256":"e7adc16adc923ccef9f3244ec2df70d16e2710d5cae598488668674697d205ce"},"schema_version":"1.0","source":{"id":"1805.00847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00847","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00847v2","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00847","created_at":"2026-05-18T00:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"GQHURGGZ6Y4W","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQHURGGZ6Y4WNHUU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQHURGGZ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:12eff041b2612db4e07f48a8a8be346e7cdb695877b413ad4d4a9e0de7ce9e75","target":"graph","created_at":"2026-05-18T00:16:53Z","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 propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing constraints and variable energy rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy rates. We also consider the optimization problem of identifying the minimal upper bound that will permit the existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmeti","authors_text":"Giovanni Bacci, Kim G. Larsen, Nicolas Markey, Patricia Bouyer, Pierre-Alain Reynier, Uli Fahrenberg","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-02T14:51:46Z","title":"Optimal and Robust Controller Synthesis: using Energy Timed Automata with Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00847","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:46c4420d6aebe71721a0eb5f28185e6972adf36621885afae7437139366ce623","target":"record","created_at":"2026-05-18T00:16:53Z","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":"1275450003245d70a2f0fe7f057b214a826be4fa2562d8aaf4c45c961b78a551","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-02T14:51:46Z","title_canon_sha256":"e7adc16adc923ccef9f3244ec2df70d16e2710d5cae598488668674697d205ce"},"schema_version":"1.0","source":{"id":"1805.00847","kind":"arxiv","version":2}},"canonical_sha256":"340f4898d9f639669e9409d6525af461118bd7888a42da603354f495dcab826e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"340f4898d9f639669e9409d6525af461118bd7888a42da603354f495dcab826e","first_computed_at":"2026-05-18T00:16:53.073782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:53.073782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xVkN5kqbO8hTnJdi1zbVh9xOVVm4Wc9qgFbpoeCbhCG6PtGb1+Iyn3FynLgAUry0VmP+M3LRzfA8TIgvqFWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:53.074647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46c4420d6aebe71721a0eb5f28185e6972adf36621885afae7437139366ce623","sha256:12eff041b2612db4e07f48a8a8be346e7cdb695877b413ad4d4a9e0de7ce9e75"],"state_sha256":"4effe9d90236ed533deb619344261aab77b416fbb077b5179d044f5937f2f84b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRg7VXtLd9GXT2pE1HfFWZGltDQjuaB9OABAShdoZZP5xjMLG9W4CiUMDh4ZFwWbbp9Gtt3Cp/cqx2vTzpHjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:22:57.757029Z","bundle_sha256":"bf5fc552500be8bad1b5f1bfbe9b1cc8d621ff06dfd3604b2a0da82ca8af480b"}}