{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FG4I5CSRNODL65AGLAD6HZ76SM","short_pith_number":"pith:FG4I5CSR","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"},"canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","source":{"kind":"arxiv","id":"2501.00236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00236","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00236v2","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00236","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"FG4I5CSRNODL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FG4I5CSRNODL65AG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FG4I5CSR","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FG4I5CSRNODL65AGLAD6HZ76SM","target":"record","payload":{"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"},"canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","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"},"source_kind":"arxiv","source_id":"2501.00236","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-17T23:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Up3rhqAzzqxofggLvd4sw++w/phCZ6o5NPKLoFR1Gg5GS1rL2ekyccfNQX/LzaN54gpv4cZtgI828OFPyPeoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:58.575580Z"},"content_sha256":"228c325b8da5c825f7e7b8da98d2d51b82c696db18dd8b2e0177d8c0ae5bbf14","schema_version":"1.0","event_id":"sha256:228c325b8da5c825f7e7b8da98d2d51b82c696db18dd8b2e0177d8c0ae5bbf14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FG4I5CSRNODL65AGLAD6HZ76SM","target":"graph","payload":{"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"},"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-17T23:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2185Y3927QKQ1w/+ipM/822kpwYsfNuKqehjVegGYLnYTgwL7dEunBQ0YNbbbLT1z4faka65z4nfpQA/T8iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:58.575980Z"},"content_sha256":"134b02c42d6e6e17f6efc67a4ba67f927cabbeae700a972e74b2ce854b1983d8","schema_version":"1.0","event_id":"sha256:134b02c42d6e6e17f6efc67a4ba67f927cabbeae700a972e74b2ce854b1983d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/bundle.json","state_url":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG4I5CSRNODL65AGLAD6HZ76SM/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-25T23:09:58Z","links":{"resolver":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM","bundle":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/bundle.json","state":"https://pith.science/pith/FG4I5CSRNODL65AGLAD6HZ76SM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG4I5CSRNODL65AGLAD6HZ76SM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FG4I5CSRNODL65AGLAD6HZ76SM","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":"24f03bf252c7ebb15a07a711782b1cdaa4a7513dec9b71e42a6c58b32f63b43c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-31T03:00:47Z","title_canon_sha256":"49ad468e4f716114b35b5efd62de797a42337fda708a3fb62198567dd9e46849"},"schema_version":"1.0","source":{"id":"2501.00236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00236","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00236v2","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00236","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"FG4I5CSRNODL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FG4I5CSRNODL65AG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FG4I5CSR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:134b02c42d6e6e17f6efc67a4ba67f927cabbeae700a972e74b2ce854b1983d8","target":"graph","created_at":"2026-05-17T23:39:01Z","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":"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","authors_text":"Keqin Liu, Qizhen Jia, Yiying Zhang, Zhi Ding","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-31T03:00:47Z","title":"Efficient Algorithm Design of Dynamic Spectrum Access by Whittle Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00236","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:228c325b8da5c825f7e7b8da98d2d51b82c696db18dd8b2e0177d8c0ae5bbf14","target":"record","created_at":"2026-05-17T23:39:01Z","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":"24f03bf252c7ebb15a07a711782b1cdaa4a7513dec9b71e42a6c58b32f63b43c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-31T03:00:47Z","title_canon_sha256":"49ad468e4f716114b35b5efd62de797a42337fda708a3fb62198567dd9e46849"},"schema_version":"1.0","source":{"id":"2501.00236","kind":"arxiv","version":2}},"canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b88e8a516b86bf74065807e3e7fe9314362260b8ec882170bd8f8913ad35f3","first_computed_at":"2026-05-17T23:39:01.597565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:01.597565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKZ0NyY4PKVsdKRU4MFDPAC3IjPxH2s19kjEidp2uTsCHdLoVDLnoMm6/IIDITa34FCDKrd2WXFmpvx9eJCCCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:01.598411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:228c325b8da5c825f7e7b8da98d2d51b82c696db18dd8b2e0177d8c0ae5bbf14","sha256:134b02c42d6e6e17f6efc67a4ba67f927cabbeae700a972e74b2ce854b1983d8"],"state_sha256":"ffedf36450166e15ca30a9c61c6d0a971ef82f922500a04a8f51196165c85cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7w1FTLYl5fHSys4x5j8Wnw7ohfm+Xd6Wp/HoXOVQvAUGKD3gYexubFHej4Dp1EByaxBirnFfx+x07+k50Y0/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:09:58.579357Z","bundle_sha256":"83e97dac63dc0aa56e06f16a06b7af7b6c9975874bc0efcf88730974abd69c46"}}