{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:MR755VUBZJNNNSQDXPTK3KYE3T","short_pith_number":"pith:MR755VUB","canonical_record":{"source":{"id":"cs/0701093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-16T02:43:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587","abstract_canon_sha256":"e407cd561ccc6c9ebb589633ea3d7697c2707e6aa7535999ca7e3a8507fae130"},"schema_version":"1.0"},"canonical_sha256":"647fded681ca5ad6ca03bbe6adab04dcf1d8394d8497026a9b33f90a2cbb39a6","source":{"kind":"arxiv","id":"cs/0701093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701093","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701093v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701093","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"MR755VUBZJNN","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MR755VUBZJNNNSQD","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MR755VUB","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:MR755VUBZJNNNSQDXPTK3KYE3T","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-16T02:43:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587","abstract_canon_sha256":"e407cd561ccc6c9ebb589633ea3d7697c2707e6aa7535999ca7e3a8507fae130"},"schema_version":"1.0"},"canonical_sha256":"647fded681ca5ad6ca03bbe6adab04dcf1d8394d8497026a9b33f90a2cbb39a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.541190Z","signature_b64":"mytJnYTsENyHW5r+SfGVdj4OQRBnuju4OG8BNUWPtjkipxxf39FSIXf3OxjhKDxuYI9xxMReAIGWXo9POr+LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647fded681ca5ad6ca03bbe6adab04dcf1d8394d8497026a9b33f90a2cbb39a6","last_reissued_at":"2026-05-18T00:58:26.540538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.540538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701093","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUGZS5PNXLmI6RUk6VURK0vgZ9ge+hyCLjMtRg/eNED9rXVUarHYcuPr8Sckzgmk5DRD2HqJxXypBmC1vM8sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:02:39.502090Z"},"content_sha256":"eef1bf8698eef2911bdb0fd5806dfddf6d3da5a558a3b25ab9bf81a1d7810dc9","schema_version":"1.0","event_id":"sha256:eef1bf8698eef2911bdb0fd5806dfddf6d3da5a558a3b25ab9bf81a1d7810dc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:MR755VUBZJNNNSQDXPTK3KYE3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Scaling Laws for Wireless Networks with Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Khandani, Masoud Ebrahimi, Mohammad Maddah-Ali","submitted_at":"2007-01-16T02:43:42Z","abstract_excerpt":"A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power allocation is allowed. By proposing a decentralized on-off power allocation strategy, a lower bound on the achievable throughput is obtained for a general fading model. In particular, under Rayleigh fading conditions the achieved sum-rate is of order $\\log n$, which is, by a constant factor, larger than what is obtained with a centralized scheme in the work o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701093","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H43cIL2dPy5hD1oWA0EHnafN6P5aF2ZpGyt4fgDG4e4HKXjiTyE74llti6goE4nSqALGq/mfinJ8xAtBVeNbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:02:39.502770Z"},"content_sha256":"c9a296821fadbc360a0e61c1915c9f77543cc734d1ab0c02d072ce44563e3234","schema_version":"1.0","event_id":"sha256:c9a296821fadbc360a0e61c1915c9f77543cc734d1ab0c02d072ce44563e3234"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MR755VUBZJNNNSQDXPTK3KYE3T/bundle.json","state_url":"https://pith.science/pith/MR755VUBZJNNNSQDXPTK3KYE3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MR755VUBZJNNNSQDXPTK3KYE3T/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-07T06:02:39Z","links":{"resolver":"https://pith.science/pith/MR755VUBZJNNNSQDXPTK3KYE3T","bundle":"https://pith.science/pith/MR755VUBZJNNNSQDXPTK3KYE3T/bundle.json","state":"https://pith.science/pith/MR755VUBZJNNNSQDXPTK3KYE3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MR755VUBZJNNNSQDXPTK3KYE3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:MR755VUBZJNNNSQDXPTK3KYE3T","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":"e407cd561ccc6c9ebb589633ea3d7697c2707e6aa7535999ca7e3a8507fae130","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-16T02:43:42Z","title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587"},"schema_version":"1.0","source":{"id":"cs/0701093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701093","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701093v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701093","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"MR755VUBZJNN","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MR755VUBZJNNNSQD","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MR755VUB","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:c9a296821fadbc360a0e61c1915c9f77543cc734d1ab0c02d072ce44563e3234","target":"graph","created_at":"2026-05-18T00:58:26Z","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":"A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power allocation is allowed. By proposing a decentralized on-off power allocation strategy, a lower bound on the achievable throughput is obtained for a general fading model. In particular, under Rayleigh fading conditions the achieved sum-rate is of order $\\log n$, which is, by a constant factor, larger than what is obtained with a centralized scheme in the work o","authors_text":"Amir Khandani, Masoud Ebrahimi, Mohammad Maddah-Ali","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-01-16T02:43:42Z","title":"Throughput Scaling Laws for Wireless Networks with Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701093","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:eef1bf8698eef2911bdb0fd5806dfddf6d3da5a558a3b25ab9bf81a1d7810dc9","target":"record","created_at":"2026-05-18T00:58:26Z","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":"e407cd561ccc6c9ebb589633ea3d7697c2707e6aa7535999ca7e3a8507fae130","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-16T02:43:42Z","title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587"},"schema_version":"1.0","source":{"id":"cs/0701093","kind":"arxiv","version":1}},"canonical_sha256":"647fded681ca5ad6ca03bbe6adab04dcf1d8394d8497026a9b33f90a2cbb39a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"647fded681ca5ad6ca03bbe6adab04dcf1d8394d8497026a9b33f90a2cbb39a6","first_computed_at":"2026-05-18T00:58:26.540538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.540538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mytJnYTsENyHW5r+SfGVdj4OQRBnuju4OG8BNUWPtjkipxxf39FSIXf3OxjhKDxuYI9xxMReAIGWXo9POr+LCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.541190Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eef1bf8698eef2911bdb0fd5806dfddf6d3da5a558a3b25ab9bf81a1d7810dc9","sha256:c9a296821fadbc360a0e61c1915c9f77543cc734d1ab0c02d072ce44563e3234"],"state_sha256":"b606566ae311b282f3fade6bebc095247f0d1684f69a76533645819e09a1deda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yG14YKdHY2r2MJiuWqHB4CuWadL5PKAfpPA7nj4k/bnQVUMc6fcBVaILdQnwdGSWP6nB/AnZg1QVQYK1dfkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:02:39.505952Z","bundle_sha256":"05a51d06da096eb52a16fc85904762a913126f78e6c0586205bb0e478b17563f"}}