{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P4NSWWBTAG3AUT4CGLQW6LWMNU","short_pith_number":"pith:P4NSWWBT","canonical_record":{"source":{"id":"1901.05877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T16:32:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257e6278a37a25e174aa0cdf65c73aaf8c773b4a0013956f7770d24875c2ea73","abstract_canon_sha256":"def113a92858c6689e048d1f7d3842be991b010ab10e01aeb54a600eb5508ef9"},"schema_version":"1.0"},"canonical_sha256":"7f1b2b583301b60a4f8232e16f2ecc6d0f3fa223b60657ef422f0739d140b287","source":{"kind":"arxiv","id":"1901.05877","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05877","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05877v2","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05877","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"P4NSWWBTAG3A","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P4NSWWBTAG3AUT4C","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P4NSWWBT","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P4NSWWBTAG3AUT4CGLQW6LWMNU","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T16:32:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257e6278a37a25e174aa0cdf65c73aaf8c773b4a0013956f7770d24875c2ea73","abstract_canon_sha256":"def113a92858c6689e048d1f7d3842be991b010ab10e01aeb54a600eb5508ef9"},"schema_version":"1.0"},"canonical_sha256":"7f1b2b583301b60a4f8232e16f2ecc6d0f3fa223b60657ef422f0739d140b287","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.814233Z","signature_b64":"1YqpPJGSTqoAU7vxW2gX1gw6qxfuD1l9Dd7CW0izovBOVIWI5lbSjJy/PpKWiZpsz2ayx/mNKl7WSvTc5ZFbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f1b2b583301b60a4f8232e16f2ecc6d0f3fa223b60657ef422f0739d140b287","last_reissued_at":"2026-05-17T23:55:26.813847Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.813847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05877","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:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0ewLcSMrN+uU5yzkeKuWoXVZhFaOaq2JHKO5kLXGL0JhhGwftK8xWwT53semCIAsI6z1tdi20CObd5DqX4CDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:28:46.128381Z"},"content_sha256":"92b7ca7d6111bcb88d89bafc21034a8e1b8d1b6ab23dda690767140e40e178a8","schema_version":"1.0","event_id":"sha256:92b7ca7d6111bcb88d89bafc21034a8e1b8d1b6ab23dda690767140e40e178a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P4NSWWBTAG3AUT4CGLQW6LWMNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatially Coupled LDPC Codes and the Multiple Access Channel","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, Yingyan Ma","submitted_at":"2019-01-17T16:32:21Z","abstract_excerpt":"We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative multi-user detector (MUD). Besides excellent decoding thresholds, the approach benefits from the possibility of using rather simple and regular underlying block LDPC codes owing to the universal behavior of the resulting coupled code with respect to the channel front-end, i.e., the iterative MUD. Furthermore, an additional outer repetition code makes the scheme fl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05877","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:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXypqC8zZEIACfngBpHYUotgJrRArid9+r79noslfaD0KMeu1iFOAqKxfy+tzPW52cmaN0e3AFN7rPWnkh8oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:28:46.129082Z"},"content_sha256":"656b5f43a01e31ce56e9fd45e6e282040f395728c47d3825b295b60a9d68cddd","schema_version":"1.0","event_id":"sha256:656b5f43a01e31ce56e9fd45e6e282040f395728c47d3825b295b60a9d68cddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/bundle.json","state_url":"https://pith.science/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/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-25T20:28:46Z","links":{"resolver":"https://pith.science/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU","bundle":"https://pith.science/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/bundle.json","state":"https://pith.science/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4NSWWBTAG3AUT4CGLQW6LWMNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P4NSWWBTAG3AUT4CGLQW6LWMNU","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":"def113a92858c6689e048d1f7d3842be991b010ab10e01aeb54a600eb5508ef9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T16:32:21Z","title_canon_sha256":"257e6278a37a25e174aa0cdf65c73aaf8c773b4a0013956f7770d24875c2ea73"},"schema_version":"1.0","source":{"id":"1901.05877","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05877","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05877v2","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05877","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"P4NSWWBTAG3A","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P4NSWWBTAG3AUT4C","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P4NSWWBT","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:656b5f43a01e31ce56e9fd45e6e282040f395728c47d3825b295b60a9d68cddd","target":"graph","created_at":"2026-05-17T23:55:26Z","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 consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative multi-user detector (MUD). Besides excellent decoding thresholds, the approach benefits from the possibility of using rather simple and regular underlying block LDPC codes owing to the universal behavior of the resulting coupled code with respect to the channel front-end, i.e., the iterative MUD. Furthermore, an additional outer repetition code makes the scheme fl","authors_text":"Sebastian Cammerer, Stephan ten Brink, Xiaojie Wang, Yingyan Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T16:32:21Z","title":"Spatially Coupled LDPC Codes and the Multiple Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05877","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:92b7ca7d6111bcb88d89bafc21034a8e1b8d1b6ab23dda690767140e40e178a8","target":"record","created_at":"2026-05-17T23:55:26Z","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":"def113a92858c6689e048d1f7d3842be991b010ab10e01aeb54a600eb5508ef9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T16:32:21Z","title_canon_sha256":"257e6278a37a25e174aa0cdf65c73aaf8c773b4a0013956f7770d24875c2ea73"},"schema_version":"1.0","source":{"id":"1901.05877","kind":"arxiv","version":2}},"canonical_sha256":"7f1b2b583301b60a4f8232e16f2ecc6d0f3fa223b60657ef422f0739d140b287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f1b2b583301b60a4f8232e16f2ecc6d0f3fa223b60657ef422f0739d140b287","first_computed_at":"2026-05-17T23:55:26.813847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:26.813847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1YqpPJGSTqoAU7vxW2gX1gw6qxfuD1l9Dd7CW0izovBOVIWI5lbSjJy/PpKWiZpsz2ayx/mNKl7WSvTc5ZFbCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:26.814233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05877","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92b7ca7d6111bcb88d89bafc21034a8e1b8d1b6ab23dda690767140e40e178a8","sha256:656b5f43a01e31ce56e9fd45e6e282040f395728c47d3825b295b60a9d68cddd"],"state_sha256":"817293d2771ac742ae6d1250b68f39a6d65f782e4bf5fe5267aa8ebc9dab18f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFK1wgVq+ctao1KUZGPSme44Sw/4URuS5qxhwq8kTj885I8adgDq5hHtgo/QSI8k59Y6Yk2T6MrUXgSVOXckAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:28:46.133109Z","bundle_sha256":"7c978774e2cf891f6a9ff7dbc1fa874225904c7b4e76e248790ebab5e860d628"}}