{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DPWAWRMDAQQNAW24BCC2KRHJIJ","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":"e7bbb085634e45a86307e7ef054e16a389511163c31cb435c59ffe3fb3f77def","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-25T17:09:40Z","title_canon_sha256":"77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d"},"schema_version":"1.0","source":{"id":"1907.11518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11518","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11518v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11518","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"DPWAWRMDAQQN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DPWAWRMDAQQNAW24","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DPWAWRMD","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:9cf0cb800faebf55c82592f324d95346184877bba5a2f78860f4062585d9c0d6","target":"graph","created_at":"2026-05-17T23:39:28Z","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":"We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user detection (MUD) based on the Gaussian approximation (GA) is assumed. The evolution of mean-square errors (MSE) of the GA-based MUD during iterative processing is studied. We show that the K-dimensional tuples formed by the MSEs of K users constitute a conservative vector field. The achievable rate is a potential function of this conservative field, so it is t","authors_text":"Chulong Liang, Li Ping, Stephan ten Brink, Xiaojie Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-25T17:09:40Z","title":"Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11518","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:db85ca07fa44ab4de73e1d49bbbc364b0cccf521d35eb2e0a09e768a792cec33","target":"record","created_at":"2026-05-17T23:39:28Z","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":"e7bbb085634e45a86307e7ef054e16a389511163c31cb435c59ffe3fb3f77def","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-25T17:09:40Z","title_canon_sha256":"77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d"},"schema_version":"1.0","source":{"id":"1907.11518","kind":"arxiv","version":1}},"canonical_sha256":"1bec0b45830420d05b5c0885a544e9426846ea979067a09ab1041b1672f93074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bec0b45830420d05b5c0885a544e9426846ea979067a09ab1041b1672f93074","first_computed_at":"2026-05-17T23:39:28.830684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:28.830684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e3RdIzzDDa6BTzQgdBuQWsSvZDKfABB6zFQz/q0GUJSZcvyFm7mamkrOTLgWGxtSDWNj9DigXoc0vz+ivPeNDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:28.831337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db85ca07fa44ab4de73e1d49bbbc364b0cccf521d35eb2e0a09e768a792cec33","sha256:9cf0cb800faebf55c82592f324d95346184877bba5a2f78860f4062585d9c0d6"],"state_sha256":"0974640ea1f497d5c945334f42b809c1bf0e690beafa438059f9b2df2af9d60e"}