{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QY2ZWF437TOZKTWCHU2FZ6T5RP","short_pith_number":"pith:QY2ZWF43","canonical_record":{"source":{"id":"1309.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-14T19:01:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2dd742607b2dacc295ed0a7339a515d98ef047ec3d3c8effffaa81791f45a554","abstract_canon_sha256":"8fc85855d82e4d8974b5cc2444e589ae0e4a677e737b956ea4aadc62b021c174"},"schema_version":"1.0"},"canonical_sha256":"86359b179bfcdd954ec23d345cfa7d8bd3db04d8f57430f803c72dba14c1fb8e","source":{"kind":"arxiv","id":"1309.3692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3692","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3692v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3692","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"QY2ZWF437TOZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QY2ZWF437TOZKTWC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QY2ZWF43","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QY2ZWF437TOZKTWCHU2FZ6T5RP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-14T19:01:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2dd742607b2dacc295ed0a7339a515d98ef047ec3d3c8effffaa81791f45a554","abstract_canon_sha256":"8fc85855d82e4d8974b5cc2444e589ae0e4a677e737b956ea4aadc62b021c174"},"schema_version":"1.0"},"canonical_sha256":"86359b179bfcdd954ec23d345cfa7d8bd3db04d8f57430f803c72dba14c1fb8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.752416Z","signature_b64":"Pz8OeGooaI9PfUXlmtYaSBSqZ/7e9fTFhg+/ix8uchwyrzq7NEMFxhWpaTgPbXk3+BDtHOzCXERvI69WWSVZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86359b179bfcdd954ec23d345cfa7d8bd3db04d8f57430f803c72dba14c1fb8e","last_reissued_at":"2026-05-18T03:13:20.752058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.752058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3692","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:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lqo2s3ZqAdF8MSxHHA3D8b5hOuJoivkyAwdXFlJOAZbz3EHdMot5m9ygrSMtLcj2Dy6YbAsudOmeM018gWFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:43.431805Z"},"content_sha256":"c7781fbfeb9e32d7d2a4483734301da75559e28d4906df632b17a313b20a0313","schema_version":"1.0","event_id":"sha256:c7781fbfeb9e32d7d2a4483734301da75559e28d4906df632b17a313b20a0313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QY2ZWF437TOZKTWCHU2FZ6T5RP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sufficient Conditions on the Optimality of Myopic Sensing in Opportunistic Channel Access: A Unifying Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyan Liu, Sahand Haji Ali Ahmad, Yang Liu","submitted_at":"2013-09-14T19:01:17Z","abstract_excerpt":"This paper considers a widely studied stochastic control problem arising from opportunistic spectrum access (OSA) in a multi-channel system, with the goal of providing a unifying analytical framework whereby a number of prior results may be viewed as special cases. Specifically, we consider a single wireless transceiver/user with access to $N$ channels, each modeled as an iid discrete-time two-state Markov chain. In each time step the user is allowed to sense $k\\leq N$ channels, and subsequently use up to $m\\leq k$ channels out of those sensed to be available. Channel sensing is assumed to be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3692","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:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"waof600eXoAxGaWZQLQFfCVszAJTQ6eWBoZRZARhHfraPK83oIG+R2dFxuulvqk+qba0JMiZ8kFczxkTB8u+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:43.432157Z"},"content_sha256":"501078bbd65957b4e4eec6eb281c2ba5c78dca0c8f289d90b7e4ee90a4ae2e42","schema_version":"1.0","event_id":"sha256:501078bbd65957b4e4eec6eb281c2ba5c78dca0c8f289d90b7e4ee90a4ae2e42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/bundle.json","state_url":"https://pith.science/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/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-05-30T20:29:43Z","links":{"resolver":"https://pith.science/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP","bundle":"https://pith.science/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/bundle.json","state":"https://pith.science/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY2ZWF437TOZKTWCHU2FZ6T5RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QY2ZWF437TOZKTWCHU2FZ6T5RP","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":"8fc85855d82e4d8974b5cc2444e589ae0e4a677e737b956ea4aadc62b021c174","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-14T19:01:17Z","title_canon_sha256":"2dd742607b2dacc295ed0a7339a515d98ef047ec3d3c8effffaa81791f45a554"},"schema_version":"1.0","source":{"id":"1309.3692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3692","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3692v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3692","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"QY2ZWF437TOZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QY2ZWF437TOZKTWC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QY2ZWF43","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:501078bbd65957b4e4eec6eb281c2ba5c78dca0c8f289d90b7e4ee90a4ae2e42","target":"graph","created_at":"2026-05-18T03:13:20Z","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":"This paper considers a widely studied stochastic control problem arising from opportunistic spectrum access (OSA) in a multi-channel system, with the goal of providing a unifying analytical framework whereby a number of prior results may be viewed as special cases. Specifically, we consider a single wireless transceiver/user with access to $N$ channels, each modeled as an iid discrete-time two-state Markov chain. In each time step the user is allowed to sense $k\\leq N$ channels, and subsequently use up to $m\\leq k$ channels out of those sensed to be available. Channel sensing is assumed to be ","authors_text":"Mingyan Liu, Sahand Haji Ali Ahmad, Yang Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-14T19:01:17Z","title":"Sufficient Conditions on the Optimality of Myopic Sensing in Opportunistic Channel Access: A Unifying Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3692","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:c7781fbfeb9e32d7d2a4483734301da75559e28d4906df632b17a313b20a0313","target":"record","created_at":"2026-05-18T03:13:20Z","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":"8fc85855d82e4d8974b5cc2444e589ae0e4a677e737b956ea4aadc62b021c174","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-14T19:01:17Z","title_canon_sha256":"2dd742607b2dacc295ed0a7339a515d98ef047ec3d3c8effffaa81791f45a554"},"schema_version":"1.0","source":{"id":"1309.3692","kind":"arxiv","version":1}},"canonical_sha256":"86359b179bfcdd954ec23d345cfa7d8bd3db04d8f57430f803c72dba14c1fb8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86359b179bfcdd954ec23d345cfa7d8bd3db04d8f57430f803c72dba14c1fb8e","first_computed_at":"2026-05-18T03:13:20.752058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.752058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pz8OeGooaI9PfUXlmtYaSBSqZ/7e9fTFhg+/ix8uchwyrzq7NEMFxhWpaTgPbXk3+BDtHOzCXERvI69WWSVZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.752416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7781fbfeb9e32d7d2a4483734301da75559e28d4906df632b17a313b20a0313","sha256:501078bbd65957b4e4eec6eb281c2ba5c78dca0c8f289d90b7e4ee90a4ae2e42"],"state_sha256":"2175ff9b3eac800ff9e2a43fd40c703ab6536eda348cee67a254b3a52b973d5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/m4vRd+hAVTX3XUWav14uR7VZSR7C5+nVncpE7yZVWT4B0d4emvDQg1XCp2b4JkhuWYlbSLP+qD+k+RbdqgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:29:43.434108Z","bundle_sha256":"08a85ab27bab0b63170a7aa6a6ed68dce8827cc0c6743663c6463879d46b2a26"}}