{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KIWJF7INIKKPNKKLDSIUXAAPPF","short_pith_number":"pith:KIWJF7IN","schema_version":"1.0","canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","source":{"kind":"arxiv","id":"1109.1552","version":1},"attestation_state":"computed","paper":{"title":"Efficient Online Learning for Opportunistic Spectrum Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.OC","math.PR"],"primary_cat":"cs.LG","authors_text":"Bhaskar Krishnamachari, Wenhan Dai, Yi Gai","submitted_at":"2011-09-07T19:54:30Z","abstract_excerpt":"The problem of opportunistic spectrum access in cognitive radio networks has been recently formulated as a non-Bayesian restless multi-armed bandit problem. In this problem, there are N arms (corresponding to channels) and one player (corresponding to a secondary user). The state of each arm evolves as a finite-state Markov chain with unknown parameters. At each time slot, the player can select K < N arms to play and receives state-dependent rewards (corresponding to the throughput obtained given the activity of primary users). The objective is to maximize the expected total rewards (i.e., tot"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1109.1552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-07T19:54:30Z","cross_cats_sorted":["cs.NI","cs.SY","math.OC","math.PR"],"title_canon_sha256":"87e98e61937ba74b673ef52334f98388af142df8ba2c108433e3b41615c47096","abstract_canon_sha256":"62bc60d24c87870d8ba43e1da922eda1de4ce16f918a5972d8ebbc0e7b75fb68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:44.389147Z","signature_b64":"pA7ck/3etss2fTaAnBMGKVQ9XWFP/k2u22ZnQ1zkACjN2ruTIle86f29PAGwRIZJyVvr4m3AEnH/tgVTh3wTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","last_reissued_at":"2026-05-18T04:08:44.388748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:44.388748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Online Learning for Opportunistic Spectrum Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.OC","math.PR"],"primary_cat":"cs.LG","authors_text":"Bhaskar Krishnamachari, Wenhan Dai, Yi Gai","submitted_at":"2011-09-07T19:54:30Z","abstract_excerpt":"The problem of opportunistic spectrum access in cognitive radio networks has been recently formulated as a non-Bayesian restless multi-armed bandit problem. In this problem, there are N arms (corresponding to channels) and one player (corresponding to a secondary user). The state of each arm evolves as a finite-state Markov chain with unknown parameters. At each time slot, the player can select K < N arms to play and receives state-dependent rewards (corresponding to the throughput obtained given the activity of primary users). The objective is to maximize the expected total rewards (i.e., tot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1552","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.1552","created_at":"2026-05-18T04:08:44.388808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1552v1","created_at":"2026-05-18T04:08:44.388808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1552","created_at":"2026-05-18T04:08:44.388808+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIWJF7INIKKP","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIWJF7INIKKPNKKL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIWJF7IN","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF","json":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF.json","graph_json":"https://pith.science/api/pith-number/KIWJF7INIKKPNKKLDSIUXAAPPF/graph.json","events_json":"https://pith.science/api/pith-number/KIWJF7INIKKPNKKLDSIUXAAPPF/events.json","paper":"https://pith.science/paper/KIWJF7IN"},"agent_actions":{"view_html":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF","download_json":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF.json","view_paper":"https://pith.science/paper/KIWJF7IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1552&json=true","fetch_graph":"https://pith.science/api/pith-number/KIWJF7INIKKPNKKLDSIUXAAPPF/graph.json","fetch_events":"https://pith.science/api/pith-number/KIWJF7INIKKPNKKLDSIUXAAPPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/action/storage_attestation","attest_author":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/action/author_attestation","sign_citation":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/action/citation_signature","submit_replication":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/action/replication_record"}},"created_at":"2026-05-18T04:08:44.388808+00:00","updated_at":"2026-05-18T04:08:44.388808+00:00"}