{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YDQXLZSZHSEVKZDDNPYGM6ZBA3","short_pith_number":"pith:YDQXLZSZ","canonical_record":{"source":{"id":"1511.00133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-31T14:41:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"171ac8e9f0638d8c4491d5d1550d8c76d752348a0f24203ffb48e8b5141a6253","abstract_canon_sha256":"c5dea6ced78e58b1e42a8c6a8736b2e892caa1ae110f6c4df1dcf4d13c6ae628"},"schema_version":"1.0"},"canonical_sha256":"c0e175e6593c895564636bf0667b2106ec65946fb42c38570d87efb25332b294","source":{"kind":"arxiv","id":"1511.00133","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00133","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00133v3","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00133","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"YDQXLZSZHSEV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDQXLZSZHSEVKZDD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDQXLZSZ","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YDQXLZSZHSEVKZDDNPYGM6ZBA3","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-31T14:41:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"171ac8e9f0638d8c4491d5d1550d8c76d752348a0f24203ffb48e8b5141a6253","abstract_canon_sha256":"c5dea6ced78e58b1e42a8c6a8736b2e892caa1ae110f6c4df1dcf4d13c6ae628"},"schema_version":"1.0"},"canonical_sha256":"c0e175e6593c895564636bf0667b2106ec65946fb42c38570d87efb25332b294","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:09.234469Z","signature_b64":"hoN2wM/IwyqIROzuycdx9XQg1Fk+hNAiXHhWdIHMa0to+4EzOdQjnanzXrqrW7pilP9ayYkqaK/KOl/LkKCKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e175e6593c895564636bf0667b2106ec65946fb42c38570d87efb25332b294","last_reissued_at":"2026-05-18T01:26:09.233726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:09.233726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00133","source_version":3,"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-18T01:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bn0EWhkR10l0DAUJsJFciPH7eoY/9GinTgJ9FPDNSyH+NgzaejiDSNX4ADP3c+QnnBbWFG8dbLPDqyMtb7wWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:04:01.509347Z"},"content_sha256":"2dc8de95e490ba3f200eb629c1890c265468b1719484065c7452bc35a8405288","schema_version":"1.0","event_id":"sha256:2dc8de95e490ba3f200eb629c1890c265468b1719484065c7452bc35a8405288"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YDQXLZSZHSEVKZDDNPYGM6ZBA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some problems of Graph Based Codes for Belief Propagation decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Vasiliy Usatyuk","submitted_at":"2015-10-31T14:41:09Z","abstract_excerpt":"Short survey about code on the graph by example of hardware friendly quasi-cycle LDPC code. We consider two main properties of code: weight enumerator (well known from classic code theory) and Trapping sets pseudocodewords weight spectrum (a subgraph in code graph's which become reasone of decoding failure under Belief propagation). In paper we show fast methods to measure first components of TS enumerator using EMD=ACE constrains for high girth codes on the graph using graph spectral classification method. This approach simplify solving trouble of agreed between minimal TS pseudocode weight a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00133","kind":"arxiv","version":3},"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-18T01:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oZaQKwIl3pNx5o3thcnlyG2RqAB2HWV4byJOBZFVTwSVCD1A05lAJyTMCPfpb814u5TM6Ul6UWkXwBtIIC5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:04:01.509703Z"},"content_sha256":"1246fd672b98d955aad722232c51d6ad14906da31da08b3931c356ece2582692","schema_version":"1.0","event_id":"sha256:1246fd672b98d955aad722232c51d6ad14906da31da08b3931c356ece2582692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/bundle.json","state_url":"https://pith.science/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/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-25T01:04:01Z","links":{"resolver":"https://pith.science/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3","bundle":"https://pith.science/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/bundle.json","state":"https://pith.science/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDQXLZSZHSEVKZDDNPYGM6ZBA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YDQXLZSZHSEVKZDDNPYGM6ZBA3","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":"c5dea6ced78e58b1e42a8c6a8736b2e892caa1ae110f6c4df1dcf4d13c6ae628","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-31T14:41:09Z","title_canon_sha256":"171ac8e9f0638d8c4491d5d1550d8c76d752348a0f24203ffb48e8b5141a6253"},"schema_version":"1.0","source":{"id":"1511.00133","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00133","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00133v3","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00133","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"YDQXLZSZHSEV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDQXLZSZHSEVKZDD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDQXLZSZ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:1246fd672b98d955aad722232c51d6ad14906da31da08b3931c356ece2582692","target":"graph","created_at":"2026-05-18T01:26:09Z","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":"Short survey about code on the graph by example of hardware friendly quasi-cycle LDPC code. We consider two main properties of code: weight enumerator (well known from classic code theory) and Trapping sets pseudocodewords weight spectrum (a subgraph in code graph's which become reasone of decoding failure under Belief propagation). In paper we show fast methods to measure first components of TS enumerator using EMD=ACE constrains for high girth codes on the graph using graph spectral classification method. This approach simplify solving trouble of agreed between minimal TS pseudocode weight a","authors_text":"Vasiliy Usatyuk","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-31T14:41:09Z","title":"Some problems of Graph Based Codes for Belief Propagation decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00133","kind":"arxiv","version":3},"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:2dc8de95e490ba3f200eb629c1890c265468b1719484065c7452bc35a8405288","target":"record","created_at":"2026-05-18T01:26:09Z","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":"c5dea6ced78e58b1e42a8c6a8736b2e892caa1ae110f6c4df1dcf4d13c6ae628","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-31T14:41:09Z","title_canon_sha256":"171ac8e9f0638d8c4491d5d1550d8c76d752348a0f24203ffb48e8b5141a6253"},"schema_version":"1.0","source":{"id":"1511.00133","kind":"arxiv","version":3}},"canonical_sha256":"c0e175e6593c895564636bf0667b2106ec65946fb42c38570d87efb25332b294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e175e6593c895564636bf0667b2106ec65946fb42c38570d87efb25332b294","first_computed_at":"2026-05-18T01:26:09.233726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:09.233726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hoN2wM/IwyqIROzuycdx9XQg1Fk+hNAiXHhWdIHMa0to+4EzOdQjnanzXrqrW7pilP9ayYkqaK/KOl/LkKCKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:09.234469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00133","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dc8de95e490ba3f200eb629c1890c265468b1719484065c7452bc35a8405288","sha256:1246fd672b98d955aad722232c51d6ad14906da31da08b3931c356ece2582692"],"state_sha256":"3dae88b893346bf2007335e9b95f041a71724a63d887e9dc2d84b00eac8df527"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDpa9h7CGHxeoVfyK/sKIzu2HBIUBLJArDnSAKuSPCObOmI96R5nwvj6UHKmlN8oKN5+qTlwLvIXv5pLERBzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T01:04:01.511602Z","bundle_sha256":"3e95dc2f7e9c84da854f899a5c4ebe4a1af58a6af06c0e0b0cb0dc2d0d2276c8"}}