{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NN5YYB7RKQL62WLOQRNXAV5LTK","short_pith_number":"pith:NN5YYB7R","canonical_record":{"source":{"id":"1506.00744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-02T04:13:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3808ae655fd9c93f8602a00ac08f09e7c6f9e3f74f1e7c0918c471e62c2c4cea","abstract_canon_sha256":"179f3adb3bfa18f41fd6fac4703b98e4f46adbc1b7c7b05918e8baabd8e51ea9"},"schema_version":"1.0"},"canonical_sha256":"6b7b8c07f15417ed596e845b7057ab9aa6f93ccbe47cf401c9d1b6bd97832e47","source":{"kind":"arxiv","id":"1506.00744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00744","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00744v1","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00744","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"NN5YYB7RKQL6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NN5YYB7RKQL62WLO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NN5YYB7R","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NN5YYB7RKQL62WLOQRNXAV5LTK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-02T04:13:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3808ae655fd9c93f8602a00ac08f09e7c6f9e3f74f1e7c0918c471e62c2c4cea","abstract_canon_sha256":"179f3adb3bfa18f41fd6fac4703b98e4f46adbc1b7c7b05918e8baabd8e51ea9"},"schema_version":"1.0"},"canonical_sha256":"6b7b8c07f15417ed596e845b7057ab9aa6f93ccbe47cf401c9d1b6bd97832e47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:52.821803Z","signature_b64":"UEueyPw+xtOYfJQJa6XfcpRz+r0mhXHsyhdaQMK6uAXOkc8nwwLFij3gpKYHa1coJjZykimXC/BcqpMjhXHmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b7b8c07f15417ed596e845b7057ab9aa6f93ccbe47cf401c9d1b6bd97832e47","last_reissued_at":"2026-05-18T01:59:52.821239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:52.821239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00744","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-18T01:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjE3QTvzSSvjZw0rkML0N0CigeC4CElMp1d6s9Nz6mS1K4fXXVG3Dut6d3dYeSuzDhrFG/Sa0KcWIA5Q9n6oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:32.213061Z"},"content_sha256":"03929be304100f5688d763f071e89fc5a1adfd25747879c0f839e2281ca07e23","schema_version":"1.0","event_id":"sha256:03929be304100f5688d763f071e89fc5a1adfd25747879c0f839e2281ca07e23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NN5YYB7RKQL62WLOQRNXAV5LTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ZOS: A Fast Rendezvous Algorithm Based on Set of Available Channels for Cognitive Radios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Hai Liu, Lu Yu, Xiaowen Chu, Yiu-Wing Leung, Zhiyong Lin","submitted_at":"2015-06-02T04:13:00Z","abstract_excerpt":"Most of existing rendezvous algorithms generate channel-hopping sequences based on the whole channel set. They are inefficient when the set of available channels is a small subset of the whole channel set. We propose a new algorithm called ZOS which uses three types of elementary sequences (namely, Zero-type, One-type, and S-type) to generate channel-hopping sequences based on the set of available channels. ZOS provides guaranteed rendezvous without any additional requirements. The maximum time-to-rendezvous of ZOS is upper-bounded by O(m1*m2*log2M) where M is the number of all channels and m1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00744","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-18T01:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkZdnfrjXiLAt+FmPv0lS/fQOpJb12O3oS7eBVqkbE5eRQs10vW+T/UIp+6UgHRYcig8dyvEcG86RMCtnv23Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:32.213430Z"},"content_sha256":"c88551895619da7a0e7f6e2bf1f8b162287e72a4748214036d5b56b1c091da06","schema_version":"1.0","event_id":"sha256:c88551895619da7a0e7f6e2bf1f8b162287e72a4748214036d5b56b1c091da06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/bundle.json","state_url":"https://pith.science/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/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-30T06:08:32Z","links":{"resolver":"https://pith.science/pith/NN5YYB7RKQL62WLOQRNXAV5LTK","bundle":"https://pith.science/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/bundle.json","state":"https://pith.science/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NN5YYB7RKQL62WLOQRNXAV5LTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NN5YYB7RKQL62WLOQRNXAV5LTK","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":"179f3adb3bfa18f41fd6fac4703b98e4f46adbc1b7c7b05918e8baabd8e51ea9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-02T04:13:00Z","title_canon_sha256":"3808ae655fd9c93f8602a00ac08f09e7c6f9e3f74f1e7c0918c471e62c2c4cea"},"schema_version":"1.0","source":{"id":"1506.00744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00744","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00744v1","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00744","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"NN5YYB7RKQL6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NN5YYB7RKQL62WLO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NN5YYB7R","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:c88551895619da7a0e7f6e2bf1f8b162287e72a4748214036d5b56b1c091da06","target":"graph","created_at":"2026-05-18T01:59:52Z","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":"Most of existing rendezvous algorithms generate channel-hopping sequences based on the whole channel set. They are inefficient when the set of available channels is a small subset of the whole channel set. We propose a new algorithm called ZOS which uses three types of elementary sequences (namely, Zero-type, One-type, and S-type) to generate channel-hopping sequences based on the set of available channels. ZOS provides guaranteed rendezvous without any additional requirements. The maximum time-to-rendezvous of ZOS is upper-bounded by O(m1*m2*log2M) where M is the number of all channels and m1","authors_text":"Hai Liu, Lu Yu, Xiaowen Chu, Yiu-Wing Leung, Zhiyong Lin","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-02T04:13:00Z","title":"ZOS: A Fast Rendezvous Algorithm Based on Set of Available Channels for Cognitive Radios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00744","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:03929be304100f5688d763f071e89fc5a1adfd25747879c0f839e2281ca07e23","target":"record","created_at":"2026-05-18T01:59:52Z","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":"179f3adb3bfa18f41fd6fac4703b98e4f46adbc1b7c7b05918e8baabd8e51ea9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-02T04:13:00Z","title_canon_sha256":"3808ae655fd9c93f8602a00ac08f09e7c6f9e3f74f1e7c0918c471e62c2c4cea"},"schema_version":"1.0","source":{"id":"1506.00744","kind":"arxiv","version":1}},"canonical_sha256":"6b7b8c07f15417ed596e845b7057ab9aa6f93ccbe47cf401c9d1b6bd97832e47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b7b8c07f15417ed596e845b7057ab9aa6f93ccbe47cf401c9d1b6bd97832e47","first_computed_at":"2026-05-18T01:59:52.821239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:52.821239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UEueyPw+xtOYfJQJa6XfcpRz+r0mhXHsyhdaQMK6uAXOkc8nwwLFij3gpKYHa1coJjZykimXC/BcqpMjhXHmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:52.821803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03929be304100f5688d763f071e89fc5a1adfd25747879c0f839e2281ca07e23","sha256:c88551895619da7a0e7f6e2bf1f8b162287e72a4748214036d5b56b1c091da06"],"state_sha256":"07704575cb6cb3de7b05fe8adbefa73a4937e124425fe45f7ce62f499bdb068e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIwVVaY0JAproaQSMUxiyQcZXEg/cbvnA1DIQBgUe6588p8fDtnGa8ALoJ+f0thtyy3FwgyVfMC4s6epIYzNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:08:32.215583Z","bundle_sha256":"118c3f32a587134abf3cbe87ff84f1411dd2cc1fd33c7c26f051f6a6bc3c98ef"}}