{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EUO4PL3AASKEGUOO6SHQXXRNZE","short_pith_number":"pith:EUO4PL3A","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"},"canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","source":{"kind":"arxiv","id":"1909.01683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01683","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01683v1","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01683","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"EUO4PL3AASKE","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_16","alias_value":"EUO4PL3AASKEGUOO","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_8","alias_value":"EUO4PL3A","created_at":"2026-07-05T00:02:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EUO4PL3AASKEGUOO6SHQXXRNZE","target":"record","payload":{"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"},"canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","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"},"source_kind":"arxiv","source_id":"1909.01683","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-07-05T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSGMXKs3DkoLsfE419DmikEQBn9gUysHvBjW41TVHSRlOvbWZ2xkse2q8xPoHZUGa5GXgcjAeSL+jXIwWy6kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T04:55:57.770656Z"},"content_sha256":"7d5deaa65726313eb89cb4f0530a556b0ff72923ab19c087e8d0eca56102fd05","schema_version":"1.0","event_id":"sha256:7d5deaa65726313eb89cb4f0530a556b0ff72923ab19c087e8d0eca56102fd05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EUO4PL3AASKEGUOO6SHQXXRNZE","target":"graph","payload":{"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"},"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-07-05T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5fIzg5vVSjkPONsb4qEls6IeIctgbLRjm1J4FSOmJ/oJhbZsNuNjLARBsimMExAVsjIiQZPc1ube6/i7yk3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T04:55:57.771439Z"},"content_sha256":"64dc227f61e79bc99f41f657f3c7e85422dfe09cfd7e4ca79c0e805e420bd628","schema_version":"1.0","event_id":"sha256:64dc227f61e79bc99f41f657f3c7e85422dfe09cfd7e4ca79c0e805e420bd628"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/bundle.json","state_url":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/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-08-23T04:55:57Z","links":{"resolver":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE","bundle":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/bundle.json","state":"https://pith.science/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUO4PL3AASKEGUOO6SHQXXRNZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUO4PL3AASKEGUOO6SHQXXRNZE","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":"d785c6b3aa6722969d66379b87c1b6f5cfab586fd082b19f8ada89338e4d3660","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-04T10:35:00Z","title_canon_sha256":"d28973b4a68f9362bdd749af8d758f89a572892a4b02b13198320a077672eb48"},"schema_version":"1.0","source":{"id":"1909.01683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01683","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01683v1","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01683","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"EUO4PL3AASKE","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_16","alias_value":"EUO4PL3AASKEGUOO","created_at":"2026-07-05T00:02:18Z"},{"alias_kind":"pith_short_8","alias_value":"EUO4PL3A","created_at":"2026-07-05T00:02:18Z"}],"graph_snapshots":[{"event_id":"sha256:64dc227f61e79bc99f41f657f3c7e85422dfe09cfd7e4ca79c0e805e420bd628","target":"graph","created_at":"2026-07-05T00:02:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.01683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kyungchun Lee, NhanThanh Nguyen","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-04T10:35:00Z","title":"Deep Learning-Aided Tabu Search Detection for Large MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01683","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:7d5deaa65726313eb89cb4f0530a556b0ff72923ab19c087e8d0eca56102fd05","target":"record","created_at":"2026-07-05T00:02:18Z","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":"d785c6b3aa6722969d66379b87c1b6f5cfab586fd082b19f8ada89338e4d3660","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-04T10:35:00Z","title_canon_sha256":"d28973b4a68f9362bdd749af8d758f89a572892a4b02b13198320a077672eb48"},"schema_version":"1.0","source":{"id":"1909.01683","kind":"arxiv","version":1}},"canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"251dc7af6004944351cef48f0bde2dc9205572d28b05678ddd157156e60159a5","first_computed_at":"2026-07-05T00:02:18.945034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:18.945034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5a3nq+7xxOyAps2cqiRlRYX+hXgmE7JRVj0yGhH1lk0+eE9UDA+IhzRbEwSmXI6/t23xPVnGR5AERZ+Vqeg4Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:18.945381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5deaa65726313eb89cb4f0530a556b0ff72923ab19c087e8d0eca56102fd05","sha256:64dc227f61e79bc99f41f657f3c7e85422dfe09cfd7e4ca79c0e805e420bd628"],"state_sha256":"9b731c767120483532d3421f5dfebc92b14ed61bcce1e3fa88fd743054d25844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NI3PxWo8PzISbzOkwOJNnEj68WytnH0rd0k6w7hfg/xEv/WuhDnQ/9JmhvCfxekfyUlV5lY0Xs6CkHTlTF8SDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T04:55:57.776474Z","bundle_sha256":"7839db44ab4951ee6ef4196b23d36920aa30e6cad9d033e062a84ec9c7a5b149"}}