{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RMSOGX2FJ7SN4C3D7IUJNC7UCZ","short_pith_number":"pith:RMSOGX2F","schema_version":"1.0","canonical_sha256":"8b24e35f454fe4de0b63fa28968bf4165ba5969617ba902f95d517a276072c7e","source":{"kind":"arxiv","id":"1805.06752","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Igor Kadota, Rajat Talak, Sertac Karaman","submitted_at":"2018-05-15T22:57:06Z","abstract_excerpt":"Age of information (AoI) is a recently proposed metric that measures the time elapsed since the generation of the last received information update. We consider the problem of AoI minimization for a network under general interference constraints, and time varying channel. We study the case where the channel statistics are known, but the current channel state is unknown. We propose two scheduling policies, namely, the virtual queue based policy and age-based policy. In the virtual queue based policy, the scheduler schedules links with maximum weighted sum of the virtual queue lengths, while in t"},"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":"1805.06752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-15T22:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"c72e2eaa3691f7ab5ae899c82fd550f9df7f43ca6f11b08bc5595b95eb5a24cd","abstract_canon_sha256":"7cc40235bdca4cc98f09084dfcbecba09b22262adb046872745aa1ee31f2ef12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:43.455180Z","signature_b64":"ZPhUC4xYSYqZxnZ6h7idLZxtwujPmFwekrqRd4SsQxc2tFOgUOlzk+Q8SwtPplRX/QDEpknoAJADf8GuBtDJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b24e35f454fe4de0b63fa28968bf4165ba5969617ba902f95d517a276072c7e","last_reissued_at":"2026-05-18T00:15:43.454752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:43.454752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Igor Kadota, Rajat Talak, Sertac Karaman","submitted_at":"2018-05-15T22:57:06Z","abstract_excerpt":"Age of information (AoI) is a recently proposed metric that measures the time elapsed since the generation of the last received information update. We consider the problem of AoI minimization for a network under general interference constraints, and time varying channel. We study the case where the channel statistics are known, but the current channel state is unknown. We propose two scheduling policies, namely, the virtual queue based policy and age-based policy. In the virtual queue based policy, the scheduler schedules links with maximum weighted sum of the virtual queue lengths, while in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06752","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":"1805.06752","created_at":"2026-05-18T00:15:43.454822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06752v1","created_at":"2026-05-18T00:15:43.454822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06752","created_at":"2026-05-18T00:15:43.454822+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMSOGX2FJ7SN","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMSOGX2FJ7SN4C3D","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMSOGX2F","created_at":"2026-05-18T12:32:50.500415+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/RMSOGX2FJ7SN4C3D7IUJNC7UCZ","json":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ.json","graph_json":"https://pith.science/api/pith-number/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/graph.json","events_json":"https://pith.science/api/pith-number/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/events.json","paper":"https://pith.science/paper/RMSOGX2F"},"agent_actions":{"view_html":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ","download_json":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ.json","view_paper":"https://pith.science/paper/RMSOGX2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06752&json=true","fetch_graph":"https://pith.science/api/pith-number/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/action/storage_attestation","attest_author":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/action/author_attestation","sign_citation":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/action/citation_signature","submit_replication":"https://pith.science/pith/RMSOGX2FJ7SN4C3D7IUJNC7UCZ/action/replication_record"}},"created_at":"2026-05-18T00:15:43.454822+00:00","updated_at":"2026-05-18T00:15:43.454822+00:00"}