{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3VCW4XECZI3S2IKZXCP45M5DHJ","short_pith_number":"pith:3VCW4XEC","canonical_record":{"source":{"id":"1408.2078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-09T10:21:11Z","cross_cats_sorted":[],"title_canon_sha256":"03aceb9f5ae49dff99a3bf79bcd01abb7ed842e722eca37ea56d46e29ccf6362","abstract_canon_sha256":"f7c2def4bd31ff5870846478c779ae23131238ccc05c80c73d52b203af2a00dd"},"schema_version":"1.0"},"canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","source":{"kind":"arxiv","id":"1408.2078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2078","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2078v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2078","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"3VCW4XECZI3S","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3VCW4XECZI3S2IKZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3VCW4XEC","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3VCW4XECZI3S2IKZXCP45M5DHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-09T10:21:11Z","cross_cats_sorted":[],"title_canon_sha256":"03aceb9f5ae49dff99a3bf79bcd01abb7ed842e722eca37ea56d46e29ccf6362","abstract_canon_sha256":"f7c2def4bd31ff5870846478c779ae23131238ccc05c80c73d52b203af2a00dd"},"schema_version":"1.0"},"canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.370732Z","signature_b64":"DE0+zOE4lQRXZ6JuWgJC3wPE9YSZsNx3qUuhm7CC6Z0qq1ElvHdFjH7gISdF28kpmkdd9pGRwwBOQJCjH9SqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","last_reissued_at":"2026-05-18T02:45:30.370121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.370121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2078","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlcpSkd2Ffe5bmqynxhJULiiNgeKZxJXaGCH5BqdBhSr/AQzdlTmN3HHPEX8BRiAhHgmjWz1X8Nvp/2bxJ0sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:25:08.737470Z"},"content_sha256":"db336647386d227ed343b965b6796de62401746250a8091e36ce34aa5dafef77","schema_version":"1.0","event_id":"sha256:db336647386d227ed343b965b6796de62401746250a8091e36ce34aa5dafef77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3VCW4XECZI3S2IKZXCP45M5DHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primary User-aware Network Coding for Multi-hop Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arsany Guirguis, Moustafa Youssef, Raymond Guirguis","submitted_at":"2014-08-09T10:21:11Z","abstract_excerpt":"Network coding has proved its efficiency in increasing the network performance for traditional ad-hoc networks. In this paper, we investigate using network coding for enhancing the throughput of multi-hop cognitive radio networks. We formulate the network coding throughput maximization problem as a graph theory problem, where different constraints and primary users' characteristics are mapped to the graph structure. We then show that the optimal solution to this problem in NP-hard and propose a heuristic algorithm to efficiently solve it.\n  Evaluation of the proposed algorithm through NS2 simu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2078","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qJ96ZC5rmxOcRzc2PvRMnCydAVLprc6crFCqTAywPmTRe0dS+GCEMAcXsji0P4iPmm3WcZW+ehe9dUiKZ9FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:25:08.737814Z"},"content_sha256":"d97342b8504da49c7469b674283eeea2148efb807b7761123e7c8a5251b142f2","schema_version":"1.0","event_id":"sha256:d97342b8504da49c7469b674283eeea2148efb807b7761123e7c8a5251b142f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/bundle.json","state_url":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/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-25T19:25:08Z","links":{"resolver":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ","bundle":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/bundle.json","state":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3VCW4XECZI3S2IKZXCP45M5DHJ","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":"f7c2def4bd31ff5870846478c779ae23131238ccc05c80c73d52b203af2a00dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-09T10:21:11Z","title_canon_sha256":"03aceb9f5ae49dff99a3bf79bcd01abb7ed842e722eca37ea56d46e29ccf6362"},"schema_version":"1.0","source":{"id":"1408.2078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2078","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2078v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2078","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"3VCW4XECZI3S","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3VCW4XECZI3S2IKZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3VCW4XEC","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:d97342b8504da49c7469b674283eeea2148efb807b7761123e7c8a5251b142f2","target":"graph","created_at":"2026-05-18T02:45:30Z","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":"Network coding has proved its efficiency in increasing the network performance for traditional ad-hoc networks. In this paper, we investigate using network coding for enhancing the throughput of multi-hop cognitive radio networks. We formulate the network coding throughput maximization problem as a graph theory problem, where different constraints and primary users' characteristics are mapped to the graph structure. We then show that the optimal solution to this problem in NP-hard and propose a heuristic algorithm to efficiently solve it.\n  Evaluation of the proposed algorithm through NS2 simu","authors_text":"Arsany Guirguis, Moustafa Youssef, Raymond Guirguis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-09T10:21:11Z","title":"Primary User-aware Network Coding for Multi-hop Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2078","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:db336647386d227ed343b965b6796de62401746250a8091e36ce34aa5dafef77","target":"record","created_at":"2026-05-18T02:45:30Z","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":"f7c2def4bd31ff5870846478c779ae23131238ccc05c80c73d52b203af2a00dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-09T10:21:11Z","title_canon_sha256":"03aceb9f5ae49dff99a3bf79bcd01abb7ed842e722eca37ea56d46e29ccf6362"},"schema_version":"1.0","source":{"id":"1408.2078","kind":"arxiv","version":1}},"canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","first_computed_at":"2026-05-18T02:45:30.370121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.370121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DE0+zOE4lQRXZ6JuWgJC3wPE9YSZsNx3qUuhm7CC6Z0qq1ElvHdFjH7gISdF28kpmkdd9pGRwwBOQJCjH9SqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.370732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db336647386d227ed343b965b6796de62401746250a8091e36ce34aa5dafef77","sha256:d97342b8504da49c7469b674283eeea2148efb807b7761123e7c8a5251b142f2"],"state_sha256":"a5f985212d3efa174e38fab5d22a3b22bbbd1fc706376c28849cac4d459d860a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqZ53GqpNDhsfcsp2jh+LUrxJp1OKGRUD3PzfO22uH3wlD+lWDmYsvm1/g7ci7ob5IO1zgdfwuvGuYNnfCwjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:25:08.739688Z","bundle_sha256":"51d5bdb0ac60ba5416fe3551f5645947f4ed7b3b2c435ceb283285048b787d27"}}