{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LGDUTRGDNZID23VHZUA35P642O","short_pith_number":"pith:LGDUTRGD","schema_version":"1.0","canonical_sha256":"598749c4c36e503d6ea7cd01bebfdcd3a500b0520f052786b432d36218b9edb9","source":{"kind":"arxiv","id":"1706.04546","version":2},"attestation_state":"computed","paper":{"title":"Reinforcement Learning with Budget-Constrained Nonparametric Function Approximation for Opportunistic Spectrum Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"David Romero, Theodoros Tsiligkaridis","submitted_at":"2017-06-14T15:44:52Z","abstract_excerpt":"Opportunistic spectrum access is one of the emerging techniques for maximizing throughput in congested bands and is enabled by predicting idle slots in spectrum. We propose a kernel-based reinforcement learning approach coupled with a novel budget-constrained sparsification technique that efficiently captures the environment to find the best channel access actions. This approach allows learning and planning over the intrinsic state-action space and extends well to large state spaces. We apply our methods to evaluate coexistence of a reinforcement learning-based radio with a multi-channel adver"},"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":"1706.04546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T15:44:52Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"1e84bd1d0f9a91be0438b75b6a761b912c6439afc6eddbfb1cab7bd4f1f1de12","abstract_canon_sha256":"f6e62f17f6315036879a451ba6c1a6efe4ff8b7151049fedded7a077d243b584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:44.006221Z","signature_b64":"aqiskCOaNRWwjBh3BoJOdE+JQJm7cN++UEOGCZGrQ0qEvmR3P5a0rwhfF/bKGH5Bsrc71cFVuRJGfVPkRc0HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598749c4c36e503d6ea7cd01bebfdcd3a500b0520f052786b432d36218b9edb9","last_reissued_at":"2026-05-18T00:12:44.005595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:44.005595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning with Budget-Constrained Nonparametric Function Approximation for Opportunistic Spectrum Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"David Romero, Theodoros Tsiligkaridis","submitted_at":"2017-06-14T15:44:52Z","abstract_excerpt":"Opportunistic spectrum access is one of the emerging techniques for maximizing throughput in congested bands and is enabled by predicting idle slots in spectrum. We propose a kernel-based reinforcement learning approach coupled with a novel budget-constrained sparsification technique that efficiently captures the environment to find the best channel access actions. This approach allows learning and planning over the intrinsic state-action space and extends well to large state spaces. We apply our methods to evaluate coexistence of a reinforcement learning-based radio with a multi-channel adver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04546","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.04546","created_at":"2026-05-18T00:12:44.005678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04546v2","created_at":"2026-05-18T00:12:44.005678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04546","created_at":"2026-05-18T00:12:44.005678+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGDUTRGDNZID","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGDUTRGDNZID23VH","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGDUTRGD","created_at":"2026-05-18T12:31:28.150371+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/LGDUTRGDNZID23VHZUA35P642O","json":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O.json","graph_json":"https://pith.science/api/pith-number/LGDUTRGDNZID23VHZUA35P642O/graph.json","events_json":"https://pith.science/api/pith-number/LGDUTRGDNZID23VHZUA35P642O/events.json","paper":"https://pith.science/paper/LGDUTRGD"},"agent_actions":{"view_html":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O","download_json":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O.json","view_paper":"https://pith.science/paper/LGDUTRGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04546&json=true","fetch_graph":"https://pith.science/api/pith-number/LGDUTRGDNZID23VHZUA35P642O/graph.json","fetch_events":"https://pith.science/api/pith-number/LGDUTRGDNZID23VHZUA35P642O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O/action/storage_attestation","attest_author":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O/action/author_attestation","sign_citation":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O/action/citation_signature","submit_replication":"https://pith.science/pith/LGDUTRGDNZID23VHZUA35P642O/action/replication_record"}},"created_at":"2026-05-18T00:12:44.005678+00:00","updated_at":"2026-05-18T00:12:44.005678+00:00"}