{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HABSXWTEQG3C7DBIUWZ3OO7STZ","short_pith_number":"pith:HABSXWTE","canonical_record":{"source":{"id":"1811.10938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T12:38:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f160c7fc9367fedcc401c8db4e88604021576a4646222495e750486483fd7395","abstract_canon_sha256":"d8e56cb52baba9abcad5d99cd39562cf16a0e807d205c7625fdf0084318b38dc"},"schema_version":"1.0"},"canonical_sha256":"38032bda6481b62f8c28a5b3b73bf29e6e898732d0b53957756a12c304f5ac94","source":{"kind":"arxiv","id":"1811.10938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10938","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10938v2","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10938","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"HABSXWTEQG3C","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HABSXWTEQG3C7DBI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HABSXWTE","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HABSXWTEQG3C7DBIUWZ3OO7STZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T12:38:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f160c7fc9367fedcc401c8db4e88604021576a4646222495e750486483fd7395","abstract_canon_sha256":"d8e56cb52baba9abcad5d99cd39562cf16a0e807d205c7625fdf0084318b38dc"},"schema_version":"1.0"},"canonical_sha256":"38032bda6481b62f8c28a5b3b73bf29e6e898732d0b53957756a12c304f5ac94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:11.447927Z","signature_b64":"AiRdSBL/cp0ZV8Kn7ravRNAYP5PF8HcbxXJbRH+srRGwzsoabLp+lLLniXjh8lKD1YB67nHdm7RPq0BxWMhMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38032bda6481b62f8c28a5b3b73bf29e6e898732d0b53957756a12c304f5ac94","last_reissued_at":"2026-05-17T23:40:11.447203Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:11.447203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10938","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYDtz68tt9SVIjJ1hk3QarKGOI5E5CUdHuxrHY9KgTTrGusYgJsIymau/jr0l/9FJiW6ikDe8/NkUObLGw6cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:25:43.371692Z"},"content_sha256":"ae32a6c87c705683aafb1d699523525d29f5e7b7135febc3dd7954847141e35b","schema_version":"1.0","event_id":"sha256:ae32a6c87c705683aafb1d699523525d29f5e7b7135febc3dd7954847141e35b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HABSXWTEQG3C7DBIUWZ3OO7STZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Capacity Detection and Decoding: Code Design for Dynamic User Loads in Gaussian Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sebastian Cammerer, Stephan ten Brink, Xiaojie Wang","submitted_at":"2018-11-27T12:38:48Z","abstract_excerpt":"This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing, resembling the scenario of an actual wireless cellular system. To obtain a low-complexity non-orthogonal multiple access (NOMA) scheme, we propose a serial concatenation of a low-density parity-check (LDPC) code and a repetition code (REP), this way achieving near Gaussian MAC (GMAC) capacity performance while coping with the dynamics of the MAC system. The joint op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10938","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Myoq5/W3sAyU7DbTFfyBGT8ZSfecliHo5F6ius8DfMcC3beCjUIUdxAfMyFoy1hS8uTdbm0fRCEMMaPzSxeyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:25:43.372484Z"},"content_sha256":"ceed634555e82ce631728d346830f85dc7536bbef35a8a77fa60e7dd9a15a53e","schema_version":"1.0","event_id":"sha256:ceed634555e82ce631728d346830f85dc7536bbef35a8a77fa60e7dd9a15a53e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/bundle.json","state_url":"https://pith.science/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:25:43Z","links":{"resolver":"https://pith.science/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ","bundle":"https://pith.science/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/bundle.json","state":"https://pith.science/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HABSXWTEQG3C7DBIUWZ3OO7STZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HABSXWTEQG3C7DBIUWZ3OO7STZ","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":"d8e56cb52baba9abcad5d99cd39562cf16a0e807d205c7625fdf0084318b38dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T12:38:48Z","title_canon_sha256":"f160c7fc9367fedcc401c8db4e88604021576a4646222495e750486483fd7395"},"schema_version":"1.0","source":{"id":"1811.10938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10938","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10938v2","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10938","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"HABSXWTEQG3C","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HABSXWTEQG3C7DBI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HABSXWTE","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:ceed634555e82ce631728d346830f85dc7536bbef35a8a77fa60e7dd9a15a53e","target":"graph","created_at":"2026-05-17T23:40:11Z","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":"This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing, resembling the scenario of an actual wireless cellular system. To obtain a low-complexity non-orthogonal multiple access (NOMA) scheme, we propose a serial concatenation of a low-density parity-check (LDPC) code and a repetition code (REP), this way achieving near Gaussian MAC (GMAC) capacity performance while coping with the dynamics of the MAC system. The joint op","authors_text":"Sebastian Cammerer, 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":"2018-11-27T12:38:48Z","title":"Near-Capacity Detection and Decoding: Code Design for Dynamic User Loads in Gaussian Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10938","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:ae32a6c87c705683aafb1d699523525d29f5e7b7135febc3dd7954847141e35b","target":"record","created_at":"2026-05-17T23:40:11Z","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":"d8e56cb52baba9abcad5d99cd39562cf16a0e807d205c7625fdf0084318b38dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T12:38:48Z","title_canon_sha256":"f160c7fc9367fedcc401c8db4e88604021576a4646222495e750486483fd7395"},"schema_version":"1.0","source":{"id":"1811.10938","kind":"arxiv","version":2}},"canonical_sha256":"38032bda6481b62f8c28a5b3b73bf29e6e898732d0b53957756a12c304f5ac94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38032bda6481b62f8c28a5b3b73bf29e6e898732d0b53957756a12c304f5ac94","first_computed_at":"2026-05-17T23:40:11.447203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:11.447203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AiRdSBL/cp0ZV8Kn7ravRNAYP5PF8HcbxXJbRH+srRGwzsoabLp+lLLniXjh8lKD1YB67nHdm7RPq0BxWMhMDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:11.447927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae32a6c87c705683aafb1d699523525d29f5e7b7135febc3dd7954847141e35b","sha256:ceed634555e82ce631728d346830f85dc7536bbef35a8a77fa60e7dd9a15a53e"],"state_sha256":"0d2d2b131397016081d0e145b0162ca05425d679e8821658a9d862307eb258f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbxVNQGwCAe51lCD8/sVl3DFeAFDwsZWOqgg/7ZK81Rd/YEieuDXL4/8IY2cQpALPYK4Y9pLA+OYd6Dpc4osCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:25:43.376048Z","bundle_sha256":"acbc974c54e95771717b6c5eaf63c3a475a612f3c19627e10accdcd299202c2c"}}