{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PLO6XR6ALK54MBLWI2JYQAHGV7","short_pith_number":"pith:PLO6XR6A","canonical_record":{"source":{"id":"1404.3265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-12T08:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"0af77d319bf44bbfd2ef7a65cfa53ff6846a2ed01f823c1f410330c6a4750ba4","abstract_canon_sha256":"8484bb59c9d450812f7c69d12a36b4a0291554eed140fe46a82528bc50e51532"},"schema_version":"1.0"},"canonical_sha256":"7addebc7c05abbc6057646938800e6afc3e30b60c472ed77d8b06d3d66ef6f29","source":{"kind":"arxiv","id":"1404.3265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3265","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3265v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3265","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"PLO6XR6ALK54","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PLO6XR6ALK54MBLW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PLO6XR6A","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PLO6XR6ALK54MBLWI2JYQAHGV7","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-12T08:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"0af77d319bf44bbfd2ef7a65cfa53ff6846a2ed01f823c1f410330c6a4750ba4","abstract_canon_sha256":"8484bb59c9d450812f7c69d12a36b4a0291554eed140fe46a82528bc50e51532"},"schema_version":"1.0"},"canonical_sha256":"7addebc7c05abbc6057646938800e6afc3e30b60c472ed77d8b06d3d66ef6f29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.545474Z","signature_b64":"ZZzHMWaVSo2+LL4eHU9l8RyYhi/QFC2nMz638iKi9YExANt1Fs5emp8/jXkJuOUfMDWDFeHokgYEpv0WBFi/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7addebc7c05abbc6057646938800e6afc3e30b60c472ed77d8b06d3d66ef6f29","last_reissued_at":"2026-05-18T02:54:15.545040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.545040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3265","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-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+TlV85OcMPZIeJph1CkXo3+LpWNcxY5qoH+8ayzlVVitcO7coF0d2X2V7BCz5ym4nbDt090J8PBdqSr/vdvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:07.531066Z"},"content_sha256":"6f9c4c51dcedba52df5b3e0ff36d3974ec24c148bf45259eda95e3ac5e2f0c81","schema_version":"1.0","event_id":"sha256:6f9c4c51dcedba52df5b3e0ff36d3974ec24c148bf45259eda95e3ac5e2f0c81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PLO6XR6ALK54MBLWI2JYQAHGV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Francis C.M. Lau, Haisheng Tan, Hongyu Liang, Jiajun Yu, Tiancheng Lou","submitted_at":"2014-04-12T08:24:22Z","abstract_excerpt":"In Cognitive Radio Networks (CRNs), the secondary users (SUs) are allowed to access the licensed channels opportunistically. A fundamental and essential operation for SUs is to establish communication through choosing a common channel at the same time slot, which is referred to as rendezvous problem. In this paper, we study strategies to achieve fast rendezvous for two secondary users.\n  The channel availability for secondary nodes is subject to temporal and spatial variation. Moreover, in a distributed system, one user is oblivious of the other user's channel status. Therefore, a fast rendezv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3265","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-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQpsb9GUqJzoW0fYw/RKEMSbCRIKTcYPhMfoq7D9dvQPsP30V8b5nkbzjqT0fiLVSLckEbJgGi0RoxW8+ywKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:07.531428Z"},"content_sha256":"6b534f3666361bf863ebc396a04a7d55517887418acfd2895e7722ec31871a33","schema_version":"1.0","event_id":"sha256:6b534f3666361bf863ebc396a04a7d55517887418acfd2895e7722ec31871a33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/bundle.json","state_url":"https://pith.science/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/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-05-29T16:23:07Z","links":{"resolver":"https://pith.science/pith/PLO6XR6ALK54MBLWI2JYQAHGV7","bundle":"https://pith.science/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/bundle.json","state":"https://pith.science/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLO6XR6ALK54MBLWI2JYQAHGV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PLO6XR6ALK54MBLWI2JYQAHGV7","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":"8484bb59c9d450812f7c69d12a36b4a0291554eed140fe46a82528bc50e51532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-12T08:24:22Z","title_canon_sha256":"0af77d319bf44bbfd2ef7a65cfa53ff6846a2ed01f823c1f410330c6a4750ba4"},"schema_version":"1.0","source":{"id":"1404.3265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3265","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3265v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3265","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"PLO6XR6ALK54","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PLO6XR6ALK54MBLW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PLO6XR6A","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6b534f3666361bf863ebc396a04a7d55517887418acfd2895e7722ec31871a33","target":"graph","created_at":"2026-05-18T02:54:15Z","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 Cognitive Radio Networks (CRNs), the secondary users (SUs) are allowed to access the licensed channels opportunistically. A fundamental and essential operation for SUs is to establish communication through choosing a common channel at the same time slot, which is referred to as rendezvous problem. In this paper, we study strategies to achieve fast rendezvous for two secondary users.\n  The channel availability for secondary nodes is subject to temporal and spatial variation. Moreover, in a distributed system, one user is oblivious of the other user's channel status. Therefore, a fast rendezv","authors_text":"Francis C.M. Lau, Haisheng Tan, Hongyu Liang, Jiajun Yu, Tiancheng Lou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-12T08:24:22Z","title":"Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3265","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:6f9c4c51dcedba52df5b3e0ff36d3974ec24c148bf45259eda95e3ac5e2f0c81","target":"record","created_at":"2026-05-18T02:54:15Z","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":"8484bb59c9d450812f7c69d12a36b4a0291554eed140fe46a82528bc50e51532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-12T08:24:22Z","title_canon_sha256":"0af77d319bf44bbfd2ef7a65cfa53ff6846a2ed01f823c1f410330c6a4750ba4"},"schema_version":"1.0","source":{"id":"1404.3265","kind":"arxiv","version":1}},"canonical_sha256":"7addebc7c05abbc6057646938800e6afc3e30b60c472ed77d8b06d3d66ef6f29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7addebc7c05abbc6057646938800e6afc3e30b60c472ed77d8b06d3d66ef6f29","first_computed_at":"2026-05-18T02:54:15.545040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:15.545040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZZzHMWaVSo2+LL4eHU9l8RyYhi/QFC2nMz638iKi9YExANt1Fs5emp8/jXkJuOUfMDWDFeHokgYEpv0WBFi/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:15.545474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f9c4c51dcedba52df5b3e0ff36d3974ec24c148bf45259eda95e3ac5e2f0c81","sha256:6b534f3666361bf863ebc396a04a7d55517887418acfd2895e7722ec31871a33"],"state_sha256":"469c8916361fa01fb1bafb059b86c4ad90f5297a7eb9b8d15afc9a2c327456f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ijy1Wc/tMFKP6vK8F+CiR4UwSX//TkErPn2Us88II/gY5M/iEGyyxhRa4wr38tLPyOl2oEjLpimiWg34I7kPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:23:07.533612Z","bundle_sha256":"a062d52b2cdc9d1354c63f70b948c2cf54eadf05369c51c75dec38bc6361acdb"}}