{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5VEYOTJRFLMWOVEKM3WOQ3GEPM","short_pith_number":"pith:5VEYOTJR","schema_version":"1.0","canonical_sha256":"ed49874d312ad967548a66ece86cc47b1e60267eacee3c6983ebeb57cc4300ab","source":{"kind":"arxiv","id":"1012.4824","version":1},"attestation_state":"computed","paper":{"title":"Input Parameters Optimization in Swarm DS-CDMA Multiuser Detectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.CO"],"primary_cat":"cs.AI","authors_text":"Bruno A. Angelico, Leonardo D. Oliveira, Paul Jean E. Jeszensky, Taufik Abr\\~ao","submitted_at":"2010-12-21T22:25:37Z","abstract_excerpt":"In this paper, the uplink direct sequence code division multiple access (DS-CDMA) multiuser detection problem (MuD) is studied into heuristic perspective, named particle swarm optimization (PSO). Regarding different system improvements for future technologies, such as high-order modulation and diversity exploitation, a complete parameter optimization procedure for the PSO applied to MuD problem is provided, which represents the major contribution of this paper. Furthermore, the performance of the PSO-MuD is briefly analyzed via Monte-Carlo simulations. Simulation results show that, after conve"},"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":"1012.4824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-12-21T22:25:37Z","cross_cats_sorted":["math.CO","stat.CO"],"title_canon_sha256":"2e96305ae6e939fc589a24b29227f2b76eb4855ef6205cb690b176b4e64dbbe4","abstract_canon_sha256":"6803c801c2c1ddfacd2287deafafb1f02720ef20b908947b55d01db5910bcbad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:06.670819Z","signature_b64":"I9c4wAS042TfHEYNqj8iOHjFvDZfI+OwmcbwMLVKkAfKF8C9zWCajtNbXKj4kghAe93s3VgzyOsBw2AhMMGGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed49874d312ad967548a66ece86cc47b1e60267eacee3c6983ebeb57cc4300ab","last_reissued_at":"2026-05-18T02:23:06.670287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:06.670287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Input Parameters Optimization in Swarm DS-CDMA Multiuser Detectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.CO"],"primary_cat":"cs.AI","authors_text":"Bruno A. Angelico, Leonardo D. Oliveira, Paul Jean E. Jeszensky, Taufik Abr\\~ao","submitted_at":"2010-12-21T22:25:37Z","abstract_excerpt":"In this paper, the uplink direct sequence code division multiple access (DS-CDMA) multiuser detection problem (MuD) is studied into heuristic perspective, named particle swarm optimization (PSO). Regarding different system improvements for future technologies, such as high-order modulation and diversity exploitation, a complete parameter optimization procedure for the PSO applied to MuD problem is provided, which represents the major contribution of this paper. Furthermore, the performance of the PSO-MuD is briefly analyzed via Monte-Carlo simulations. Simulation results show that, after conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4824","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":"1012.4824","created_at":"2026-05-18T02:23:06.670380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4824v1","created_at":"2026-05-18T02:23:06.670380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4824","created_at":"2026-05-18T02:23:06.670380+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VEYOTJRFLMW","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VEYOTJRFLMWOVEK","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VEYOTJR","created_at":"2026-05-18T12:26:04.259169+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/5VEYOTJRFLMWOVEKM3WOQ3GEPM","json":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM.json","graph_json":"https://pith.science/api/pith-number/5VEYOTJRFLMWOVEKM3WOQ3GEPM/graph.json","events_json":"https://pith.science/api/pith-number/5VEYOTJRFLMWOVEKM3WOQ3GEPM/events.json","paper":"https://pith.science/paper/5VEYOTJR"},"agent_actions":{"view_html":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM","download_json":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM.json","view_paper":"https://pith.science/paper/5VEYOTJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4824&json=true","fetch_graph":"https://pith.science/api/pith-number/5VEYOTJRFLMWOVEKM3WOQ3GEPM/graph.json","fetch_events":"https://pith.science/api/pith-number/5VEYOTJRFLMWOVEKM3WOQ3GEPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM/action/storage_attestation","attest_author":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM/action/author_attestation","sign_citation":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM/action/citation_signature","submit_replication":"https://pith.science/pith/5VEYOTJRFLMWOVEKM3WOQ3GEPM/action/replication_record"}},"created_at":"2026-05-18T02:23:06.670380+00:00","updated_at":"2026-05-18T02:23:06.670380+00:00"}