{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H2DCKPZG67DOLFURQ5ZR47RDAE","short_pith_number":"pith:H2DCKPZG","schema_version":"1.0","canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","source":{"kind":"arxiv","id":"1712.07419","version":4},"attestation_state":"computed","paper":{"title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Eytan Modiano, Lingjie Duan, Yu-Pin Hsu","submitted_at":"2017-12-20T11:23:04Z","abstract_excerpt":"Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a base-station (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for"},"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":"1712.07419","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-20T11:23:04Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"bfa5d368d420d6551fb9ac3685cbf64c33aa4fa55ca32a1c90ced07532f64e5c","abstract_canon_sha256":"5b93cb78534cefe7744ec2f7d43a33eba86a70fa96ebb03fd7aa171bbc9bc2a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:39.495787Z","signature_b64":"YPqgmG0cFEwvLYCDay8xWoQKz42HDqjG+5SubYni/PatvC9hviOq5pAT3CG2LyKgAMwRNvR0gCkAKZlaFKNhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","last_reissued_at":"2026-05-18T00:05:39.495404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:39.495404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Eytan Modiano, Lingjie Duan, Yu-Pin Hsu","submitted_at":"2017-12-20T11:23:04Z","abstract_excerpt":"Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a base-station (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07419","kind":"arxiv","version":4},"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":"1712.07419","created_at":"2026-05-18T00:05:39.495467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07419v4","created_at":"2026-05-18T00:05:39.495467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07419","created_at":"2026-05-18T00:05:39.495467+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2DCKPZG67DO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2DCKPZG67DOLFUR","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2DCKPZG","created_at":"2026-05-18T12:31:18.294218+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/H2DCKPZG67DOLFURQ5ZR47RDAE","json":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE.json","graph_json":"https://pith.science/api/pith-number/H2DCKPZG67DOLFURQ5ZR47RDAE/graph.json","events_json":"https://pith.science/api/pith-number/H2DCKPZG67DOLFURQ5ZR47RDAE/events.json","paper":"https://pith.science/paper/H2DCKPZG"},"agent_actions":{"view_html":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE","download_json":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE.json","view_paper":"https://pith.science/paper/H2DCKPZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07419&json=true","fetch_graph":"https://pith.science/api/pith-number/H2DCKPZG67DOLFURQ5ZR47RDAE/graph.json","fetch_events":"https://pith.science/api/pith-number/H2DCKPZG67DOLFURQ5ZR47RDAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/action/storage_attestation","attest_author":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/action/author_attestation","sign_citation":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/action/citation_signature","submit_replication":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/action/replication_record"}},"created_at":"2026-05-18T00:05:39.495467+00:00","updated_at":"2026-05-18T00:05:39.495467+00:00"}