{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HYR25Y3YN76KOYGMQTKOO742ZQ","short_pith_number":"pith:HYR25Y3Y","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"},"canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","source":{"kind":"arxiv","id":"1404.1908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1908","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1908v1","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1908","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"HYR25Y3YN76K","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HYR25Y3YN76KOYGM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HYR25Y3Y","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HYR25Y3YN76KOYGMQTKOO742ZQ","target":"record","payload":{"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"},"canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","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"},"source_kind":"arxiv","source_id":"1404.1908","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:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7H3XH24jtq+oH8slepVg6OMuuLmM/cjNSSLjTbOe2Q038XUm0VHhqerCfxtTpZw21FADO/oZBhmfobNqBn9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:15:35.571964Z"},"content_sha256":"25a71a5543fb9f23db6a59caa31aa64dc895aaf84521bd96d2ba5cbde518ed6a","schema_version":"1.0","event_id":"sha256:25a71a5543fb9f23db6a59caa31aa64dc895aaf84521bd96d2ba5cbde518ed6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HYR25Y3YN76KOYGMQTKOO742ZQ","target":"graph","payload":{"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"},"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:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0xlUo/FwUr1zdduXeazcfABmcHe+Zo4oYckGQt9wvaQ8QTSv/2LKN7Og/QiQVowrQw16khCfWeJRg1KhyqvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:15:35.572520Z"},"content_sha256":"8ad3d12c9a61e621b6681495070c80fe572953a61e3a9957eec0828a695edb88","schema_version":"1.0","event_id":"sha256:8ad3d12c9a61e621b6681495070c80fe572953a61e3a9957eec0828a695edb88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/bundle.json","state_url":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/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-12T09:15:35Z","links":{"resolver":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ","bundle":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/bundle.json","state":"https://pith.science/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYR25Y3YN76KOYGMQTKOO742ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HYR25Y3YN76KOYGMQTKOO742ZQ","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":"740b141931716bbd96cdf84a7b0e4a771393b30f3cd47e7f25cff6e13381bd01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-07T07:51:30Z","title_canon_sha256":"c1344dd8837469cd42ee004ebc59d3ef8e7b6ac3060552f7990b76491643217b"},"schema_version":"1.0","source":{"id":"1404.1908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1908","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1908v1","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1908","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"HYR25Y3YN76K","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HYR25Y3YN76KOYGM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HYR25Y3Y","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:8ad3d12c9a61e621b6681495070c80fe572953a61e3a9957eec0828a695edb88","target":"graph","created_at":"2026-05-18T02:54:39Z","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":"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","authors_text":"Le Thanh Tan, Long Bao Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-07T07:51:30Z","title":"Fair channel allocation and access design for cognitive ad hoc networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1908","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:25a71a5543fb9f23db6a59caa31aa64dc895aaf84521bd96d2ba5cbde518ed6a","target":"record","created_at":"2026-05-18T02:54:39Z","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":"740b141931716bbd96cdf84a7b0e4a771393b30f3cd47e7f25cff6e13381bd01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-07T07:51:30Z","title_canon_sha256":"c1344dd8837469cd42ee004ebc59d3ef8e7b6ac3060552f7990b76491643217b"},"schema_version":"1.0","source":{"id":"1404.1908","kind":"arxiv","version":1}},"canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e23aee3786ffca760cc84d4e77f9acc0fb45224b660c2c1dd3ded3ba750eaa6","first_computed_at":"2026-05-18T02:54:39.022154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:39.022154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BnIi9146rGhIwEfYxfGRKUPnfkZZMbIU7ZuxEBj1RjsijBDSiMl9wTkTN3JqGcze2i5aPWfU/Ao39evSxmxKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:39.022740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25a71a5543fb9f23db6a59caa31aa64dc895aaf84521bd96d2ba5cbde518ed6a","sha256:8ad3d12c9a61e621b6681495070c80fe572953a61e3a9957eec0828a695edb88"],"state_sha256":"190376c0ecb1c6678b3a7d80aa22d617f70dd1a576ec35c2dbe7481913ace34d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdDFj1aGHz7E2QyzSxdM81AfAZ/3obSIGDUq4obULV3s7T8AcRByha4BBapiPXnv2aI1CgBWrasOYM+jiUFuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:15:35.575134Z","bundle_sha256":"272c7d7fc88968270420275580babe182be078fce5a0cb402577beed2186ba7c"}}