{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5BKFL6UOAYEF5XQCYL6DPWRA7F","short_pith_number":"pith:5BKFL6UO","schema_version":"1.0","canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","source":{"kind":"arxiv","id":"1305.6993","version":1},"attestation_state":"computed","paper":{"title":"On The Optimality of Myopic Sensing in Multi-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Demosthenis Teneketzis, Yi Ouyang","submitted_at":"2013-05-30T03:26:32Z","abstract_excerpt":"We consider the channel sensing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a multi-state Markov chain (M.C.). At each time instant a user selects one channel to sense and uses it to transmit information. A reward depending on the state of the selected channel is obtained for each transmission. The objective is to design a channel sensing policy that maximizes the expected total reward collected over a finite or infinite horizon. This pro"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1305.6993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-05-30T03:26:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"348546061fe0c80a7a50d7d412c24ed97f5e4214f7dc93c5d48385a49aa73f2e","abstract_canon_sha256":"a0345397361f8455a6cded622a98706a9735932f0655dbaa683a034a8d13272f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:16.681214Z","signature_b64":"yCv0Q26DoJ9KO76LjbMUd2ABiAhJcxSjsf1CM7qyodfnYP4URBDpFj1Q2U3TSwttEZdzfjxa71HpDfOP9a2BCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","last_reissued_at":"2026-05-18T03:22:16.680685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:16.680685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Optimality of Myopic Sensing in Multi-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Demosthenis Teneketzis, Yi Ouyang","submitted_at":"2013-05-30T03:26:32Z","abstract_excerpt":"We consider the channel sensing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a multi-state Markov chain (M.C.). At each time instant a user selects one channel to sense and uses it to transmit information. A reward depending on the state of the selected channel is obtained for each transmission. The objective is to design a channel sensing policy that maximizes the expected total reward collected over a finite or infinite horizon. This pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6993","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.6993","created_at":"2026-05-18T03:22:16.680761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6993v1","created_at":"2026-05-18T03:22:16.680761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6993","created_at":"2026-05-18T03:22:16.680761+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BKFL6UOAYEF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BKFL6UOAYEF5XQC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BKFL6UO","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F","json":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F.json","graph_json":"https://pith.science/api/pith-number/5BKFL6UOAYEF5XQCYL6DPWRA7F/graph.json","events_json":"https://pith.science/api/pith-number/5BKFL6UOAYEF5XQCYL6DPWRA7F/events.json","paper":"https://pith.science/paper/5BKFL6UO"},"agent_actions":{"view_html":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F","download_json":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F.json","view_paper":"https://pith.science/paper/5BKFL6UO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6993&json=true","fetch_graph":"https://pith.science/api/pith-number/5BKFL6UOAYEF5XQCYL6DPWRA7F/graph.json","fetch_events":"https://pith.science/api/pith-number/5BKFL6UOAYEF5XQCYL6DPWRA7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/action/storage_attestation","attest_author":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/action/author_attestation","sign_citation":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/action/citation_signature","submit_replication":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/action/replication_record"}},"created_at":"2026-05-18T03:22:16.680761+00:00","updated_at":"2026-05-18T03:22:16.680761+00:00"}