{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I4357COJGRP6UH73P3634VTUZM","short_pith_number":"pith:I4357COJ","canonical_record":{"source":{"id":"1410.8366","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T13:21:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b5c04145dbfbf71139d786aa4d928e34180005db86b2e6180fb11b0e3b2d3d7","abstract_canon_sha256":"42c0e9c0dcaa76f6f42a0ef50957f001b22c2d48ef534cd3ea3d053d79e9ff77"},"schema_version":"1.0"},"canonical_sha256":"4737df89c9345fea1ffb7efdbe5674cb303b1d31877e3000739c209232f78b8f","source":{"kind":"arxiv","id":"1410.8366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8366","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8366v2","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8366","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"I4357COJGRP6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I4357COJGRP6UH73","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I4357COJ","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I4357COJGRP6UH73P3634VTUZM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8366","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T13:21:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b5c04145dbfbf71139d786aa4d928e34180005db86b2e6180fb11b0e3b2d3d7","abstract_canon_sha256":"42c0e9c0dcaa76f6f42a0ef50957f001b22c2d48ef534cd3ea3d053d79e9ff77"},"schema_version":"1.0"},"canonical_sha256":"4737df89c9345fea1ffb7efdbe5674cb303b1d31877e3000739c209232f78b8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:51.476196Z","signature_b64":"F0J6F2ETemhvPjumxGWwBlSIuN01cJuDD9LWi6MpWCLQn6G1Vq1/i3o11437U4YsaLtVpmpE4HBqUlGvdBUCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4737df89c9345fea1ffb7efdbe5674cb303b1d31877e3000739c209232f78b8f","last_reissued_at":"2026-05-18T00:53:51.475664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:51.475664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8366","source_version":2,"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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKDysvLiJTP9Unv+93rAOWUa+Gl0WQ7pke4oGhYRgzqa6bNWXM6YKL00MGwX7xye7Xkv0uNsF/IKb8ppgD1cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:24:08.930790Z"},"content_sha256":"1c9cb5d824edb77387d1ec5d044c458f3cdd88ed4afa4f6647cc4d81695676fa","schema_version":"1.0","event_id":"sha256:1c9cb5d824edb77387d1ec5d044c458f3cdd88ed4afa4f6647cc4d81695676fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I4357COJGRP6UH73P3634VTUZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farokh Marvasti, Mohammad Ali Sedaghat, Ralf M\\\"uller","submitted_at":"2014-10-30T13:21:34Z","abstract_excerpt":"We extend the result by Tse and Verd\\'{u} on the optimum asymptotic multiuser efficiency of randomly spread CDMA with Binary Phase Shift Keying (BPSK) input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a $K$-user system with spreading gain $N$ when $K$ and $N\\rightarrow\\infty$ and the loading factor, $\\frac{K}{N}$, grows logarithmically with $K$ under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8366","kind":"arxiv","version":2},"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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdIt1O8HuAFZCeELZwWq4Yl8Tvz4E4zNcqb8lyvWgn1+I2KGaE+Ode+wQ14eJl0Ve0shbgfaeq8xlB20MO/rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:24:08.931147Z"},"content_sha256":"5b57401c112e6f81de6048a600d2b72a54aa758d4cdc3452178d5a655d7fb1b6","schema_version":"1.0","event_id":"sha256:5b57401c112e6f81de6048a600d2b72a54aa758d4cdc3452178d5a655d7fb1b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4357COJGRP6UH73P3634VTUZM/bundle.json","state_url":"https://pith.science/pith/I4357COJGRP6UH73P3634VTUZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4357COJGRP6UH73P3634VTUZM/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-05T16:24:08Z","links":{"resolver":"https://pith.science/pith/I4357COJGRP6UH73P3634VTUZM","bundle":"https://pith.science/pith/I4357COJGRP6UH73P3634VTUZM/bundle.json","state":"https://pith.science/pith/I4357COJGRP6UH73P3634VTUZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4357COJGRP6UH73P3634VTUZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I4357COJGRP6UH73P3634VTUZM","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":"42c0e9c0dcaa76f6f42a0ef50957f001b22c2d48ef534cd3ea3d053d79e9ff77","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T13:21:34Z","title_canon_sha256":"7b5c04145dbfbf71139d786aa4d928e34180005db86b2e6180fb11b0e3b2d3d7"},"schema_version":"1.0","source":{"id":"1410.8366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8366","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8366v2","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8366","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"I4357COJGRP6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I4357COJGRP6UH73","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I4357COJ","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:5b57401c112e6f81de6048a600d2b72a54aa758d4cdc3452178d5a655d7fb1b6","target":"graph","created_at":"2026-05-18T00:53:51Z","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 extend the result by Tse and Verd\\'{u} on the optimum asymptotic multiuser efficiency of randomly spread CDMA with Binary Phase Shift Keying (BPSK) input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a $K$-user system with spreading gain $N$ when $K$ and $N\\rightarrow\\infty$ and the loading factor, $\\frac{K}{N}$, grows logarithmically with $K$ under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal t","authors_text":"Farokh Marvasti, Mohammad Ali Sedaghat, Ralf M\\\"uller","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T13:21:34Z","title":"On Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8366","kind":"arxiv","version":2},"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:1c9cb5d824edb77387d1ec5d044c458f3cdd88ed4afa4f6647cc4d81695676fa","target":"record","created_at":"2026-05-18T00:53:51Z","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":"42c0e9c0dcaa76f6f42a0ef50957f001b22c2d48ef534cd3ea3d053d79e9ff77","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T13:21:34Z","title_canon_sha256":"7b5c04145dbfbf71139d786aa4d928e34180005db86b2e6180fb11b0e3b2d3d7"},"schema_version":"1.0","source":{"id":"1410.8366","kind":"arxiv","version":2}},"canonical_sha256":"4737df89c9345fea1ffb7efdbe5674cb303b1d31877e3000739c209232f78b8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4737df89c9345fea1ffb7efdbe5674cb303b1d31877e3000739c209232f78b8f","first_computed_at":"2026-05-18T00:53:51.475664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:51.475664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F0J6F2ETemhvPjumxGWwBlSIuN01cJuDD9LWi6MpWCLQn6G1Vq1/i3o11437U4YsaLtVpmpE4HBqUlGvdBUCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:51.476196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c9cb5d824edb77387d1ec5d044c458f3cdd88ed4afa4f6647cc4d81695676fa","sha256:5b57401c112e6f81de6048a600d2b72a54aa758d4cdc3452178d5a655d7fb1b6"],"state_sha256":"6f9ad160c8c125910f32f1615278c0306eabd344fbbcb317e11f88de580e131f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sluhjSxnK32Soz6D9J5hoIOdleqn7i2VGampvUornxaTJFGrcIK2PsAqIdIb1YGRGeY9SsyBDp7YDUTqIRjzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:24:08.933163Z","bundle_sha256":"89d54ba7f1fa7d0cd24d436c29b0532186f4ac4fd4ba02015f758c28258d2ee8"}}