{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V56BGWUBDUDBRCC3R6NQKAQJ3K","short_pith_number":"pith:V56BGWUB","canonical_record":{"source":{"id":"1905.05992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-15T07:32:06Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"title_canon_sha256":"712338358b4585e4576bdad529c3003616c157db17f1fbc33d7fc5079e0d9bb4","abstract_canon_sha256":"508dad09dbed8df03d421651c9d373a11da68f4b5de586ec68463115ef79295c"},"schema_version":"1.0"},"canonical_sha256":"af7c135a811d0618885b8f9b050209da8e3816214885d2612508c913b4c83f9c","source":{"kind":"arxiv","id":"1905.05992","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05992","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05992v2","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05992","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"V56BGWUBDUDB","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_16","alias_value":"V56BGWUBDUDBRCC3","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_8","alias_value":"V56BGWUB","created_at":"2026-06-04T20:14:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V56BGWUBDUDBRCC3R6NQKAQJ3K","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-15T07:32:06Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"title_canon_sha256":"712338358b4585e4576bdad529c3003616c157db17f1fbc33d7fc5079e0d9bb4","abstract_canon_sha256":"508dad09dbed8df03d421651c9d373a11da68f4b5de586ec68463115ef79295c"},"schema_version":"1.0"},"canonical_sha256":"af7c135a811d0618885b8f9b050209da8e3816214885d2612508c913b4c83f9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:30.840427Z","signature_b64":"XhQ47ADMY3afXrs1KRLysOG4DvhRDNrsPof//Jtx8XAUctNpFloC8h1CtI71PWbUIyzNu+e0gHyQLVQG6erLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7c135a811d0618885b8f9b050209da8e3816214885d2612508c913b4c83f9c","last_reissued_at":"2026-06-04T20:14:30.839994Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:30.839994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05992","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-06-04T20:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXYWzDLK3cq6K05wf1FHwUwsf/AQOx1ugK3/KEuaxsmVxuxXUKz81YScAZH7Rsj6NXDi+3cbZM6dQ0aSLlg3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:38:59.914953Z"},"content_sha256":"dc2f26cf30a29ff524106038250fa2b4722330e1fd17e0901f7342704f87b05f","schema_version":"1.0","event_id":"sha256:dc2f26cf30a29ff524106038250fa2b4722330e1fd17e0901f7342704f87b05f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V56BGWUBDUDBRCC3R6NQKAQJ3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep reinforcement learning for scheduling in large-scale networked control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Adrian Redder, Arunselvan Ramaswamy, Daniel E. Quevedo","submitted_at":"2019-05-15T07:32:06Z","abstract_excerpt":"This work considers the problem of control and resource scheduling in networked systems. We present DIRA, a Deep reinforcement learning based Iterative Resource Allocation algorithm, which is scalable and control-aware. Our algorithm is tailored towards large-scale problems where control and scheduling need to act jointly to optimize performance. DIRA can be used to schedule general time-domain optimization based controllers. In the present work, we focus on control designs based on suitably adapted linear quadratic regulators. We apply our algorithm to networked systems with correlated fading"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05992","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.05992/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-04T20:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Rq1fEIKSTtzUmEejdZttkTP6yx6tII++XxESF2UdLQGFqGto1ee7kqeIz2YPcm2A/plfJOp8goAQg7NEsAvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:38:59.915344Z"},"content_sha256":"9e72eee0c31e821c7da20d6f0a45a4578aa952475d4658bd1871982d41719ac3","schema_version":"1.0","event_id":"sha256:9e72eee0c31e821c7da20d6f0a45a4578aa952475d4658bd1871982d41719ac3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/bundle.json","state_url":"https://pith.science/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/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-22T20:38:59Z","links":{"resolver":"https://pith.science/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K","bundle":"https://pith.science/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/bundle.json","state":"https://pith.science/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V56BGWUBDUDBRCC3R6NQKAQJ3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V56BGWUBDUDBRCC3R6NQKAQJ3K","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":"508dad09dbed8df03d421651c9d373a11da68f4b5de586ec68463115ef79295c","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-15T07:32:06Z","title_canon_sha256":"712338358b4585e4576bdad529c3003616c157db17f1fbc33d7fc5079e0d9bb4"},"schema_version":"1.0","source":{"id":"1905.05992","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05992","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05992v2","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05992","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"V56BGWUBDUDB","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_16","alias_value":"V56BGWUBDUDBRCC3","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_8","alias_value":"V56BGWUB","created_at":"2026-06-04T20:14:30Z"}],"graph_snapshots":[{"event_id":"sha256:9e72eee0c31e821c7da20d6f0a45a4578aa952475d4658bd1871982d41719ac3","target":"graph","created_at":"2026-06-04T20:14:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.05992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work considers the problem of control and resource scheduling in networked systems. We present DIRA, a Deep reinforcement learning based Iterative Resource Allocation algorithm, which is scalable and control-aware. Our algorithm is tailored towards large-scale problems where control and scheduling need to act jointly to optimize performance. DIRA can be used to schedule general time-domain optimization based controllers. In the present work, we focus on control designs based on suitably adapted linear quadratic regulators. We apply our algorithm to networked systems with correlated fading","authors_text":"Adrian Redder, Arunselvan Ramaswamy, Daniel E. Quevedo","cross_cats":["cs.LG","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-15T07:32:06Z","title":"Deep reinforcement learning for scheduling in large-scale networked control systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05992","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:dc2f26cf30a29ff524106038250fa2b4722330e1fd17e0901f7342704f87b05f","target":"record","created_at":"2026-06-04T20:14:30Z","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":"508dad09dbed8df03d421651c9d373a11da68f4b5de586ec68463115ef79295c","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-15T07:32:06Z","title_canon_sha256":"712338358b4585e4576bdad529c3003616c157db17f1fbc33d7fc5079e0d9bb4"},"schema_version":"1.0","source":{"id":"1905.05992","kind":"arxiv","version":2}},"canonical_sha256":"af7c135a811d0618885b8f9b050209da8e3816214885d2612508c913b4c83f9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af7c135a811d0618885b8f9b050209da8e3816214885d2612508c913b4c83f9c","first_computed_at":"2026-06-04T20:14:30.839994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:30.839994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XhQ47ADMY3afXrs1KRLysOG4DvhRDNrsPof//Jtx8XAUctNpFloC8h1CtI71PWbUIyzNu+e0gHyQLVQG6erLDw==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:30.840427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05992","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc2f26cf30a29ff524106038250fa2b4722330e1fd17e0901f7342704f87b05f","sha256:9e72eee0c31e821c7da20d6f0a45a4578aa952475d4658bd1871982d41719ac3"],"state_sha256":"99e5cef784a756144767dc04147787494f45ecb1a000627d8d0907b166272e08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOYSCD6X4yokT+jvhjuAHILKUbFtL3VQHivnOnUDQD8OhAInGIVt3pvn4L7Wlo19vXW0q1KA4kDJzq0nhayBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:38:59.917420Z","bundle_sha256":"cb06d6deb192f92f2b498cbeff26c3aaf7213230d240c4bb01b5536f172d1f58"}}