{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5BKFL6UOAYEF5XQCYL6DPWRA7F","short_pith_number":"pith:5BKFL6UO","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"},"canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","source":{"kind":"arxiv","id":"1305.6993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6993","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6993v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6993","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"5BKFL6UOAYEF","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5BKFL6UOAYEF5XQC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5BKFL6UO","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5BKFL6UOAYEF5XQCYL6DPWRA7F","target":"record","payload":{"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"},"canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","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"},"source_kind":"arxiv","source_id":"1305.6993","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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZLPZLlFA3nNNY7Mb9BWBo0lebwY6jsRxSHwBojjnfxZCcRjrl+eI6BljQoJkRM6n7ErcYdU6x/ABuD//mfgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:59:25.437804Z"},"content_sha256":"b36f4198025d471d6de16a41c75eec32cf83fe36decba1505e5fad22347d452c","schema_version":"1.0","event_id":"sha256:b36f4198025d471d6de16a41c75eec32cf83fe36decba1505e5fad22347d452c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5BKFL6UOAYEF5XQCYL6DPWRA7F","target":"graph","payload":{"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"},"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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AjnLTk9BOX0L12O9edpWQTYatzzGq0Y3UFkrsxm1NQ38DKy9WAzsbnsdZbOJRUHMMy58hsSZzc0l9h7q7ZOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:59:25.438352Z"},"content_sha256":"da72825ceb50e94dca926408315ef21f938232616501c39698c5f0c7392ef475","schema_version":"1.0","event_id":"sha256:da72825ceb50e94dca926408315ef21f938232616501c39698c5f0c7392ef475"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/bundle.json","state_url":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/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-05T14:59:25Z","links":{"resolver":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F","bundle":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/bundle.json","state":"https://pith.science/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BKFL6UOAYEF5XQCYL6DPWRA7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5BKFL6UOAYEF5XQCYL6DPWRA7F","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":"a0345397361f8455a6cded622a98706a9735932f0655dbaa683a034a8d13272f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-05-30T03:26:32Z","title_canon_sha256":"348546061fe0c80a7a50d7d412c24ed97f5e4214f7dc93c5d48385a49aa73f2e"},"schema_version":"1.0","source":{"id":"1305.6993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6993","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6993v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6993","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"5BKFL6UOAYEF","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5BKFL6UOAYEF5XQC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5BKFL6UO","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:da72825ceb50e94dca926408315ef21f938232616501c39698c5f0c7392ef475","target":"graph","created_at":"2026-05-18T03:22:16Z","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":"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","authors_text":"Demosthenis Teneketzis, Yi Ouyang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-05-30T03:26:32Z","title":"On The Optimality of Myopic Sensing in Multi-State Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6993","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:b36f4198025d471d6de16a41c75eec32cf83fe36decba1505e5fad22347d452c","target":"record","created_at":"2026-05-18T03:22:16Z","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":"a0345397361f8455a6cded622a98706a9735932f0655dbaa683a034a8d13272f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-05-30T03:26:32Z","title_canon_sha256":"348546061fe0c80a7a50d7d412c24ed97f5e4214f7dc93c5d48385a49aa73f2e"},"schema_version":"1.0","source":{"id":"1305.6993","kind":"arxiv","version":1}},"canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85455fa8e06085ede02c2fc37da20f968a7c3e9e04b1e51141731566311f3f1","first_computed_at":"2026-05-18T03:22:16.680685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:16.680685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCv0Q26DoJ9KO76LjbMUd2ABiAhJcxSjsf1CM7qyodfnYP4URBDpFj1Q2U3TSwttEZdzfjxa71HpDfOP9a2BCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:16.681214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b36f4198025d471d6de16a41c75eec32cf83fe36decba1505e5fad22347d452c","sha256:da72825ceb50e94dca926408315ef21f938232616501c39698c5f0c7392ef475"],"state_sha256":"f3313e14abb0792b19348e544b8ead0ad80ff4ad0d6b3b98b671b91183d89384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3peI/5eEI1S/XCQU3nnsNbLEYl5CITgJTiCAPlRxrHwumW4TU4KcCk/OPmIYNbBWjzxLsB6uvWcM9N579r7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:59:25.441277Z","bundle_sha256":"502cdf8a3a230485e2d5d8e5f052044c8331eac36e6e4e683cde8e2a8473dd2d"}}