{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DDBYLSDORRCV6ZUHRPOYVSD2RK","short_pith_number":"pith:DDBYLSDO","schema_version":"1.0","canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","source":{"kind":"arxiv","id":"1906.10424","version":1},"attestation_state":"computed","paper":{"title":"ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Jen-Hung Wang, Yu-Lun Lin","submitted_at":"2019-06-25T09:56:21Z","abstract_excerpt":"In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel states are modeled by stochastic processes with joint distributions known to users. However, the exact state of a channel at any time is not observable. We first consider two channel models: (i) the fast time-varying channel model (where the channel states are assumed to be independent and identically distributed in each time slot), and (ii) the slow time-varyi"},"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":"1906.10424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T09:56:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"66797fa45d70e8aba9cb8b81bcc1195f3b09d53ac2715d5f658948769953dffd","abstract_canon_sha256":"495024384ea01893417f92f361040d76641fa499511f8619ccd14b9154d7b7ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:16.404731Z","signature_b64":"5whsyOMdtE4zg9ClairkHFoNdvk24v62SZo0KlHZtphpcyxffy9VllYzpPl6XWqia1OSKywN5rebrkwRYcVLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","last_reissued_at":"2026-05-17T23:42:16.404239Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:16.404239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Jen-Hung Wang, Yu-Lun Lin","submitted_at":"2019-06-25T09:56:21Z","abstract_excerpt":"In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel states are modeled by stochastic processes with joint distributions known to users. However, the exact state of a channel at any time is not observable. We first consider two channel models: (i) the fast time-varying channel model (where the channel states are assumed to be independent and identically distributed in each time slot), and (ii) the slow time-varyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10424","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":"1906.10424","created_at":"2026-05-17T23:42:16.404330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10424v1","created_at":"2026-05-17T23:42:16.404330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10424","created_at":"2026-05-17T23:42:16.404330+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDBYLSDORRCV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDBYLSDORRCV6ZUH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDBYLSDO","created_at":"2026-05-18T12:33:15.570797+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/DDBYLSDORRCV6ZUHRPOYVSD2RK","json":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK.json","graph_json":"https://pith.science/api/pith-number/DDBYLSDORRCV6ZUHRPOYVSD2RK/graph.json","events_json":"https://pith.science/api/pith-number/DDBYLSDORRCV6ZUHRPOYVSD2RK/events.json","paper":"https://pith.science/paper/DDBYLSDO"},"agent_actions":{"view_html":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK","download_json":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK.json","view_paper":"https://pith.science/paper/DDBYLSDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10424&json=true","fetch_graph":"https://pith.science/api/pith-number/DDBYLSDORRCV6ZUHRPOYVSD2RK/graph.json","fetch_events":"https://pith.science/api/pith-number/DDBYLSDORRCV6ZUHRPOYVSD2RK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/action/storage_attestation","attest_author":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/action/author_attestation","sign_citation":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/action/citation_signature","submit_replication":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/action/replication_record"}},"created_at":"2026-05-17T23:42:16.404330+00:00","updated_at":"2026-05-17T23:42:16.404330+00:00"}