{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HJDBHRJJLEICFZR2NWFX6NFBQW","short_pith_number":"pith:HJDBHRJJ","canonical_record":{"source":{"id":"1906.00548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T03:41:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ccf64fb6cb771bacfc35845b7c60aa777fb569eedbcae0033f17b01c4890890","abstract_canon_sha256":"ba88d1f73229c7e17417e36ed034a8afd2d1d7d90cb6b34d485987708e70fcf1"},"schema_version":"1.0"},"canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","source":{"kind":"arxiv","id":"1906.00548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00548","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00548v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00548","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"HJDBHRJJLEIC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJDBHRJJLEICFZR2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJDBHRJJ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HJDBHRJJLEICFZR2NWFX6NFBQW","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T03:41:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ccf64fb6cb771bacfc35845b7c60aa777fb569eedbcae0033f17b01c4890890","abstract_canon_sha256":"ba88d1f73229c7e17417e36ed034a8afd2d1d7d90cb6b34d485987708e70fcf1"},"schema_version":"1.0"},"canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:24.598928Z","signature_b64":"66pgfEccUxlTzTAMdk2b5D28FPYnB9TeWoIxcDlebMN+4FECtAkUMgHXDn9zgyWUD0Siz7vQASt5jjFmyPPaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","last_reissued_at":"2026-05-17T23:44:24.598492Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:24.598492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00548","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-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iVgiRq8Y04S97BMZSnDYwPZ0rtLP+bAO0pKQBkvqGeaVNnN1RyDhEBiKWe0h8q3d6YnImbgWZhVq8kGyETSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:29:18.774269Z"},"content_sha256":"94cb999a0c16ff486e028dead34ab8a8783fb13f9aaf5c40baab196637b3fce0","schema_version":"1.0","event_id":"sha256:94cb999a0c16ff486e028dead34ab8a8783fb13f9aaf5c40baab196637b3fce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HJDBHRJJLEICFZR2NWFX6NFBQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harvest-or-Transmit Policy for Cognitive Radio Networks: A Learning Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adrish Banerjee, Kalpant Pathak","submitted_at":"2019-06-03T03:41:21Z","abstract_excerpt":"We consider an underlay cognitive radio network where the secondary user (SU) harvests energy from the environment. We consider a slotted-mode of operation where each slot of SU is used for either energy harvesting or data transmission. Considering block fading with memory, we model the energy arrival and fading processes as a stationary Markov process of first order. We propose a harvest-or-transmit policy for the SU along with optimal transmit powers that maximize its expected throughput under three different settings. First, we consider a learning-theoretic approach where we do not assume a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00548","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-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mnARyaKNKCh+NtLeBHubEYTgQORNUG8jSmEuO7Uny43D13YyQ2FTkUCLUnbNtAC81VCpy2MG19qwZdoGVTiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:29:18.774625Z"},"content_sha256":"55407e0eff0df3d8898a050eda1aaefc44fedc49e1c25acb163d2299190e3379","schema_version":"1.0","event_id":"sha256:55407e0eff0df3d8898a050eda1aaefc44fedc49e1c25acb163d2299190e3379"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/bundle.json","state_url":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/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-03T01:29:18Z","links":{"resolver":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW","bundle":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/bundle.json","state":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HJDBHRJJLEICFZR2NWFX6NFBQW","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":"ba88d1f73229c7e17417e36ed034a8afd2d1d7d90cb6b34d485987708e70fcf1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T03:41:21Z","title_canon_sha256":"3ccf64fb6cb771bacfc35845b7c60aa777fb569eedbcae0033f17b01c4890890"},"schema_version":"1.0","source":{"id":"1906.00548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00548","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00548v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00548","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"HJDBHRJJLEIC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJDBHRJJLEICFZR2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJDBHRJJ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:55407e0eff0df3d8898a050eda1aaefc44fedc49e1c25acb163d2299190e3379","target":"graph","created_at":"2026-05-17T23:44:24Z","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":"We consider an underlay cognitive radio network where the secondary user (SU) harvests energy from the environment. We consider a slotted-mode of operation where each slot of SU is used for either energy harvesting or data transmission. Considering block fading with memory, we model the energy arrival and fading processes as a stationary Markov process of first order. We propose a harvest-or-transmit policy for the SU along with optimal transmit powers that maximize its expected throughput under three different settings. First, we consider a learning-theoretic approach where we do not assume a","authors_text":"Adrish Banerjee, Kalpant Pathak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T03:41:21Z","title":"Harvest-or-Transmit Policy for Cognitive Radio Networks: A Learning Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00548","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:94cb999a0c16ff486e028dead34ab8a8783fb13f9aaf5c40baab196637b3fce0","target":"record","created_at":"2026-05-17T23:44:24Z","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":"ba88d1f73229c7e17417e36ed034a8afd2d1d7d90cb6b34d485987708e70fcf1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T03:41:21Z","title_canon_sha256":"3ccf64fb6cb771bacfc35845b7c60aa777fb569eedbcae0033f17b01c4890890"},"schema_version":"1.0","source":{"id":"1906.00548","kind":"arxiv","version":1}},"canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","first_computed_at":"2026-05-17T23:44:24.598492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:24.598492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"66pgfEccUxlTzTAMdk2b5D28FPYnB9TeWoIxcDlebMN+4FECtAkUMgHXDn9zgyWUD0Siz7vQASt5jjFmyPPaDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:24.598928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94cb999a0c16ff486e028dead34ab8a8783fb13f9aaf5c40baab196637b3fce0","sha256:55407e0eff0df3d8898a050eda1aaefc44fedc49e1c25acb163d2299190e3379"],"state_sha256":"09170d92c3ae197e1dbc1ba58a0c18fab984424bb75bb9f90d39eceac2c70f43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1/YfPzoZSsmx+arT+d8RMxAHx5nuae0UYBMs++uBdnvn6QvMXrnAlwEwT/QXcTLnVo+7Zs2LGVqRGRtxlj2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:29:18.776623Z","bundle_sha256":"7d637db0866ad8eec58f34529b313e85eedfa04068a108cfb36c22fa97bde475"}}