{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KHBCK2TGIENOHHWIF6N2SEDGW7","short_pith_number":"pith:KHBCK2TG","canonical_record":{"source":{"id":"1402.5666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-23T20:16:41Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"4e8c8dbe078cb931f5c64be858362fd7b8f09cb8cd916d6d3919ca6a9cf25627","abstract_canon_sha256":"f309dc6cabc8788abd7203023891001dc4b8f0308de35e202d787de7e4b4ef72"},"schema_version":"1.0"},"canonical_sha256":"51c2256a66411ae39ec82f9ba91066b7ce6c6dec78de968e25a126960a90cd0c","source":{"kind":"arxiv","id":"1402.5666","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5666","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5666v2","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5666","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"KHBCK2TGIENO","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHBCK2TGIENOHHWI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHBCK2TG","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KHBCK2TGIENOHHWIF6N2SEDGW7","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-23T20:16:41Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"4e8c8dbe078cb931f5c64be858362fd7b8f09cb8cd916d6d3919ca6a9cf25627","abstract_canon_sha256":"f309dc6cabc8788abd7203023891001dc4b8f0308de35e202d787de7e4b4ef72"},"schema_version":"1.0"},"canonical_sha256":"51c2256a66411ae39ec82f9ba91066b7ce6c6dec78de968e25a126960a90cd0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:06.058066Z","signature_b64":"YvqMt+bgDtL+Kzxf30rlQxFfxdGhEk0ENaNb6jhUczDIU42MvtNB6gWv+3nfqN5tSZYP+FmJD+vg5BF0YquMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c2256a66411ae39ec82f9ba91066b7ce6c6dec78de968e25a126960a90cd0c","last_reissued_at":"2026-05-18T02:52:06.057505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:06.057505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5666","source_version":2,"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-18T02:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZBQH0rj0ohHVjyE7u+fhCq8BjBVNZRYLVt6pGD8g0I+OqVFjiO4FeeiuNkH8S9yU3N7YnnbcVtsHGP0gPa4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:03:30.657744Z"},"content_sha256":"faabfad4ff2e837d9ea13a9f9fd55fe16dee5361ad5c75d9fdb565dbd68917fe","schema_version":"1.0","event_id":"sha256:faabfad4ff2e837d9ea13a9f9fd55fe16dee5361ad5c75d9fdb565dbd68917fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KHBCK2TGIENOHHWIF6N2SEDGW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Rate and Channel Selection in Cognitive Radio Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Proutiere, Richard Combes","submitted_at":"2014-02-23T20:16:41Z","abstract_excerpt":"In this paper, we investigate dynamic channel and rate selection in cognitive radio systems which exploit a large number of channels free from primary users. In such systems, transmitters may rapidly change the selected (channel, rate) pair to opportunistically learn and track the pair offering the highest throughput. We formulate the problem of sequential channel and rate selection as an online optimization problem, and show its equivalence to a {\\it structured} Multi-Armed Bandit problem. The structure stems from inherent properties of the achieved throughput as a function of the selected ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5666","kind":"arxiv","version":2},"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-18T02:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MNSZCEGAXCiu6CxdC5Dgtyl1YJiQyImMx98AHFce88Jlu2zZjsj6AMQOu/jLiyDXQ4JrA+/TTHq8xXFKSBgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:03:30.658487Z"},"content_sha256":"cbd01f469da7af7e5cac1c9f421888b0197141ae4e163d0c408c3125decb0a97","schema_version":"1.0","event_id":"sha256:cbd01f469da7af7e5cac1c9f421888b0197141ae4e163d0c408c3125decb0a97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/bundle.json","state_url":"https://pith.science/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/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-26T10:03:30Z","links":{"resolver":"https://pith.science/pith/KHBCK2TGIENOHHWIF6N2SEDGW7","bundle":"https://pith.science/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/bundle.json","state":"https://pith.science/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHBCK2TGIENOHHWIF6N2SEDGW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KHBCK2TGIENOHHWIF6N2SEDGW7","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":"f309dc6cabc8788abd7203023891001dc4b8f0308de35e202d787de7e4b4ef72","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-23T20:16:41Z","title_canon_sha256":"4e8c8dbe078cb931f5c64be858362fd7b8f09cb8cd916d6d3919ca6a9cf25627"},"schema_version":"1.0","source":{"id":"1402.5666","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5666","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5666v2","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5666","created_at":"2026-05-18T02:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"KHBCK2TGIENO","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHBCK2TGIENOHHWI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHBCK2TG","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:cbd01f469da7af7e5cac1c9f421888b0197141ae4e163d0c408c3125decb0a97","target":"graph","created_at":"2026-05-18T02:52:06Z","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":"In this paper, we investigate dynamic channel and rate selection in cognitive radio systems which exploit a large number of channels free from primary users. In such systems, transmitters may rapidly change the selected (channel, rate) pair to opportunistically learn and track the pair offering the highest throughput. We formulate the problem of sequential channel and rate selection as an online optimization problem, and show its equivalence to a {\\it structured} Multi-Armed Bandit problem. The structure stems from inherent properties of the achieved throughput as a function of the selected ch","authors_text":"Alexandre Proutiere, Richard Combes","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-23T20:16:41Z","title":"Dynamic Rate and Channel Selection in Cognitive Radio Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5666","kind":"arxiv","version":2},"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:faabfad4ff2e837d9ea13a9f9fd55fe16dee5361ad5c75d9fdb565dbd68917fe","target":"record","created_at":"2026-05-18T02:52:06Z","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":"f309dc6cabc8788abd7203023891001dc4b8f0308de35e202d787de7e4b4ef72","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-23T20:16:41Z","title_canon_sha256":"4e8c8dbe078cb931f5c64be858362fd7b8f09cb8cd916d6d3919ca6a9cf25627"},"schema_version":"1.0","source":{"id":"1402.5666","kind":"arxiv","version":2}},"canonical_sha256":"51c2256a66411ae39ec82f9ba91066b7ce6c6dec78de968e25a126960a90cd0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51c2256a66411ae39ec82f9ba91066b7ce6c6dec78de968e25a126960a90cd0c","first_computed_at":"2026-05-18T02:52:06.057505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:06.057505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YvqMt+bgDtL+Kzxf30rlQxFfxdGhEk0ENaNb6jhUczDIU42MvtNB6gWv+3nfqN5tSZYP+FmJD+vg5BF0YquMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:06.058066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5666","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faabfad4ff2e837d9ea13a9f9fd55fe16dee5361ad5c75d9fdb565dbd68917fe","sha256:cbd01f469da7af7e5cac1c9f421888b0197141ae4e163d0c408c3125decb0a97"],"state_sha256":"f7be0f5f5216e1802e92b9dc61383823e93b6f155d91a3fc44e946963f4ba4e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSEcXrFX7lSj2mv3hmxufd7ltcR5T+aLYPok2c61f96LBJvSUdGFZB8d4nEbwxu9FO+rxH8PRDhMoLT8RmjZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:03:30.662949Z","bundle_sha256":"bf160d89bd805b01d0ee5a56cabcc7d9745891b32de0d839616a4bada1ef3b7e"}}