{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NSI2IAVSRQYGEHU32FKAPDUXGM","short_pith_number":"pith:NSI2IAVS","schema_version":"1.0","canonical_sha256":"6c91a402b28c30621e9bd154078e973307ddb27bd82843f3ec24bd0f6cd112d4","source":{"kind":"arxiv","id":"1609.08398","version":1},"attestation_state":"computed","paper":{"title":"Matched filter detection with dynamic threshold for cognitive radio networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatima Salahdine (UND), Hassan El Ghazi, Naima Kaabouch (UND)","submitted_at":"2016-09-27T13:13:18Z","abstract_excerpt":"-In cognitive radio networks, spectrum sensing aims to detect the unused spectrum channels in order to use the radio spectrum more efficiently. Various methods have been proposed in the past, such as energy, feature detection, and matched filter. These methods are characterized by a sensing threshold, which plays an important role in the sensing performance. Most of the existing techniques used a static threshold. However, the noise is random, and, thus the threshold should be dynamic. In this paper, we suggest an approach with an estimated and dynamic sensing threshold to increase the efficie"},"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":"1609.08398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T13:13:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bbe10c7f6158e3ddd47d0ec1def5f44b17df38e527e17817923d3e1040a52284","abstract_canon_sha256":"2aadea6bef804b73febe9a437d1f03ac1f15a8c6fab6344ab43ba184fda043a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:45.986618Z","signature_b64":"8gXlV/e2iPzga36uxh7q7Y127A+Rz7WJDTm0VY3+m07E+Jx3fcQ1nWQYpV/7mUj/62MGS6IDOizicbLAV/OOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c91a402b28c30621e9bd154078e973307ddb27bd82843f3ec24bd0f6cd112d4","last_reissued_at":"2026-05-18T01:03:45.986164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:45.986164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matched filter detection with dynamic threshold for cognitive radio networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatima Salahdine (UND), Hassan El Ghazi, Naima Kaabouch (UND)","submitted_at":"2016-09-27T13:13:18Z","abstract_excerpt":"-In cognitive radio networks, spectrum sensing aims to detect the unused spectrum channels in order to use the radio spectrum more efficiently. Various methods have been proposed in the past, such as energy, feature detection, and matched filter. These methods are characterized by a sensing threshold, which plays an important role in the sensing performance. Most of the existing techniques used a static threshold. However, the noise is random, and, thus the threshold should be dynamic. In this paper, we suggest an approach with an estimated and dynamic sensing threshold to increase the efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08398","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":"1609.08398","created_at":"2026-05-18T01:03:45.986230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08398v1","created_at":"2026-05-18T01:03:45.986230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08398","created_at":"2026-05-18T01:03:45.986230+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSI2IAVSRQYG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSI2IAVSRQYGEHU3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSI2IAVS","created_at":"2026-05-18T12:30:36.002864+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/NSI2IAVSRQYGEHU32FKAPDUXGM","json":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM.json","graph_json":"https://pith.science/api/pith-number/NSI2IAVSRQYGEHU32FKAPDUXGM/graph.json","events_json":"https://pith.science/api/pith-number/NSI2IAVSRQYGEHU32FKAPDUXGM/events.json","paper":"https://pith.science/paper/NSI2IAVS"},"agent_actions":{"view_html":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM","download_json":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM.json","view_paper":"https://pith.science/paper/NSI2IAVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08398&json=true","fetch_graph":"https://pith.science/api/pith-number/NSI2IAVSRQYGEHU32FKAPDUXGM/graph.json","fetch_events":"https://pith.science/api/pith-number/NSI2IAVSRQYGEHU32FKAPDUXGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM/action/storage_attestation","attest_author":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM/action/author_attestation","sign_citation":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM/action/citation_signature","submit_replication":"https://pith.science/pith/NSI2IAVSRQYGEHU32FKAPDUXGM/action/replication_record"}},"created_at":"2026-05-18T01:03:45.986230+00:00","updated_at":"2026-05-18T01:03:45.986230+00:00"}