{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UYZH235YAC5W4GJTHHDNPVX3QW","short_pith_number":"pith:UYZH235Y","canonical_record":{"source":{"id":"1405.0751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-05T00:15:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4f268b209faec83ae3c71297df399d18f8d4bfbb0a44d4b7741584e29d4a9d91","abstract_canon_sha256":"17126f2a85bcbadc7cacd5dc2e5ca4a06f53eb1e753e970fa8d2ddb5961ba596"},"schema_version":"1.0"},"canonical_sha256":"a6327d6fb800bb6e193339c6d7d6fb85920299bf4619c40e38dfa56aa6f2b383","source":{"kind":"arxiv","id":"1405.0751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0751","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0751v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0751","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"UYZH235YAC5W","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYZH235YAC5W4GJT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYZH235Y","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UYZH235YAC5W4GJTHHDNPVX3QW","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-05T00:15:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4f268b209faec83ae3c71297df399d18f8d4bfbb0a44d4b7741584e29d4a9d91","abstract_canon_sha256":"17126f2a85bcbadc7cacd5dc2e5ca4a06f53eb1e753e970fa8d2ddb5961ba596"},"schema_version":"1.0"},"canonical_sha256":"a6327d6fb800bb6e193339c6d7d6fb85920299bf4619c40e38dfa56aa6f2b383","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.511162Z","signature_b64":"IkleNl7LSbKI+ZEHRUSfKY0wW97g/AOZmwjpPlwhC8xR18RR1P0Eg2sBzxkSziVtnlajUK0daNzDREP8Mns6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6327d6fb800bb6e193339c6d7d6fb85920299bf4619c40e38dfa56aa6f2b383","last_reissued_at":"2026-05-18T00:58:41.510469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.510469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0751","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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7ydq44+ob3VY1tk3eoj3FVglmcgkQiYUXH/+uVzeyVQrdJHVih36Xow27XihR6cyUUV67YW/2Kcir985SOhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:29.148069Z"},"content_sha256":"6eadad85f47cebca193589380837d98b711efd26166bd8983fb430f5f087e54f","schema_version":"1.0","event_id":"sha256:6eadad85f47cebca193589380837d98b711efd26166bd8983fb430f5f087e54f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UYZH235YAC5W4GJTHHDNPVX3QW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime Control using Input Sequences with Markovian Processor Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Daniel E. Quevedo, Vijay Gupta, Wann-Jiun Ma","submitted_at":"2014-05-05T00:15:48Z","abstract_excerpt":"We study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To address this issue, the algorithm calculates sequences of tentative future control inputs whenever possible, which are then buffered for possible future use. We assume that the processor availability is correlated so that the number of control inputs calculated at any time step is described by a Markov chain. Using a Lyapunov function based approach we deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0751","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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZwPzyGpeLeuycBfjEyexGioNY/+Dl7qPpj3T6gaHpURj+k14FyzmxkVamkp1DjcOgu2sJQhlrv8LeASh3ScBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:29.148440Z"},"content_sha256":"1cd0af0d8fb2354874fa41c1bcf86d57f4e83fdbf7e6eb65c86971a1953f6a86","schema_version":"1.0","event_id":"sha256:1cd0af0d8fb2354874fa41c1bcf86d57f4e83fdbf7e6eb65c86971a1953f6a86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYZH235YAC5W4GJTHHDNPVX3QW/bundle.json","state_url":"https://pith.science/pith/UYZH235YAC5W4GJTHHDNPVX3QW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYZH235YAC5W4GJTHHDNPVX3QW/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-28T02:21:29Z","links":{"resolver":"https://pith.science/pith/UYZH235YAC5W4GJTHHDNPVX3QW","bundle":"https://pith.science/pith/UYZH235YAC5W4GJTHHDNPVX3QW/bundle.json","state":"https://pith.science/pith/UYZH235YAC5W4GJTHHDNPVX3QW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYZH235YAC5W4GJTHHDNPVX3QW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UYZH235YAC5W4GJTHHDNPVX3QW","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":"17126f2a85bcbadc7cacd5dc2e5ca4a06f53eb1e753e970fa8d2ddb5961ba596","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-05T00:15:48Z","title_canon_sha256":"4f268b209faec83ae3c71297df399d18f8d4bfbb0a44d4b7741584e29d4a9d91"},"schema_version":"1.0","source":{"id":"1405.0751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0751","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0751v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0751","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"UYZH235YAC5W","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYZH235YAC5W4GJT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYZH235Y","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:1cd0af0d8fb2354874fa41c1bcf86d57f4e83fdbf7e6eb65c86971a1953f6a86","target":"graph","created_at":"2026-05-18T00:58:41Z","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 study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To address this issue, the algorithm calculates sequences of tentative future control inputs whenever possible, which are then buffered for possible future use. We assume that the processor availability is correlated so that the number of control inputs calculated at any time step is described by a Markov chain. Using a Lyapunov function based approach we deri","authors_text":"Daniel E. Quevedo, Vijay Gupta, Wann-Jiun Ma","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-05T00:15:48Z","title":"Anytime Control using Input Sequences with Markovian Processor Availability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0751","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:6eadad85f47cebca193589380837d98b711efd26166bd8983fb430f5f087e54f","target":"record","created_at":"2026-05-18T00:58:41Z","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":"17126f2a85bcbadc7cacd5dc2e5ca4a06f53eb1e753e970fa8d2ddb5961ba596","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-05T00:15:48Z","title_canon_sha256":"4f268b209faec83ae3c71297df399d18f8d4bfbb0a44d4b7741584e29d4a9d91"},"schema_version":"1.0","source":{"id":"1405.0751","kind":"arxiv","version":1}},"canonical_sha256":"a6327d6fb800bb6e193339c6d7d6fb85920299bf4619c40e38dfa56aa6f2b383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6327d6fb800bb6e193339c6d7d6fb85920299bf4619c40e38dfa56aa6f2b383","first_computed_at":"2026-05-18T00:58:41.510469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.510469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IkleNl7LSbKI+ZEHRUSfKY0wW97g/AOZmwjpPlwhC8xR18RR1P0Eg2sBzxkSziVtnlajUK0daNzDREP8Mns6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.511162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eadad85f47cebca193589380837d98b711efd26166bd8983fb430f5f087e54f","sha256:1cd0af0d8fb2354874fa41c1bcf86d57f4e83fdbf7e6eb65c86971a1953f6a86"],"state_sha256":"f306875eb9590b052bbb81668b1b4a046d7785ba011d28a07da0350fa51ccf7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RFej4kxLE6P9Ho2CEMxjNhpP41XzUPn280nP3dFwvd3b5jZ40RYxw+yyj96ERMruvOQZKQypcKr17CdVOX1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:21:29.150515Z","bundle_sha256":"94a2829f63917eeed494d50556bb5060281d6fdef7159bbafa3492cc19c3e77f"}}