{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GWHP66N5ANGI4O4FAC2S3CX6HB","short_pith_number":"pith:GWHP66N5","schema_version":"1.0","canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","source":{"kind":"arxiv","id":"2605.13012","version":1},"attestation_state":"computed","paper":{"title":"Toward Practical Age-of-Information Scheduling in 5G Cellular","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Igor Kadota, Zhuoyi Zhao","submitted_at":"2026-05-13T05:04:52Z","abstract_excerpt":"We consider a 5G cellular network where a gNB schedules time-sensitive uplink transmissions from multiple UEs and forwards received packets to remote destinations. In practical 5G networks, the gNB does not directly observe the destination-side Age of Information (AoI) and must make scheduling decisions under stringent slot-level runtime constraints. In this paper, we develop a low-complexity AoI-aware scheduling policy for 5G cellular under limited observability. We first design a low-complexity estimator that infers UE-side packet timestamps and destination-side AoI from gNB-visible observat"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T05:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"e63c27a17f4fdf19bbaef174a1e59dbacaf9eae3b9ac8455b548e96cb4f1a94c","abstract_canon_sha256":"5c1871f6e4ae205cc05bb3503ef32e0e342207980cc3d05ab92fad386fe979b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.240492Z","signature_b64":"mNfDdS9ciyv9CmEXSDOyDdVulT9z11sz+XuuNk7nWw0wAsSN973swgNRHMMWi43X4vbgJM7+Igl4wEg+/HAICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","last_reissued_at":"2026-05-18T03:09:00.239856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.239856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Practical Age-of-Information Scheduling in 5G Cellular","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Igor Kadota, Zhuoyi Zhao","submitted_at":"2026-05-13T05:04:52Z","abstract_excerpt":"We consider a 5G cellular network where a gNB schedules time-sensitive uplink transmissions from multiple UEs and forwards received packets to remote destinations. In practical 5G networks, the gNB does not directly observe the destination-side Age of Information (AoI) and must make scheduling decisions under stringent slot-level runtime constraints. In this paper, we develop a low-complexity AoI-aware scheduling policy for 5G cellular under limited observability. We first design a low-complexity estimator that infers UE-side packet timestamps and destination-side AoI from gNB-visible observat"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The LC estimator and MW-LC achieve performance close to a richer estimator-based AoI policy from the literature.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The low-complexity estimator can accurately infer UE-side packet timestamps and destination-side AoI from gNB-visible observations under realistic 5G slot-level constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A low-complexity estimator and MW-LC Max-Weight policy enable practical AoI-aware uplink scheduling in 5G under limited observability, matching richer policies in NetSim and MATLAB simulations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0b2b735faaf1870796b5831d005f5dea252a056223c1b706ea5877c757b6a79c"},"source":{"id":"2605.13012","kind":"arxiv","version":1},"verdict":{"id":"2c25ae09-aaa9-4193-9f65-84fe091e229d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:29:31.679053Z","strongest_claim":"The LC estimator and MW-LC achieve performance close to a richer estimator-based AoI policy from the literature.","one_line_summary":"A low-complexity estimator and MW-LC Max-Weight policy enable practical AoI-aware uplink scheduling in 5G under limited observability, matching richer policies in NetSim and MATLAB simulations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The low-complexity estimator can accurately infer UE-side packet timestamps and destination-side AoI from gNB-visible observations under realistic 5G slot-level constraints.","pith_extraction_headline":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability."},"references":{"count":17,"sample":[{"doi":"","year":2011,"title":"Minimizing age of information in vehicular networks,","work_id":"1e872526-ae65-4482-8cf1-ce86d64dfac3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Update or wait: How to keep your data fresh,","work_id":"8efddd6e-c2ff-4990-83b3-d0e6237a8e5f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Age of information: An introduction and survey,","work_id":"007a3c93-0e5d-43cc-b811-13d1c16d32f2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,","work_id":"1a2cbcde-8aa7-4f68-89c8-d55310fba18a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"AoI-QPS: Age-of- information aware efficient queue-proportional scheduling,","work_id":"e1fbaa87-5925-4372-949a-c2b7234a8d54","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"b08e40d6ae3df28b3092f65d953c99c817e6def26ad404ea34f03983d9046ff1","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"831ee4de153d2c59c7b2572c3110c9cdc5aeed9f00f70676c6d75c3c3cb1df56"},"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":"2605.13012","created_at":"2026-05-18T03:09:00.239960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13012v1","created_at":"2026-05-18T03:09:00.239960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13012","created_at":"2026-05-18T03:09:00.239960+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWHP66N5ANGI","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWHP66N5ANGI4O4F","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWHP66N5","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB","json":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB.json","graph_json":"https://pith.science/api/pith-number/GWHP66N5ANGI4O4FAC2S3CX6HB/graph.json","events_json":"https://pith.science/api/pith-number/GWHP66N5ANGI4O4FAC2S3CX6HB/events.json","paper":"https://pith.science/paper/GWHP66N5"},"agent_actions":{"view_html":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB","download_json":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB.json","view_paper":"https://pith.science/paper/GWHP66N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13012&json=true","fetch_graph":"https://pith.science/api/pith-number/GWHP66N5ANGI4O4FAC2S3CX6HB/graph.json","fetch_events":"https://pith.science/api/pith-number/GWHP66N5ANGI4O4FAC2S3CX6HB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/action/storage_attestation","attest_author":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/action/author_attestation","sign_citation":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/action/citation_signature","submit_replication":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/action/replication_record"}},"created_at":"2026-05-18T03:09:00.239960+00:00","updated_at":"2026-05-18T03:09:00.239960+00:00"}