{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ARBCKMEJQRCRLPGRFRFYIJOUQJ","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":"f4e2319fdbd683ac8e14e5f6abc531935ba7d5e768fa817431430cae0d7fede5","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-05-19T09:37:18Z","title_canon_sha256":"9d80bc6c5b083e670da1076fe0c9a72e82de2f661ff80c6662a1e59722921428"},"schema_version":"1.0","source":{"id":"2205.09420","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.09420","created_at":"2026-07-05T06:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"2205.09420v3","created_at":"2026-07-05T06:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.09420","created_at":"2026-07-05T06:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"ARBCKMEJQRCR","created_at":"2026-07-05T06:42:56Z"},{"alias_kind":"pith_short_16","alias_value":"ARBCKMEJQRCRLPGR","created_at":"2026-07-05T06:42:56Z"},{"alias_kind":"pith_short_8","alias_value":"ARBCKMEJ","created_at":"2026-07-05T06:42:56Z"}],"graph_snapshots":[{"event_id":"sha256:30b73f37a8483415c57222d61085f956cace02392b3e3503595dd7cc842646f0","target":"graph","created_at":"2026-07-05T06:42:56Z","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/2205.09420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multicasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy consumption of the BS and the latency of serving asynchronized requests from the MUs, is formulated as an infinite-horizon Markov decision process (MDP) problem with a large discrete action space, multiple time-varying constraints, and multiple time-invariant constraints. To address these challenges, this paper proposes a novel distribution-embedding multi-agent pr","authors_text":"Chuan Huang, Ran Li, Shengpei Jiang, Xiaoqi Qin","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-05-19T09:37:18Z","title":"Multicast Scheduling over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.09420","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:00514e20a8f491ece8d428d8e5a93741cff66ad31a62d6532b479437c6594a63","target":"record","created_at":"2026-07-05T06:42:56Z","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":"f4e2319fdbd683ac8e14e5f6abc531935ba7d5e768fa817431430cae0d7fede5","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-05-19T09:37:18Z","title_canon_sha256":"9d80bc6c5b083e670da1076fe0c9a72e82de2f661ff80c6662a1e59722921428"},"schema_version":"1.0","source":{"id":"2205.09420","kind":"arxiv","version":3}},"canonical_sha256":"0442253089844515bcd12c4b8425d4826502f251b5bc4081a7610f273a5f1acc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0442253089844515bcd12c4b8425d4826502f251b5bc4081a7610f273a5f1acc","first_computed_at":"2026-07-05T06:42:56.094563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:42:56.094563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Byys+9ZmxFN9ognvqEowtCPdIedVfzlXz5mgvuimHLp07EDLzOcQNjuOjbvv0zJrq3oFMOWKCjPBTw3FbEAaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:42:56.095039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.09420","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00514e20a8f491ece8d428d8e5a93741cff66ad31a62d6532b479437c6594a63","sha256:30b73f37a8483415c57222d61085f956cace02392b3e3503595dd7cc842646f0"],"state_sha256":"2794984bba43e3fb163bfba9f9a684f00f84f05cef6967354b85e555843cd1e9"}