{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E5T3Y2PXFJNUIF74UHLRBSOODM","short_pith_number":"pith:E5T3Y2PX","schema_version":"1.0","canonical_sha256":"2767bc69f72a5b4417fca1d710c9ce1b3cc2798cdecb4f6adcb9b270adacb8dc","source":{"kind":"arxiv","id":"1404.1995","version":1},"attestation_state":"computed","paper":{"title":"Channel assignment for throughput maximization in cognitive radio networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Le Thanh Tan, Long Bao Le","submitted_at":"2014-04-08T03:17:58Z","abstract_excerpt":"In this paper, we consider the channel allocation problem for throughput maximization in cognitive radio networks with hardware-constrained secondary users. Specifically, we assume that secondary users exploit spectrum holes on a set of channels where each secondary user can use at most one available channel for communication. We develop two channel assignment algorithms that can efficiently utilize spectrum opportunities on these channels. In the first algorithm, secondary users are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the nu"},"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":"1404.1995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-08T03:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"b3faf3b7219e60bd6646d51e132649013ba407d098e24860f4d4d274725cef82","abstract_canon_sha256":"2392e71480f9af49de4dcc8604facbaf6b2b1a659d9d5a294aed2fd7884bdb1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:38.832875Z","signature_b64":"VYIkuUcd6+bS2iXhhDceUchFSy+TYJxT01VsfgPkEOPCZyI0h9J3O2suAdP0JrydCwb9yBAZElTGpRRYLn2hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2767bc69f72a5b4417fca1d710c9ce1b3cc2798cdecb4f6adcb9b270adacb8dc","last_reissued_at":"2026-05-18T02:54:38.832339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:38.832339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel assignment for throughput maximization in cognitive radio networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Le Thanh Tan, Long Bao Le","submitted_at":"2014-04-08T03:17:58Z","abstract_excerpt":"In this paper, we consider the channel allocation problem for throughput maximization in cognitive radio networks with hardware-constrained secondary users. Specifically, we assume that secondary users exploit spectrum holes on a set of channels where each secondary user can use at most one available channel for communication. We develop two channel assignment algorithms that can efficiently utilize spectrum opportunities on these channels. In the first algorithm, secondary users are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1995","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":"1404.1995","created_at":"2026-05-18T02:54:38.832443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1995v1","created_at":"2026-05-18T02:54:38.832443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1995","created_at":"2026-05-18T02:54:38.832443+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5T3Y2PXFJNU","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5T3Y2PXFJNUIF74","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5T3Y2PX","created_at":"2026-05-18T12:28:25.294606+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/E5T3Y2PXFJNUIF74UHLRBSOODM","json":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM.json","graph_json":"https://pith.science/api/pith-number/E5T3Y2PXFJNUIF74UHLRBSOODM/graph.json","events_json":"https://pith.science/api/pith-number/E5T3Y2PXFJNUIF74UHLRBSOODM/events.json","paper":"https://pith.science/paper/E5T3Y2PX"},"agent_actions":{"view_html":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM","download_json":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM.json","view_paper":"https://pith.science/paper/E5T3Y2PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1995&json=true","fetch_graph":"https://pith.science/api/pith-number/E5T3Y2PXFJNUIF74UHLRBSOODM/graph.json","fetch_events":"https://pith.science/api/pith-number/E5T3Y2PXFJNUIF74UHLRBSOODM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM/action/storage_attestation","attest_author":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM/action/author_attestation","sign_citation":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM/action/citation_signature","submit_replication":"https://pith.science/pith/E5T3Y2PXFJNUIF74UHLRBSOODM/action/replication_record"}},"created_at":"2026-05-18T02:54:38.832443+00:00","updated_at":"2026-05-18T02:54:38.832443+00:00"}