{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XCNMKGMA7KMYEQYGHNO7MZWGXP","short_pith_number":"pith:XCNMKGMA","canonical_record":{"source":{"id":"1409.3331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-11T06:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5be758e08f5a8b93cda2e9c4f251fa4394eb199e5f089c002714d84fbb391ded","abstract_canon_sha256":"0503779a7ce9b099225d0d9effad9b290d748d9bfaf7597de66b5f66f068ef6d"},"schema_version":"1.0"},"canonical_sha256":"b89ac51980fa998243063b5df666c6bbee31e8275644589e1ab5ece773c08834","source":{"kind":"arxiv","id":"1409.3331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3331","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3331v1","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3331","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"XCNMKGMA7KMY","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XCNMKGMA7KMYEQYG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XCNMKGMA","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XCNMKGMA7KMYEQYGHNO7MZWGXP","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-11T06:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5be758e08f5a8b93cda2e9c4f251fa4394eb199e5f089c002714d84fbb391ded","abstract_canon_sha256":"0503779a7ce9b099225d0d9effad9b290d748d9bfaf7597de66b5f66f068ef6d"},"schema_version":"1.0"},"canonical_sha256":"b89ac51980fa998243063b5df666c6bbee31e8275644589e1ab5ece773c08834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:01.611690Z","signature_b64":"I1mGOYBD9IlSY/J+AAM66FTMj1G89PyUjVSnoiqqHrpZM89fnojdrjlHbF0hIZHyanAVdxOoz/eGHitmveayAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89ac51980fa998243063b5df666c6bbee31e8275644589e1ab5ece773c08834","last_reissued_at":"2026-05-18T02:43:01.611170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:01.611170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3331","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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHf410sZip70TX00xnxAclNUJgLbj2gtxtAI/k81dJqqbQRtV2WixOmLAtaRRIFPD1i9eGGZGv1AcokHHXDqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:46:26.317671Z"},"content_sha256":"de3da7810e1143466045efd1749aa8c9990d595710946864fef3acd0ddfc9ee8","schema_version":"1.0","event_id":"sha256:de3da7810e1143466045efd1749aa8c9990d595710946864fef3acd0ddfc9ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XCNMKGMA7KMYEQYGHNO7MZWGXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement-based data transmission in temporally-correlated fading channels: Partial CSIT scenario","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Merouane Debbah, Tommy Svensson","submitted_at":"2014-09-11T06:21:28Z","abstract_excerpt":"Reinforcement algorithms refer to the schemes where the results of the previous trials and a reward-punishment rule are used for parameter setting in the next steps. In this paper, we use the concept of reinforcement algorithms to develop different data transmission models in wireless networks. Considering temporally-correlated fading channels, the results are presented for the cases with partial channel state information at the transmitter (CSIT). As demonstrated, the implementation of reinforcement algorithms improves the performance of communication setups remarkably, with the same feedback"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3331","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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5E+Oj5foUewvyN0KJc2LzwlcJTNyL+zH3AWKqFxv+w/vea5YKwXbHIASy0QToQGFJTJ2jQXl60nKncbVnMQrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:46:26.318025Z"},"content_sha256":"59eb76bda99b52b521c3f82324011cc40d0c68c6eead1ba47ed06f6d08b7c409","schema_version":"1.0","event_id":"sha256:59eb76bda99b52b521c3f82324011cc40d0c68c6eead1ba47ed06f6d08b7c409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/bundle.json","state_url":"https://pith.science/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/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-05T09:46:26Z","links":{"resolver":"https://pith.science/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP","bundle":"https://pith.science/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/bundle.json","state":"https://pith.science/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCNMKGMA7KMYEQYGHNO7MZWGXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XCNMKGMA7KMYEQYGHNO7MZWGXP","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":"0503779a7ce9b099225d0d9effad9b290d748d9bfaf7597de66b5f66f068ef6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-11T06:21:28Z","title_canon_sha256":"5be758e08f5a8b93cda2e9c4f251fa4394eb199e5f089c002714d84fbb391ded"},"schema_version":"1.0","source":{"id":"1409.3331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3331","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3331v1","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3331","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"XCNMKGMA7KMY","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XCNMKGMA7KMYEQYG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XCNMKGMA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:59eb76bda99b52b521c3f82324011cc40d0c68c6eead1ba47ed06f6d08b7c409","target":"graph","created_at":"2026-05-18T02:43:01Z","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":"Reinforcement algorithms refer to the schemes where the results of the previous trials and a reward-punishment rule are used for parameter setting in the next steps. In this paper, we use the concept of reinforcement algorithms to develop different data transmission models in wireless networks. Considering temporally-correlated fading channels, the results are presented for the cases with partial channel state information at the transmitter (CSIT). As demonstrated, the implementation of reinforcement algorithms improves the performance of communication setups remarkably, with the same feedback","authors_text":"Behrooz Makki, Merouane Debbah, Tommy Svensson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-11T06:21:28Z","title":"Reinforcement-based data transmission in temporally-correlated fading channels: Partial CSIT scenario"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3331","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:de3da7810e1143466045efd1749aa8c9990d595710946864fef3acd0ddfc9ee8","target":"record","created_at":"2026-05-18T02:43:01Z","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":"0503779a7ce9b099225d0d9effad9b290d748d9bfaf7597de66b5f66f068ef6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-11T06:21:28Z","title_canon_sha256":"5be758e08f5a8b93cda2e9c4f251fa4394eb199e5f089c002714d84fbb391ded"},"schema_version":"1.0","source":{"id":"1409.3331","kind":"arxiv","version":1}},"canonical_sha256":"b89ac51980fa998243063b5df666c6bbee31e8275644589e1ab5ece773c08834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89ac51980fa998243063b5df666c6bbee31e8275644589e1ab5ece773c08834","first_computed_at":"2026-05-18T02:43:01.611170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:01.611170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I1mGOYBD9IlSY/J+AAM66FTMj1G89PyUjVSnoiqqHrpZM89fnojdrjlHbF0hIZHyanAVdxOoz/eGHitmveayAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:01.611690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de3da7810e1143466045efd1749aa8c9990d595710946864fef3acd0ddfc9ee8","sha256:59eb76bda99b52b521c3f82324011cc40d0c68c6eead1ba47ed06f6d08b7c409"],"state_sha256":"c909151ff290fdd47743a561321e8b6936d54e49ce2b5a99b666f3737b0cdece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HX7w9Ptf00MQoz3Q+30CaSIlamNabyotS/WZ73VFxGgZ5iP+dOUrMofo/4QmzkBO6ql4A4Rccg5Vh/+dAE2ODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:46:26.320103Z","bundle_sha256":"d2111011a22aef0375611ed73c77b4c2ef67094907e5baadba2ef29cc458cde7"}}