{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7YEQ2YU5FBYNNV4VYXMVKLQLK7","short_pith_number":"pith:7YEQ2YU5","canonical_record":{"source":{"id":"1108.2783","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-13T11:01:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"07e49d2708fbe6320e5199d1f82edc26cd41ccb1bef193bcc9424d77806a15a7","abstract_canon_sha256":"e97987e278c5f7ff17c3b9fba1148ee2157cdc98b2d5b17decf9f47db7072b5d"},"schema_version":"1.0"},"canonical_sha256":"fe090d629d2870d6d795c5d9552e0b57e6f0eaeea50651879caeb491665cbc7f","source":{"kind":"arxiv","id":"1108.2783","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2783","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2783v3","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2783","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"7YEQ2YU5FBYN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YEQ2YU5FBYNNV4V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YEQ2YU5","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7YEQ2YU5FBYNNV4VYXMVKLQLK7","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2783","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-13T11:01:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"07e49d2708fbe6320e5199d1f82edc26cd41ccb1bef193bcc9424d77806a15a7","abstract_canon_sha256":"e97987e278c5f7ff17c3b9fba1148ee2157cdc98b2d5b17decf9f47db7072b5d"},"schema_version":"1.0"},"canonical_sha256":"fe090d629d2870d6d795c5d9552e0b57e6f0eaeea50651879caeb491665cbc7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:41.885829Z","signature_b64":"ZKEvCdBmYCJia1TWrde0uB8GiTXasS6r1GOjW5RyajFaKp76/1F+S/RqbNBvNRdBso0C2RGP/mPc5LehLAomCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe090d629d2870d6d795c5d9552e0b57e6f0eaeea50651879caeb491665cbc7f","last_reissued_at":"2026-05-18T02:21:41.885439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:41.885439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2783","source_version":3,"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-18T02:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKW3kVw6oYqgve7RnifdQLLo7nU75zLR94yuQG1CX9yTthLUcGfza2mmUdsGJK4cnmeTXgky1QJcTnLTI6alCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:51:14.358603Z"},"content_sha256":"f004b7383feb23bf3f122b6ee9e1a6ea21659df565d7cfc759e6f6c6844e94e4","schema_version":"1.0","event_id":"sha256:f004b7383feb23bf3f122b6ee9e1a6ea21659df565d7cfc759e6f6c6844e94e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7YEQ2YU5FBYNNV4VYXMVKLQLK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimum Attention and the Anytime Attention Control Problems for Linear Systems: A Linear Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"M.C.F. Donkers, P. Tabuada, W.P.M.H. Heemels","submitted_at":"2011-08-13T11:01:03Z","abstract_excerpt":"In this paper, we present two control laws that are tailored for control applications in which computational and/or communication resources are scarce. Namely, we consider minimum attention control, where the `attention' that a control task requires is minimised given certain performance requirements, and anytime attention control, where the performance under the `attention' given by a scheduler is maximised. Here, we interpret `attention' as the inverse of the time elapsed between two consecutive executions of a control task. By focussing on linear plants, by allowing for only a finite number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2783","kind":"arxiv","version":3},"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-18T02:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lU11laj/i1yakvvVUfQ7hFk+qh3/I4lHnGy7T0mWdPTUeTg1bsalp6YYJ+jYPHJZsVGZN4S9wJjugDP1eGdoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:51:14.359275Z"},"content_sha256":"0fc99e63730e2d00330fa24b4e066553cbe9e432a8b76917bcde0e3684d8e76f","schema_version":"1.0","event_id":"sha256:0fc99e63730e2d00330fa24b4e066553cbe9e432a8b76917bcde0e3684d8e76f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/bundle.json","state_url":"https://pith.science/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/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-04T08:51:14Z","links":{"resolver":"https://pith.science/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7","bundle":"https://pith.science/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/bundle.json","state":"https://pith.science/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YEQ2YU5FBYNNV4VYXMVKLQLK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7YEQ2YU5FBYNNV4VYXMVKLQLK7","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":"e97987e278c5f7ff17c3b9fba1148ee2157cdc98b2d5b17decf9f47db7072b5d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-13T11:01:03Z","title_canon_sha256":"07e49d2708fbe6320e5199d1f82edc26cd41ccb1bef193bcc9424d77806a15a7"},"schema_version":"1.0","source":{"id":"1108.2783","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2783","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2783v3","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2783","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"7YEQ2YU5FBYN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YEQ2YU5FBYNNV4V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YEQ2YU5","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:0fc99e63730e2d00330fa24b4e066553cbe9e432a8b76917bcde0e3684d8e76f","target":"graph","created_at":"2026-05-18T02:21: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":"In this paper, we present two control laws that are tailored for control applications in which computational and/or communication resources are scarce. Namely, we consider minimum attention control, where the `attention' that a control task requires is minimised given certain performance requirements, and anytime attention control, where the performance under the `attention' given by a scheduler is maximised. Here, we interpret `attention' as the inverse of the time elapsed between two consecutive executions of a control task. By focussing on linear plants, by allowing for only a finite number","authors_text":"M.C.F. Donkers, P. Tabuada, W.P.M.H. Heemels","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-13T11:01:03Z","title":"On the Minimum Attention and the Anytime Attention Control Problems for Linear Systems: A Linear Programming Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2783","kind":"arxiv","version":3},"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:f004b7383feb23bf3f122b6ee9e1a6ea21659df565d7cfc759e6f6c6844e94e4","target":"record","created_at":"2026-05-18T02:21: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":"e97987e278c5f7ff17c3b9fba1148ee2157cdc98b2d5b17decf9f47db7072b5d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-13T11:01:03Z","title_canon_sha256":"07e49d2708fbe6320e5199d1f82edc26cd41ccb1bef193bcc9424d77806a15a7"},"schema_version":"1.0","source":{"id":"1108.2783","kind":"arxiv","version":3}},"canonical_sha256":"fe090d629d2870d6d795c5d9552e0b57e6f0eaeea50651879caeb491665cbc7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe090d629d2870d6d795c5d9552e0b57e6f0eaeea50651879caeb491665cbc7f","first_computed_at":"2026-05-18T02:21:41.885439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:41.885439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKEvCdBmYCJia1TWrde0uB8GiTXasS6r1GOjW5RyajFaKp76/1F+S/RqbNBvNRdBso0C2RGP/mPc5LehLAomCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:41.885829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2783","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f004b7383feb23bf3f122b6ee9e1a6ea21659df565d7cfc759e6f6c6844e94e4","sha256:0fc99e63730e2d00330fa24b4e066553cbe9e432a8b76917bcde0e3684d8e76f"],"state_sha256":"23a9001410785986b3eb54fe7fe7e36cb902b958f601fd71a0d73f1dc31a8cb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64BG3qwfj/TvM6pq1YiuYFKW4w8EMqdpqdhZ05hZwrLw1qNBAAVK7HU/OCNt1hJP1aNW7XlRD7crKGUEedONBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:51:14.362519Z","bundle_sha256":"2a15ade175dcbbf03c6ba7f883f776a99909289124686d83cac0f818521f57f1"}}