{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2KJVQXVQQ7ADRATONTTSC45UVB","short_pith_number":"pith:2KJVQXVQ","canonical_record":{"source":{"id":"1705.10717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T16:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abe24ea5c748cdc47b2b41c287c270a69b2daba5e4807036576bbba19792de92","abstract_canon_sha256":"50ce4de50ad93f51f1badd147b4bddd49eac61b28ef8a87a6f254618b37f64f2"},"schema_version":"1.0"},"canonical_sha256":"d293585eb087c038826e6ce72173b4a85b4b71039627721ceb49cb6e8d001df9","source":{"kind":"arxiv","id":"1705.10717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10717","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10717v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10717","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"2KJVQXVQQ7AD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KJVQXVQQ7ADRATO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KJVQXVQ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2KJVQXVQQ7ADRATONTTSC45UVB","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T16:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abe24ea5c748cdc47b2b41c287c270a69b2daba5e4807036576bbba19792de92","abstract_canon_sha256":"50ce4de50ad93f51f1badd147b4bddd49eac61b28ef8a87a6f254618b37f64f2"},"schema_version":"1.0"},"canonical_sha256":"d293585eb087c038826e6ce72173b4a85b4b71039627721ceb49cb6e8d001df9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.703647Z","signature_b64":"P1qzKk9Ob0tOrfoUBCYJELm28dt285tYSDkz9VoyNNTiHhBADsfa+W+tseogceo2MFZbovlzNM7ys4l55hkbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d293585eb087c038826e6ce72173b4a85b4b71039627721ceb49cb6e8d001df9","last_reissued_at":"2026-05-18T00:43:23.702944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.702944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10717","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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jopZXHN85lZ7MvhF9mHcHxl2rmsXrRQOnyrk69HRymT6Ro60305QsmnAnqbLgB49fTz4y+31wP0ZLSg36a11AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:31:20.601379Z"},"content_sha256":"c6411a0645f12121f23430c8887465247c2ca5f5f59490213c185133deb6dbaa","schema_version":"1.0","event_id":"sha256:c6411a0645f12121f23430c8887465247c2ca5f5f59490213c185133deb6dbaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2KJVQXVQQ7ADRATONTTSC45UVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Stanislav Kruglik, Valeriya Potapova","submitted_at":"2017-05-30T16:11:47Z","abstract_excerpt":"An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In particular, it was shown that NB QC-LDPC codes constructed with use of our algorithm loose less that 0.1 dB in comparison to the best NB LDPC cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10717","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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItCDWH5HAZWWDyYjBn9nG+1LOcmzjg5PGJ573ZaitrixmhhN48WS/71/K/plFlnvbLqMK5c6ax323ujk8U2nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:31:20.601728Z"},"content_sha256":"8031a96c367afd2740b44b0738974227326ec8c3736df9c1a55921b994b25546","schema_version":"1.0","event_id":"sha256:8031a96c367afd2740b44b0738974227326ec8c3736df9c1a55921b994b25546"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KJVQXVQQ7ADRATONTTSC45UVB/bundle.json","state_url":"https://pith.science/pith/2KJVQXVQQ7ADRATONTTSC45UVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KJVQXVQQ7ADRATONTTSC45UVB/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-26T13:31:20Z","links":{"resolver":"https://pith.science/pith/2KJVQXVQQ7ADRATONTTSC45UVB","bundle":"https://pith.science/pith/2KJVQXVQQ7ADRATONTTSC45UVB/bundle.json","state":"https://pith.science/pith/2KJVQXVQQ7ADRATONTTSC45UVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KJVQXVQQ7ADRATONTTSC45UVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2KJVQXVQQ7ADRATONTTSC45UVB","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":"50ce4de50ad93f51f1badd147b4bddd49eac61b28ef8a87a6f254618b37f64f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T16:11:47Z","title_canon_sha256":"abe24ea5c748cdc47b2b41c287c270a69b2daba5e4807036576bbba19792de92"},"schema_version":"1.0","source":{"id":"1705.10717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10717","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10717v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10717","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"2KJVQXVQQ7AD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KJVQXVQQ7ADRATO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KJVQXVQ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8031a96c367afd2740b44b0738974227326ec8c3736df9c1a55921b994b25546","target":"graph","created_at":"2026-05-18T00:43:23Z","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":"An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In particular, it was shown that NB QC-LDPC codes constructed with use of our algorithm loose less that 0.1 dB in comparison to the best NB LDPC cod","authors_text":"Alexey Frolov, Stanislav Kruglik, Valeriya Potapova","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T16:11:47Z","title":"A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10717","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:c6411a0645f12121f23430c8887465247c2ca5f5f59490213c185133deb6dbaa","target":"record","created_at":"2026-05-18T00:43:23Z","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":"50ce4de50ad93f51f1badd147b4bddd49eac61b28ef8a87a6f254618b37f64f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T16:11:47Z","title_canon_sha256":"abe24ea5c748cdc47b2b41c287c270a69b2daba5e4807036576bbba19792de92"},"schema_version":"1.0","source":{"id":"1705.10717","kind":"arxiv","version":1}},"canonical_sha256":"d293585eb087c038826e6ce72173b4a85b4b71039627721ceb49cb6e8d001df9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d293585eb087c038826e6ce72173b4a85b4b71039627721ceb49cb6e8d001df9","first_computed_at":"2026-05-18T00:43:23.702944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.702944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1qzKk9Ob0tOrfoUBCYJELm28dt285tYSDkz9VoyNNTiHhBADsfa+W+tseogceo2MFZbovlzNM7ys4l55hkbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.703647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6411a0645f12121f23430c8887465247c2ca5f5f59490213c185133deb6dbaa","sha256:8031a96c367afd2740b44b0738974227326ec8c3736df9c1a55921b994b25546"],"state_sha256":"25e79519eccf0fece2c9f9962477da7e4a6e56e94060a456d484855b79c3c7e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE+FOs1cizLNkNbxKHFy4g6OGkok2shfFT5HIsNj7I41veHZVLitQnYzTNOp+TezhhfP3sIa3wm0WTDBAJ86Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:31:20.603667Z","bundle_sha256":"1a268b63fd9de75f8bf38597c457a3bd1e6ecb7af353850d083b228c23909017"}}