{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:S52OW2PYMN5GSWPCGAYGQ4WNNU","short_pith_number":"pith:S52OW2PY","canonical_record":{"source":{"id":"1107.4950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-25T13:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"1487fd2e9d8c32d7d48983708f5ea6ae186a40ca7b09662a0cf29c4e5f46236d","abstract_canon_sha256":"ffe6693cee4686b388035049b988646530b6f2206d618f65944eda5f1092854d"},"schema_version":"1.0"},"canonical_sha256":"9774eb69f8637a6959e230306872cd6d25c789d7c0a6e0a96a85c62ff85c0cba","source":{"kind":"arxiv","id":"1107.4950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4950","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4950v1","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4950","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"S52OW2PYMN5G","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S52OW2PYMN5GSWPC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S52OW2PY","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:S52OW2PYMN5GSWPCGAYGQ4WNNU","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-25T13:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"1487fd2e9d8c32d7d48983708f5ea6ae186a40ca7b09662a0cf29c4e5f46236d","abstract_canon_sha256":"ffe6693cee4686b388035049b988646530b6f2206d618f65944eda5f1092854d"},"schema_version":"1.0"},"canonical_sha256":"9774eb69f8637a6959e230306872cd6d25c789d7c0a6e0a96a85c62ff85c0cba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:54.183851Z","signature_b64":"Dx4Nn3pZP9CAGaaLf9so/FWW29TywF7/YTNVj/iBId/skjrKTKGUTl1iUKoHUqAzWrUIISVeU37O+u7/HpRFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9774eb69f8637a6959e230306872cd6d25c789d7c0a6e0a96a85c62ff85c0cba","last_reissued_at":"2026-05-18T04:16:54.183224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:54.183224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4950","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-18T04:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtKcBMeOtQc83M3yNjy6TgNZSO52gcLUhFrKn21vvDo4SIholGewKT3KNX53kfBQment4lSBN0IWRAML+yALDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:38:26.283873Z"},"content_sha256":"bdc58b49192ee3ba909f8fad00610907aeec49d2a46bfda1fd4f88babde6f21b","schema_version":"1.0","event_id":"sha256:bdc58b49192ee3ba909f8fad00610907aeec49d2a46bfda1fd4f88babde6f21b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:S52OW2PYMN5GSWPCGAYGQ4WNNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Dissemination in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mubashir Husain Rehmani","submitted_at":"2011-07-25T13:46:25Z","abstract_excerpt":"In this report, we first describe the problem that we are dealing with i.e. data dissemination in multi-hop cognitive radio networks. To address this problem, we propose a channel selection strategy named 'SURF'. We evaluate the proposed channel selection strategy in both single-hop and multi-hop scenarios and compared it with relevant approaches. So far, one technical report and a poster is published as part of this work, while two publications are under review; one is in IEEE Communications Letters and the second one is in IEEE WoWMoM conference. In on-going works sections, we first mention "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4950","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-18T04:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgkw3iMVANBsJ5IGQy69fKHLhIoh2OJs+dCFR3iQCR7g+DnKR47CFXXEAZ7a7ygi0M7YPAJScqeer1hN+KPCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:38:26.284220Z"},"content_sha256":"c06ee0ced588143122ed56cf02729f7e343bc91f79a2d80f3e937d85d15651e4","schema_version":"1.0","event_id":"sha256:c06ee0ced588143122ed56cf02729f7e343bc91f79a2d80f3e937d85d15651e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/bundle.json","state_url":"https://pith.science/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/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-22T20:38:26Z","links":{"resolver":"https://pith.science/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU","bundle":"https://pith.science/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/bundle.json","state":"https://pith.science/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S52OW2PYMN5GSWPCGAYGQ4WNNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:S52OW2PYMN5GSWPCGAYGQ4WNNU","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":"ffe6693cee4686b388035049b988646530b6f2206d618f65944eda5f1092854d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-25T13:46:25Z","title_canon_sha256":"1487fd2e9d8c32d7d48983708f5ea6ae186a40ca7b09662a0cf29c4e5f46236d"},"schema_version":"1.0","source":{"id":"1107.4950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4950","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4950v1","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4950","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"S52OW2PYMN5G","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S52OW2PYMN5GSWPC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S52OW2PY","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:c06ee0ced588143122ed56cf02729f7e343bc91f79a2d80f3e937d85d15651e4","target":"graph","created_at":"2026-05-18T04:16:54Z","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 report, we first describe the problem that we are dealing with i.e. data dissemination in multi-hop cognitive radio networks. To address this problem, we propose a channel selection strategy named 'SURF'. We evaluate the proposed channel selection strategy in both single-hop and multi-hop scenarios and compared it with relevant approaches. So far, one technical report and a poster is published as part of this work, while two publications are under review; one is in IEEE Communications Letters and the second one is in IEEE WoWMoM conference. In on-going works sections, we first mention ","authors_text":"Mubashir Husain Rehmani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-25T13:46:25Z","title":"Data Dissemination in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4950","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:bdc58b49192ee3ba909f8fad00610907aeec49d2a46bfda1fd4f88babde6f21b","target":"record","created_at":"2026-05-18T04:16:54Z","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":"ffe6693cee4686b388035049b988646530b6f2206d618f65944eda5f1092854d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-25T13:46:25Z","title_canon_sha256":"1487fd2e9d8c32d7d48983708f5ea6ae186a40ca7b09662a0cf29c4e5f46236d"},"schema_version":"1.0","source":{"id":"1107.4950","kind":"arxiv","version":1}},"canonical_sha256":"9774eb69f8637a6959e230306872cd6d25c789d7c0a6e0a96a85c62ff85c0cba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9774eb69f8637a6959e230306872cd6d25c789d7c0a6e0a96a85c62ff85c0cba","first_computed_at":"2026-05-18T04:16:54.183224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:54.183224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dx4Nn3pZP9CAGaaLf9so/FWW29TywF7/YTNVj/iBId/skjrKTKGUTl1iUKoHUqAzWrUIISVeU37O+u7/HpRFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:54.183851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdc58b49192ee3ba909f8fad00610907aeec49d2a46bfda1fd4f88babde6f21b","sha256:c06ee0ced588143122ed56cf02729f7e343bc91f79a2d80f3e937d85d15651e4"],"state_sha256":"352a90825699957aa5f8549713d01c37ec5f77c9e055eb81da0f5bb4f64c7da4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGPcKNCD0NoZ2Ie75Wxy9SpsD8DlCuyQ+R3j23XejPec98s+22B4ME8Ko+Mb9urhkASiEe4eumIiCEpqM0v3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:38:26.286261Z","bundle_sha256":"547107dd1ca18e1b09f8d46da2d85d530c79706818f225622c42e44b170c9a34"}}