{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XZSPDEGUTWRZHDTAQR223VVGUQ","short_pith_number":"pith:XZSPDEGU","canonical_record":{"source":{"id":"1709.09312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-27T02:42:29Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"1698044a47fddee76fb8d075ed649f25bc3b61198a907316ccaf071ce6cfb2ab","abstract_canon_sha256":"48281fe5ed956c4932c0f08e87010fe65713980bc41f15df9dacb72aaa4c5eb1"},"schema_version":"1.0"},"canonical_sha256":"be64f190d49da3938e608475add6a6a40dbf8db77587f8bcf20e0dbdaece2e06","source":{"kind":"arxiv","id":"1709.09312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09312","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09312v1","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09312","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"XZSPDEGUTWRZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XZSPDEGUTWRZHDTA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XZSPDEGU","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XZSPDEGUTWRZHDTAQR223VVGUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-27T02:42:29Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"1698044a47fddee76fb8d075ed649f25bc3b61198a907316ccaf071ce6cfb2ab","abstract_canon_sha256":"48281fe5ed956c4932c0f08e87010fe65713980bc41f15df9dacb72aaa4c5eb1"},"schema_version":"1.0"},"canonical_sha256":"be64f190d49da3938e608475add6a6a40dbf8db77587f8bcf20e0dbdaece2e06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:12.211493Z","signature_b64":"Iq5JR6qMh68UbpB0zbuyS20HlNeMjbeEW+5zV60z38lPk84KV/FdTQ33IUGPr82GOX62V/o3wOJtBetE61JmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be64f190d49da3938e608475add6a6a40dbf8db77587f8bcf20e0dbdaece2e06","last_reissued_at":"2026-05-18T00:34:12.210802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:12.210802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09312","source_version":1,"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-18T00:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ddl0CjOa1q9UFgxTdfiDVtLvaHhXvAzoJTUGH8LuVLYaqAhPZn1FKqhKMRjBZoq3iCZgAeQKtrADlAgVpbmvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:55:31.380980Z"},"content_sha256":"ebe42e586627ddcedaf84298d684b1d5ca0bf366791ad8726dedd32e5f881d07","schema_version":"1.0","event_id":"sha256:ebe42e586627ddcedaf84298d684b1d5ca0bf366791ad8726dedd32e5f881d07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XZSPDEGUTWRZHDTAQR223VVGUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Reinforcement Learning Mechanism for Resource Allocation in LTE-A Networks with Markov Decision Process and Q-Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.AI","authors_text":"Einar Cesar Santos","submitted_at":"2017-09-27T02:42:29Z","abstract_excerpt":"Resource allocation is still a difficult issue to deal with in wireless networks. The unstable channel condition and traffic demand for Quality of Service (QoS) raise some barriers that interfere with the process. It is significant that an optimal policy takes into account some resources available to each traffic class while considering the spectral efficiency and other related channel issues. Reinforcement learning is a dynamic and effective method to support the accomplishment of resource allocation properly maintaining QoS levels for applications. The technique can track the system state as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09312","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"},"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-18T00:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kz1Xhry4+IJJow8bz8idkRv6DeQyXagtEEokuNo+X9tkms8Zj5qtUtgfxUvMHZqGUaRTvVrRIVGcRZcv61SaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:55:31.381645Z"},"content_sha256":"4388a625eee44c3ae4a8cb056808b9698a3717bc592175c71d456090de5b1fad","schema_version":"1.0","event_id":"sha256:4388a625eee44c3ae4a8cb056808b9698a3717bc592175c71d456090de5b1fad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/bundle.json","state_url":"https://pith.science/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/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-05-26T18:55:31Z","links":{"resolver":"https://pith.science/pith/XZSPDEGUTWRZHDTAQR223VVGUQ","bundle":"https://pith.science/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/bundle.json","state":"https://pith.science/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZSPDEGUTWRZHDTAQR223VVGUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XZSPDEGUTWRZHDTAQR223VVGUQ","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":"48281fe5ed956c4932c0f08e87010fe65713980bc41f15df9dacb72aaa4c5eb1","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-27T02:42:29Z","title_canon_sha256":"1698044a47fddee76fb8d075ed649f25bc3b61198a907316ccaf071ce6cfb2ab"},"schema_version":"1.0","source":{"id":"1709.09312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09312","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09312v1","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09312","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"XZSPDEGUTWRZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XZSPDEGUTWRZHDTA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XZSPDEGU","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4388a625eee44c3ae4a8cb056808b9698a3717bc592175c71d456090de5b1fad","target":"graph","created_at":"2026-05-18T00:34:12Z","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":"Resource allocation is still a difficult issue to deal with in wireless networks. The unstable channel condition and traffic demand for Quality of Service (QoS) raise some barriers that interfere with the process. It is significant that an optimal policy takes into account some resources available to each traffic class while considering the spectral efficiency and other related channel issues. Reinforcement learning is a dynamic and effective method to support the accomplishment of resource allocation properly maintaining QoS levels for applications. The technique can track the system state as","authors_text":"Einar Cesar Santos","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-27T02:42:29Z","title":"A Simple Reinforcement Learning Mechanism for Resource Allocation in LTE-A Networks with Markov Decision Process and Q-Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09312","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:ebe42e586627ddcedaf84298d684b1d5ca0bf366791ad8726dedd32e5f881d07","target":"record","created_at":"2026-05-18T00:34:12Z","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":"48281fe5ed956c4932c0f08e87010fe65713980bc41f15df9dacb72aaa4c5eb1","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-27T02:42:29Z","title_canon_sha256":"1698044a47fddee76fb8d075ed649f25bc3b61198a907316ccaf071ce6cfb2ab"},"schema_version":"1.0","source":{"id":"1709.09312","kind":"arxiv","version":1}},"canonical_sha256":"be64f190d49da3938e608475add6a6a40dbf8db77587f8bcf20e0dbdaece2e06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be64f190d49da3938e608475add6a6a40dbf8db77587f8bcf20e0dbdaece2e06","first_computed_at":"2026-05-18T00:34:12.210802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:12.210802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iq5JR6qMh68UbpB0zbuyS20HlNeMjbeEW+5zV60z38lPk84KV/FdTQ33IUGPr82GOX62V/o3wOJtBetE61JmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:12.211493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebe42e586627ddcedaf84298d684b1d5ca0bf366791ad8726dedd32e5f881d07","sha256:4388a625eee44c3ae4a8cb056808b9698a3717bc592175c71d456090de5b1fad"],"state_sha256":"574986060fcd5d1d6e97e748700bbbff86129f41ac876584eccc0361ce119c8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afMTSDM99VkuVwMWSvKsLk4KxQxuWTp3Cn76Aov9+ednTTKHiXFdcr7kwIRdhZ8zBlEiOio+XpjUBk+SKxpZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:55:31.384465Z","bundle_sha256":"fa8db68318190099117a1e87f617ed5cbfb39b41c4fcb2c4152ebd60ee06fa8b"}}