{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RAEDSQFBJA32A6XDMZX4Y7CZNR","short_pith_number":"pith:RAEDSQFB","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"},"canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","source":{"kind":"arxiv","id":"1811.06776","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06776","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06776v4","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06776","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAEDSQFBJA32","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RAEDSQFBJA32A6XD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RAEDSQFB","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RAEDSQFBJA32A6XDMZX4Y7CZNR","target":"record","payload":{"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"},"canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","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"},"source_kind":"arxiv","source_id":"1811.06776","source_version":4,"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-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBWM8/ce84JUovYjGepqfjiYnqCIhLh0/u/h6J8vT/e4RSgBUlCDkLLOgigvVtkZjO3Ee/sT9JD3rpqr11ITDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:05:43.386943Z"},"content_sha256":"e4e95f7c5345e35c4232c7a802f89a349777aef2bd3102faac9542ea5a3f5de3","schema_version":"1.0","event_id":"sha256:e4e95f7c5345e35c4232c7a802f89a349777aef2bd3102faac9542ea5a3f5de3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RAEDSQFBJA32A6XDMZX4Y7CZNR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcPK7v6s/iNHuD5o+6cI/LfReFdUtNG+fjxTE7iJSwtOJXxpkZwFA3LeqiiveRR80YjMY0q3i+oIoHFpOE8FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:05:43.387298Z"},"content_sha256":"3a3a6e74f72242a9e671a2e5216281439b9ffd72c3d861da85d34257e42ab048","schema_version":"1.0","event_id":"sha256:3a3a6e74f72242a9e671a2e5216281439b9ffd72c3d861da85d34257e42ab048"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/bundle.json","state_url":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/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-06-11T10:05:43Z","links":{"resolver":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR","bundle":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/bundle.json","state":"https://pith.science/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAEDSQFBJA32A6XDMZX4Y7CZNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RAEDSQFBJA32A6XDMZX4Y7CZNR","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":"dc27cbf861fa1958119dc5b62a2444ba020f5940280bacee5f60ef15b36d0f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-16T12:09:40Z","title_canon_sha256":"2599e8ada3ff462d17fcbac8ff46e837fad5a7ba0e6e827cfb32c7f4c9703e44"},"schema_version":"1.0","source":{"id":"1811.06776","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06776","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06776v4","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06776","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAEDSQFBJA32","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RAEDSQFBJA32A6XD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RAEDSQFB","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:3a3a6e74f72242a9e671a2e5216281439b9ffd72c3d861da85d34257e42ab048","target":"graph","created_at":"2026-05-17T23:46:29Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anis Elgabli, Hamza Khan, Mehdi Bennis, Mounssif Krouka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-16T12:09:40Z","title":"Reinforcement Learning Based Scheduling Algorithm for Optimizing Age of Information in Ultra Reliable Low Latency Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06776","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4e95f7c5345e35c4232c7a802f89a349777aef2bd3102faac9542ea5a3f5de3","target":"record","created_at":"2026-05-17T23:46:29Z","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":"dc27cbf861fa1958119dc5b62a2444ba020f5940280bacee5f60ef15b36d0f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-16T12:09:40Z","title_canon_sha256":"2599e8ada3ff462d17fcbac8ff46e837fad5a7ba0e6e827cfb32c7f4c9703e44"},"schema_version":"1.0","source":{"id":"1811.06776","kind":"arxiv","version":4}},"canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88083940a14837a07ae3666fcc7c596c64a1db8b611b23147e79fbedbb996f4f","first_computed_at":"2026-05-17T23:46:29.568630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:29.568630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Z/etGX3vQOYj7dZGE+GNtquTXEYeyKNuP46ogP8pYlxzg03TKxNyXq1cLoFmgSj5K1Jccg9pEetTaFvHEkBAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:29.569285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06776","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4e95f7c5345e35c4232c7a802f89a349777aef2bd3102faac9542ea5a3f5de3","sha256:3a3a6e74f72242a9e671a2e5216281439b9ffd72c3d861da85d34257e42ab048"],"state_sha256":"edba11c278f43554d073b121dc759333efbb34d9515a697dd2a92bcceb4e9652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9LNloPxzLJ0NVj6Ix3edARjfWbeB+OrLA2lwKFyh2dad6oVcJifl1EiHUHhl9rm8tML33yRQajG63uyqwR6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:05:43.389294Z","bundle_sha256":"e8b2da1d395222c94b5a4e1fe9688819ec75bc2da64489d12e1beaf1bc94a605"}}