{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ASLSHPNSO33ERX2FQLBYB4HSRU","short_pith_number":"pith:ASLSHPNS","schema_version":"1.0","canonical_sha256":"049723bdb276f648df4582c380f0f28d1ae9c0c8fc6127638ea42a424b8b1d28","source":{"kind":"arxiv","id":"1803.02998","version":2},"attestation_state":"computed","paper":{"title":"DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SY","authors_text":"Arunselvan Ramaswamy, Burak Demirel, Daniel E. Quevedo, Holger Karl","submitted_at":"2018-03-08T08:20:43Z","abstract_excerpt":"We consider networked control systems consisting of multiple independent controlled subsystems, operating over a shared communication network. Such systems are ubiquitous in cyber-physical systems, Internet of Things, and large-scale industrial systems. In many large-scale settings, the size of the communication network is smaller than the size of the system. In consequence, scheduling issues arise. The main contribution of this paper is to develop a deep reinforcement learning-based \\emph{control-aware} scheduling (\\textsc{DeepCAS}) algorithm to tackle these issues. We use the following (opti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.02998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-08T08:20:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e2699561031548566559833b27e63d2ca5660378397640e83ab85446d02f3171","abstract_canon_sha256":"f9e39c277edb3b85dff2f824d4cca02eaabf4dabe9dfc412e01e5dd8fb67df47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:21.479019Z","signature_b64":"a9AhbFIG5y5SLYc9CqtXus2ElfLC0FlE8MEYPuz8erydF4oIMWZEN1x8mmWFBdVoxHe/abSJWLBHATA2dtLaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"049723bdb276f648df4582c380f0f28d1ae9c0c8fc6127638ea42a424b8b1d28","last_reissued_at":"2026-05-18T00:13:21.478498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:21.478498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SY","authors_text":"Arunselvan Ramaswamy, Burak Demirel, Daniel E. Quevedo, Holger Karl","submitted_at":"2018-03-08T08:20:43Z","abstract_excerpt":"We consider networked control systems consisting of multiple independent controlled subsystems, operating over a shared communication network. Such systems are ubiquitous in cyber-physical systems, Internet of Things, and large-scale industrial systems. In many large-scale settings, the size of the communication network is smaller than the size of the system. In consequence, scheduling issues arise. The main contribution of this paper is to develop a deep reinforcement learning-based \\emph{control-aware} scheduling (\\textsc{DeepCAS}) algorithm to tackle these issues. We use the following (opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02998","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.02998","created_at":"2026-05-18T00:13:21.478562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02998v2","created_at":"2026-05-18T00:13:21.478562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02998","created_at":"2026-05-18T00:13:21.478562+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASLSHPNSO33E","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASLSHPNSO33ERX2F","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASLSHPNS","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU","json":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU.json","graph_json":"https://pith.science/api/pith-number/ASLSHPNSO33ERX2FQLBYB4HSRU/graph.json","events_json":"https://pith.science/api/pith-number/ASLSHPNSO33ERX2FQLBYB4HSRU/events.json","paper":"https://pith.science/paper/ASLSHPNS"},"agent_actions":{"view_html":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU","download_json":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU.json","view_paper":"https://pith.science/paper/ASLSHPNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02998&json=true","fetch_graph":"https://pith.science/api/pith-number/ASLSHPNSO33ERX2FQLBYB4HSRU/graph.json","fetch_events":"https://pith.science/api/pith-number/ASLSHPNSO33ERX2FQLBYB4HSRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU/action/storage_attestation","attest_author":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU/action/author_attestation","sign_citation":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU/action/citation_signature","submit_replication":"https://pith.science/pith/ASLSHPNSO33ERX2FQLBYB4HSRU/action/replication_record"}},"created_at":"2026-05-18T00:13:21.478562+00:00","updated_at":"2026-05-18T00:13:21.478562+00:00"}