{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VSF2G6EGVDGSP4V4YC4AP6VUQQ","short_pith_number":"pith:VSF2G6EG","schema_version":"1.0","canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","source":{"kind":"arxiv","id":"1209.0676","version":1},"attestation_state":"computed","paper":{"title":"Channel Assignment in Dense MC-MR Wireless Networks: Scaling Laws and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Jason Redi, Rahul Urgaonkar, Ram Ramanathan, William N. Tetteh","submitted_at":"2012-09-04T15:47:27Z","abstract_excerpt":"We investigate optimal channel assignment algorithms that maximize per node throughput in dense multichannel multi-radio (MC-MR) wireless networks. Specifically, we consider an MC-MR network where all nodes are within the transmission range of each other. This situation is encountered in many real-life settings such as students in a lecture hall, delegates attending a conference, or soldiers in a battlefield. In this scenario, we show that intelligent assignment of the available channels results in a significantly higher per node throughput. We first propose a class of channel assignment algor"},"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":"1209.0676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-09-04T15:47:27Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"3d3960b21644b543aec5c143edf357cc2d17e7b015843d909bc26be787342f65","abstract_canon_sha256":"c746046328914eca31767c2cbd483f2564fe8c65ca4605ee1643cd9a19cfb197"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.503434Z","signature_b64":"kcodNjJkAuwfovls4sTDmwId6jS4zpjypXQiDWAJTikVbrNvbh26eWsqTnhDTZVShDQZOesyiNEXHXomHHHHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","last_reissued_at":"2026-05-18T03:46:17.502732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.502732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Assignment in Dense MC-MR Wireless Networks: Scaling Laws and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Jason Redi, Rahul Urgaonkar, Ram Ramanathan, William N. Tetteh","submitted_at":"2012-09-04T15:47:27Z","abstract_excerpt":"We investigate optimal channel assignment algorithms that maximize per node throughput in dense multichannel multi-radio (MC-MR) wireless networks. Specifically, we consider an MC-MR network where all nodes are within the transmission range of each other. This situation is encountered in many real-life settings such as students in a lecture hall, delegates attending a conference, or soldiers in a battlefield. In this scenario, we show that intelligent assignment of the available channels results in a significantly higher per node throughput. We first propose a class of channel assignment algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0676","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":"1209.0676","created_at":"2026-05-18T03:46:17.502860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0676v1","created_at":"2026-05-18T03:46:17.502860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0676","created_at":"2026-05-18T03:46:17.502860+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSF2G6EGVDGS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSF2G6EGVDGSP4V4","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSF2G6EG","created_at":"2026-05-18T12:27:25.539911+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/VSF2G6EGVDGSP4V4YC4AP6VUQQ","json":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ.json","graph_json":"https://pith.science/api/pith-number/VSF2G6EGVDGSP4V4YC4AP6VUQQ/graph.json","events_json":"https://pith.science/api/pith-number/VSF2G6EGVDGSP4V4YC4AP6VUQQ/events.json","paper":"https://pith.science/paper/VSF2G6EG"},"agent_actions":{"view_html":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ","download_json":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ.json","view_paper":"https://pith.science/paper/VSF2G6EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0676&json=true","fetch_graph":"https://pith.science/api/pith-number/VSF2G6EGVDGSP4V4YC4AP6VUQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VSF2G6EGVDGSP4V4YC4AP6VUQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/action/storage_attestation","attest_author":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/action/author_attestation","sign_citation":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/action/citation_signature","submit_replication":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/action/replication_record"}},"created_at":"2026-05-18T03:46:17.502860+00:00","updated_at":"2026-05-18T03:46:17.502860+00:00"}