{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AEBWSW2UD54AEA4O355LLUZMPU","short_pith_number":"pith:AEBWSW2U","schema_version":"1.0","canonical_sha256":"0103695b541f7802038edf7ab5d32c7d099c4cc0f89162017a2931a9c00d032a","source":{"kind":"arxiv","id":"1705.03326","version":1},"attestation_state":"computed","paper":{"title":"Low-Density Code-Domain NOMA: Better Be Regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin M. Zaidel, Ori Shental, Shlomo Shamai","submitted_at":"2017-05-09T13:36:27Z","abstract_excerpt":"A closed-form analytical expression is derived for the limiting empirical squared singular value density of a spreading (signature) matrix corresponding to sparse low-density code-domain (LDCD) non-orthogonal multiple-access (NOMA) with regular random user-resource allocation. The derivation relies on associating the spreading matrix with the adjacency matrix of a large semiregular bipartite graph. For a simple repetition-based sparse spreading scheme, the result directly follows from a rigorous analysis of spectral measures of infinite graphs. Turning to random (sparse) binary spreading, we h"},"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":"1705.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T13:36:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b03113868151f18b13fad228628ac223ee65a94cfec80f3fdc2da261f376fc89","abstract_canon_sha256":"3960148e932a35ba03c2adc092bb1711716f13e3f7a4b2c0e46141b5e182ed58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:48.257894Z","signature_b64":"M0zO0qhaDXsLZHfCD5Gz6/5TLhPB6VF3mqWKTmjfXtsCSVKLW8Re97JXO5gQEATgS6gx0Ldkytj2V9nUsIwUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0103695b541f7802038edf7ab5d32c7d099c4cc0f89162017a2931a9c00d032a","last_reissued_at":"2026-05-18T00:44:48.257337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:48.257337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Density Code-Domain NOMA: Better Be Regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin M. Zaidel, Ori Shental, Shlomo Shamai","submitted_at":"2017-05-09T13:36:27Z","abstract_excerpt":"A closed-form analytical expression is derived for the limiting empirical squared singular value density of a spreading (signature) matrix corresponding to sparse low-density code-domain (LDCD) non-orthogonal multiple-access (NOMA) with regular random user-resource allocation. The derivation relies on associating the spreading matrix with the adjacency matrix of a large semiregular bipartite graph. For a simple repetition-based sparse spreading scheme, the result directly follows from a rigorous analysis of spectral measures of infinite graphs. Turning to random (sparse) binary spreading, we h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03326","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":"1705.03326","created_at":"2026-05-18T00:44:48.257415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03326v1","created_at":"2026-05-18T00:44:48.257415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03326","created_at":"2026-05-18T00:44:48.257415+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEBWSW2UD54A","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEBWSW2UD54AEA4O","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEBWSW2U","created_at":"2026-05-18T12:31:05.417338+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/AEBWSW2UD54AEA4O355LLUZMPU","json":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU.json","graph_json":"https://pith.science/api/pith-number/AEBWSW2UD54AEA4O355LLUZMPU/graph.json","events_json":"https://pith.science/api/pith-number/AEBWSW2UD54AEA4O355LLUZMPU/events.json","paper":"https://pith.science/paper/AEBWSW2U"},"agent_actions":{"view_html":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU","download_json":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU.json","view_paper":"https://pith.science/paper/AEBWSW2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03326&json=true","fetch_graph":"https://pith.science/api/pith-number/AEBWSW2UD54AEA4O355LLUZMPU/graph.json","fetch_events":"https://pith.science/api/pith-number/AEBWSW2UD54AEA4O355LLUZMPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU/action/storage_attestation","attest_author":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU/action/author_attestation","sign_citation":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU/action/citation_signature","submit_replication":"https://pith.science/pith/AEBWSW2UD54AEA4O355LLUZMPU/action/replication_record"}},"created_at":"2026-05-18T00:44:48.257415+00:00","updated_at":"2026-05-18T00:44:48.257415+00:00"}