{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:37MQX7I6LCCKQIOQMQ5YM3YIUI","short_pith_number":"pith:37MQX7I6","schema_version":"1.0","canonical_sha256":"dfd90bfd1e5884a821d0643b866f08a22d378e94cc91f31bc772524bc0c94ca3","source":{"kind":"arxiv","id":"1111.3041","version":1},"attestation_state":"computed","paper":{"title":"Maximizing System Throughput by Cooperative Sensing in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eylem Ekici, Ness Shroff, Shuang Li, Zizhan Zheng","submitted_at":"2011-11-13T18:05:42Z","abstract_excerpt":"Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the main challenges in CRNs is the ability to detect PU transmissions. Recent works have suggested the use of secondary user (SU) cooperation over individual sensing to improve sensing accuracy. In this paper, we consider a CRN consisting of a single PU and multiple SUs to study the problem of maximizing the total expected system throughput. We propose a Bayesian decision rule based algorithm to solve the problem optimally "},"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":"1111.3041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-13T18:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"ccfe169dfb723274209bf5cf490a2791e642ab80be966f30725b876a24135c4a","abstract_canon_sha256":"1361c1fa8bc2bca83e414c38bf75d4378b8165640271d74755cc0e26ab97043f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:23.144079Z","signature_b64":"LXsbTv9X6uRiJdvSYrfG7TGJ6pCFhb/o/qAW69ZLkdlnqtTlfly7QRJ3HEC5l2EhXNfFVuNMubWyRD4AcOL3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd90bfd1e5884a821d0643b866f08a22d378e94cc91f31bc772524bc0c94ca3","last_reissued_at":"2026-05-18T04:08:23.143478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:23.143478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing System Throughput by Cooperative Sensing in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eylem Ekici, Ness Shroff, Shuang Li, Zizhan Zheng","submitted_at":"2011-11-13T18:05:42Z","abstract_excerpt":"Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the main challenges in CRNs is the ability to detect PU transmissions. Recent works have suggested the use of secondary user (SU) cooperation over individual sensing to improve sensing accuracy. In this paper, we consider a CRN consisting of a single PU and multiple SUs to study the problem of maximizing the total expected system throughput. We propose a Bayesian decision rule based algorithm to solve the problem optimally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3041","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":"1111.3041","created_at":"2026-05-18T04:08:23.143560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3041v1","created_at":"2026-05-18T04:08:23.143560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3041","created_at":"2026-05-18T04:08:23.143560+00:00"},{"alias_kind":"pith_short_12","alias_value":"37MQX7I6LCCK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"37MQX7I6LCCKQIOQ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"37MQX7I6","created_at":"2026-05-18T12:26:18.847500+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/37MQX7I6LCCKQIOQMQ5YM3YIUI","json":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI.json","graph_json":"https://pith.science/api/pith-number/37MQX7I6LCCKQIOQMQ5YM3YIUI/graph.json","events_json":"https://pith.science/api/pith-number/37MQX7I6LCCKQIOQMQ5YM3YIUI/events.json","paper":"https://pith.science/paper/37MQX7I6"},"agent_actions":{"view_html":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI","download_json":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI.json","view_paper":"https://pith.science/paper/37MQX7I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3041&json=true","fetch_graph":"https://pith.science/api/pith-number/37MQX7I6LCCKQIOQMQ5YM3YIUI/graph.json","fetch_events":"https://pith.science/api/pith-number/37MQX7I6LCCKQIOQMQ5YM3YIUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI/action/storage_attestation","attest_author":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI/action/author_attestation","sign_citation":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI/action/citation_signature","submit_replication":"https://pith.science/pith/37MQX7I6LCCKQIOQMQ5YM3YIUI/action/replication_record"}},"created_at":"2026-05-18T04:08:23.143560+00:00","updated_at":"2026-05-18T04:08:23.143560+00:00"}