{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HBW6NCBKTLZKFIEIXRX2CTHRJA","short_pith_number":"pith:HBW6NCBK","canonical_record":{"source":{"id":"1107.4797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-24T20:39:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6ac4f2545f2066dd04ab1bf5b356e97f1d0a98796e9ee5eaeb33ac580988e13","abstract_canon_sha256":"fe5ffc95ec005898c4058f8ea3f426d679fc72bb7095b954d8b0a5185b13d3be"},"schema_version":"1.0"},"canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","source":{"kind":"arxiv","id":"1107.4797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4797","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4797v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4797","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"HBW6NCBKTLZK","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HBW6NCBKTLZKFIEI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HBW6NCBK","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HBW6NCBKTLZKFIEIXRX2CTHRJA","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-24T20:39:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6ac4f2545f2066dd04ab1bf5b356e97f1d0a98796e9ee5eaeb33ac580988e13","abstract_canon_sha256":"fe5ffc95ec005898c4058f8ea3f426d679fc72bb7095b954d8b0a5185b13d3be"},"schema_version":"1.0"},"canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.671164Z","signature_b64":"uqD9V9NMto/mO/77s5gbgyjI3bs7pXTRGIgWm2H8n4jVb796Npi7Bq+q8Dj73wpLehVwdSyukkGJ8tJTlnJABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","last_reissued_at":"2026-05-18T02:21:42.670646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.670646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4797","source_version":1,"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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+ODS8VXrca+oANOnxvCuPKCjH40FEkCl6hvcnhWNZY/mc/YpPyNkdvUgHFq6CNAEbl3HyECn+lRkZr/JRumBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:52:09.676284Z"},"content_sha256":"e7eca9864ca0de5b15f0cce88cfb4aa0a64120e8ba4bdd0675d16d5141dd2cc2","schema_version":"1.0","event_id":"sha256:e7eca9864ca0de5b15f0cce88cfb4aa0a64120e8ba4bdd0675d16d5141dd2cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HBW6NCBKTLZKFIEIXRX2CTHRJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Schlegel, Dmitri Truhachev","submitted_at":"2011-07-24T20:39:32Z","abstract_excerpt":"Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. Howeve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4797","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"},"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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"370UqjSeJ+uUWZh/zu7wdr76O2rK+Gi+1vQ/S7y5mYmZuChoIN4JIUOuB853hhDrsSv+i8uJmSz7j5waww4DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:52:09.676800Z"},"content_sha256":"21d3dc2cf67c735281ee501a0b684616f69c0d633738ef853310b3068de8aa9d","schema_version":"1.0","event_id":"sha256:21d3dc2cf67c735281ee501a0b684616f69c0d633738ef853310b3068de8aa9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/bundle.json","state_url":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/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-27T15:52:09Z","links":{"resolver":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA","bundle":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/bundle.json","state":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HBW6NCBKTLZKFIEIXRX2CTHRJA","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":"fe5ffc95ec005898c4058f8ea3f426d679fc72bb7095b954d8b0a5185b13d3be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-24T20:39:32Z","title_canon_sha256":"b6ac4f2545f2066dd04ab1bf5b356e97f1d0a98796e9ee5eaeb33ac580988e13"},"schema_version":"1.0","source":{"id":"1107.4797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4797","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4797v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4797","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"HBW6NCBKTLZK","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HBW6NCBKTLZKFIEI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HBW6NCBK","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:21d3dc2cf67c735281ee501a0b684616f69c0d633738ef853310b3068de8aa9d","target":"graph","created_at":"2026-05-18T02:21:42Z","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":"Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. Howeve","authors_text":"Christian Schlegel, Dmitri Truhachev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-24T20:39:32Z","title":"Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4797","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:e7eca9864ca0de5b15f0cce88cfb4aa0a64120e8ba4bdd0675d16d5141dd2cc2","target":"record","created_at":"2026-05-18T02:21:42Z","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":"fe5ffc95ec005898c4058f8ea3f426d679fc72bb7095b954d8b0a5185b13d3be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-24T20:39:32Z","title_canon_sha256":"b6ac4f2545f2066dd04ab1bf5b356e97f1d0a98796e9ee5eaeb33ac580988e13"},"schema_version":"1.0","source":{"id":"1107.4797","kind":"arxiv","version":1}},"canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","first_computed_at":"2026-05-18T02:21:42.670646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.670646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uqD9V9NMto/mO/77s5gbgyjI3bs7pXTRGIgWm2H8n4jVb796Npi7Bq+q8Dj73wpLehVwdSyukkGJ8tJTlnJABA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.671164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7eca9864ca0de5b15f0cce88cfb4aa0a64120e8ba4bdd0675d16d5141dd2cc2","sha256:21d3dc2cf67c735281ee501a0b684616f69c0d633738ef853310b3068de8aa9d"],"state_sha256":"0380805002e967366266a17dc229a5e805d5037fcb0ef78c10f8a2e732aa5fdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVuEaX9TtwwWyqMHj592J7f7GhJPeg1Bi92Ej7oqceSUuyYdWb4gWVQzUcBWY+fXbwmaHJ53ZNZkkV+HAG3XCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:52:09.679780Z","bundle_sha256":"bcb6f7aebee6bc870b355d40f658bd4afcbe9a28eb10f712f735fbb554c70693"}}