{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZTPW44RQB7A73BLWFM4D76QVWB","short_pith_number":"pith:ZTPW44RQ","schema_version":"1.0","canonical_sha256":"ccdf6e72300fc1fd85762b383ffa15b0411d149dbb52bdcd2fd9ddfaf0f0fab4","source":{"kind":"arxiv","id":"1105.0215","version":1},"attestation_state":"computed","paper":{"title":"Cross-Layer Modeling of Randomly Spread CDMA Using Stochastic Network Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kashif Mahmood, Mikko Vehkaper\\\"a, Yuming Jiang","submitted_at":"2011-05-01T22:30:13Z","abstract_excerpt":"Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is, however, less well-understood. In this work, we propose a method based on stochastic network calculus and large system analysis to quantify the maximum traffic that can be carried by a multiuser CDMA network under the QoS constraints. At the physical layer, we have linear minimum-mean square error receivers and adaptive modulation and coding, while the chan"},"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":"1105.0215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-01T22:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"2db21382f39bb2e44daff5626ada1b46df5d575cb26750dde692cf7b311c2e65","abstract_canon_sha256":"31b2035ee67629514abf43de698472a0a127958c6ddee11e913f50c96ff000f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:12.285140Z","signature_b64":"fLfBsbpoRBW3IgPhrCY7ewSkAZzDX/JtRy3QgqQDuzza+yK9uXyueEStLqv0yv1MfDcc8M6x4s4OW91xL+FHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdf6e72300fc1fd85762b383ffa15b0411d149dbb52bdcd2fd9ddfaf0f0fab4","last_reissued_at":"2026-05-18T04:23:12.284660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:12.284660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Layer Modeling of Randomly Spread CDMA Using Stochastic Network Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kashif Mahmood, Mikko Vehkaper\\\"a, Yuming Jiang","submitted_at":"2011-05-01T22:30:13Z","abstract_excerpt":"Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is, however, less well-understood. In this work, we propose a method based on stochastic network calculus and large system analysis to quantify the maximum traffic that can be carried by a multiuser CDMA network under the QoS constraints. At the physical layer, we have linear minimum-mean square error receivers and adaptive modulation and coding, while the chan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0215","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":"1105.0215","created_at":"2026-05-18T04:23:12.284731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0215v1","created_at":"2026-05-18T04:23:12.284731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0215","created_at":"2026-05-18T04:23:12.284731+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTPW44RQB7A7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTPW44RQB7A73BLW","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTPW44RQ","created_at":"2026-05-18T12:26:50.516681+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/ZTPW44RQB7A73BLWFM4D76QVWB","json":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB.json","graph_json":"https://pith.science/api/pith-number/ZTPW44RQB7A73BLWFM4D76QVWB/graph.json","events_json":"https://pith.science/api/pith-number/ZTPW44RQB7A73BLWFM4D76QVWB/events.json","paper":"https://pith.science/paper/ZTPW44RQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB","download_json":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB.json","view_paper":"https://pith.science/paper/ZTPW44RQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0215&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTPW44RQB7A73BLWFM4D76QVWB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTPW44RQB7A73BLWFM4D76QVWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB/action/storage_attestation","attest_author":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB/action/author_attestation","sign_citation":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB/action/citation_signature","submit_replication":"https://pith.science/pith/ZTPW44RQB7A73BLWFM4D76QVWB/action/replication_record"}},"created_at":"2026-05-18T04:23:12.284731+00:00","updated_at":"2026-05-18T04:23:12.284731+00:00"}