{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IHINXFSEQR56OWID7D2MTTXRHY","short_pith_number":"pith:IHINXFSE","canonical_record":{"source":{"id":"1502.03469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-02-11T22:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"3e12fe6d8acf08782676d33e1db934facf1c302dc95d26583d2f37ddc2ebfc0e","abstract_canon_sha256":"57216f141d16140ca82fdb72f2c130e9ab3b94769e91dd70571d48d121b540e2"},"schema_version":"1.0"},"canonical_sha256":"41d0db9644847be75903f8f4c9cef13e2c370cc1e71a72e8370d22ffd991c47c","source":{"kind":"arxiv","id":"1502.03469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03469","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03469v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03469","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"IHINXFSEQR56","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHINXFSEQR56OWID","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHINXFSE","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IHINXFSEQR56OWID7D2MTTXRHY","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-02-11T22:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"3e12fe6d8acf08782676d33e1db934facf1c302dc95d26583d2f37ddc2ebfc0e","abstract_canon_sha256":"57216f141d16140ca82fdb72f2c130e9ab3b94769e91dd70571d48d121b540e2"},"schema_version":"1.0"},"canonical_sha256":"41d0db9644847be75903f8f4c9cef13e2c370cc1e71a72e8370d22ffd991c47c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.059675Z","signature_b64":"B6i/gc5uUss/lqgyo/BWYD/+v6A7vny3pPp8l8NS805BGKuJpiefFRg1rd+w9NCC22zeeTKrNXWcD5xN1MkyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d0db9644847be75903f8f4c9cef13e2c370cc1e71a72e8370d22ffd991c47c","last_reissued_at":"2026-05-18T00:57:51.059082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.059082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03469","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-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5fvsLyN5eL8SnS0tBNmGiyZuVo1041PxxuwCw4T7uzfCJcFZfbClRDBn+irPHDrzHVZ+/4yElGlnlTVxkV2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:16:11.579406Z"},"content_sha256":"24c1ea584a49792808b196191146b3ada2315229736bb73b9d24169cd3ecbd5f","schema_version":"1.0","event_id":"sha256:24c1ea584a49792808b196191146b3ada2315229736bb73b9d24169cd3ecbd5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IHINXFSEQR56OWID7D2MTTXRHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kaigui Bian, Lin Chen, Shuyu Shi, Yusheng Ji","submitted_at":"2015-02-11T22:06:22Z","abstract_excerpt":"In cognitive radio (CR) networks, \"TTR\", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs perform channel hopping. There exists a trade-off of optimizing the average or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH protocol leads to the best \"average\" TTR without ensuring a finite \"maximum\" TTR (two CRs may never rendezvous in the worst case), or a high rendezvous diversity (multiple rendezvous channels). On the other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03469","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-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhGmBBl7Y5vT7YOhwrXuBwyPBt9TqPqUzWUbK61KjC9tVvh+QN0swfahIDZwKKtk7vkVzeVU9N8/xWL1t90sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:16:11.579750Z"},"content_sha256":"b1a7699d871c2faf293d7c41c65656f20e9fc9f67f24c140c6bcb1bcd827f6e1","schema_version":"1.0","event_id":"sha256:b1a7699d871c2faf293d7c41c65656f20e9fc9f67f24c140c6bcb1bcd827f6e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHINXFSEQR56OWID7D2MTTXRHY/bundle.json","state_url":"https://pith.science/pith/IHINXFSEQR56OWID7D2MTTXRHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHINXFSEQR56OWID7D2MTTXRHY/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-02T06:16:11Z","links":{"resolver":"https://pith.science/pith/IHINXFSEQR56OWID7D2MTTXRHY","bundle":"https://pith.science/pith/IHINXFSEQR56OWID7D2MTTXRHY/bundle.json","state":"https://pith.science/pith/IHINXFSEQR56OWID7D2MTTXRHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHINXFSEQR56OWID7D2MTTXRHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IHINXFSEQR56OWID7D2MTTXRHY","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":"57216f141d16140ca82fdb72f2c130e9ab3b94769e91dd70571d48d121b540e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-02-11T22:06:22Z","title_canon_sha256":"3e12fe6d8acf08782676d33e1db934facf1c302dc95d26583d2f37ddc2ebfc0e"},"schema_version":"1.0","source":{"id":"1502.03469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03469","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03469v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03469","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"IHINXFSEQR56","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHINXFSEQR56OWID","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHINXFSE","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:b1a7699d871c2faf293d7c41c65656f20e9fc9f67f24c140c6bcb1bcd827f6e1","target":"graph","created_at":"2026-05-18T00:57:51Z","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 (CR) networks, \"TTR\", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs perform channel hopping. There exists a trade-off of optimizing the average or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH protocol leads to the best \"average\" TTR without ensuring a finite \"maximum\" TTR (two CRs may never rendezvous in the worst case), or a high rendezvous diversity (multiple rendezvous channels). On the other","authors_text":"Kaigui Bian, Lin Chen, Shuyu Shi, Yusheng Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-02-11T22:06:22Z","title":"Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03469","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:24c1ea584a49792808b196191146b3ada2315229736bb73b9d24169cd3ecbd5f","target":"record","created_at":"2026-05-18T00:57:51Z","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":"57216f141d16140ca82fdb72f2c130e9ab3b94769e91dd70571d48d121b540e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-02-11T22:06:22Z","title_canon_sha256":"3e12fe6d8acf08782676d33e1db934facf1c302dc95d26583d2f37ddc2ebfc0e"},"schema_version":"1.0","source":{"id":"1502.03469","kind":"arxiv","version":1}},"canonical_sha256":"41d0db9644847be75903f8f4c9cef13e2c370cc1e71a72e8370d22ffd991c47c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41d0db9644847be75903f8f4c9cef13e2c370cc1e71a72e8370d22ffd991c47c","first_computed_at":"2026-05-18T00:57:51.059082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.059082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B6i/gc5uUss/lqgyo/BWYD/+v6A7vny3pPp8l8NS805BGKuJpiefFRg1rd+w9NCC22zeeTKrNXWcD5xN1MkyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.059675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24c1ea584a49792808b196191146b3ada2315229736bb73b9d24169cd3ecbd5f","sha256:b1a7699d871c2faf293d7c41c65656f20e9fc9f67f24c140c6bcb1bcd827f6e1"],"state_sha256":"f2be443958de23aa7339d6e2e71c688510c844a9f0b753183579ca7bc7bc656b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVhwnKEc7fASHt9t/YtBalhWieOxo6RrS9YTn4ZRTvfvLjqb0OJgG5wQcuI+ZpP9D1R7qSIA+AE+TtgJ4WVmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:16:11.581731Z","bundle_sha256":"3deaa6941f3bba79228cf4a25b8734b87915d7e16e1b81c5808776610b81c324"}}