{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PEFBVT7EV65OP6ZCC74AUY5GNQ","short_pith_number":"pith:PEFBVT7E","schema_version":"1.0","canonical_sha256":"790a1acfe4afbae7fb2217f80a63a66c1b5c3588f03fa159b71ca1db1c7ce4cb","source":{"kind":"arxiv","id":"1902.06933","version":1},"attestation_state":"computed","paper":{"title":"A Quasi-random Algorithm for Anonymous Rendezvous in Heterogeneous Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Cheng-Shang Chang, Jang-Ping Sheu, Yeh-Cheng Chang","submitted_at":"2019-02-19T07:33:44Z","abstract_excerpt":"The multichannel rendezvous problem that asks two secondary users to rendezvous on a common available channel in a cognitive radio network (CRN) has received a lot of attention lately. Most rendezvous algorithms in the literature focused on constructing channel hopping (CH) sequences that guarantee finite maximum time-to-rendezvous (MTTR). However, these algorithms perform rather poorly in terms of the expected time-to-rendezvous (ETTR) even when compared to the simple random algorithm. In this paper, we propose the quasi-random (QR) CH algorithm that has a comparable ETTR to the random algori"},"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":"1902.06933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-19T07:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"78bc0ad9d0c764d020b73ccb48f6e0cb8e8c5d3b4cd64c9861e8c8fe8f55d73a","abstract_canon_sha256":"860e76c48042d683bdf0decb6a9bf5eb36a57031c1918a2ed8a993b15ecc110d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:40.398351Z","signature_b64":"9QqS9ciZh+OmcRv4DGnYpyOQGA7NfLdelj1mEOgeqjMAr7zf1w+9H8udzdPJvk2owf+r2dHgRDzedcwItQj+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"790a1acfe4afbae7fb2217f80a63a66c1b5c3588f03fa159b71ca1db1c7ce4cb","last_reissued_at":"2026-05-17T23:53:40.397857Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:40.397857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quasi-random Algorithm for Anonymous Rendezvous in Heterogeneous Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Cheng-Shang Chang, Jang-Ping Sheu, Yeh-Cheng Chang","submitted_at":"2019-02-19T07:33:44Z","abstract_excerpt":"The multichannel rendezvous problem that asks two secondary users to rendezvous on a common available channel in a cognitive radio network (CRN) has received a lot of attention lately. Most rendezvous algorithms in the literature focused on constructing channel hopping (CH) sequences that guarantee finite maximum time-to-rendezvous (MTTR). However, these algorithms perform rather poorly in terms of the expected time-to-rendezvous (ETTR) even when compared to the simple random algorithm. In this paper, we propose the quasi-random (QR) CH algorithm that has a comparable ETTR to the random algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06933","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":"1902.06933","created_at":"2026-05-17T23:53:40.397934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06933v1","created_at":"2026-05-17T23:53:40.397934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06933","created_at":"2026-05-17T23:53:40.397934+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEFBVT7EV65O","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEFBVT7EV65OP6ZC","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEFBVT7E","created_at":"2026-05-18T12:33:24.271573+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/PEFBVT7EV65OP6ZCC74AUY5GNQ","json":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ.json","graph_json":"https://pith.science/api/pith-number/PEFBVT7EV65OP6ZCC74AUY5GNQ/graph.json","events_json":"https://pith.science/api/pith-number/PEFBVT7EV65OP6ZCC74AUY5GNQ/events.json","paper":"https://pith.science/paper/PEFBVT7E"},"agent_actions":{"view_html":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ","download_json":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ.json","view_paper":"https://pith.science/paper/PEFBVT7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06933&json=true","fetch_graph":"https://pith.science/api/pith-number/PEFBVT7EV65OP6ZCC74AUY5GNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PEFBVT7EV65OP6ZCC74AUY5GNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ/action/storage_attestation","attest_author":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ/action/author_attestation","sign_citation":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ/action/citation_signature","submit_replication":"https://pith.science/pith/PEFBVT7EV65OP6ZCC74AUY5GNQ/action/replication_record"}},"created_at":"2026-05-17T23:53:40.397934+00:00","updated_at":"2026-05-17T23:53:40.397934+00:00"}