{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RIUQYZWZRTA73EKIBO5FERAHH6","short_pith_number":"pith:RIUQYZWZ","canonical_record":{"source":{"id":"1708.01761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9fe87bc9c6dbbcc99e8acae3efa6f7c42239244efef56ad3c3fea3c173b74e84","abstract_canon_sha256":"1740a0263d333c9be4c9260c029ef3e1812f7ff83bc34effc626d6c10b465fc3"},"schema_version":"1.0"},"canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","source":{"kind":"arxiv","id":"1708.01761","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01761","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01761v2","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01761","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"RIUQYZWZRTA7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIUQYZWZRTA73EKI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIUQYZWZ","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RIUQYZWZRTA73EKIBO5FERAHH6","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9fe87bc9c6dbbcc99e8acae3efa6f7c42239244efef56ad3c3fea3c173b74e84","abstract_canon_sha256":"1740a0263d333c9be4c9260c029ef3e1812f7ff83bc34effc626d6c10b465fc3"},"schema_version":"1.0"},"canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.964725Z","signature_b64":"Msx/22+YIVLq2X3yt/kATuUCd+BXEZ9YMlWkgkcjzpMxKpz4E81HbBYigUMAQwL7M0TyefARGFLWo2Mf2hKdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","last_reissued_at":"2026-05-18T00:14:00.964132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.964132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01761","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-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r60FSORhwwDU/PuCNgN5sq/K/FORpnczTTpkEe5sCAi1NvI/WsEBMChaK/8/AXV5kNK2csgwClOxoL0LAH1tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:08:10.198572Z"},"content_sha256":"94f3cd1a496bc6be537d26e6ac4ef68cb1617d46899b57efe08d6e96ca1c6691","schema_version":"1.0","event_id":"sha256:94f3cd1a496bc6be537d26e6ac4ef68cb1617d46899b57efe08d6e96ca1c6691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RIUQYZWZRTA73EKIBO5FERAHH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of Non Binary Parity Check Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Boutillon","submitted_at":"2017-08-05T12:44:26Z","abstract_excerpt":"This paper generalizes the method proposed by Poulliat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficients, no codeword of Hamming weight two exists. A reduced complexity algorithm to compute the binary Hamming weight 3 of a parity check is proposed. When the number of sets of coefficients is too high for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01761","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-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9BOVw0A/xCedB71v0LIxQl7m1LY44Aq9feWJmcixdYoIeBB1QRs8m5Sr9Lt8VJwqMCrqRyAR25O+xzMa/KADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:08:10.198918Z"},"content_sha256":"f3f9de61a2a8400bf4b9c7e187a5fe854ef92130b072fe907a410c413bb8fbdd","schema_version":"1.0","event_id":"sha256:f3f9de61a2a8400bf4b9c7e187a5fe854ef92130b072fe907a410c413bb8fbdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/bundle.json","state_url":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIUQYZWZRTA73EKIBO5FERAHH6/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-27T15:08:10Z","links":{"resolver":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6","bundle":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/bundle.json","state":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIUQYZWZRTA73EKIBO5FERAHH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RIUQYZWZRTA73EKIBO5FERAHH6","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":"1740a0263d333c9be4c9260c029ef3e1812f7ff83bc34effc626d6c10b465fc3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","title_canon_sha256":"9fe87bc9c6dbbcc99e8acae3efa6f7c42239244efef56ad3c3fea3c173b74e84"},"schema_version":"1.0","source":{"id":"1708.01761","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01761","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01761v2","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01761","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"RIUQYZWZRTA7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIUQYZWZRTA73EKI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIUQYZWZ","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:f3f9de61a2a8400bf4b9c7e187a5fe854ef92130b072fe907a410c413bb8fbdd","target":"graph","created_at":"2026-05-18T00:14:00Z","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":"This paper generalizes the method proposed by Poulliat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficients, no codeword of Hamming weight two exists. A reduced complexity algorithm to compute the binary Hamming weight 3 of a parity check is proposed. When the number of sets of coefficients is too high for a","authors_text":"Emmanuel Boutillon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","title":"Optimization of Non Binary Parity Check Coefficients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01761","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:94f3cd1a496bc6be537d26e6ac4ef68cb1617d46899b57efe08d6e96ca1c6691","target":"record","created_at":"2026-05-18T00:14:00Z","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":"1740a0263d333c9be4c9260c029ef3e1812f7ff83bc34effc626d6c10b465fc3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","title_canon_sha256":"9fe87bc9c6dbbcc99e8acae3efa6f7c42239244efef56ad3c3fea3c173b74e84"},"schema_version":"1.0","source":{"id":"1708.01761","kind":"arxiv","version":2}},"canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","first_computed_at":"2026-05-18T00:14:00.964132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.964132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Msx/22+YIVLq2X3yt/kATuUCd+BXEZ9YMlWkgkcjzpMxKpz4E81HbBYigUMAQwL7M0TyefARGFLWo2Mf2hKdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.964725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01761","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94f3cd1a496bc6be537d26e6ac4ef68cb1617d46899b57efe08d6e96ca1c6691","sha256:f3f9de61a2a8400bf4b9c7e187a5fe854ef92130b072fe907a410c413bb8fbdd"],"state_sha256":"64be4fd4424b432f3a993f22fb034a8edc612f466ff9b2b95fd508f1c9e12f5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qelZGtFsCFTryi8CKLobkA3RbRA43sX1pd+SIfXVKv4hmRSVsYcKGnvtj/uDREK5oK9aMEUE4KOHqmY13H2wAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:08:10.201100Z","bundle_sha256":"aac7e46e31c7468ab4e7e8c519983b904350705ba1bdb8b55484a56de5429d21"}}