{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HYR25Y3YN76KOYGMQTKOO742ZQ","short_pith_number":"pith:HYR25Y3Y","schema_version":"1.0","canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","source":{"kind":"arxiv","id":"1404.1908","version":1},"attestation_state":"computed","paper":{"title":"Fair channel allocation and access design for cognitive ad hoc 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-07T07:51:30Z","abstract_excerpt":"We investigate the fair channel assignment and access design problem for cognitive radio ad hoc network in this paper. In particular, we consider a scenario where ad hoc network nodes have hardware constraints which allow them to access at most one channel at any time. We investigate a fair channel allocation problem where each node is allocated a subset of channels which are sensed and accessed periodically by their owners by using a MAC protocol. Toward this end, we analyze the complexity of the optimal brute-force search algorithm which finds the optimal solution for this NP-hard problem. W"},"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.1908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-07T07:51:30Z","cross_cats_sorted":[],"title_canon_sha256":"c1344dd8837469cd42ee004ebc59d3ef8e7b6ac3060552f7990b76491643217b","abstract_canon_sha256":"740b141931716bbd96cdf84a7b0e4a771393b30f3cd47e7f25cff6e13381bd01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:39.022740Z","signature_b64":"BnIi9146rGhIwEfYxfGRKUPnfkZZMbIU7ZuxEBj1RjsijBDSiMl9wTkTN3JqGcze2i5aPWfU/Ao39evSxmxKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","last_reissued_at":"2026-05-18T02:54:39.022154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:39.022154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair channel allocation and access design for cognitive ad hoc 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-07T07:51:30Z","abstract_excerpt":"We investigate the fair channel assignment and access design problem for cognitive radio ad hoc network in this paper. In particular, we consider a scenario where ad hoc network nodes have hardware constraints which allow them to access at most one channel at any time. We investigate a fair channel allocation problem where each node is allocated a subset of channels which are sensed and accessed periodically by their owners by using a MAC protocol. Toward this end, we analyze the complexity of the optimal brute-force search algorithm which finds the optimal solution for this NP-hard problem. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1908","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.1908","created_at":"2026-05-18T02:54:39.022247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1908v1","created_at":"2026-05-18T02:54:39.022247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1908","created_at":"2026-05-18T02:54:39.022247+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYR25Y3YN76K","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYR25Y3YN76KOYGM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYR25Y3Y","created_at":"2026-05-18T12:28:33.132498+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/HYR25Y3YN76KOYGMQTKOO742ZQ","json":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ.json","graph_json":"https://pith.science/api/pith-number/HYR25Y3YN76KOYGMQTKOO742ZQ/graph.json","events_json":"https://pith.science/api/pith-number/HYR25Y3YN76KOYGMQTKOO742ZQ/events.json","paper":"https://pith.science/paper/HYR25Y3Y"},"agent_actions":{"view_html":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ","download_json":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ.json","view_paper":"https://pith.science/paper/HYR25Y3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1908&json=true","fetch_graph":"https://pith.science/api/pith-number/HYR25Y3YN76KOYGMQTKOO742ZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HYR25Y3YN76KOYGMQTKOO742ZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/action/storage_attestation","attest_author":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/action/author_attestation","sign_citation":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/action/citation_signature","submit_replication":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/action/replication_record"}},"created_at":"2026-05-18T02:54:39.022247+00:00","updated_at":"2026-05-18T02:54:39.022247+00:00"}