{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L76OBGDUOMYF2JKNLAIIPWAUDQ","short_pith_number":"pith:L76OBGDU","schema_version":"1.0","canonical_sha256":"5ffce0987473305d254d581087d8141c0596f012813c59abddad5f8991ff87e9","source":{"kind":"arxiv","id":"1506.01136","version":1},"attestation_state":"computed","paper":{"title":"Efficient Channel-Hopping Rendezvous Algorithm Based on Available Channel Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hai Liu, Lu Yu, Xiaowen Chu, Yiu-Wing Leung, Zhiyong Lin","submitted_at":"2015-06-03T06:18:08Z","abstract_excerpt":"In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that rendezvous can be completed within finite time and they generate channel-hopping (CH) sequences based on the whole channel set. However, some channels may not be available (e.g., they are being used by the licensed users) and these existing algorithms would randomly replace the unavailable channels in the CH sequence. This random replacement is not effective, espe"},"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":"1506.01136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-03T06:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"531b9eccf7511e34683e89a00f993e81b7a2d64035979be695802d5f9865740a","abstract_canon_sha256":"0b6b49f5a6e5e9886db66abd032fd77e67a4d50367d51d605ab333b53719265e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:24.983231Z","signature_b64":"3d4Z5cW4eFsvkz6PWsn85oJlcYVx9HxGB8vpv6E9wE41QWyvP9M3nieKq0J7SWOOw3iiDR7+I6xspT+WrMtYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ffce0987473305d254d581087d8141c0596f012813c59abddad5f8991ff87e9","last_reissued_at":"2026-05-18T01:58:24.982845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:24.982845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Channel-Hopping Rendezvous Algorithm Based on Available Channel Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hai Liu, Lu Yu, Xiaowen Chu, Yiu-Wing Leung, Zhiyong Lin","submitted_at":"2015-06-03T06:18:08Z","abstract_excerpt":"In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that rendezvous can be completed within finite time and they generate channel-hopping (CH) sequences based on the whole channel set. However, some channels may not be available (e.g., they are being used by the licensed users) and these existing algorithms would randomly replace the unavailable channels in the CH sequence. This random replacement is not effective, espe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01136","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":"1506.01136","created_at":"2026-05-18T01:58:24.982907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01136v1","created_at":"2026-05-18T01:58:24.982907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01136","created_at":"2026-05-18T01:58:24.982907+00:00"},{"alias_kind":"pith_short_12","alias_value":"L76OBGDUOMYF","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L76OBGDUOMYF2JKN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L76OBGDU","created_at":"2026-05-18T12:29:29.992203+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/L76OBGDUOMYF2JKNLAIIPWAUDQ","json":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ.json","graph_json":"https://pith.science/api/pith-number/L76OBGDUOMYF2JKNLAIIPWAUDQ/graph.json","events_json":"https://pith.science/api/pith-number/L76OBGDUOMYF2JKNLAIIPWAUDQ/events.json","paper":"https://pith.science/paper/L76OBGDU"},"agent_actions":{"view_html":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ","download_json":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ.json","view_paper":"https://pith.science/paper/L76OBGDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01136&json=true","fetch_graph":"https://pith.science/api/pith-number/L76OBGDUOMYF2JKNLAIIPWAUDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/L76OBGDUOMYF2JKNLAIIPWAUDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ/action/storage_attestation","attest_author":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ/action/author_attestation","sign_citation":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ/action/citation_signature","submit_replication":"https://pith.science/pith/L76OBGDUOMYF2JKNLAIIPWAUDQ/action/replication_record"}},"created_at":"2026-05-18T01:58:24.982907+00:00","updated_at":"2026-05-18T01:58:24.982907+00:00"}