{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TGACKFI54DZ5ZEFFDWLTGI7BQR","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":"d990ff5e153f26f66a0941676eec1da8c1850735fbafb50e1b29df3e48fd2f61","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-07T07:36:43Z","title_canon_sha256":"8e88b7e2faa6ff2ffdec51578316d263b9851330679790bab6bec6115e6cfaa6"},"schema_version":"1.0","source":{"id":"1404.1674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1674","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1674v1","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1674","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"pith_short_12","alias_value":"TGACKFI54DZ5","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TGACKFI54DZ5ZEFF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TGACKFI5","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:535ea47c9212dd3145e714acc45a869471856e433962cbfb661e5b9a6fd2519d","target":"graph","created_at":"2026-05-18T02:54:45Z","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 channel assignment problem for cognitive radio networks with hardware-constrained secondary users (SUs). In particular, we assume that SUs exploit spectrum holes on a set of channels where each SU can use at most one available channel for communication. We present the optimal brute-force search algorithm to solve the corresponding nonlinear integer optimization problem and analyze its complexity. Because the optimal solution has exponential complexity with the numbers of channels and SUs, we develop two low-complexity channel assignment algorithms that can effici","authors_text":"Le Thanh Tan, Long Bao Le","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-07T07:36:43Z","title":"Channel Assignment With Access Contention Resolution for Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1674","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:5f05a9aa58fa306b7101d87ab8620431e831751a1347dd7af5aec376db40a03c","target":"record","created_at":"2026-05-18T02:54:45Z","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":"d990ff5e153f26f66a0941676eec1da8c1850735fbafb50e1b29df3e48fd2f61","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-07T07:36:43Z","title_canon_sha256":"8e88b7e2faa6ff2ffdec51578316d263b9851330679790bab6bec6115e6cfaa6"},"schema_version":"1.0","source":{"id":"1404.1674","kind":"arxiv","version":1}},"canonical_sha256":"998025151de0f3dc90a51d973323e18459abd8c7311c2818c407c37647f81895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"998025151de0f3dc90a51d973323e18459abd8c7311c2818c407c37647f81895","first_computed_at":"2026-05-18T02:54:45.791248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:45.791248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6RBL9QM304cKDCZmD2ZDGm40M4b/Vo0bIrKqwpjNWt98JMoliSd/ckdy6PCP32NxBixH9iCnCrop83pJH4RPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:45.791664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f05a9aa58fa306b7101d87ab8620431e831751a1347dd7af5aec376db40a03c","sha256:535ea47c9212dd3145e714acc45a869471856e433962cbfb661e5b9a6fd2519d"],"state_sha256":"9917ab9198ec0d4cf09d49e86388b018b1d521c0b0a1bc9c6204e130b1e460d8"}