{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MCUIQV7NCG437QODYW2QGXB6HG","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":"6087cbe50b74d2c2f6d8526b2929dad583e11f5e3293822efcb5d6787f562b59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-22T21:41:11Z","title_canon_sha256":"77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d"},"schema_version":"1.0","source":{"id":"1907.09593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09593","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09593v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09593","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"MCUIQV7NCG43","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MCUIQV7NCG437QOD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MCUIQV7N","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:839ed5651bb2657da5a3e331ca131fcc9a00df78d87117f335397520cfe693ab","target":"graph","created_at":"2026-05-17T23:39:52Z","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 multi-user 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 ","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-22T21:41:11Z","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.09593","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:f1b4d2679fa27e8a6816e804f8daadd12581a1fbe5afe063ea45da4b139f3f07","target":"record","created_at":"2026-05-17T23:39:52Z","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":"6087cbe50b74d2c2f6d8526b2929dad583e11f5e3293822efcb5d6787f562b59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-22T21:41:11Z","title_canon_sha256":"77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d"},"schema_version":"1.0","source":{"id":"1907.09593","kind":"arxiv","version":1}},"canonical_sha256":"60a88857ed11b9bfc1c3c5b5035c3e39be2dc4b26f6edbfa586c8fe3838b416a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60a88857ed11b9bfc1c3c5b5035c3e39be2dc4b26f6edbfa586c8fe3838b416a","first_computed_at":"2026-05-17T23:39:52.816506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:52.816506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g70IEHOZlYerPGChIw0A+AkMvVMsslyTnGBV0M3cxYaN7kyjISFoUS/6NPqPOwsZwYipl1kUKABOqZvdg0D2AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:52.817001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1b4d2679fa27e8a6816e804f8daadd12581a1fbe5afe063ea45da4b139f3f07","sha256:839ed5651bb2657da5a3e331ca131fcc9a00df78d87117f335397520cfe693ab"],"state_sha256":"50081e82496186c15135c0c06d7fafa7d9ff7767a0f4ca07b94ff1bb36a1296b"}