{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3VCW4XECZI3S2IKZXCP45M5DHJ","short_pith_number":"pith:3VCW4XEC","schema_version":"1.0","canonical_sha256":"dd456e5c82ca372d2159b89fceb3a33a67eaa5a0d57a97cf966231e5e20a1580","source":{"kind":"arxiv","id":"1408.2078","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.2078","created_at":"2026-05-18T02:45:30.370227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2078v1","created_at":"2026-05-18T02:45:30.370227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2078","created_at":"2026-05-18T02:45:30.370227+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VCW4XECZI3S","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VCW4XECZI3S2IKZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VCW4XEC","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ","json":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ.json","graph_json":"https://pith.science/api/pith-number/3VCW4XECZI3S2IKZXCP45M5DHJ/graph.json","events_json":"https://pith.science/api/pith-number/3VCW4XECZI3S2IKZXCP45M5DHJ/events.json","paper":"https://pith.science/paper/3VCW4XEC"},"agent_actions":{"view_html":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ","download_json":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ.json","view_paper":"https://pith.science/paper/3VCW4XEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2078&json=true","fetch_graph":"https://pith.science/api/pith-number/3VCW4XECZI3S2IKZXCP45M5DHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VCW4XECZI3S2IKZXCP45M5DHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/action/storage_attestation","attest_author":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/action/author_attestation","sign_citation":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/action/citation_signature","submit_replication":"https://pith.science/pith/3VCW4XECZI3S2IKZXCP45M5DHJ/action/replication_record"}},"created_at":"2026-05-18T02:45:30.370227+00:00","updated_at":"2026-05-18T02:45:30.370227+00:00"}