{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FG4I5CSRNODL65AGLAD6HZ76SM","short_pith_number":"pith:FG4I5CSR","schema_version":"1.0","canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","source":{"kind":"arxiv","id":"2501.00236","version":2},"attestation_state":"computed","paper":{"title":"Efficient Algorithm Design of Dynamic Spectrum Access by Whittle Index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Keqin Liu, Qizhen Jia, Yiying Zhang, Zhi Ding","submitted_at":"2024-12-31T03:00:47Z","abstract_excerpt":"Dynamic spectrum access problem is an important problem that allows a wireless sub-network to use channels temporarily unoccupied by the parent network for minimizing the spectrum waste. Previous work has shown that the sequential channel allocation problem for the sub-network can be formulated within the restless multi-armed bandits (RMAB) framework. The objective is to maximize the expected long-term return over an infinite horizon while minimizing interference to the parent network. Different from the previous work that exploits a binary feedback (e.g., ACK/NAK) to compensate for sensing er"},"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":"2501.00236","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-31T03:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"49ad468e4f716114b35b5efd62de797a42337fda708a3fb62198567dd9e46849","abstract_canon_sha256":"24f03bf252c7ebb15a07a711782b1cdaa4a7513dec9b71e42a6c58b32f63b43c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.598411Z","signature_b64":"zKZ0NyY4PKVsdKRU4MFDPAC3IjPxH2s19kjEidp2uTsCHdLoVDLnoMm6/IIDITa34FCDKrd2WXFmpvx9eJCCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","last_reissued_at":"2026-05-17T23:39:01.597565Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.597565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithm Design of Dynamic Spectrum Access by Whittle Index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Keqin Liu, Qizhen Jia, Yiying Zhang, Zhi Ding","submitted_at":"2024-12-31T03:00:47Z","abstract_excerpt":"Dynamic spectrum access problem is an important problem that allows a wireless sub-network to use channels temporarily unoccupied by the parent network for minimizing the spectrum waste. Previous work has shown that the sequential channel allocation problem for the sub-network can be formulated within the restless multi-armed bandits (RMAB) framework. The objective is to maximize the expected long-term return over an infinite horizon while minimizing interference to the parent network. Different from the previous work that exploits a binary feedback (e.g., ACK/NAK) to compensate for sensing er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00236","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":"2501.00236","created_at":"2026-05-17T23:39:01.597708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00236v2","created_at":"2026-05-17T23:39:01.597708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00236","created_at":"2026-05-17T23:39:01.597708+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG4I5CSRNODL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG4I5CSRNODL65AG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG4I5CSR","created_at":"2026-05-18T12:33:37.589309+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/FG4I5CSRNODL65AGLAD6HZ76SM","json":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM.json","graph_json":"https://pith.science/api/pith-number/FG4I5CSRNODL65AGLAD6HZ76SM/graph.json","events_json":"https://pith.science/api/pith-number/FG4I5CSRNODL65AGLAD6HZ76SM/events.json","paper":"https://pith.science/paper/FG4I5CSR"},"agent_actions":{"view_html":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM","download_json":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM.json","view_paper":"https://pith.science/paper/FG4I5CSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00236&json=true","fetch_graph":"https://pith.science/api/pith-number/FG4I5CSRNODL65AGLAD6HZ76SM/graph.json","fetch_events":"https://pith.science/api/pith-number/FG4I5CSRNODL65AGLAD6HZ76SM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/action/storage_attestation","attest_author":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/action/author_attestation","sign_citation":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/action/citation_signature","submit_replication":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/action/replication_record"}},"created_at":"2026-05-17T23:39:01.597708+00:00","updated_at":"2026-05-17T23:39:01.597708+00:00"}