{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ITEQ5RS5RDQ637QBPM3AXC3K5S","short_pith_number":"pith:ITEQ5RS5","canonical_record":{"source":{"id":"1103.1784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-09T13:56:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13349870f4ff94b69510ad52b608921e93383db54f5b3ac8d567e294f85cf633","abstract_canon_sha256":"d1a67890a609c1e49d91532a093b72f57864e36e9297b223795561bbb394a8b2"},"schema_version":"1.0"},"canonical_sha256":"44c90ec65d88e1edfe017b360b8b6aec908c13c63278f22f7446efe07faf2b0a","source":{"kind":"arxiv","id":"1103.1784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1784","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1784v1","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1784","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"ITEQ5RS5RDQ6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"ITEQ5RS5RDQ637QB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"ITEQ5RS5","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ITEQ5RS5RDQ637QBPM3AXC3K5S","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-09T13:56:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13349870f4ff94b69510ad52b608921e93383db54f5b3ac8d567e294f85cf633","abstract_canon_sha256":"d1a67890a609c1e49d91532a093b72f57864e36e9297b223795561bbb394a8b2"},"schema_version":"1.0"},"canonical_sha256":"44c90ec65d88e1edfe017b360b8b6aec908c13c63278f22f7446efe07faf2b0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:05.780636Z","signature_b64":"3tX/5+cz0r8DcozyZsAS9LvxVVnu/WJvgHnHAybHK47mOWfF5nuxpP5hM4YMYbYT5s/OsG2jm6+h/vKJ5n+CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c90ec65d88e1edfe017b360b8b6aec908c13c63278f22f7446efe07faf2b0a","last_reissued_at":"2026-05-18T04:27:05.779881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:05.779881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1784","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-18T04:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vChhhnP7mFBGyaX6epZHBRQwbiXmEnePydKB9MP7H3NfDq18IUqHcQrqFBNBi+PWOjCMXj70dTYszGmvstkjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:56:54.790749Z"},"content_sha256":"8d67a395b428be84ef3669f207a6902d33542cec5856832569145660c58de7cd","schema_version":"1.0","event_id":"sha256:8d67a395b428be84ef3669f207a6902d33542cec5856832569145660c58de7cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ITEQ5RS5RDQ637QBPM3AXC3K5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Myopic Sensing in Multi-channel Opportunistic Access: the Case of Sensing Multiple Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kehao Wang, Lin Chen","submitted_at":"2011-03-09T13:56:58Z","abstract_excerpt":"Recent works have developed a simple and robust myopic sensing policy for multi-channel opportunistic communication systems where a secondary user (SU) can access one of N i.i.d. Markovian channels. The optimality of the myopic sensing policy in maximizing the SU's cumulated reward is established under certain conditions on channel parameters. This paper studies the generic case where the SU can sense more than one channel each time. By characterizing the myopic sensing policy in this context, we establish analytically its optimality for certain system setting when the SU is allowed to sense t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1784","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-18T04:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqnTDzGGQMatwgHg2bgVwuz2liUibcvFoggBrlxJ5c9UFj1tgRGSsaGyWRAwVC4lgWiv5yLkBp4hQ5jtel9HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:56:54.791099Z"},"content_sha256":"86e7fd56ce3acd75ef76ad3bdcf3e4e6133cc013f09dd3f5b63d156ac54b7667","schema_version":"1.0","event_id":"sha256:86e7fd56ce3acd75ef76ad3bdcf3e4e6133cc013f09dd3f5b63d156ac54b7667"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/bundle.json","state_url":"https://pith.science/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/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-01T06:56:54Z","links":{"resolver":"https://pith.science/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S","bundle":"https://pith.science/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/bundle.json","state":"https://pith.science/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITEQ5RS5RDQ637QBPM3AXC3K5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ITEQ5RS5RDQ637QBPM3AXC3K5S","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":"d1a67890a609c1e49d91532a093b72f57864e36e9297b223795561bbb394a8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-09T13:56:58Z","title_canon_sha256":"13349870f4ff94b69510ad52b608921e93383db54f5b3ac8d567e294f85cf633"},"schema_version":"1.0","source":{"id":"1103.1784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1784","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1784v1","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1784","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"ITEQ5RS5RDQ6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"ITEQ5RS5RDQ637QB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"ITEQ5RS5","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:86e7fd56ce3acd75ef76ad3bdcf3e4e6133cc013f09dd3f5b63d156ac54b7667","target":"graph","created_at":"2026-05-18T04:27:05Z","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":"Recent works have developed a simple and robust myopic sensing policy for multi-channel opportunistic communication systems where a secondary user (SU) can access one of N i.i.d. Markovian channels. The optimality of the myopic sensing policy in maximizing the SU's cumulated reward is established under certain conditions on channel parameters. This paper studies the generic case where the SU can sense more than one channel each time. By characterizing the myopic sensing policy in this context, we establish analytically its optimality for certain system setting when the SU is allowed to sense t","authors_text":"Kehao Wang, Lin Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-09T13:56:58Z","title":"On the Optimality of Myopic Sensing in Multi-channel Opportunistic Access: the Case of Sensing Multiple Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1784","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:8d67a395b428be84ef3669f207a6902d33542cec5856832569145660c58de7cd","target":"record","created_at":"2026-05-18T04:27:05Z","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":"d1a67890a609c1e49d91532a093b72f57864e36e9297b223795561bbb394a8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-09T13:56:58Z","title_canon_sha256":"13349870f4ff94b69510ad52b608921e93383db54f5b3ac8d567e294f85cf633"},"schema_version":"1.0","source":{"id":"1103.1784","kind":"arxiv","version":1}},"canonical_sha256":"44c90ec65d88e1edfe017b360b8b6aec908c13c63278f22f7446efe07faf2b0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44c90ec65d88e1edfe017b360b8b6aec908c13c63278f22f7446efe07faf2b0a","first_computed_at":"2026-05-18T04:27:05.779881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:05.779881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tX/5+cz0r8DcozyZsAS9LvxVVnu/WJvgHnHAybHK47mOWfF5nuxpP5hM4YMYbYT5s/OsG2jm6+h/vKJ5n+CCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:05.780636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d67a395b428be84ef3669f207a6902d33542cec5856832569145660c58de7cd","sha256:86e7fd56ce3acd75ef76ad3bdcf3e4e6133cc013f09dd3f5b63d156ac54b7667"],"state_sha256":"e65f58a7dc89258c3b0352fbd1b58c1c94e95ca65705fb89c0be0e602dee1bdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Swm455AauXbZBOHxM1aWi7MDcbSNmO8tkRIcF7FTKRoMl4jveM/hC9O4aVUD/X3s1+H2DneT7R8/QTypJK/vBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:56:54.793049Z","bundle_sha256":"ed391b7fa838152946468fc710853478b96aa124bd6a1a5bf08c69372142533f"}}