{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CSPR2JHB6IODQPIYVXZDHGQANC","short_pith_number":"pith:CSPR2JHB","schema_version":"1.0","canonical_sha256":"149f1d24e1f21c383d18adf2339a00689890c0a67487c71b69afb3466dcc5e1f","source":{"kind":"arxiv","id":"1707.07020","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Quorum-based Channel-hopping Distributed Coordination Scheme for Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ali Eyadeh, Esraa Al Jarrah, Haythem Bany Salameh","submitted_at":"2017-07-21T18:45:03Z","abstract_excerpt":"In this paper, we propose novel channel-hoppingbased distributed rendezvous algorithm based on grid-basedquorum techniques. The proposed algorithm increases the probability of rendezvous (RDV) within a single cycle by allowing CR nodes to meet more often according to intersection property of quorum systems (QSs). Our proposed algorithm is called Adaptive quorum-based channel-hopping distributed coordination scheme for cognitive radio networks. The main idea of our algorithm is to dynamically adjust the selected QS by CR users according to the varying traffic loads in the CRN. The proposed algo"},"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":"1707.07020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-07-21T18:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"c7781835af1fe4f664b20bb952c95b7672965a9119be76b31e189a6d18a40f98","abstract_canon_sha256":"835db1715cfb7a319964ce107842d407333350412359604952295b6a550fd095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:45.564854Z","signature_b64":"kYFrrCzLIqDA+aiWRgRhbnbwwbHhrupFO9EtNr5x5/61lcuFzwvXGMMDZDrA5zoVwSBH9fPXDH4J1gWsosXSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149f1d24e1f21c383d18adf2339a00689890c0a67487c71b69afb3466dcc5e1f","last_reissued_at":"2026-05-18T00:39:45.564180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:45.564180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Quorum-based Channel-hopping Distributed Coordination Scheme for Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ali Eyadeh, Esraa Al Jarrah, Haythem Bany Salameh","submitted_at":"2017-07-21T18:45:03Z","abstract_excerpt":"In this paper, we propose novel channel-hoppingbased distributed rendezvous algorithm based on grid-basedquorum techniques. The proposed algorithm increases the probability of rendezvous (RDV) within a single cycle by allowing CR nodes to meet more often according to intersection property of quorum systems (QSs). Our proposed algorithm is called Adaptive quorum-based channel-hopping distributed coordination scheme for cognitive radio networks. The main idea of our algorithm is to dynamically adjust the selected QS by CR users according to the varying traffic loads in the CRN. The proposed algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07020","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":"1707.07020","created_at":"2026-05-18T00:39:45.564308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07020v1","created_at":"2026-05-18T00:39:45.564308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07020","created_at":"2026-05-18T00:39:45.564308+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSPR2JHB6IOD","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSPR2JHB6IODQPIY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSPR2JHB","created_at":"2026-05-18T12:31:10.602751+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/CSPR2JHB6IODQPIYVXZDHGQANC","json":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC.json","graph_json":"https://pith.science/api/pith-number/CSPR2JHB6IODQPIYVXZDHGQANC/graph.json","events_json":"https://pith.science/api/pith-number/CSPR2JHB6IODQPIYVXZDHGQANC/events.json","paper":"https://pith.science/paper/CSPR2JHB"},"agent_actions":{"view_html":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC","download_json":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC.json","view_paper":"https://pith.science/paper/CSPR2JHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07020&json=true","fetch_graph":"https://pith.science/api/pith-number/CSPR2JHB6IODQPIYVXZDHGQANC/graph.json","fetch_events":"https://pith.science/api/pith-number/CSPR2JHB6IODQPIYVXZDHGQANC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC/action/storage_attestation","attest_author":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC/action/author_attestation","sign_citation":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC/action/citation_signature","submit_replication":"https://pith.science/pith/CSPR2JHB6IODQPIYVXZDHGQANC/action/replication_record"}},"created_at":"2026-05-18T00:39:45.564308+00:00","updated_at":"2026-05-18T00:39:45.564308+00:00"}