{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UI6XWJVU3AU6T3VUIZJM5DTDWQ","short_pith_number":"pith:UI6XWJVU","schema_version":"1.0","canonical_sha256":"a23d7b26b4d829e9eeb44652ce8e63b419aa8df3ca67cec95e13894d7a499c33","source":{"kind":"arxiv","id":"1602.03936","version":1},"attestation_state":"computed","paper":{"title":"Study of Interference Cancellation and Relay Selection Algorithms Using Greedy Techniques for Cooperative DS-CDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Gu, R. C. de Lamare","submitted_at":"2016-02-12T00:46:51Z","abstract_excerpt":"In this work, we study interference cancellation techniques and a multi-relay selection algorithm based on greedy methods for the uplink of cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise low-cost list-based successive interference cancellation (GL-SIC) and parallel interference cancellation (GL-PIC) algorithms with RAKE receivers as the front-end that can approach the maximum likelihood detector performance and be used at both the relays and the destination of cooperative systems. Unlike prior art, the proposed GL-SIC and GL-PIC algorithms exploit "},"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":"1602.03936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-12T00:46:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"685b08d2cd4f0ed35350f111478141d8eca6e2e0a32c59c8f914b25f46aee40d","abstract_canon_sha256":"d6b797e7bd816db928f9faddefdc5eb832b8dfab4543127b13a8bb3b9e8dcb37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.128731Z","signature_b64":"yJG1NE2jR8EUfYD0dqyzG24OYBrvFU/bzn/ltE7SdnZNgnIlEBFDFOHf2//lpaUBfu5ugRNPG7KWUldXqf8zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a23d7b26b4d829e9eeb44652ce8e63b419aa8df3ca67cec95e13894d7a499c33","last_reissued_at":"2026-05-18T01:20:55.128102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.128102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Study of Interference Cancellation and Relay Selection Algorithms Using Greedy Techniques for Cooperative DS-CDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Gu, R. C. de Lamare","submitted_at":"2016-02-12T00:46:51Z","abstract_excerpt":"In this work, we study interference cancellation techniques and a multi-relay selection algorithm based on greedy methods for the uplink of cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise low-cost list-based successive interference cancellation (GL-SIC) and parallel interference cancellation (GL-PIC) algorithms with RAKE receivers as the front-end that can approach the maximum likelihood detector performance and be used at both the relays and the destination of cooperative systems. Unlike prior art, the proposed GL-SIC and GL-PIC algorithms exploit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03936","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":"1602.03936","created_at":"2026-05-18T01:20:55.128194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03936v1","created_at":"2026-05-18T01:20:55.128194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03936","created_at":"2026-05-18T01:20:55.128194+00:00"},{"alias_kind":"pith_short_12","alias_value":"UI6XWJVU3AU6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UI6XWJVU3AU6T3VU","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UI6XWJVU","created_at":"2026-05-18T12:30:46.583412+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/UI6XWJVU3AU6T3VUIZJM5DTDWQ","json":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ.json","graph_json":"https://pith.science/api/pith-number/UI6XWJVU3AU6T3VUIZJM5DTDWQ/graph.json","events_json":"https://pith.science/api/pith-number/UI6XWJVU3AU6T3VUIZJM5DTDWQ/events.json","paper":"https://pith.science/paper/UI6XWJVU"},"agent_actions":{"view_html":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ","download_json":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ.json","view_paper":"https://pith.science/paper/UI6XWJVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03936&json=true","fetch_graph":"https://pith.science/api/pith-number/UI6XWJVU3AU6T3VUIZJM5DTDWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UI6XWJVU3AU6T3VUIZJM5DTDWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ/action/storage_attestation","attest_author":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ/action/author_attestation","sign_citation":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ/action/citation_signature","submit_replication":"https://pith.science/pith/UI6XWJVU3AU6T3VUIZJM5DTDWQ/action/replication_record"}},"created_at":"2026-05-18T01:20:55.128194+00:00","updated_at":"2026-05-18T01:20:55.128194+00:00"}