{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GWHP66N5ANGI4O4FAC2S3CX6HB","short_pith_number":"pith:GWHP66N5","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"},"canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","source":{"kind":"arxiv","id":"2605.13012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13012","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13012v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13012","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"GWHP66N5ANGI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GWHP66N5ANGI4O4F","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GWHP66N5","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GWHP66N5ANGI4O4FAC2S3CX6HB","target":"record","payload":{"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"},"canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","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"},"source_kind":"arxiv","source_id":"2605.13012","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFdCyEJm39mG0Hvk/lxloKD29TQXm0TT/oo3uMOwxXVndetApzA+yqCGFbKdl62SqnqgFv03NVgGWc2ftDzlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:04:20.696723Z"},"content_sha256":"395067a460b05d1ecfef426a2d98b7d964355a31ae7490d4453927e8f493cb3c","schema_version":"1.0","event_id":"sha256:395067a460b05d1ecfef426a2d98b7d964355a31ae7490d4453927e8f493cb3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GWHP66N5ANGI4O4FAC2S3CX6HB","target":"graph","payload":{"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"},"verdict_id":"2c25ae09-aaa9-4193-9f65-84fe091e229d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cq8iCJ/bE9SlHUiAaqFSNMnk4QcVJBoVclpyqHMSENnYW8bd0aNGjrJscU5JsZNsgnqxquIDLqMMndlpRkTqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:04:20.697253Z"},"content_sha256":"dde12fc13b51a226725b4030d84ab681d1aa76d68800a5902981cfbca0a97c85","schema_version":"1.0","event_id":"sha256:dde12fc13b51a226725b4030d84ab681d1aa76d68800a5902981cfbca0a97c85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/bundle.json","state_url":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T04:04:20Z","links":{"resolver":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB","bundle":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/bundle.json","state":"https://pith.science/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWHP66N5ANGI4O4FAC2S3CX6HB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GWHP66N5ANGI4O4FAC2S3CX6HB","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":"5c1871f6e4ae205cc05bb3503ef32e0e342207980cc3d05ab92fad386fe979b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T05:04:52Z","title_canon_sha256":"e63c27a17f4fdf19bbaef174a1e59dbacaf9eae3b9ac8455b548e96cb4f1a94c"},"schema_version":"1.0","source":{"id":"2605.13012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13012","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13012v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13012","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"GWHP66N5ANGI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GWHP66N5ANGI4O4F","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GWHP66N5","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:dde12fc13b51a226725b4030d84ab681d1aa76d68800a5902981cfbca0a97c85","target":"graph","created_at":"2026-05-18T03:09:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The LC estimator and MW-LC achieve performance close to a richer estimator-based AoI policy from the literature."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability."}],"snapshot_sha256":"0b2b735faaf1870796b5831d005f5dea252a056223c1b706ea5877c757b6a79c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"831ee4de153d2c59c7b2572c3110c9cdc5aeed9f00f70676c6d75c3c3cb1df56"},"paper":{"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","authors_text":"Igor Kadota, Zhuoyi Zhao","cross_cats":[],"headline":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T05:04:52Z","title":"Toward Practical Age-of-Information Scheduling in 5G Cellular"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Minimizing age of information in vehicular networks,","work_id":"1e872526-ae65-4482-8cf1-ce86d64dfac3","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Update or wait: How to keep your data fresh,","work_id":"8efddd6e-c2ff-4990-83b3-d0e6237a8e5f","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Age of information: An introduction and survey,","work_id":"007a3c93-0e5d-43cc-b811-13d1c16d32f2","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,","work_id":"1a2cbcde-8aa7-4f68-89c8-d55310fba18a","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"AoI-QPS: Age-of- information aware efficient queue-proportional scheduling,","work_id":"e1fbaa87-5925-4372-949a-c2b7234a8d54","year":2025}],"snapshot_sha256":"b08e40d6ae3df28b3092f65d953c99c817e6def26ad404ea34f03983d9046ff1"},"source":{"id":"2605.13012","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:29:31.679053Z","id":"2c25ae09-aaa9-4193-9f65-84fe091e229d","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A low-complexity estimator enables practical Age-of-Information scheduling in 5G despite limited observability.","strongest_claim":"The LC estimator and MW-LC achieve performance close to a richer estimator-based AoI policy from the literature.","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."}},"verdict_id":"2c25ae09-aaa9-4193-9f65-84fe091e229d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:395067a460b05d1ecfef426a2d98b7d964355a31ae7490d4453927e8f493cb3c","target":"record","created_at":"2026-05-18T03:09:00Z","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":"5c1871f6e4ae205cc05bb3503ef32e0e342207980cc3d05ab92fad386fe979b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T05:04:52Z","title_canon_sha256":"e63c27a17f4fdf19bbaef174a1e59dbacaf9eae3b9ac8455b548e96cb4f1a94c"},"schema_version":"1.0","source":{"id":"2605.13012","kind":"arxiv","version":1}},"canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358eff79bd034c8e3b8500b52d8afe386f3e8df45d4c372faa7feef2e170d46e","first_computed_at":"2026-05-18T03:09:00.239856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.239856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNfDdS9ciyv9CmEXSDOyDdVulT9z11sz+XuuNk7nWw0wAsSN973swgNRHMMWi43X4vbgJM7+Igl4wEg+/HAICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.240492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:395067a460b05d1ecfef426a2d98b7d964355a31ae7490d4453927e8f493cb3c","sha256:dde12fc13b51a226725b4030d84ab681d1aa76d68800a5902981cfbca0a97c85"],"state_sha256":"2f7fb9b07dab994e59b4b9e5d58ac4c500cedd94e3c11841859499a089312bf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuYUXRZEchZ3rQcDdKwIm2R+GhOGGmqCbRQEkm2rjvN0X3w9DqhQI2U5HZVARh5JvNkPWWey1ddkwqpwoMwRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:04:20.699982Z","bundle_sha256":"ae26d899c11693c93c2af02d0b6b83cd1b1101bc63a1403d6e06f8cebf3c9682"}}