{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:674ZYYZLEJSYYHPUGHL57QKQT6","short_pith_number":"pith:674ZYYZL","canonical_record":{"source":{"id":"1211.3666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-15T17:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"5de9edb9d13b80ca2b822b96fc578c49a510cad7b503281fdab10c89f14cb4c2","abstract_canon_sha256":"69c01ac738b9e76004c080bdb6808633e3d9ae3ff3d369c3b65b0fccfcc2b434"},"schema_version":"1.0"},"canonical_sha256":"f7f99c632b22658c1df431d7dfc1509f86ee6ca811d3ffb426c914fe29435731","source":{"kind":"arxiv","id":"1211.3666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3666","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3666v1","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3666","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"674ZYYZLEJSY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"674ZYYZLEJSYYHPU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"674ZYYZL","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:674ZYYZLEJSYYHPUGHL57QKQT6","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-15T17:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"5de9edb9d13b80ca2b822b96fc578c49a510cad7b503281fdab10c89f14cb4c2","abstract_canon_sha256":"69c01ac738b9e76004c080bdb6808633e3d9ae3ff3d369c3b65b0fccfcc2b434"},"schema_version":"1.0"},"canonical_sha256":"f7f99c632b22658c1df431d7dfc1509f86ee6ca811d3ffb426c914fe29435731","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:39.119674Z","signature_b64":"VInECggKGhIXAp4igor9r7FUVBGSebAp3o5Dim7eDPGvyoZFJ1Bt0dp6ulJgLj7cEAoOOd1Jyh5YBwwjmd7ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f99c632b22658c1df431d7dfc1509f86ee6ca811d3ffb426c914fe29435731","last_reissued_at":"2026-05-18T03:40:39.118875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:39.118875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3666","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-18T03:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ucL1VDOOvU5Tx3MT8UQDNkeMLvm9J2XxOi0COQr0pXJCqcMbAFxuig4n9cd84h5B+B7T3r/XTSG+GljazWFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:41:02.714967Z"},"content_sha256":"86a541d2315aa4e376b0d5f6c49fd2e2e0015f46d5601ed3481543e7b157a973","schema_version":"1.0","event_id":"sha256:86a541d2315aa4e376b0d5f6c49fd2e2e0015f46d5601ed3481543e7b157a973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:674ZYYZLEJSYYHPUGHL57QKQT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing System Throughput Using Cooperative Sensing in Multi-Channel Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eylem Ekici, Ness B. Shroff, Shuang Li, Zizhan Zheng","submitted_at":"2012-11-15T17:22:33Z","abstract_excerpt":"In Cognitive Radio Networks (CRNs), unlicensed users are allowed to access the licensed spectrum when it is not currently being used by primary users (PUs). In this paper, we study the throughput maximization problem for a multi-channel CRN where each SU can only sense a limited number of channels. We show that this problem is strongly NP-hard, and propose an approximation algorithm with a factor at least $1/2\\mu$ where $\\mu \\in [1,2]$ is a system parameter reflecting the sensing capability of SUs across channels and their sensing budgets. This performance guarantee is achieved by exploiting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3666","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-18T03:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+DtxIOwqtWZ4Uod8orZMdUCsfqZ0lEZDnE4vlkDvSLD19Je2mI/mU7BNcEHmI+DfV6lUUbylFqyIaC6/yvECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:41:02.715309Z"},"content_sha256":"a30a26cf331393f252c603205387aea668413c70b416d313215058876f8209eb","schema_version":"1.0","event_id":"sha256:a30a26cf331393f252c603205387aea668413c70b416d313215058876f8209eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/674ZYYZLEJSYYHPUGHL57QKQT6/bundle.json","state_url":"https://pith.science/pith/674ZYYZLEJSYYHPUGHL57QKQT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/674ZYYZLEJSYYHPUGHL57QKQT6/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-11T09:41:02Z","links":{"resolver":"https://pith.science/pith/674ZYYZLEJSYYHPUGHL57QKQT6","bundle":"https://pith.science/pith/674ZYYZLEJSYYHPUGHL57QKQT6/bundle.json","state":"https://pith.science/pith/674ZYYZLEJSYYHPUGHL57QKQT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/674ZYYZLEJSYYHPUGHL57QKQT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:674ZYYZLEJSYYHPUGHL57QKQT6","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":"69c01ac738b9e76004c080bdb6808633e3d9ae3ff3d369c3b65b0fccfcc2b434","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-15T17:22:33Z","title_canon_sha256":"5de9edb9d13b80ca2b822b96fc578c49a510cad7b503281fdab10c89f14cb4c2"},"schema_version":"1.0","source":{"id":"1211.3666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3666","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3666v1","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3666","created_at":"2026-05-18T03:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"674ZYYZLEJSY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"674ZYYZLEJSYYHPU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"674ZYYZL","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:a30a26cf331393f252c603205387aea668413c70b416d313215058876f8209eb","target":"graph","created_at":"2026-05-18T03:40: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":"In Cognitive Radio Networks (CRNs), unlicensed users are allowed to access the licensed spectrum when it is not currently being used by primary users (PUs). In this paper, we study the throughput maximization problem for a multi-channel CRN where each SU can only sense a limited number of channels. We show that this problem is strongly NP-hard, and propose an approximation algorithm with a factor at least $1/2\\mu$ where $\\mu \\in [1,2]$ is a system parameter reflecting the sensing capability of SUs across channels and their sensing budgets. This performance guarantee is achieved by exploiting a","authors_text":"Eylem Ekici, Ness B. Shroff, Shuang Li, Zizhan Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-15T17:22:33Z","title":"Maximizing System Throughput Using Cooperative Sensing in Multi-Channel Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3666","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:86a541d2315aa4e376b0d5f6c49fd2e2e0015f46d5601ed3481543e7b157a973","target":"record","created_at":"2026-05-18T03:40: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":"69c01ac738b9e76004c080bdb6808633e3d9ae3ff3d369c3b65b0fccfcc2b434","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-15T17:22:33Z","title_canon_sha256":"5de9edb9d13b80ca2b822b96fc578c49a510cad7b503281fdab10c89f14cb4c2"},"schema_version":"1.0","source":{"id":"1211.3666","kind":"arxiv","version":1}},"canonical_sha256":"f7f99c632b22658c1df431d7dfc1509f86ee6ca811d3ffb426c914fe29435731","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7f99c632b22658c1df431d7dfc1509f86ee6ca811d3ffb426c914fe29435731","first_computed_at":"2026-05-18T03:40:39.118875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:39.118875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VInECggKGhIXAp4igor9r7FUVBGSebAp3o5Dim7eDPGvyoZFJ1Bt0dp6ulJgLj7cEAoOOd1Jyh5YBwwjmd7ZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:39.119674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86a541d2315aa4e376b0d5f6c49fd2e2e0015f46d5601ed3481543e7b157a973","sha256:a30a26cf331393f252c603205387aea668413c70b416d313215058876f8209eb"],"state_sha256":"37d70621395c4a246c69dce17425c4656947a9dcf500b9f3ebfe7982d9181a44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Y2uLElIUApKmStL/0VTsoq1GLZEvkNPDwfGxY7dHa9b8/CFVosMIjCDnHyise+x8fQ6v7XAAJzn/9v6wnwlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:41:02.717197Z","bundle_sha256":"eecaa2f5fa504b207ac16a09564c97097a51eae735e6757e79e4e56c2936becd"}}