{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:VSARFDKMVW4ZGTJUERD44NMWAT","short_pith_number":"pith:VSARFDKM","canonical_record":{"source":{"id":"0801.3289","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2008-01-21T22:45:28Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a0c0b6d55587be064dd059ef23414f45bd2d564d28441702f441a0abbcfefce2","abstract_canon_sha256":"6b6a6485e5868ac13ecdd9b065f9ac0a2aa94811a0f04d71fae065ea844b9442"},"schema_version":"1.0"},"canonical_sha256":"ac81128d4cadb9934d342447ce359604e5e7245b9892a1d83a5c7dd87746b3e3","source":{"kind":"arxiv","id":"0801.3289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.3289","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0801.3289v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3289","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"VSARFDKMVW4Z","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"VSARFDKMVW4ZGTJU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"VSARFDKM","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:VSARFDKMVW4ZGTJUERD44NMWAT","target":"record","payload":{"canonical_record":{"source":{"id":"0801.3289","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2008-01-21T22:45:28Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a0c0b6d55587be064dd059ef23414f45bd2d564d28441702f441a0abbcfefce2","abstract_canon_sha256":"6b6a6485e5868ac13ecdd9b065f9ac0a2aa94811a0f04d71fae065ea844b9442"},"schema_version":"1.0"},"canonical_sha256":"ac81128d4cadb9934d342447ce359604e5e7245b9892a1d83a5c7dd87746b3e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.699802Z","signature_b64":"xpkqKJTatrZuPZpL6ilWACODb1P0wmcLqIFL2UtiZyIAMxaRnyEv5hV7LWT/kzXF81mkqEQ/ybXOggvyBhk3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac81128d4cadb9934d342447ce359604e5e7245b9892a1d83a5c7dd87746b3e3","last_reissued_at":"2026-05-18T00:58:48.699199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.699199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.3289","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmuQnxFgVcwT/HWg16Q3ON5Xdf6V0qdp1cjLvRuIrKAMqiGTN/Lxfk3MiD9Z8EmrraWQkbXjOCAn4xbiFMUeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:53:30.391260Z"},"content_sha256":"17a7105c4b27406e54b58bde78fc8e28ac62c90a42471011dd6fa61c607fc119","schema_version":"1.0","event_id":"sha256:17a7105c4b27406e54b58bde78fc8e28ac62c90a42471011dd6fa61c607fc119"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:VSARFDKMVW4ZGTJUERD44NMWAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Medium Access Control in Cognitive Radios: A Sequential Design Approach","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Hai Jiang, Hesham El Gamal, H. Vincent Poor, Lifeng Lai","submitted_at":"2008-01-21T22:45:28Z","abstract_excerpt":"The design of medium access control protocols for a cognitive user wishing to opportunistically exploit frequency bands within parts of the radio spectrum having multiple bands is considered. In the scenario under consideration, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring the availability of channels and exploiting the opportunities identified thus far. Using a sequential design approach, an optimal medium access strategy is derived. To avoid the prohibitive computationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3289","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YW0wwr4p+ANpplwKnar2hFHJFyr7uMLqodTkI8kQYvXrARFD9safZNh3lNvOXthb/zsR7xK919i/DR3ticjRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:53:30.391621Z"},"content_sha256":"da0ada7e1b57a3a996e94b8cd40fc731ecfa2d951df2fa9fb3faff4a3c906913","schema_version":"1.0","event_id":"sha256:da0ada7e1b57a3a996e94b8cd40fc731ecfa2d951df2fa9fb3faff4a3c906913"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSARFDKMVW4ZGTJUERD44NMWAT/bundle.json","state_url":"https://pith.science/pith/VSARFDKMVW4ZGTJUERD44NMWAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSARFDKMVW4ZGTJUERD44NMWAT/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:53:30Z","links":{"resolver":"https://pith.science/pith/VSARFDKMVW4ZGTJUERD44NMWAT","bundle":"https://pith.science/pith/VSARFDKMVW4ZGTJUERD44NMWAT/bundle.json","state":"https://pith.science/pith/VSARFDKMVW4ZGTJUERD44NMWAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSARFDKMVW4ZGTJUERD44NMWAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:VSARFDKMVW4ZGTJUERD44NMWAT","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":"6b6a6485e5868ac13ecdd9b065f9ac0a2aa94811a0f04d71fae065ea844b9442","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2008-01-21T22:45:28Z","title_canon_sha256":"a0c0b6d55587be064dd059ef23414f45bd2d564d28441702f441a0abbcfefce2"},"schema_version":"1.0","source":{"id":"0801.3289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.3289","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0801.3289v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3289","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"VSARFDKMVW4Z","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"VSARFDKMVW4ZGTJU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"VSARFDKM","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:da0ada7e1b57a3a996e94b8cd40fc731ecfa2d951df2fa9fb3faff4a3c906913","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"The design of medium access control protocols for a cognitive user wishing to opportunistically exploit frequency bands within parts of the radio spectrum having multiple bands is considered. In the scenario under consideration, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring the availability of channels and exploiting the opportunities identified thus far. Using a sequential design approach, an optimal medium access strategy is derived. To avoid the prohibitive computationa","authors_text":"Hai Jiang, Hesham El Gamal, H. Vincent Poor, Lifeng Lai","cross_cats":["cs.NI","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2008-01-21T22:45:28Z","title":"Optimal Medium Access Control in Cognitive Radios: A Sequential Design Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3289","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:17a7105c4b27406e54b58bde78fc8e28ac62c90a42471011dd6fa61c607fc119","target":"record","created_at":"2026-05-18T00:58:48Z","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":"6b6a6485e5868ac13ecdd9b065f9ac0a2aa94811a0f04d71fae065ea844b9442","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2008-01-21T22:45:28Z","title_canon_sha256":"a0c0b6d55587be064dd059ef23414f45bd2d564d28441702f441a0abbcfefce2"},"schema_version":"1.0","source":{"id":"0801.3289","kind":"arxiv","version":1}},"canonical_sha256":"ac81128d4cadb9934d342447ce359604e5e7245b9892a1d83a5c7dd87746b3e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac81128d4cadb9934d342447ce359604e5e7245b9892a1d83a5c7dd87746b3e3","first_computed_at":"2026-05-18T00:58:48.699199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.699199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xpkqKJTatrZuPZpL6ilWACODb1P0wmcLqIFL2UtiZyIAMxaRnyEv5hV7LWT/kzXF81mkqEQ/ybXOggvyBhk3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.699802Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.3289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a7105c4b27406e54b58bde78fc8e28ac62c90a42471011dd6fa61c607fc119","sha256:da0ada7e1b57a3a996e94b8cd40fc731ecfa2d951df2fa9fb3faff4a3c906913"],"state_sha256":"33ca0ec6531200dc5c7a081d0efd3beed0032d5966a20ff057dc382a6080e6de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyyksWn8xZN0BMayhaw27MQY/E4EjDSe2q8g5Ij3pidHV6QHjlM8WnegKXUoKCJaf/MYCAPeIxbGULBI9rkmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:53:30.393552Z","bundle_sha256":"2a96d74a54855de68e26bccd11e8fb11f22e99308aeecb4f5ad3873f115c4d77"}}