{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KCX7JGNOIT5QCFPAMJHVVDV27N","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":"4e9d0da39cd76b158a56936f8dfbf19569457dce86f049305515bd89e198859a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-27T17:31:52Z","title_canon_sha256":"28fef85a31ba568a1e110ba1a566052ce61a01d66c01ae2e9afd00d1dcd185a5"},"schema_version":"1.0","source":{"id":"1011.5987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5987","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5987v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5987","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"KCX7JGNOIT5Q","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KCX7JGNOIT5QCFPA","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KCX7JGNO","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:28e57846290808a0a546dad2124b4f5bb54d151ef0b9eba7aaabb4455c5843ea","target":"graph","created_at":"2026-05-18T04:34:37Z","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":"In this paper, we propose a novel adaptive modulation and coding (AMC) algorithm dedicated to reduce the feedback frequency of the channel state information (CSI). There have been already plenty of works on AMC so as to exploit the bandwidth more efficiently with the CSI feedback to the transmitter. However, in some occasions, frequent CSI feedback is not favorable in these systems. This work considers finite-state Markov chain (FSMC) based channel prediction to alleviate the feedback while maximizing the overall throughput. We derive the close-form of the frame error rate (FER) based on chann","authors_text":"Hsuan-Jung Su, Jhesyong Jiang, Ping-Cheng Yeh, Shou-Pon Lin, Wei-Ting Lin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-27T17:31:52Z","title":"Prediction-based Adaptation (PRADA) Algorithm for Modulation and Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5987","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:a919b81739c0a759158b0a03056daa5bcb5ef508348363c204b7a4f6cf17aa89","target":"record","created_at":"2026-05-18T04:34:37Z","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":"4e9d0da39cd76b158a56936f8dfbf19569457dce86f049305515bd89e198859a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-27T17:31:52Z","title_canon_sha256":"28fef85a31ba568a1e110ba1a566052ce61a01d66c01ae2e9afd00d1dcd185a5"},"schema_version":"1.0","source":{"id":"1011.5987","kind":"arxiv","version":1}},"canonical_sha256":"50aff499ae44fb0115e0624f5a8ebafb66863ec5282760289ba9ad86b565c2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50aff499ae44fb0115e0624f5a8ebafb66863ec5282760289ba9ad86b565c2ea","first_computed_at":"2026-05-18T04:34:37.736817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:37.736817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MDyASi8EByaOY+8ZLx4uwBj/Wq2mkrgIYQBuIFSv1duk5d7yVdw+kk13lBpRBJ2/HUQ8nQ2MzxodNhB5pemjAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:37.737244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a919b81739c0a759158b0a03056daa5bcb5ef508348363c204b7a4f6cf17aa89","sha256:28e57846290808a0a546dad2124b4f5bb54d151ef0b9eba7aaabb4455c5843ea"],"state_sha256":"a0639e1076b6e0c1615211ba15d2099171b2937374905af8cbf78822dfd5575b"}