{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KOYY2GBUXEMN36WVSYQWPCHN3P","short_pith_number":"pith:KOYY2GBU","canonical_record":{"source":{"id":"1404.3891","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-15T12:39:10Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"12de5e9b1d180f466b92cbbb2d12f276999a41c7dc060ad37e0f4cb56276b4e5","abstract_canon_sha256":"91d0b7545c24827c8a3d114a992285302a9eeaf3baf046313f632b95e87bf502"},"schema_version":"1.0"},"canonical_sha256":"53b18d1834b918ddfad596216788eddbc7918fd6b838ac187691235106e974ba","source":{"kind":"arxiv","id":"1404.3891","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3891","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3891v4","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3891","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"KOYY2GBUXEMN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KOYY2GBUXEMN36WV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KOYY2GBU","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KOYY2GBUXEMN36WVSYQWPCHN3P","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3891","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-15T12:39:10Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"12de5e9b1d180f466b92cbbb2d12f276999a41c7dc060ad37e0f4cb56276b4e5","abstract_canon_sha256":"91d0b7545c24827c8a3d114a992285302a9eeaf3baf046313f632b95e87bf502"},"schema_version":"1.0"},"canonical_sha256":"53b18d1834b918ddfad596216788eddbc7918fd6b838ac187691235106e974ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.600597Z","signature_b64":"Nd7fvv+HdT8e/DsVUnQ84xHgH9jZaUNGro1ZO4ukHvEnoxUurUQL/QcBzs4+/mJ6qRlQi7Zgyhd4FczTmYd3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b18d1834b918ddfad596216788eddbc7918fd6b838ac187691235106e974ba","last_reissued_at":"2026-05-18T00:58:41.599940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.599940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3891","source_version":4,"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:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0KYnA3p85kwHK+QO42WV7zaYnJx4VQ8pnK4X5mo9rOw7NcInquR9CY+Unt6m3gQWTjCAM7fbsHSu3hRO8+3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:12:20.030769Z"},"content_sha256":"72925fe6e7f28678ebedb18a433568d876ecb08f2d5ba614940d317eff78e985","schema_version":"1.0","event_id":"sha256:72925fe6e7f28678ebedb18a433568d876ecb08f2d5ba614940d317eff78e985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KOYY2GBUXEMN36WVSYQWPCHN3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Li Li, Xiaoxiong Zhong, Yang Qin, Yanlin Li, Yuanyuan Yang","submitted_at":"2014-04-15T12:39:10Z","abstract_excerpt":"In this paper, we consider the joint opportunistic routing and channel assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks (CRNs) for improving aggregate throughput of the secondary users. We first present the nonlinear programming optimization model for this joint problem, taking into account the feature of CRNs-channel uncertainty. Then considering the queue state of a node, we propose a new scheme to select proper forwarding candidates for opportunistic routing. Furthermore, a new algorithm for calculating the forwarding probability of any packet at a node is pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3891","kind":"arxiv","version":4},"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:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjIhrOaaAPFyGpU9Je/B/Q8Q3gfE5RJ+O+Tz3Y4zD4L3Pvpke7cDZhJqS4Nm0Q48DjOddIcT2Vdh1plzH2J9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:12:20.031114Z"},"content_sha256":"af99db6c38873b2b95930feb55443c55905cb39b3acf574f021da43296884c76","schema_version":"1.0","event_id":"sha256:af99db6c38873b2b95930feb55443c55905cb39b3acf574f021da43296884c76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/bundle.json","state_url":"https://pith.science/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/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-02T21:12:20Z","links":{"resolver":"https://pith.science/pith/KOYY2GBUXEMN36WVSYQWPCHN3P","bundle":"https://pith.science/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/bundle.json","state":"https://pith.science/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOYY2GBUXEMN36WVSYQWPCHN3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KOYY2GBUXEMN36WVSYQWPCHN3P","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":"91d0b7545c24827c8a3d114a992285302a9eeaf3baf046313f632b95e87bf502","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-15T12:39:10Z","title_canon_sha256":"12de5e9b1d180f466b92cbbb2d12f276999a41c7dc060ad37e0f4cb56276b4e5"},"schema_version":"1.0","source":{"id":"1404.3891","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3891","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3891v4","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3891","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"KOYY2GBUXEMN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KOYY2GBUXEMN36WV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KOYY2GBU","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:af99db6c38873b2b95930feb55443c55905cb39b3acf574f021da43296884c76","target":"graph","created_at":"2026-05-18T00:58:41Z","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 paper, we consider the joint opportunistic routing and channel assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks (CRNs) for improving aggregate throughput of the secondary users. We first present the nonlinear programming optimization model for this joint problem, taking into account the feature of CRNs-channel uncertainty. Then considering the queue state of a node, we propose a new scheme to select proper forwarding candidates for opportunistic routing. Furthermore, a new algorithm for calculating the forwarding probability of any packet at a node is pro","authors_text":"Li Li, Xiaoxiong Zhong, Yang Qin, Yanlin Li, Yuanyuan Yang","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-15T12:39:10Z","title":"Joint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3891","kind":"arxiv","version":4},"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:72925fe6e7f28678ebedb18a433568d876ecb08f2d5ba614940d317eff78e985","target":"record","created_at":"2026-05-18T00:58:41Z","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":"91d0b7545c24827c8a3d114a992285302a9eeaf3baf046313f632b95e87bf502","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-15T12:39:10Z","title_canon_sha256":"12de5e9b1d180f466b92cbbb2d12f276999a41c7dc060ad37e0f4cb56276b4e5"},"schema_version":"1.0","source":{"id":"1404.3891","kind":"arxiv","version":4}},"canonical_sha256":"53b18d1834b918ddfad596216788eddbc7918fd6b838ac187691235106e974ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53b18d1834b918ddfad596216788eddbc7918fd6b838ac187691235106e974ba","first_computed_at":"2026-05-18T00:58:41.599940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.599940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nd7fvv+HdT8e/DsVUnQ84xHgH9jZaUNGro1ZO4ukHvEnoxUurUQL/QcBzs4+/mJ6qRlQi7Zgyhd4FczTmYd3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.600597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3891","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72925fe6e7f28678ebedb18a433568d876ecb08f2d5ba614940d317eff78e985","sha256:af99db6c38873b2b95930feb55443c55905cb39b3acf574f021da43296884c76"],"state_sha256":"f78a58cc8ae01cbf8624441b48ecb2d43fcc90a27a1475b91481393303a3f1a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akL4Vq+xPE6ggFTXczfZxIVh+vmgz+uwvTA9giZoWJr3n70y6AxPYHhCL+cC3N1xN0W0iRIHu79GMHyaVZndAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:12:20.033227Z","bundle_sha256":"b6a22f2969a0d68bc1396a89021b0462e36d5a43e9e049a5975c34cb9f775203"}}