{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HBW6NCBKTLZKFIEIXRX2CTHRJA","short_pith_number":"pith:HBW6NCBK","schema_version":"1.0","canonical_sha256":"386de6882a9af2a2a088bc6fa14cf1480b3e0eb9ebac984b15a0309329e872eb","source":{"kind":"arxiv","id":"1107.4797","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4797","created_at":"2026-05-18T02:21:42.670733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4797v1","created_at":"2026-05-18T02:21:42.670733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4797","created_at":"2026-05-18T02:21:42.670733+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBW6NCBKTLZK","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBW6NCBKTLZKFIEI","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBW6NCBK","created_at":"2026-05-18T12:26:30.835961+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/HBW6NCBKTLZKFIEIXRX2CTHRJA","json":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA.json","graph_json":"https://pith.science/api/pith-number/HBW6NCBKTLZKFIEIXRX2CTHRJA/graph.json","events_json":"https://pith.science/api/pith-number/HBW6NCBKTLZKFIEIXRX2CTHRJA/events.json","paper":"https://pith.science/paper/HBW6NCBK"},"agent_actions":{"view_html":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA","download_json":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA.json","view_paper":"https://pith.science/paper/HBW6NCBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4797&json=true","fetch_graph":"https://pith.science/api/pith-number/HBW6NCBKTLZKFIEIXRX2CTHRJA/graph.json","fetch_events":"https://pith.science/api/pith-number/HBW6NCBKTLZKFIEIXRX2CTHRJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/action/storage_attestation","attest_author":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/action/author_attestation","sign_citation":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/action/citation_signature","submit_replication":"https://pith.science/pith/HBW6NCBKTLZKFIEIXRX2CTHRJA/action/replication_record"}},"created_at":"2026-05-18T02:21:42.670733+00:00","updated_at":"2026-05-18T02:21:42.670733+00:00"}