{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HJDBHRJJLEICFZR2NWFX6NFBQW","short_pith_number":"pith:HJDBHRJJ","schema_version":"1.0","canonical_sha256":"3a4613c529591022e63a6d8b7f34a1859229dcfa55bd96a0f6250ecbb060bdf6","source":{"kind":"arxiv","id":"1906.00548","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00548","created_at":"2026-05-17T23:44:24.598565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00548v1","created_at":"2026-05-17T23:44:24.598565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00548","created_at":"2026-05-17T23:44:24.598565+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJDBHRJJLEIC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJDBHRJJLEICFZR2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJDBHRJJ","created_at":"2026-05-18T12:33:18.533446+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/HJDBHRJJLEICFZR2NWFX6NFBQW","json":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW.json","graph_json":"https://pith.science/api/pith-number/HJDBHRJJLEICFZR2NWFX6NFBQW/graph.json","events_json":"https://pith.science/api/pith-number/HJDBHRJJLEICFZR2NWFX6NFBQW/events.json","paper":"https://pith.science/paper/HJDBHRJJ"},"agent_actions":{"view_html":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW","download_json":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW.json","view_paper":"https://pith.science/paper/HJDBHRJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00548&json=true","fetch_graph":"https://pith.science/api/pith-number/HJDBHRJJLEICFZR2NWFX6NFBQW/graph.json","fetch_events":"https://pith.science/api/pith-number/HJDBHRJJLEICFZR2NWFX6NFBQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/action/storage_attestation","attest_author":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/action/author_attestation","sign_citation":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/action/citation_signature","submit_replication":"https://pith.science/pith/HJDBHRJJLEICFZR2NWFX6NFBQW/action/replication_record"}},"created_at":"2026-05-17T23:44:24.598565+00:00","updated_at":"2026-05-17T23:44:24.598565+00:00"}