{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DB4QCI7ZPWAQEG47AKA4DTC5XB","short_pith_number":"pith:DB4QCI7Z","canonical_record":{"source":{"id":"1702.02634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be159fb02180d8cf1b826becd648aac4093ffc92b888c9c149f421b5e86f48d1","abstract_canon_sha256":"1ec5de6abe2cb6ca23d8a61f8fbbe58b0ec928070fdf1662c3b32aaf958b9016"},"schema_version":"1.0"},"canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","source":{"kind":"arxiv","id":"1702.02634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02634","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02634v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02634","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"DB4QCI7ZPWAQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DB4QCI7ZPWAQEG47","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DB4QCI7Z","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DB4QCI7ZPWAQEG47AKA4DTC5XB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be159fb02180d8cf1b826becd648aac4093ffc92b888c9c149f421b5e86f48d1","abstract_canon_sha256":"1ec5de6abe2cb6ca23d8a61f8fbbe58b0ec928070fdf1662c3b32aaf958b9016"},"schema_version":"1.0"},"canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.831533Z","signature_b64":"3WfLwQq5pFQD8R2LT8LoP1AG0smjwgktyQQq7VACJ/kaPCECV+uftxsYCgILqetyZHy/1LF0SHC72J3gac/ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","last_reissued_at":"2026-05-18T00:51:03.831134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.831134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02634","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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eiXtduGh5/WdcJxxV0qhrcmFzv2KYH/G3FvPl4KAsK7F930lux+hVHf8ltxUtMTsuvrT9bNaDKNcSIduKIABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:14:15.792009Z"},"content_sha256":"18a7b474ed876b5515852063f32deed3e5417e5c65fe9c7f148f77ff1f42b608","schema_version":"1.0","event_id":"sha256:18a7b474ed876b5515852063f32deed3e5417e5c65fe9c7f148f77ff1f42b608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DB4QCI7ZPWAQEG47AKA4DTC5XB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunshan Liu, Min Li, Stephen V. Hanly","submitted_at":"2017-02-08T22:04:50Z","abstract_excerpt":"Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink communication, where regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station, subject to minimum symbol error probability (SEP) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02634","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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUnS8IGdWN7aY2t2btCZSBQa6ECCfCUYJaKFAmqT0dyyWtn4dfCvVtXQFqTAvTLDq0D8kqbt+nk/6StiVuoVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:14:15.792366Z"},"content_sha256":"8ac28d06713336f3cbca85bd0197cbde07bb0ce6e143d917525d6650133a0f0b","schema_version":"1.0","event_id":"sha256:8ac28d06713336f3cbca85bd0197cbde07bb0ce6e143d917525d6650133a0f0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/bundle.json","state_url":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/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-26T23:14:15Z","links":{"resolver":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB","bundle":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/bundle.json","state":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DB4QCI7ZPWAQEG47AKA4DTC5XB","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":"1ec5de6abe2cb6ca23d8a61f8fbbe58b0ec928070fdf1662c3b32aaf958b9016","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","title_canon_sha256":"be159fb02180d8cf1b826becd648aac4093ffc92b888c9c149f421b5e86f48d1"},"schema_version":"1.0","source":{"id":"1702.02634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02634","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02634v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02634","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"DB4QCI7ZPWAQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DB4QCI7ZPWAQEG47","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DB4QCI7Z","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:8ac28d06713336f3cbca85bd0197cbde07bb0ce6e143d917525d6650133a0f0b","target":"graph","created_at":"2026-05-18T00:51:03Z","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":"Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink communication, where regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station, subject to minimum symbol error probability (SEP) ","authors_text":"Chunshan Liu, Min Li, Stephen V. Hanly","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","title":"Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02634","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:18a7b474ed876b5515852063f32deed3e5417e5c65fe9c7f148f77ff1f42b608","target":"record","created_at":"2026-05-18T00:51:03Z","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":"1ec5de6abe2cb6ca23d8a61f8fbbe58b0ec928070fdf1662c3b32aaf958b9016","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","title_canon_sha256":"be159fb02180d8cf1b826becd648aac4093ffc92b888c9c149f421b5e86f48d1"},"schema_version":"1.0","source":{"id":"1702.02634","kind":"arxiv","version":1}},"canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","first_computed_at":"2026-05-18T00:51:03.831134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.831134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3WfLwQq5pFQD8R2LT8LoP1AG0smjwgktyQQq7VACJ/kaPCECV+uftxsYCgILqetyZHy/1LF0SHC72J3gac/ACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.831533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18a7b474ed876b5515852063f32deed3e5417e5c65fe9c7f148f77ff1f42b608","sha256:8ac28d06713336f3cbca85bd0197cbde07bb0ce6e143d917525d6650133a0f0b"],"state_sha256":"b6fb7b6f62e9927ea282e9be80d2619c87a0d2624daa3667f8a326794189541e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvLFbGKDzfQU02LX1R3b0cOwG1DT+Es3tOqUehkfyX+fdj3km7ITEAq+TZXlzKHwKMyvD2Z0xzHpkZhsnwwHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T23:14:15.794165Z","bundle_sha256":"9ad5ae9cb0c170a6a10061a966c2e4e91eb656285d919cb14e2bddac65d85e58"}}