{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KIWJF7INIKKPNKKLDSIUXAAPPF","short_pith_number":"pith:KIWJF7IN","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"},"canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","source":{"kind":"arxiv","id":"1109.1552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1552","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1552v1","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1552","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"KIWJF7INIKKP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIWJF7INIKKPNKKL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIWJF7IN","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KIWJF7INIKKPNKKLDSIUXAAPPF","target":"record","payload":{"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"},"canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","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"},"source_kind":"arxiv","source_id":"1109.1552","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:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"087M/qrugqENswryi2AJxKKGpXCzKlDvLTlMv2/Evjw+dIf6t2fcJdr+15I6G7HzNcjmB2mrQ8tUKBAo6riZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:33:34.804801Z"},"content_sha256":"7f68a1f0148a096c7580000f5043bf2ba4a36aecf29d57c5507f5113f99d7c4d","schema_version":"1.0","event_id":"sha256:7f68a1f0148a096c7580000f5043bf2ba4a36aecf29d57c5507f5113f99d7c4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KIWJF7INIKKPNKKLDSIUXAAPPF","target":"graph","payload":{"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"},"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:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9J71sDRxQA8GazuhiwUgWpjMYactkFaN24Q9Xz3u1aBiF+XWFiM76FluOvX3d2Y/OcyAOZ0xSmCOLM6tkRTmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:33:34.805376Z"},"content_sha256":"eb0dfc6374b2d98832d228bd4dfcc482996af410c55c4ceab2024ca2d7c78b7a","schema_version":"1.0","event_id":"sha256:eb0dfc6374b2d98832d228bd4dfcc482996af410c55c4ceab2024ca2d7c78b7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/bundle.json","state_url":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/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-06-07T07:33:34Z","links":{"resolver":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF","bundle":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/bundle.json","state":"https://pith.science/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIWJF7INIKKPNKKLDSIUXAAPPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KIWJF7INIKKPNKKLDSIUXAAPPF","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":"62bc60d24c87870d8ba43e1da922eda1de4ce16f918a5972d8ebbc0e7b75fb68","cross_cats_sorted":["cs.NI","cs.SY","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-07T19:54:30Z","title_canon_sha256":"87e98e61937ba74b673ef52334f98388af142df8ba2c108433e3b41615c47096"},"schema_version":"1.0","source":{"id":"1109.1552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1552","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1552v1","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1552","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"KIWJF7INIKKP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIWJF7INIKKPNKKL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIWJF7IN","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:eb0dfc6374b2d98832d228bd4dfcc482996af410c55c4ceab2024ca2d7c78b7a","target":"graph","created_at":"2026-05-18T04:08:44Z","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":"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","authors_text":"Bhaskar Krishnamachari, Wenhan Dai, Yi Gai","cross_cats":["cs.NI","cs.SY","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-07T19:54:30Z","title":"Efficient Online Learning for Opportunistic Spectrum Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1552","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:7f68a1f0148a096c7580000f5043bf2ba4a36aecf29d57c5507f5113f99d7c4d","target":"record","created_at":"2026-05-18T04:08:44Z","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":"62bc60d24c87870d8ba43e1da922eda1de4ce16f918a5972d8ebbc0e7b75fb68","cross_cats_sorted":["cs.NI","cs.SY","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-07T19:54:30Z","title_canon_sha256":"87e98e61937ba74b673ef52334f98388af142df8ba2c108433e3b41615c47096"},"schema_version":"1.0","source":{"id":"1109.1552","kind":"arxiv","version":1}},"canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"522c92fd0d4294f6a94b1c914b800f79571df601d6263caad342df7708936096","first_computed_at":"2026-05-18T04:08:44.388748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:44.388748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pA7ck/3etss2fTaAnBMGKVQ9XWFP/k2u22ZnQ1zkACjN2ruTIle86f29PAGwRIZJyVvr4m3AEnH/tgVTh3wTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:44.389147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f68a1f0148a096c7580000f5043bf2ba4a36aecf29d57c5507f5113f99d7c4d","sha256:eb0dfc6374b2d98832d228bd4dfcc482996af410c55c4ceab2024ca2d7c78b7a"],"state_sha256":"295851b3ac4cfd681c046e2f871c119efe48e2da1c5982aff745b914994645cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D92RRafLAEU7JVOz+Wglrfxz23u00RxQV20EHqT6TykV+/Sh53ZVqY5e8EcDI61kARZUpvcXtLKt4PKeEzsMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:33:34.808267Z","bundle_sha256":"e4f30b3acf0839df752a55959815fbdcf17288d61af0eab120777db21103f974"}}