{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WPW6LWYBND7SUYJGHJVZVURDPB","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":"5e06f4c66bdac2e473a94302e80358906a4378dd814fce0878490a3f29fa5ab3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-09-13T12:37:23Z","title_canon_sha256":"2d5bdce08d2f96b0a12bb7b57abb65924a1529fe814521287321a1c083e0037e"},"schema_version":"1.0","source":{"id":"2209.05939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.05939","created_at":"2026-07-05T04:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"2209.05939v1","created_at":"2026-07-05T04:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05939","created_at":"2026-07-05T04:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"WPW6LWYBND7S","created_at":"2026-07-05T04:56:51Z"},{"alias_kind":"pith_short_16","alias_value":"WPW6LWYBND7SUYJG","created_at":"2026-07-05T04:56:51Z"},{"alias_kind":"pith_short_8","alias_value":"WPW6LWYB","created_at":"2026-07-05T04:56:51Z"}],"graph_snapshots":[{"event_id":"sha256:4f3da89d19e8bc8cfca8f3bb247e7dc2a94a895fa82df4b4e3ed11a5adb95804","target":"graph","created_at":"2026-07-05T04:56:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.05939/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we present a novel traffic prediction and fast uplink framework for IoT networks controlled by binary Markovian events. First, we apply the forward algorithm with hidden Markov models (HMM) in order to schedule the available resources to the devices with maximum likelihood activation probabilities via fast uplink grant. In addition, we evaluate the regret metric as the number of wasted transmission slots to evaluate the performance of the prediction. Next, we formulate a fairness optimization problem to minimize the age of information while keeping the regret as minimum as possib","authors_text":"Anders E. Kalor, Eslam Eldeeb, Hirley Alves, Mohammad Shehab, Petar Popovski","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-09-13T12:37:23Z","title":"Traffic Prediction and Fast Uplink for Hidden Markov IoT Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05939","kind":"arxiv","version":1},"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:937c06a15fc74867a11bf7fc55f98c7e60303f36ecc84b40ad6642af9387338e","target":"record","created_at":"2026-07-05T04:56:51Z","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":"5e06f4c66bdac2e473a94302e80358906a4378dd814fce0878490a3f29fa5ab3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-09-13T12:37:23Z","title_canon_sha256":"2d5bdce08d2f96b0a12bb7b57abb65924a1529fe814521287321a1c083e0037e"},"schema_version":"1.0","source":{"id":"2209.05939","kind":"arxiv","version":1}},"canonical_sha256":"b3ede5db0168ff2a61263a6b9ad22378538fe647a6c1833699148a02f5211f8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3ede5db0168ff2a61263a6b9ad22378538fe647a6c1833699148a02f5211f8f","first_computed_at":"2026-07-05T04:56:51.728705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:56:51.728705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIycId0IHUBf1DrPxuQ1NgZJzUU7qxA7YprpC5uM9/TOn76d2CIkCz9T8//bsMZEDBknYKFSG2V9AvPhxY0hAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:56:51.729239Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.05939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:937c06a15fc74867a11bf7fc55f98c7e60303f36ecc84b40ad6642af9387338e","sha256:4f3da89d19e8bc8cfca8f3bb247e7dc2a94a895fa82df4b4e3ed11a5adb95804"],"state_sha256":"3a08262bdd0d25a897daa5ddabfbd33fd12a982b02a0d45e5be343675f9f4ef8"}