{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NXHXLYPF35TRPSCZKOY7I27BT3","short_pith_number":"pith:NXHXLYPF","schema_version":"1.0","canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","source":{"kind":"arxiv","id":"1111.5200","version":2},"attestation_state":"computed","paper":{"title":"Wireless Capacity and Admission Control in Cognitive Radio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-11-22T14:08:44Z","abstract_excerpt":"We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum se"},"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":"1111.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"881cabb8f86be9f796598f1382195de73614e3475a176b5f8e22713b1ee973d8","abstract_canon_sha256":"73ca5b536e8b3ad93b3b0ddbb530bc9551844c7760aeead796bf644aa123cabc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:16.684960Z","signature_b64":"AaWyrdE+X2/D/MD/9pjR75DxZF66hup61s531zoa8fXr1Yj6SyQGXVSoU8TSPJ5K7GHHiX+DGSkKJXBC9WvZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","last_reissued_at":"2026-05-18T04:04:16.684162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:16.684162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wireless Capacity and Admission Control in Cognitive Radio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-11-22T14:08:44Z","abstract_excerpt":"We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5200","kind":"arxiv","version":2},"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":"1111.5200","created_at":"2026-05-18T04:04:16.684271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5200v2","created_at":"2026-05-18T04:04:16.684271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5200","created_at":"2026-05-18T04:04:16.684271+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXHXLYPF35TR","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXHXLYPF35TRPSCZ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXHXLYPF","created_at":"2026-05-18T12:26:37.096874+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/NXHXLYPF35TRPSCZKOY7I27BT3","json":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3.json","graph_json":"https://pith.science/api/pith-number/NXHXLYPF35TRPSCZKOY7I27BT3/graph.json","events_json":"https://pith.science/api/pith-number/NXHXLYPF35TRPSCZKOY7I27BT3/events.json","paper":"https://pith.science/paper/NXHXLYPF"},"agent_actions":{"view_html":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3","download_json":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3.json","view_paper":"https://pith.science/paper/NXHXLYPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5200&json=true","fetch_graph":"https://pith.science/api/pith-number/NXHXLYPF35TRPSCZKOY7I27BT3/graph.json","fetch_events":"https://pith.science/api/pith-number/NXHXLYPF35TRPSCZKOY7I27BT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/action/storage_attestation","attest_author":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/action/author_attestation","sign_citation":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/action/citation_signature","submit_replication":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/action/replication_record"}},"created_at":"2026-05-18T04:04:16.684271+00:00","updated_at":"2026-05-18T04:04:16.684271+00:00"}