{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OQ4GGRMEVLDX4UV5RORKA7Z64L","short_pith_number":"pith:OQ4GGRME","schema_version":"1.0","canonical_sha256":"7438634584aac77e52bd8ba2a07f3ee2e55deaddc2d964fc81ecf22453d72be2","source":{"kind":"arxiv","id":"1904.00647","version":1},"attestation_state":"computed","paper":{"title":"On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sinha, Arunabh Srivastava, Krishna Jagannathan","submitted_at":"2019-04-01T09:09:37Z","abstract_excerpt":"Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal scheduling policy for minimizing the average-AoI metric for a downlink transmission problem. For delay-sensitive applications, including real-time control of a cyber-physical system, or scheduling URLLC traffic in 5G, it is essential to have a more stringent uniform control on AoI across all users. In this paper, we derive an exactly optimal scheduling policy for th"},"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":"1904.00647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-01T09:09:37Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2b10cd7db295327fc3f682686966dc79c6a977fe4ca5cf322ca84e30c072a826","abstract_canon_sha256":"9d35d80e8b73b228e49bf3f50b7136bda8714e3649d40f5f055b1f986d3fbafa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:47.805845Z","signature_b64":"E3T5OTQRCKU6GDg7odc28o/IQo+ehUMdXKWLWnS3ln6nWgdutMeG3HriM3YcpjNi/PuiwbnLhAcSKI+jij+yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7438634584aac77e52bd8ba2a07f3ee2e55deaddc2d964fc81ecf22453d72be2","last_reissued_at":"2026-05-17T23:49:47.805245Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:47.805245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sinha, Arunabh Srivastava, Krishna Jagannathan","submitted_at":"2019-04-01T09:09:37Z","abstract_excerpt":"Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal scheduling policy for minimizing the average-AoI metric for a downlink transmission problem. For delay-sensitive applications, including real-time control of a cyber-physical system, or scheduling URLLC traffic in 5G, it is essential to have a more stringent uniform control on AoI across all users. In this paper, we derive an exactly optimal scheduling policy for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00647","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":""},"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":"1904.00647","created_at":"2026-05-17T23:49:47.805327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00647v1","created_at":"2026-05-17T23:49:47.805327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00647","created_at":"2026-05-17T23:49:47.805327+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQ4GGRMEVLDX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQ4GGRMEVLDX4UV5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQ4GGRME","created_at":"2026-05-18T12:33:24.271573+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/OQ4GGRMEVLDX4UV5RORKA7Z64L","json":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L.json","graph_json":"https://pith.science/api/pith-number/OQ4GGRMEVLDX4UV5RORKA7Z64L/graph.json","events_json":"https://pith.science/api/pith-number/OQ4GGRMEVLDX4UV5RORKA7Z64L/events.json","paper":"https://pith.science/paper/OQ4GGRME"},"agent_actions":{"view_html":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L","download_json":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L.json","view_paper":"https://pith.science/paper/OQ4GGRME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00647&json=true","fetch_graph":"https://pith.science/api/pith-number/OQ4GGRMEVLDX4UV5RORKA7Z64L/graph.json","fetch_events":"https://pith.science/api/pith-number/OQ4GGRMEVLDX4UV5RORKA7Z64L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L/action/storage_attestation","attest_author":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L/action/author_attestation","sign_citation":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L/action/citation_signature","submit_replication":"https://pith.science/pith/OQ4GGRMEVLDX4UV5RORKA7Z64L/action/replication_record"}},"created_at":"2026-05-17T23:49:47.805327+00:00","updated_at":"2026-05-17T23:49:47.805327+00:00"}