{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4JCBYRDILBW4JYVEJIFEZ53JH4","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":"88b85ab3bb8eace13f941026c0afa6810208ff9022df352a99f65b7e7ad0a2c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-30T07:01:59Z","title_canon_sha256":"8b869962e3621d1c34fcc324af8aee6716d983dc37adcce7e092d47cd504aed5"},"schema_version":"1.0","source":{"id":"1811.12645","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12645","created_at":"2026-07-04T23:59:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12645v2","created_at":"2026-07-04T23:59:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12645","created_at":"2026-07-04T23:59:29Z"},{"alias_kind":"pith_short_12","alias_value":"4JCBYRDILBW4","created_at":"2026-07-04T23:59:29Z"},{"alias_kind":"pith_short_16","alias_value":"4JCBYRDILBW4JYVE","created_at":"2026-07-04T23:59:29Z"},{"alias_kind":"pith_short_8","alias_value":"4JCBYRDI","created_at":"2026-07-04T23:59:29Z"}],"graph_snapshots":[{"event_id":"sha256:401cc58ddf00f806bc7fe1b7a6d4902a28510ba64fcbb386ee91a3ab8426ddb9","target":"graph","created_at":"2026-07-04T23:59:29Z","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/1811.12645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate learning-based maximum likelihood (ML) detection for uplink massive multiple-input and multiple-output (MIMO) systems with one-bit analog-to-digital converters (ADCs). To overcome the significant dependency of learning-based detection on the training length, we propose two one-bit ML detection methods: a biased-learning method and a dithering-and-learning method. The biased-learning method keeps likelihood functions with zero probability from wiping out the obtained information through learning, thereby providing more robust detection performance. Extending the bi","authors_text":"Alan Gatherer, Brian L. Evans, Jinseok Choi, Yunseong Cho","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-30T07:01:59Z","title":"Robust Learning-Based ML Detection for Massive MIMO Systems with One-Bit Quantized Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12645","kind":"arxiv","version":2},"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:22ec1b90fa0badba5da7501c519137d5ffd46875b299c38652f1f420b0cb6bbd","target":"record","created_at":"2026-07-04T23:59:29Z","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":"88b85ab3bb8eace13f941026c0afa6810208ff9022df352a99f65b7e7ad0a2c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-30T07:01:59Z","title_canon_sha256":"8b869962e3621d1c34fcc324af8aee6716d983dc37adcce7e092d47cd504aed5"},"schema_version":"1.0","source":{"id":"1811.12645","kind":"arxiv","version":2}},"canonical_sha256":"e2441c4468586dc4e2a44a0a4cf7693f1ec468ef499b213807bd2cbf951c7b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2441c4468586dc4e2a44a0a4cf7693f1ec468ef499b213807bd2cbf951c7b46","first_computed_at":"2026-07-04T23:59:29.671832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:29.671832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"akYWn5r3ZWCHWP4UZqbXtlKSpc/t5oTebSc81mhxdFnhdvaEO7umFGe0k26uBBsk/CT2ctaGPxl88LqsOsAPDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:29.672307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12645","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22ec1b90fa0badba5da7501c519137d5ffd46875b299c38652f1f420b0cb6bbd","sha256:401cc58ddf00f806bc7fe1b7a6d4902a28510ba64fcbb386ee91a3ab8426ddb9"],"state_sha256":"671b93a74fdeadcabf8998af0bae954236a5a025e1d7b4709bfb272c1523b1ce"}