{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RAEDSQFBJA32A6XDMZX4Y7CZNR","short_pith_number":"pith:RAEDSQFB","schema_version":"1.0","canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","source":{"kind":"arxiv","id":"1811.06776","version":4},"attestation_state":"computed","paper":{"title":"Reinforcement Learning Based Scheduling Algorithm for Optimizing Age of Information in Ultra Reliable Low Latency Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anis Elgabli, Hamza Khan, Mehdi Bennis, Mounssif Krouka","submitted_at":"2018-11-16T12:09:40Z","abstract_excerpt":"Age of Information (AoI) measures the freshness of the information at a remote location. AoI reflects the time that is elapsed since the generation of the packet by a transmitter. In this paper, we consider a remote monitoring problem (e.g., remote factory) in which a number of sensor nodes are transmitting time sensitive measurements to a remote monitoring site. We consider minimizing a metric that maintains a trade-off between minimizing the sum of the expected AoI of all sensors and minimizing an Ultra Reliable Low Latency Communication (URLLC) term. The URLLC term is considered to ensure 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":"1811.06776","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-16T12:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"2599e8ada3ff462d17fcbac8ff46e837fad5a7ba0e6e827cfb32c7f4c9703e44","abstract_canon_sha256":"dc27cbf861fa1958119dc5b62a2444ba020f5940280bacee5f60ef15b36d0f2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.569285Z","signature_b64":"9Z/etGX3vQOYj7dZGE+GNtquTXEYeyKNuP46ogP8pYlxzg03TKxNyXq1cLoFmgSj5K1Jccg9pEetTaFvHEkBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","last_reissued_at":"2026-05-17T23:46:29.568630Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.568630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning Based Scheduling Algorithm for Optimizing Age of Information in Ultra Reliable Low Latency Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anis Elgabli, Hamza Khan, Mehdi Bennis, Mounssif Krouka","submitted_at":"2018-11-16T12:09:40Z","abstract_excerpt":"Age of Information (AoI) measures the freshness of the information at a remote location. AoI reflects the time that is elapsed since the generation of the packet by a transmitter. In this paper, we consider a remote monitoring problem (e.g., remote factory) in which a number of sensor nodes are transmitting time sensitive measurements to a remote monitoring site. We consider minimizing a metric that maintains a trade-off between minimizing the sum of the expected AoI of all sensors and minimizing an Ultra Reliable Low Latency Communication (URLLC) term. The URLLC term is considered to ensure t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06776","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":"1811.06776","created_at":"2026-05-17T23:46:29.568742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06776v4","created_at":"2026-05-17T23:46:29.568742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06776","created_at":"2026-05-17T23:46:29.568742+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAEDSQFBJA32","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAEDSQFBJA32A6XD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAEDSQFB","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/RAEDSQFBJA32A6XDMZX4Y7CZNR","json":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR.json","graph_json":"https://pith.science/api/pith-number/RAEDSQFBJA32A6XDMZX4Y7CZNR/graph.json","events_json":"https://pith.science/api/pith-number/RAEDSQFBJA32A6XDMZX4Y7CZNR/events.json","paper":"https://pith.science/paper/RAEDSQFB"},"agent_actions":{"view_html":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR","download_json":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR.json","view_paper":"https://pith.science/paper/RAEDSQFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06776&json=true","fetch_graph":"https://pith.science/api/pith-number/RAEDSQFBJA32A6XDMZX4Y7CZNR/graph.json","fetch_events":"https://pith.science/api/pith-number/RAEDSQFBJA32A6XDMZX4Y7CZNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/action/storage_attestation","attest_author":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/action/author_attestation","sign_citation":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/action/citation_signature","submit_replication":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/action/replication_record"}},"created_at":"2026-05-17T23:46:29.568742+00:00","updated_at":"2026-05-17T23:46:29.568742+00:00"}