{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L5CX7MO4JWZQMCUHHCJOL5QCBK","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":"f3b2ccd2e95b2321414b281813c6a32dc76f7f5634fa665a07a719fb3a62bf19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-04T03:20:22Z","title_canon_sha256":"9c8644f5025dad523e2638c67e6b9eab9216f0c9d766d2bc635a3e2de2c55a67"},"schema_version":"1.0","source":{"id":"2411.01766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01766","created_at":"2026-07-05T09:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01766v2","created_at":"2026-07-05T09:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01766","created_at":"2026-07-05T09:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"L5CX7MO4JWZQ","created_at":"2026-07-05T09:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"L5CX7MO4JWZQMCUH","created_at":"2026-07-05T09:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"L5CX7MO4","created_at":"2026-07-05T09:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:a224013e87d004347e6d1b67adafdb69752c5b1e65d842b4c40f744f6df72432","target":"graph","created_at":"2026-07-05T09:31:10Z","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/2411.01766/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, a two-stage intelligent scheduler is proposed to minimize the packet-level delay jitter while guaranteeing delay bound. Firstly, Lyapunov technology is employed to transform the delay-violation constraint into a sequential slot-level queue stability problem. Secondly, a hierarchical scheme is proposed to solve the resource allocation between multiple base stations and users, where the multi-agent reinforcement learning (MARL) gives the user priority and the number of scheduled packets, while the underlying scheduler allocates the resource. Our proposed scheme achieves lower dela","authors_text":"Cheng Zhang, Ji Fan, Lan Wei, Yongming Huang, Zening Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-04T03:20:22Z","title":"Lyapunov-guided Multi-Agent Reinforcement Learning for Delay-Sensitive Wireless Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01766","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:c376df7b245e60dc5b8433698069d52a6398180cbce0223d9385ab79db27a914","target":"record","created_at":"2026-07-05T09:31:10Z","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":"f3b2ccd2e95b2321414b281813c6a32dc76f7f5634fa665a07a719fb3a62bf19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-04T03:20:22Z","title_canon_sha256":"9c8644f5025dad523e2638c67e6b9eab9216f0c9d766d2bc635a3e2de2c55a67"},"schema_version":"1.0","source":{"id":"2411.01766","kind":"arxiv","version":2}},"canonical_sha256":"5f457fb1dc4db3060a873892e5f6020ab26d8594e1f1a77a78a56f60fdb63e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f457fb1dc4db3060a873892e5f6020ab26d8594e1f1a77a78a56f60fdb63e3c","first_computed_at":"2026-07-05T09:31:10.905197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:10.905197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wKvn6VaD65QvaDG5KA3PoSyZ0BvCM13RuwLACELF2I6KVnruqQkBJdBa0QVrf/zuGNhN1aQe6FsWcSjacNE4AA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:10.905621Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.01766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c376df7b245e60dc5b8433698069d52a6398180cbce0223d9385ab79db27a914","sha256:a224013e87d004347e6d1b67adafdb69752c5b1e65d842b4c40f744f6df72432"],"state_sha256":"e8a223e06a319006a54f886db03d1779ba6dc366f33fc3c6d12401652bf30cf4"}