{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DDBYLSDORRCV6ZUHRPOYVSD2RK","short_pith_number":"pith:DDBYLSDO","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"},"canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","source":{"kind":"arxiv","id":"1906.10424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10424","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10424v1","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10424","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"pith_short_12","alias_value":"DDBYLSDORRCV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DDBYLSDORRCV6ZUH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DDBYLSDO","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DDBYLSDORRCV6ZUHRPOYVSD2RK","target":"record","payload":{"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"},"canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","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"},"source_kind":"arxiv","source_id":"1906.10424","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVx/FEbHWg9r/8b7daHxd3v5klrFCrnKOdfS4xAAM6frbeszMzUU6efz8uKqQAMkCU0bBN04bQuWKQB21QImAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:57:49.605947Z"},"content_sha256":"7bbc9cffbfadf0903e3fcece84209f66654377ee99b47f7a363581353cc487f5","schema_version":"1.0","event_id":"sha256:7bbc9cffbfadf0903e3fcece84209f66654377ee99b47f7a363581353cc487f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DDBYLSDORRCV6ZUHRPOYVSD2RK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TErIQWWCMk3Mo9U7xRalRU/R/S8ww2BueAERTDj949ARqul2Oyb27r84FyfWyuY8B8GUyprN3XJi8x4ibcusBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:57:49.606618Z"},"content_sha256":"06162027989f5d98c27a2662e0a92316af74b9379baadf908ec670cb3c4f129e","schema_version":"1.0","event_id":"sha256:06162027989f5d98c27a2662e0a92316af74b9379baadf908ec670cb3c4f129e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/bundle.json","state_url":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T20:57:49Z","links":{"resolver":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK","bundle":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/bundle.json","state":"https://pith.science/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDBYLSDORRCV6ZUHRPOYVSD2RK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DDBYLSDORRCV6ZUHRPOYVSD2RK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"495024384ea01893417f92f361040d76641fa499511f8619ccd14b9154d7b7ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T09:56:21Z","title_canon_sha256":"66797fa45d70e8aba9cb8b81bcc1195f3b09d53ac2715d5f658948769953dffd"},"schema_version":"1.0","source":{"id":"1906.10424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10424","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10424v1","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10424","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"pith_short_12","alias_value":"DDBYLSDORRCV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DDBYLSDORRCV6ZUH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DDBYLSDO","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:06162027989f5d98c27a2662e0a92316af74b9379baadf908ec670cb3c4f129e","target":"graph","created_at":"2026-05-17T23:42:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Jen-Hung Wang, Yu-Lun Lin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T09:56:21Z","title":"ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10424","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7bbc9cffbfadf0903e3fcece84209f66654377ee99b47f7a363581353cc487f5","target":"record","created_at":"2026-05-17T23:42:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"495024384ea01893417f92f361040d76641fa499511f8619ccd14b9154d7b7ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T09:56:21Z","title_canon_sha256":"66797fa45d70e8aba9cb8b81bcc1195f3b09d53ac2715d5f658948769953dffd"},"schema_version":"1.0","source":{"id":"1906.10424","kind":"arxiv","version":1}},"canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18c385c86e8c455f66878bdd8ac87a8a90558bd68c855a925876f6e533d71f14","first_computed_at":"2026-05-17T23:42:16.404239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:16.404239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5whsyOMdtE4zg9ClairkHFoNdvk24v62SZo0KlHZtphpcyxffy9VllYzpPl6XWqia1OSKywN5rebrkwRYcVLCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:16.404731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bbc9cffbfadf0903e3fcece84209f66654377ee99b47f7a363581353cc487f5","sha256:06162027989f5d98c27a2662e0a92316af74b9379baadf908ec670cb3c4f129e"],"state_sha256":"48be33fd7aedabd9f24e3b9d4b876bb46159e1071410bd52b23f1cccbf96a397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEGGPfxdeCOK/mehBQOqMxydZJX+br5NeZRg2tHL76+xOjhnDJUlOvIhSzF2Qsd47EnjlR2frGonWv2rLa3CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T20:57:49.610721Z","bundle_sha256":"c534048fdd95eb8b6df6242583bc7c5128570062798e320dfe558ca80a5b982d"}}