{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:6CPQQ7OVDUOVSRTRF6ZHI66B47","short_pith_number":"pith:6CPQQ7OV","canonical_record":{"source":{"id":"0707.1912","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-13T02:28:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587","abstract_canon_sha256":"7175b59629e8d485315fc1b6540b1abfb4dec445cdb32865bdd6db68ba9ac0ae"},"schema_version":"1.0"},"canonical_sha256":"f09f087dd51d1d5946712fb2747bc1e7dbcaefb9cf02d7f0ddaa1b1aa3f938b7","source":{"kind":"arxiv","id":"0707.1912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.1912","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0707.1912v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1912","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"6CPQQ7OVDUOV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"6CPQQ7OVDUOVSRTR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"6CPQQ7OV","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:6CPQQ7OVDUOVSRTRF6ZHI66B47","target":"record","payload":{"canonical_record":{"source":{"id":"0707.1912","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-13T02:28:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587","abstract_canon_sha256":"7175b59629e8d485315fc1b6540b1abfb4dec445cdb32865bdd6db68ba9ac0ae"},"schema_version":"1.0"},"canonical_sha256":"f09f087dd51d1d5946712fb2747bc1e7dbcaefb9cf02d7f0ddaa1b1aa3f938b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.087976Z","signature_b64":"ygqyjUt+ut38+RMVmxETbJZxh3XActZ9z4D6iShnQ7GIgehCv/mYHh84jYylU0+VwW8YYAZ8OaOKaNyP109kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09f087dd51d1d5946712fb2747bc1e7dbcaefb9cf02d7f0ddaa1b1aa3f938b7","last_reissued_at":"2026-05-18T00:58:26.087331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.087331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.1912","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":"w8MYZoqTukxYXWjLHb7AaheArKSC9DRhlMvEmiFSQzwsXSVafxQqyIWKnwC63WTnosbiRoS1Sh/3E0RiEFXPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:14:44.291640Z"},"content_sha256":"09cefc14b140848879a44f011bfc02323f8f0cf84c63b831259b6f9df5f91dcc","schema_version":"1.0","event_id":"sha256:09cefc14b140848879a44f011bfc02323f8f0cf84c63b831259b6f9df5f91dcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:6CPQQ7OVDUOVSRTRF6ZHI66B47","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 K. Khandani, Masoud Ebrahimi, Mohammad A. Maddah-Ali","submitted_at":"2007-07-13T02:28:06Z","abstract_excerpt":"A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\\log n$ (ii) the maximum throughput is achievable in a distributed f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1912","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":"OMGX8dpx8V7dU3PL5nQRoSJoHqL93ri1L/SPCkJHhccTwU66M15oIfcO8sb2AmLOdYqiPpBCODhWaKa7p0Y+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:14:44.292436Z"},"content_sha256":"88bf23db3a2dbd863f3926675c68ff02a10030957bd0c854aba3b5094d75a2a4","schema_version":"1.0","event_id":"sha256:88bf23db3a2dbd863f3926675c68ff02a10030957bd0c854aba3b5094d75a2a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/bundle.json","state_url":"https://pith.science/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/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-31T15:14:44Z","links":{"resolver":"https://pith.science/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47","bundle":"https://pith.science/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/bundle.json","state":"https://pith.science/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CPQQ7OVDUOVSRTRF6ZHI66B47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:6CPQQ7OVDUOVSRTRF6ZHI66B47","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":"7175b59629e8d485315fc1b6540b1abfb4dec445cdb32865bdd6db68ba9ac0ae","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-13T02:28:06Z","title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587"},"schema_version":"1.0","source":{"id":"0707.1912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.1912","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0707.1912v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1912","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"6CPQQ7OVDUOV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"6CPQQ7OVDUOVSRTR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"6CPQQ7OV","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:88bf23db3a2dbd863f3926675c68ff02a10030957bd0c854aba3b5094d75a2a4","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 communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\\log n$ (ii) the maximum throughput is achievable in a distributed f","authors_text":"Amir K. Khandani, Masoud Ebrahimi, Mohammad A. Maddah-Ali","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-07-13T02:28:06Z","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":"0707.1912","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:09cefc14b140848879a44f011bfc02323f8f0cf84c63b831259b6f9df5f91dcc","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":"7175b59629e8d485315fc1b6540b1abfb4dec445cdb32865bdd6db68ba9ac0ae","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-13T02:28:06Z","title_canon_sha256":"1706299833758c17a6cddee88c31dc1af1c9dbd677d7eb7f4831949fa74cf587"},"schema_version":"1.0","source":{"id":"0707.1912","kind":"arxiv","version":1}},"canonical_sha256":"f09f087dd51d1d5946712fb2747bc1e7dbcaefb9cf02d7f0ddaa1b1aa3f938b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09f087dd51d1d5946712fb2747bc1e7dbcaefb9cf02d7f0ddaa1b1aa3f938b7","first_computed_at":"2026-05-18T00:58:26.087331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.087331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygqyjUt+ut38+RMVmxETbJZxh3XActZ9z4D6iShnQ7GIgehCv/mYHh84jYylU0+VwW8YYAZ8OaOKaNyP109kAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.087976Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.1912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09cefc14b140848879a44f011bfc02323f8f0cf84c63b831259b6f9df5f91dcc","sha256:88bf23db3a2dbd863f3926675c68ff02a10030957bd0c854aba3b5094d75a2a4"],"state_sha256":"2a2737ddf0e48fbcf840640babe11943fdabf5e77276018bb8e388d6df096bfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIYqJan8BbiMoF9nV0VeKQXCh82mb4bP3/AXkPr1RL0+U/Wvo2itkDIhHVx5coIdMTvD7P4CqmCPr4pc/cCVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:14:44.296482Z","bundle_sha256":"32f6d84412aa855106390fa4732abd17037ed3d1d8c6d62fc98ab262ee263639"}}