{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EUO4PL3AASKEGUOO6SHQXXRNZE","short_pith_number":"pith:EUO4PL3A","schema_version":"1.0","canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","source":{"kind":"arxiv","id":"1909.01683","version":1},"attestation_state":"computed","paper":{"title":"Deep Learning-Aided Tabu Search Detection for Large MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Kyungchun Lee, NhanThanh Nguyen","submitted_at":"2019-09-04T10:35:00Z","abstract_excerpt":"In this study, we consider the application of deep learning (DL) to tabu search (TS) detection in large multiple-input multiple-output (MIMO) systems. First, we propose a deep neural network architecture for symbol detection, termed the fast-convergence sparsely connected detection network (FS-Net), which is obtained by optimizing the prior detection networks called DetNet and ScNet. Then, we propose the DL-aided TS algorithm, in which the initial solution is approximated by the proposed FS-Net. Furthermore, in this algorithm, an adaptive early termination algorithm and a modified searching pr"},"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":"1909.01683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-04T10:35:00Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"d28973b4a68f9362bdd749af8d758f89a572892a4b02b13198320a077672eb48","abstract_canon_sha256":"d785c6b3aa6722969d66379b87c1b6f5cfab586fd082b19f8ada89338e4d3660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:18.945381Z","signature_b64":"5a3nq+7xxOyAps2cqiRlRYX+hXgmE7JRVj0yGhH1lk0+eE9UDA+IhzRbEwSmXI6/t23xPVnGR5AERZ+Vqeg4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","last_reissued_at":"2026-07-05T00:02:18.945034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:18.945034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning-Aided Tabu Search Detection for Large MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Kyungchun Lee, NhanThanh Nguyen","submitted_at":"2019-09-04T10:35:00Z","abstract_excerpt":"In this study, we consider the application of deep learning (DL) to tabu search (TS) detection in large multiple-input multiple-output (MIMO) systems. First, we propose a deep neural network architecture for symbol detection, termed the fast-convergence sparsely connected detection network (FS-Net), which is obtained by optimizing the prior detection networks called DetNet and ScNet. Then, we propose the DL-aided TS algorithm, in which the initial solution is approximated by the proposed FS-Net. Furthermore, in this algorithm, an adaptive early termination algorithm and a modified searching pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01683","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.01683/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.01683","created_at":"2026-07-05T00:02:18.945089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01683v1","created_at":"2026-07-05T00:02:18.945089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01683","created_at":"2026-07-05T00:02:18.945089+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUO4PL3AASKE","created_at":"2026-07-05T00:02:18.945089+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUO4PL3AASKEGUOO","created_at":"2026-07-05T00:02:18.945089+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUO4PL3A","created_at":"2026-07-05T00:02:18.945089+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/EUO4PL3AASKEGUOO6SHQXXRNZE","json":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE.json","graph_json":"https://pith.science/api/pith-number/EUO4PL3AASKEGUOO6SHQXXRNZE/graph.json","events_json":"https://pith.science/api/pith-number/EUO4PL3AASKEGUOO6SHQXXRNZE/events.json","paper":"https://pith.science/paper/EUO4PL3A"},"agent_actions":{"view_html":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE","download_json":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE.json","view_paper":"https://pith.science/paper/EUO4PL3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01683&json=true","fetch_graph":"https://pith.science/api/pith-number/EUO4PL3AASKEGUOO6SHQXXRNZE/graph.json","fetch_events":"https://pith.science/api/pith-number/EUO4PL3AASKEGUOO6SHQXXRNZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/action/storage_attestation","attest_author":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/action/author_attestation","sign_citation":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/action/citation_signature","submit_replication":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/action/replication_record"}},"created_at":"2026-07-05T00:02:18.945089+00:00","updated_at":"2026-07-05T00:02:18.945089+00:00"}