{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:35MR3KN5Q3CJ6SSTIK23SVFQ5G","short_pith_number":"pith:35MR3KN5","schema_version":"1.0","canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","source":{"kind":"arxiv","id":"2310.04817","version":1},"attestation_state":"computed","paper":{"title":"A Grouping-based Scheduler for Efficient Channel Utilization under Age of Information Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jingzhou Sun, Lehan Wang, Sheng Zhou, Yuxuan Sun, Zhisheng Niu","submitted_at":"2023-10-07T14:14:48Z","abstract_excerpt":"We consider a status information updating system where a fusion center collects the status information from a large number of sources and each of them has its own age of information (AoI) constraints. A novel grouping-based scheduler is proposed to solve this complex large-scale problem by dividing the sources into different scheduling groups. The problem is then transformed into deriving the optimal grouping scheme. A two-step grouping algorithm (TGA) is proposed: 1) Given AoI constraints, we first identify the sources with harmonic AoI constraints, then design a fast grouping method and an o"},"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":"2310.04817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"5b931e0afcf1a78f0b6677e0abeb161e3fbd13aa39ecebc4d71bc94804b52f02","abstract_canon_sha256":"53cdb1a393cd4c583f9b4c75a9615a8a563436f2b96c1e5fb54e65deac0ddbf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:23.208284Z","signature_b64":"jKNTip8hUP6guOrY/+YmWz0WmcsYvUv9aXgT7xbKh+jlxhnBMnRiWQ+Jx9xYY7PQ+meUd2d//wfSTRaeko7QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","last_reissued_at":"2026-07-05T06:58:23.207865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:23.207865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Grouping-based Scheduler for Efficient Channel Utilization under Age of Information Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jingzhou Sun, Lehan Wang, Sheng Zhou, Yuxuan Sun, Zhisheng Niu","submitted_at":"2023-10-07T14:14:48Z","abstract_excerpt":"We consider a status information updating system where a fusion center collects the status information from a large number of sources and each of them has its own age of information (AoI) constraints. A novel grouping-based scheduler is proposed to solve this complex large-scale problem by dividing the sources into different scheduling groups. The problem is then transformed into deriving the optimal grouping scheme. A two-step grouping algorithm (TGA) is proposed: 1) Given AoI constraints, we first identify the sources with harmonic AoI constraints, then design a fast grouping method and an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04817","kind":"arxiv","version":1},"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/2310.04817/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":"2310.04817","created_at":"2026-07-05T06:58:23.207923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04817v1","created_at":"2026-07-05T06:58:23.207923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04817","created_at":"2026-07-05T06:58:23.207923+00:00"},{"alias_kind":"pith_short_12","alias_value":"35MR3KN5Q3CJ","created_at":"2026-07-05T06:58:23.207923+00:00"},{"alias_kind":"pith_short_16","alias_value":"35MR3KN5Q3CJ6SST","created_at":"2026-07-05T06:58:23.207923+00:00"},{"alias_kind":"pith_short_8","alias_value":"35MR3KN5","created_at":"2026-07-05T06:58:23.207923+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/35MR3KN5Q3CJ6SSTIK23SVFQ5G","json":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G.json","graph_json":"https://pith.science/api/pith-number/35MR3KN5Q3CJ6SSTIK23SVFQ5G/graph.json","events_json":"https://pith.science/api/pith-number/35MR3KN5Q3CJ6SSTIK23SVFQ5G/events.json","paper":"https://pith.science/paper/35MR3KN5"},"agent_actions":{"view_html":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G","download_json":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G.json","view_paper":"https://pith.science/paper/35MR3KN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04817&json=true","fetch_graph":"https://pith.science/api/pith-number/35MR3KN5Q3CJ6SSTIK23SVFQ5G/graph.json","fetch_events":"https://pith.science/api/pith-number/35MR3KN5Q3CJ6SSTIK23SVFQ5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/action/storage_attestation","attest_author":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/action/author_attestation","sign_citation":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/action/citation_signature","submit_replication":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/action/replication_record"}},"created_at":"2026-07-05T06:58:23.207923+00:00","updated_at":"2026-07-05T06:58:23.207923+00:00"}