{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TN6XJS5SDUNBBPBSXXHECQKMPN","short_pith_number":"pith:TN6XJS5S","canonical_record":{"source":{"id":"1010.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-01T03:23:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5cbc4129c3c5117c94fa24d95c0c798a1244dcc3cae189f2f77e25117b247d7","abstract_canon_sha256":"ef89fc866e983affac95b43eaf5d682d3418efc6e4b18d5eeb8a34562fa7e603"},"schema_version":"1.0"},"canonical_sha256":"9b7d74cbb21d1a10bc32bdce41414c7b48da4b1cee68b73e9fe9cac6a453a83b","source":{"kind":"arxiv","id":"1010.0056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0056","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0056v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0056","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"TN6XJS5SDUNB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TN6XJS5SDUNBBPBS","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TN6XJS5S","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TN6XJS5SDUNBBPBSXXHECQKMPN","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-01T03:23:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5cbc4129c3c5117c94fa24d95c0c798a1244dcc3cae189f2f77e25117b247d7","abstract_canon_sha256":"ef89fc866e983affac95b43eaf5d682d3418efc6e4b18d5eeb8a34562fa7e603"},"schema_version":"1.0"},"canonical_sha256":"9b7d74cbb21d1a10bc32bdce41414c7b48da4b1cee68b73e9fe9cac6a453a83b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.326554Z","signature_b64":"fDCy27y2AhJ7YncBL+6zICqVZWkfUoxRrsJ2wmXyrvt0aPDspv7S1FbMZ4FBWOvET70UYJUDhDKwhONOS9nlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7d74cbb21d1a10bc32bdce41414c7b48da4b1cee68b73e9fe9cac6a453a83b","last_reissued_at":"2026-05-18T04:40:00.326081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.326081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0056","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:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Is9ZHOhN9CF0E4I2Rq68kUJGD+6ffvjFlRYMFXlvOZhPrfDnqQS2vnFuTiNPGrYafC02l9FA4HDVWl3hp3IVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:26:38.096022Z"},"content_sha256":"c32eac731e97091e21dd3f566cf8c18b8f2e15cdd9d65dabb52410348b9ec0d1","schema_version":"1.0","event_id":"sha256:c32eac731e97091e21dd3f566cf8c18b8f2e15cdd9d65dabb52410348b9ec0d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TN6XJS5SDUNBBPBSXXHECQKMPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Cem Tekin, Mingyan Liu","submitted_at":"2010-10-01T03:23:17Z","abstract_excerpt":"We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activities) is modeled as an arbitrary finite-state Markov chain. At each instance of time, a (secondary) user probes a channel and collects a certain reward as a function of the state of the channel (e.g., good channel condition results in higher data rate for the user). Each channel has potentially different state space and statistics, both unknown to the user, who tries to learn which one is the best as it goes and maximize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0056","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:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJ0KE/x2gFTwN4w4LAJ4WYx3OStvO/UJyb8s/NtI/C1Kvn68Ao+NjTrgnVmtfCYqaK5X98jEpDlzVO+11ZN8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:26:38.096534Z"},"content_sha256":"391b4a8efa905fc5ff302d06d4aa60dbde088fbea1bce029c813d58ab58e03a1","schema_version":"1.0","event_id":"sha256:391b4a8efa905fc5ff302d06d4aa60dbde088fbea1bce029c813d58ab58e03a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/bundle.json","state_url":"https://pith.science/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/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-29T17:26:38Z","links":{"resolver":"https://pith.science/pith/TN6XJS5SDUNBBPBSXXHECQKMPN","bundle":"https://pith.science/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/bundle.json","state":"https://pith.science/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TN6XJS5SDUNBBPBSXXHECQKMPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TN6XJS5SDUNBBPBSXXHECQKMPN","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":"ef89fc866e983affac95b43eaf5d682d3418efc6e4b18d5eeb8a34562fa7e603","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-01T03:23:17Z","title_canon_sha256":"e5cbc4129c3c5117c94fa24d95c0c798a1244dcc3cae189f2f77e25117b247d7"},"schema_version":"1.0","source":{"id":"1010.0056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0056","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0056v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0056","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"TN6XJS5SDUNB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TN6XJS5SDUNBBPBS","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TN6XJS5S","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:391b4a8efa905fc5ff302d06d4aa60dbde088fbea1bce029c813d58ab58e03a1","target":"graph","created_at":"2026-05-18T04:40:00Z","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 an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activities) is modeled as an arbitrary finite-state Markov chain. At each instance of time, a (secondary) user probes a channel and collects a certain reward as a function of the state of the channel (e.g., good channel condition results in higher data rate for the user). Each channel has potentially different state space and statistics, both unknown to the user, who tries to learn which one is the best as it goes and maximize","authors_text":"Cem Tekin, Mingyan Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-01T03:23:17Z","title":"Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0056","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:c32eac731e97091e21dd3f566cf8c18b8f2e15cdd9d65dabb52410348b9ec0d1","target":"record","created_at":"2026-05-18T04:40:00Z","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":"ef89fc866e983affac95b43eaf5d682d3418efc6e4b18d5eeb8a34562fa7e603","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-01T03:23:17Z","title_canon_sha256":"e5cbc4129c3c5117c94fa24d95c0c798a1244dcc3cae189f2f77e25117b247d7"},"schema_version":"1.0","source":{"id":"1010.0056","kind":"arxiv","version":1}},"canonical_sha256":"9b7d74cbb21d1a10bc32bdce41414c7b48da4b1cee68b73e9fe9cac6a453a83b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b7d74cbb21d1a10bc32bdce41414c7b48da4b1cee68b73e9fe9cac6a453a83b","first_computed_at":"2026-05-18T04:40:00.326081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:00.326081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fDCy27y2AhJ7YncBL+6zICqVZWkfUoxRrsJ2wmXyrvt0aPDspv7S1FbMZ4FBWOvET70UYJUDhDKwhONOS9nlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:00.326554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c32eac731e97091e21dd3f566cf8c18b8f2e15cdd9d65dabb52410348b9ec0d1","sha256:391b4a8efa905fc5ff302d06d4aa60dbde088fbea1bce029c813d58ab58e03a1"],"state_sha256":"f947537b44c1e2afb7b0eb10ca5762496db1e76323f91e8fd7b1de3cda1b7a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdXQhcu/MIL+NLsc8dXyIwDjMHQel9WPH72pBhpE0QgNjU8rM1G5x70f2WFe9FBGFtsjQFSNRD6RgUspdFOyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:26:38.099012Z","bundle_sha256":"9c413b755e21441f43ea72fedb0466f28610c18f87086d6c1a27adbbd0ef36e1"}}