{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EFP4XRBHCWIME4C6OTATCPONCH","short_pith_number":"pith:EFP4XRBH","canonical_record":{"source":{"id":"1702.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T11:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18bf29e68dd457110f49f1db3fcda4bf1d439aa998beb419276d1a9c9bcb6763","abstract_canon_sha256":"2a7aee61172e1612c16162e8e06cc33bc93b4edb53e2d6d0217e387fd16b66b8"},"schema_version":"1.0"},"canonical_sha256":"215fcbc4271590c2705e74c1313dcd11e363a9f3bda040e75b71e1c713e375b5","source":{"kind":"arxiv","id":"1702.02372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02372","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02372v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02372","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"EFP4XRBHCWIM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFP4XRBHCWIME4C6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFP4XRBH","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EFP4XRBHCWIME4C6OTATCPONCH","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T11:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18bf29e68dd457110f49f1db3fcda4bf1d439aa998beb419276d1a9c9bcb6763","abstract_canon_sha256":"2a7aee61172e1612c16162e8e06cc33bc93b4edb53e2d6d0217e387fd16b66b8"},"schema_version":"1.0"},"canonical_sha256":"215fcbc4271590c2705e74c1313dcd11e363a9f3bda040e75b71e1c713e375b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.101263Z","signature_b64":"Dv0iBwvagEO0MlwJNWdiWi/uhmyJKdCNYtf7KvuXYql69OTNJYSge15GURY78xaMErDKmo1G//K27c5cxhjDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215fcbc4271590c2705e74c1313dcd11e363a9f3bda040e75b71e1c713e375b5","last_reissued_at":"2026-05-18T00:51:06.100785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.100785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02372","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:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/8rD8iRRHFMArvsmKYCzvuwtDC004mRV6i0gwQnNpxRWoKJlPNYn4OR2sgQGQqhQ+F2hIMo+DjarGQz8PZHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:30:41.349303Z"},"content_sha256":"f382b7e7055426f1d2a7fa4fd8b18750570e9ffc3714364f0a6e3831ad161140","schema_version":"1.0","event_id":"sha256:f382b7e7055426f1d2a7fa4fd8b18750570e9ffc3714364f0a6e3831ad161140"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EFP4XRBHCWIME4C6OTATCPONCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multilevel Coding Schemes Based on Non-Binary LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Valeriya Potapova","submitted_at":"2017-02-08T11:05:42Z","abstract_excerpt":"We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity we consider multilevel coding schemes based on non-binary LDPC codes (NB-LDPC-MLC schemes) over smaller fields. The use of such schemes gives us a reasonable gain in complexity. At the same time the performance of NB-LDPC-MLC schemes is practically the same as th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02372","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:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYrfD7vWMNGdL83M7bPIUwV+9u8bmx10m78tRIeYFVS52OHUTL9+iS1ymxH6wa5ruzXQBk2o505o4RXguSv1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:30:41.349661Z"},"content_sha256":"907e522d14e499778c0e48437b5b0d9de0ef594b792a48736aa9bd092a04b2ad","schema_version":"1.0","event_id":"sha256:907e522d14e499778c0e48437b5b0d9de0ef594b792a48736aa9bd092a04b2ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFP4XRBHCWIME4C6OTATCPONCH/bundle.json","state_url":"https://pith.science/pith/EFP4XRBHCWIME4C6OTATCPONCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFP4XRBHCWIME4C6OTATCPONCH/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-26T20:30:41Z","links":{"resolver":"https://pith.science/pith/EFP4XRBHCWIME4C6OTATCPONCH","bundle":"https://pith.science/pith/EFP4XRBHCWIME4C6OTATCPONCH/bundle.json","state":"https://pith.science/pith/EFP4XRBHCWIME4C6OTATCPONCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFP4XRBHCWIME4C6OTATCPONCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EFP4XRBHCWIME4C6OTATCPONCH","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":"2a7aee61172e1612c16162e8e06cc33bc93b4edb53e2d6d0217e387fd16b66b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T11:05:42Z","title_canon_sha256":"18bf29e68dd457110f49f1db3fcda4bf1d439aa998beb419276d1a9c9bcb6763"},"schema_version":"1.0","source":{"id":"1702.02372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02372","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02372v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02372","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"EFP4XRBHCWIM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFP4XRBHCWIME4C6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFP4XRBH","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:907e522d14e499778c0e48437b5b0d9de0ef594b792a48736aa9bd092a04b2ad","target":"graph","created_at":"2026-05-18T00:51:06Z","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 address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity we consider multilevel coding schemes based on non-binary LDPC codes (NB-LDPC-MLC schemes) over smaller fields. The use of such schemes gives us a reasonable gain in complexity. At the same time the performance of NB-LDPC-MLC schemes is practically the same as th","authors_text":"Alexey Frolov, Valeriya Potapova","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T11:05:42Z","title":"On Multilevel Coding Schemes Based on Non-Binary LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02372","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:f382b7e7055426f1d2a7fa4fd8b18750570e9ffc3714364f0a6e3831ad161140","target":"record","created_at":"2026-05-18T00:51:06Z","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":"2a7aee61172e1612c16162e8e06cc33bc93b4edb53e2d6d0217e387fd16b66b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T11:05:42Z","title_canon_sha256":"18bf29e68dd457110f49f1db3fcda4bf1d439aa998beb419276d1a9c9bcb6763"},"schema_version":"1.0","source":{"id":"1702.02372","kind":"arxiv","version":1}},"canonical_sha256":"215fcbc4271590c2705e74c1313dcd11e363a9f3bda040e75b71e1c713e375b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215fcbc4271590c2705e74c1313dcd11e363a9f3bda040e75b71e1c713e375b5","first_computed_at":"2026-05-18T00:51:06.100785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.100785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dv0iBwvagEO0MlwJNWdiWi/uhmyJKdCNYtf7KvuXYql69OTNJYSge15GURY78xaMErDKmo1G//K27c5cxhjDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.101263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f382b7e7055426f1d2a7fa4fd8b18750570e9ffc3714364f0a6e3831ad161140","sha256:907e522d14e499778c0e48437b5b0d9de0ef594b792a48736aa9bd092a04b2ad"],"state_sha256":"f315e20f0dbd452972175a8b9ad9d92b4b8faa1f61731a9c55f4c60f94a50b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ke1ODWpd3xKsgqlLuIZU2t85an0ONybuva1BIDrME/21KAn76Uk4Y5qChM1+CGTSOEoR7zsgx6LHdCmeDmALBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:30:41.355005Z","bundle_sha256":"584b9d6ad1826bf935fd0aacc0baa1caa26207b5eeb12c171e9e54150d55a93b"}}