{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L5CX7MO4JWZQMCUHHCJOL5QCBK","short_pith_number":"pith:L5CX7MO4","schema_version":"1.0","canonical_sha256":"5f457fb1dc4db3060a873892e5f6020ab26d8594e1f1a77a78a56f60fdb63e3c","source":{"kind":"arxiv","id":"2411.01766","version":2},"attestation_state":"computed","paper":{"title":"Lyapunov-guided Multi-Agent Reinforcement Learning for Delay-Sensitive Wireless Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Zhang, Ji Fan, Lan Wei, Yongming Huang, Zening Liu","submitted_at":"2024-11-04T03:20:22Z","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"},"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":"2411.01766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-04T03:20:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c8644f5025dad523e2638c67e6b9eab9216f0c9d766d2bc635a3e2de2c55a67","abstract_canon_sha256":"f3b2ccd2e95b2321414b281813c6a32dc76f7f5634fa665a07a719fb3a62bf19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:10.905621Z","signature_b64":"wKvn6VaD65QvaDG5KA3PoSyZ0BvCM13RuwLACELF2I6KVnruqQkBJdBa0QVrf/zuGNhN1aQe6FsWcSjacNE4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f457fb1dc4db3060a873892e5f6020ab26d8594e1f1a77a78a56f60fdb63e3c","last_reissued_at":"2026-07-05T09:31:10.905197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:10.905197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lyapunov-guided Multi-Agent Reinforcement Learning for Delay-Sensitive Wireless Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Zhang, Ji Fan, Lan Wei, Yongming Huang, Zening Liu","submitted_at":"2024-11-04T03:20:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01766","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/2411.01766/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.01766","created_at":"2026-07-05T09:31:10.905254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01766v2","created_at":"2026-07-05T09:31:10.905254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01766","created_at":"2026-07-05T09:31:10.905254+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5CX7MO4JWZQ","created_at":"2026-07-05T09:31:10.905254+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5CX7MO4JWZQMCUH","created_at":"2026-07-05T09:31:10.905254+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5CX7MO4","created_at":"2026-07-05T09:31:10.905254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03586","citing_title":"Beamforming and Resource Allocation for Delay Minimization in RIS-Assisted OFDM Systems","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK","json":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK.json","graph_json":"https://pith.science/api/pith-number/L5CX7MO4JWZQMCUHHCJOL5QCBK/graph.json","events_json":"https://pith.science/api/pith-number/L5CX7MO4JWZQMCUHHCJOL5QCBK/events.json","paper":"https://pith.science/paper/L5CX7MO4"},"agent_actions":{"view_html":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK","download_json":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK.json","view_paper":"https://pith.science/paper/L5CX7MO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01766&json=true","fetch_graph":"https://pith.science/api/pith-number/L5CX7MO4JWZQMCUHHCJOL5QCBK/graph.json","fetch_events":"https://pith.science/api/pith-number/L5CX7MO4JWZQMCUHHCJOL5QCBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK/action/storage_attestation","attest_author":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK/action/author_attestation","sign_citation":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK/action/citation_signature","submit_replication":"https://pith.science/pith/L5CX7MO4JWZQMCUHHCJOL5QCBK/action/replication_record"}},"created_at":"2026-07-05T09:31:10.905254+00:00","updated_at":"2026-07-05T09:31:10.905254+00:00"}