{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DPWAWRMDAQQNAW24BCC2KRHJIJ","short_pith_number":"pith:DPWAWRMD","schema_version":"1.0","canonical_sha256":"1bec0b45830420d05b5c0885a544e9426846ea979067a09ab1041b1672f93074","source":{"kind":"arxiv","id":"1907.11518","version":1},"attestation_state":"computed","paper":{"title":"Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Li Ping, Stephan ten Brink, Xiaojie Wang","submitted_at":"2019-07-25T17:09:40Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.11518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-25T17:09:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d","abstract_canon_sha256":"e7bbb085634e45a86307e7ef054e16a389511163c31cb435c59ffe3fb3f77def"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:28.831337Z","signature_b64":"e3RdIzzDDa6BTzQgdBuQWsSvZDKfABB6zFQz/q0GUJSZcvyFm7mamkrOTLgWGxtSDWNj9DigXoc0vz+ivPeNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bec0b45830420d05b5c0885a544e9426846ea979067a09ab1041b1672f93074","last_reissued_at":"2026-05-17T23:39:28.830684Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:28.830684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Li Ping, Stephan ten Brink, Xiaojie Wang","submitted_at":"2019-07-25T17:09:40Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11518","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.11518","created_at":"2026-05-17T23:39:28.830767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11518v1","created_at":"2026-05-17T23:39:28.830767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11518","created_at":"2026-05-17T23:39:28.830767+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPWAWRMDAQQN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPWAWRMDAQQNAW24","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPWAWRMD","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ","json":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ.json","graph_json":"https://pith.science/api/pith-number/DPWAWRMDAQQNAW24BCC2KRHJIJ/graph.json","events_json":"https://pith.science/api/pith-number/DPWAWRMDAQQNAW24BCC2KRHJIJ/events.json","paper":"https://pith.science/paper/DPWAWRMD"},"agent_actions":{"view_html":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ","download_json":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ.json","view_paper":"https://pith.science/paper/DPWAWRMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11518&json=true","fetch_graph":"https://pith.science/api/pith-number/DPWAWRMDAQQNAW24BCC2KRHJIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DPWAWRMDAQQNAW24BCC2KRHJIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ/action/storage_attestation","attest_author":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ/action/author_attestation","sign_citation":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ/action/citation_signature","submit_replication":"https://pith.science/pith/DPWAWRMDAQQNAW24BCC2KRHJIJ/action/replication_record"}},"created_at":"2026-05-17T23:39:28.830767+00:00","updated_at":"2026-05-17T23:39:28.830767+00:00"}