{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7PJ7EAQ6SGCEETCN35NEUIB6ZQ","short_pith_number":"pith:7PJ7EAQ6","schema_version":"1.0","canonical_sha256":"fbd3f2021e9184424c4ddf5a4a203ecc36512c52242a0e177c4a29d88c6eb00a","source":{"kind":"arxiv","id":"1211.5562","version":2},"attestation_state":"computed","paper":{"title":"Spectrum Sensing using Distributed Sequential Detection via Noisy Reporting MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Jithin K. Sreedharan, Vinod Sharma","submitted_at":"2012-11-23T17:43:59Z","abstract_excerpt":"This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We develop an energy efficient detector with low detection delay using decentralized sequential hypothesis testing. Our algorithm at the Cognitive Radios employs an asynchronous transmission scheme which takes into account the noise at the fusion center. We start with a distributed algorithm, DualSPRT, in which Cognitive Radios sequentially collect the observations, make local decisions using SPRT (Sequential Probability Ratio Test) and s"},"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":"1211.5562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-23T17:43:59Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"9b83bff393a6b25898d8387ec7ee16212e1f15e2a169841bc1f92b0fc19fcac0","abstract_canon_sha256":"ab533f426f138aa31bd78bf90b2934e50d123d77b61121fff5ffd94505d69854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:50.161255Z","signature_b64":"SSh8HvBXp2CEtQDZCQ+Cw0TmOknmhSbtqFmwNwxIujnbaHF5Ty/DA4ZdPKax7rX4TgViFG0ccI9hPousQ59DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd3f2021e9184424c4ddf5a4a203ecc36512c52242a0e177c4a29d88c6eb00a","last_reissued_at":"2026-05-18T03:14:50.160443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:50.160443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectrum Sensing using Distributed Sequential Detection via Noisy Reporting MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Jithin K. Sreedharan, Vinod Sharma","submitted_at":"2012-11-23T17:43:59Z","abstract_excerpt":"This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We develop an energy efficient detector with low detection delay using decentralized sequential hypothesis testing. Our algorithm at the Cognitive Radios employs an asynchronous transmission scheme which takes into account the noise at the fusion center. We start with a distributed algorithm, DualSPRT, in which Cognitive Radios sequentially collect the observations, make local decisions using SPRT (Sequential Probability Ratio Test) and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5562","kind":"arxiv","version":2},"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":"1211.5562","created_at":"2026-05-18T03:14:50.160595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5562v2","created_at":"2026-05-18T03:14:50.160595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5562","created_at":"2026-05-18T03:14:50.160595+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PJ7EAQ6SGCE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PJ7EAQ6SGCEETCN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PJ7EAQ6","created_at":"2026-05-18T12:26:58.693483+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/7PJ7EAQ6SGCEETCN35NEUIB6ZQ","json":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ.json","graph_json":"https://pith.science/api/pith-number/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/graph.json","events_json":"https://pith.science/api/pith-number/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/events.json","paper":"https://pith.science/paper/7PJ7EAQ6"},"agent_actions":{"view_html":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ","download_json":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ.json","view_paper":"https://pith.science/paper/7PJ7EAQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5562&json=true","fetch_graph":"https://pith.science/api/pith-number/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/action/storage_attestation","attest_author":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/action/author_attestation","sign_citation":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/action/citation_signature","submit_replication":"https://pith.science/pith/7PJ7EAQ6SGCEETCN35NEUIB6ZQ/action/replication_record"}},"created_at":"2026-05-18T03:14:50.160595+00:00","updated_at":"2026-05-18T03:14:50.160595+00:00"}