{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LV7LNUPK7GTOUEGHSKKA22UGRN","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":"3726d44c84598790ea09a540afc1141f915da98148f866799e69e5518f40ebf2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-25T17:29:13Z","title_canon_sha256":"240482c3de7c61bf79b84bfabcf92c82fb67d37a2472abd24cde5b049d40c493"},"schema_version":"1.0","source":{"id":"1510.07273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07273","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07273v1","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07273","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"LV7LNUPK7GTO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LV7LNUPK7GTOUEGH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LV7LNUPK","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:e0110d77dce107d61d858eb27c06b6ba20ae8b9c70a05ed282ba3bce65508f45","target":"graph","created_at":"2026-05-18T01:29:14Z","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"},"paper":{"abstract_excerpt":"In this article, we consider multiuser detection that copes with multiple access interference caused in star-topology machine-to-machine (M2M) communications. We assume that the transmitted signals are discrete-valued (e.g. binary signals taking values of $\\pm 1$), which is taken into account as prior information in detection. We formulate the detection problem as the maximum a posteriori (MAP) estimation, which is relaxed to a convex optimization called the sum-of-absolute-values (SOAV) optimization. The SOAV optimization can be efficiently solved by a proximal splitting algorithm, for which ","authors_text":"Hampei Sasahara, Kazunori Hayashi, Masaaki Nagahara","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-25T17:29:13Z","title":"Multiuser Detection by MAP Estimation with Sum-of-Absolute-Values Relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07273","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:ad092e9b205dd7db8bcf904b5f1cb305d4bb842c23b3e3d2d5e1e28fec791142","target":"record","created_at":"2026-05-18T01:29:14Z","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":"3726d44c84598790ea09a540afc1141f915da98148f866799e69e5518f40ebf2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-25T17:29:13Z","title_canon_sha256":"240482c3de7c61bf79b84bfabcf92c82fb67d37a2472abd24cde5b049d40c493"},"schema_version":"1.0","source":{"id":"1510.07273","kind":"arxiv","version":1}},"canonical_sha256":"5d7eb6d1eaf9a6ea10c792940d6a868b4e24cf7a2d5e1646aa20ab86c3aec70c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d7eb6d1eaf9a6ea10c792940d6a868b4e24cf7a2d5e1646aa20ab86c3aec70c","first_computed_at":"2026-05-18T01:29:14.499632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:14.499632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FOaVm3f0lWx7+2WbY/58mkq1VDczrVIp1/arpP/aCgGDCSGFTefWoBmiVbRo8de2YLJ9ofzbP0zNy8gBUYN6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:14.500106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad092e9b205dd7db8bcf904b5f1cb305d4bb842c23b3e3d2d5e1e28fec791142","sha256:e0110d77dce107d61d858eb27c06b6ba20ae8b9c70a05ed282ba3bce65508f45"],"state_sha256":"d709fcc686a3cd842ca04b5734feec24d9dd5aa765813761a3195d62c40de940"}