{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q2FGCDZSWOI7D7GKXJCR44F7AO","short_pith_number":"pith:Q2FGCDZS","canonical_record":{"source":{"id":"2602.16367","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-02-18T11:09:58Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"03655e9adee463ad497df0feb2d7b0e03dbb4858ff963086778bcf9150f394b4","abstract_canon_sha256":"afc6c60911a02b836d46af7af5e758fb42133c0a11d8e70d00d9a913ea14a6ea"},"schema_version":"1.0"},"canonical_sha256":"868a610f32b391f1fccaba451e70bf03ae5402f15c2eec69815cfdb114034d52","source":{"kind":"arxiv","id":"2602.16367","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16367","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16367v3","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16367","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"Q2FGCDZSWOI7","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"Q2FGCDZSWOI7D7GK","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"Q2FGCDZS","created_at":"2026-05-20T00:03:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q2FGCDZSWOI7D7GKXJCR44F7AO","target":"record","payload":{"canonical_record":{"source":{"id":"2602.16367","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-02-18T11:09:58Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"03655e9adee463ad497df0feb2d7b0e03dbb4858ff963086778bcf9150f394b4","abstract_canon_sha256":"afc6c60911a02b836d46af7af5e758fb42133c0a11d8e70d00d9a913ea14a6ea"},"schema_version":"1.0"},"canonical_sha256":"868a610f32b391f1fccaba451e70bf03ae5402f15c2eec69815cfdb114034d52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:06.102843Z","signature_b64":"87tVifNWkxmCPNtz/w+53sZjY0L7WLV+X4kBMr1TSseAKN5g3YIiq5ak7okPNhR9b0vCvmc/8+OEfKN+EcxRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"868a610f32b391f1fccaba451e70bf03ae5402f15c2eec69815cfdb114034d52","last_reissued_at":"2026-05-20T00:03:06.101950Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:06.101950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.16367","source_version":3,"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-20T00:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"raxp2E5VUr2U89L0NI+/9GS2XlUQjmLB3p8K6j+KRCRAi9X83bSh6tweK0zSXMBLdnumbA4Mt71SSgiZpa3dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:18:50.551037Z"},"content_sha256":"245baca584197312f61baaaefd89217787f6b9ec6dc983dee56c7d83f408f5bb","schema_version":"1.0","event_id":"sha256:245baca584197312f61baaaefd89217787f6b9ec6dc983dee56c7d83f408f5bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q2FGCDZSWOI7D7GKXJCR44F7AO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multihop Rendezvous Protocol for Cognitive Radio-based Emergency Response Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.NI","authors_text":"Eoghan Furey, Ian McLoughlin, Saim Ghafoor, Saritha Unnikrishnan, Zahid Ali","submitted_at":"2026-02-18T11:09:58Z","abstract_excerpt":"This paper addresses the challenge of efficient rendezvous in multihop cognitive radio networks, where existing channel-hopping algorithms designed for single-hop scenarios incur increased delay and coordination inefficiencies in multinode topologies. To overcome these limitations, we propose a Multihop Dual Modular Clock Algorithm (M-DMCA), which systematically extends modular clock-based rendezvous to multihop environments while preserving efficient channel coordination. The proposed scheme enables dual-channel selection per timeslot and incorporates a lightweight three-way handshake mechani"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16367","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.16367/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T00:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LnLh/XXC3ualOEZVO9IooRYzmfz6UgQbtl23fBfGNsQ2S6ZD63sxh6FLcsNTdY0vjPqUl2nbbW945m8StvyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:18:50.551763Z"},"content_sha256":"e19d3414e0f56a9f5f4fd5ba2a49296167231132876cccff18f8b2cc8521447d","schema_version":"1.0","event_id":"sha256:e19d3414e0f56a9f5f4fd5ba2a49296167231132876cccff18f8b2cc8521447d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/bundle.json","state_url":"https://pith.science/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/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-07T10:18:50Z","links":{"resolver":"https://pith.science/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO","bundle":"https://pith.science/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/bundle.json","state":"https://pith.science/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2FGCDZSWOI7D7GKXJCR44F7AO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q2FGCDZSWOI7D7GKXJCR44F7AO","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":"afc6c60911a02b836d46af7af5e758fb42133c0a11d8e70d00d9a913ea14a6ea","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-02-18T11:09:58Z","title_canon_sha256":"03655e9adee463ad497df0feb2d7b0e03dbb4858ff963086778bcf9150f394b4"},"schema_version":"1.0","source":{"id":"2602.16367","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16367","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16367v3","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16367","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"Q2FGCDZSWOI7","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"Q2FGCDZSWOI7D7GK","created_at":"2026-05-20T00:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"Q2FGCDZS","created_at":"2026-05-20T00:03:06Z"}],"graph_snapshots":[{"event_id":"sha256:e19d3414e0f56a9f5f4fd5ba2a49296167231132876cccff18f8b2cc8521447d","target":"graph","created_at":"2026-05-20T00:03:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.16367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the challenge of efficient rendezvous in multihop cognitive radio networks, where existing channel-hopping algorithms designed for single-hop scenarios incur increased delay and coordination inefficiencies in multinode topologies. To overcome these limitations, we propose a Multihop Dual Modular Clock Algorithm (M-DMCA), which systematically extends modular clock-based rendezvous to multihop environments while preserving efficient channel coordination. The proposed scheme enables dual-channel selection per timeslot and incorporates a lightweight three-way handshake mechani","authors_text":"Eoghan Furey, Ian McLoughlin, Saim Ghafoor, Saritha Unnikrishnan, Zahid Ali","cross_cats":["cs.ET"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-02-18T11:09:58Z","title":"A Multihop Rendezvous Protocol for Cognitive Radio-based Emergency Response Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16367","kind":"arxiv","version":3},"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:245baca584197312f61baaaefd89217787f6b9ec6dc983dee56c7d83f408f5bb","target":"record","created_at":"2026-05-20T00:03:06Z","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":"afc6c60911a02b836d46af7af5e758fb42133c0a11d8e70d00d9a913ea14a6ea","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-02-18T11:09:58Z","title_canon_sha256":"03655e9adee463ad497df0feb2d7b0e03dbb4858ff963086778bcf9150f394b4"},"schema_version":"1.0","source":{"id":"2602.16367","kind":"arxiv","version":3}},"canonical_sha256":"868a610f32b391f1fccaba451e70bf03ae5402f15c2eec69815cfdb114034d52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"868a610f32b391f1fccaba451e70bf03ae5402f15c2eec69815cfdb114034d52","first_computed_at":"2026-05-20T00:03:06.101950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:06.101950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"87tVifNWkxmCPNtz/w+53sZjY0L7WLV+X4kBMr1TSseAKN5g3YIiq5ak7okPNhR9b0vCvmc/8+OEfKN+EcxRAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:06.102843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.16367","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245baca584197312f61baaaefd89217787f6b9ec6dc983dee56c7d83f408f5bb","sha256:e19d3414e0f56a9f5f4fd5ba2a49296167231132876cccff18f8b2cc8521447d"],"state_sha256":"19ab4da3336a01636dca03956745d0d5e1039d9ac6625729426b567270a320e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFJn7A3hM9Z4jdB4dUppdLZsgAAMJvOy+VEXW2aKCOR408tlWeG95WEUVX1vpSvRno1FVoItDyFZND38d6oNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:18:50.555266Z","bundle_sha256":"3972c07e1de1c0fc97f625250d1be5ad5be3b8287cfbca8aeb1dd17d1769cb83"}}