{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3VRKGHAM5B3VE36PWVNJQZZZN6","short_pith_number":"pith:3VRKGHAM","canonical_record":{"source":{"id":"1006.1024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-05T06:19:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e8edf798715472f80cb99a06ba67576bb505c6da9192e548d9dda09fb71d5f7","abstract_canon_sha256":"3ec2f6a2284187b8b7de92dd77547b3f0c0c99cdcbcd73b3efd41b1c1153a49f"},"schema_version":"1.0"},"canonical_sha256":"dd62a31c0ce877526fcfb55a9867396f8efbdbc5fb8cca02bfcd9343e6cda1fa","source":{"kind":"arxiv","id":"1006.1024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1024","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1024v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1024","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"3VRKGHAM5B3V","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3VRKGHAM5B3VE36P","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3VRKGHAM","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3VRKGHAM5B3VE36PWVNJQZZZN6","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-05T06:19:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e8edf798715472f80cb99a06ba67576bb505c6da9192e548d9dda09fb71d5f7","abstract_canon_sha256":"3ec2f6a2284187b8b7de92dd77547b3f0c0c99cdcbcd73b3efd41b1c1153a49f"},"schema_version":"1.0"},"canonical_sha256":"dd62a31c0ce877526fcfb55a9867396f8efbdbc5fb8cca02bfcd9343e6cda1fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.505817Z","signature_b64":"fvccA/LM7lLVUpw6gy32isx2DhmR+f63KiI7roGD3pJF6+INSyFp8UB8lmpKQYdrpusB4PFwuuzticmpWwc0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd62a31c0ce877526fcfb55a9867396f8efbdbc5fb8cca02bfcd9343e6cda1fa","last_reissued_at":"2026-05-18T00:58:19.505093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.505093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1024","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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cy74KBPDE9UURCjE1HzZ5Ji79SdYSVo9feUiLVe1O5d40gtitdeA/y4DkHIpo++InIYhMdAwpb07S/5DH2qRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:43:46.222296Z"},"content_sha256":"774ee590b8c5c1b65a477f37c49faa81742cba61879ea513f01ec6e00628eae0","schema_version":"1.0","event_id":"sha256:774ee590b8c5c1b65a477f37c49faa81742cba61879ea513f01ec6e00628eae0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3VRKGHAM5B3VE36PWVNJQZZZN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Xiao Ma, Xuepeng Wang","submitted_at":"2010-06-05T06:19:28Z","abstract_excerpt":"In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDPC codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1024","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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sspJkMCnWAY5JdfMJzh1zQGAy2vPxt8di4AM+/gRlatpqkmrEAGLHKDXaG617BvW+4SG2av1sK74t2q9Fk12Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:43:46.222666Z"},"content_sha256":"a3b901fa73fad2a6e27fb0906f75e1c10fb93f65adb4fea4be8695e44bfcc6b8","schema_version":"1.0","event_id":"sha256:a3b901fa73fad2a6e27fb0906f75e1c10fb93f65adb4fea4be8695e44bfcc6b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/bundle.json","state_url":"https://pith.science/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/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-06-01T02:43:46Z","links":{"resolver":"https://pith.science/pith/3VRKGHAM5B3VE36PWVNJQZZZN6","bundle":"https://pith.science/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/bundle.json","state":"https://pith.science/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VRKGHAM5B3VE36PWVNJQZZZN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3VRKGHAM5B3VE36PWVNJQZZZN6","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":"3ec2f6a2284187b8b7de92dd77547b3f0c0c99cdcbcd73b3efd41b1c1153a49f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-05T06:19:28Z","title_canon_sha256":"4e8edf798715472f80cb99a06ba67576bb505c6da9192e548d9dda09fb71d5f7"},"schema_version":"1.0","source":{"id":"1006.1024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1024","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1024v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1024","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"3VRKGHAM5B3V","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3VRKGHAM5B3VE36P","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3VRKGHAM","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:a3b901fa73fad2a6e27fb0906f75e1c10fb93f65adb4fea4be8695e44bfcc6b8","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDPC codes.","authors_text":"Baoming Bai, Xiao Ma, Xuepeng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-05T06:19:28Z","title":"A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1024","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:774ee590b8c5c1b65a477f37c49faa81742cba61879ea513f01ec6e00628eae0","target":"record","created_at":"2026-05-18T00:58:19Z","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":"3ec2f6a2284187b8b7de92dd77547b3f0c0c99cdcbcd73b3efd41b1c1153a49f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-05T06:19:28Z","title_canon_sha256":"4e8edf798715472f80cb99a06ba67576bb505c6da9192e548d9dda09fb71d5f7"},"schema_version":"1.0","source":{"id":"1006.1024","kind":"arxiv","version":1}},"canonical_sha256":"dd62a31c0ce877526fcfb55a9867396f8efbdbc5fb8cca02bfcd9343e6cda1fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd62a31c0ce877526fcfb55a9867396f8efbdbc5fb8cca02bfcd9343e6cda1fa","first_computed_at":"2026-05-18T00:58:19.505093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.505093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fvccA/LM7lLVUpw6gy32isx2DhmR+f63KiI7roGD3pJF6+INSyFp8UB8lmpKQYdrpusB4PFwuuzticmpWwc0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.505817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:774ee590b8c5c1b65a477f37c49faa81742cba61879ea513f01ec6e00628eae0","sha256:a3b901fa73fad2a6e27fb0906f75e1c10fb93f65adb4fea4be8695e44bfcc6b8"],"state_sha256":"6882d52e1e7a769a2df06a0b4aad3e1c41c35a9329b464919b4fe59e88298fad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLWCEhpIKGznT++P40Sl+Ctt4NU6z62KKa4gr/gddQN4+Ny6QWZXXIpmDw4OrcxBIy3KK11plXJrZQK+AZpjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:43:46.224689Z","bundle_sha256":"939b6f1ea842590c40b6f0d47e1241ed2372994166fc5a58f47b6bc6e3642b47"}}