{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VSF2G6EGVDGSP4V4YC4AP6VUQQ","short_pith_number":"pith:VSF2G6EG","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"},"canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","source":{"kind":"arxiv","id":"1209.0676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0676","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0676v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0676","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"VSF2G6EGVDGS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VSF2G6EGVDGSP4V4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VSF2G6EG","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VSF2G6EGVDGSP4V4YC4AP6VUQQ","target":"record","payload":{"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"},"canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","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"},"source_kind":"arxiv","source_id":"1209.0676","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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWvgvZl6G4LEDmZA/8LX2PM/Mf7dK+M0QrrUP6yjYfj6GH28bNim6fjX4KTt5Jlf9Tb5NFHiVzw+rpZUKNe+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:08:18.653927Z"},"content_sha256":"a7a19599c3ad91d8b99a413a9734ccd401ad86f53b0ff5d79fa3df8daa7e1689","schema_version":"1.0","event_id":"sha256:a7a19599c3ad91d8b99a413a9734ccd401ad86f53b0ff5d79fa3df8daa7e1689"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VSF2G6EGVDGSP4V4YC4AP6VUQQ","target":"graph","payload":{"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"},"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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLR6UNl1+7VaxTFyaWwoGVmFoqoAr46VnwobKZaMcWq1B7AFe5V8xFq2s7CfxFPCn3RXE0ufsyJX+TBt9P+UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:08:18.654629Z"},"content_sha256":"8375c5d5f358cebad27880fa98b4fbf28801fd4d49827c7d76a1dac432b97e88","schema_version":"1.0","event_id":"sha256:8375c5d5f358cebad27880fa98b4fbf28801fd4d49827c7d76a1dac432b97e88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/bundle.json","state_url":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/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-05-19T07:08:18Z","links":{"resolver":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ","bundle":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/bundle.json","state":"https://pith.science/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSF2G6EGVDGSP4V4YC4AP6VUQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VSF2G6EGVDGSP4V4YC4AP6VUQQ","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":"c746046328914eca31767c2cbd483f2564fe8c65ca4605ee1643cd9a19cfb197","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-09-04T15:47:27Z","title_canon_sha256":"3d3960b21644b543aec5c143edf357cc2d17e7b015843d909bc26be787342f65"},"schema_version":"1.0","source":{"id":"1209.0676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0676","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0676v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0676","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"VSF2G6EGVDGS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VSF2G6EGVDGSP4V4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VSF2G6EG","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:8375c5d5f358cebad27880fa98b4fbf28801fd4d49827c7d76a1dac432b97e88","target":"graph","created_at":"2026-05-18T03:46:17Z","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 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","authors_text":"Jason Redi, Rahul Urgaonkar, Ram Ramanathan, William N. Tetteh","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-09-04T15:47:27Z","title":"Channel Assignment in Dense MC-MR Wireless Networks: Scaling Laws and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0676","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:a7a19599c3ad91d8b99a413a9734ccd401ad86f53b0ff5d79fa3df8daa7e1689","target":"record","created_at":"2026-05-18T03:46:17Z","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":"c746046328914eca31767c2cbd483f2564fe8c65ca4605ee1643cd9a19cfb197","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-09-04T15:47:27Z","title_canon_sha256":"3d3960b21644b543aec5c143edf357cc2d17e7b015843d909bc26be787342f65"},"schema_version":"1.0","source":{"id":"1209.0676","kind":"arxiv","version":1}},"canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8ba37886a8cd27f2bcc0b807fab484369e691fd2387bd6dbf623fcd6af30e7","first_computed_at":"2026-05-18T03:46:17.502732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.502732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcodNjJkAuwfovls4sTDmwId6jS4zpjypXQiDWAJTikVbrNvbh26eWsqTnhDTZVShDQZOesyiNEXHXomHHHHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.503434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7a19599c3ad91d8b99a413a9734ccd401ad86f53b0ff5d79fa3df8daa7e1689","sha256:8375c5d5f358cebad27880fa98b4fbf28801fd4d49827c7d76a1dac432b97e88"],"state_sha256":"c8e741ce9662303bca641f0354a1f78f2947b47d1460f87c6043c5ce76992862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gtH2+ZPPmAARjzaWNVwp2zIEcw4+NXr3sQXnhwpxKKanNHa+mGe0FEPZ+jVYxWVOs0y+nvfwRh0jGxaZ9WoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:08:18.657395Z","bundle_sha256":"b6981f0d49c32d8a343b385e129cc281ff595811477123f9fea0ffb2e67c3ddd"}}