{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IDVFDAPTGTHSDJN66OLRGROPNY","short_pith_number":"pith:IDVFDAPT","canonical_record":{"source":{"id":"1605.05123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"707574426ca3206aa7707692192d5f4c5c2e8c6f8f7a1d28750ec57f2d17a720","abstract_canon_sha256":"4813cbb74bcf6df6d60dffd215a24e9836abd1fbf8b414dcfc4f5897f4233b94"},"schema_version":"1.0"},"canonical_sha256":"40ea5181f334cf21a5bef3971345cf6e06f2480864214d7b907120eaf6b4fd56","source":{"kind":"arxiv","id":"1605.05123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05123","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05123v1","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05123","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"IDVFDAPTGTHS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDVFDAPTGTHSDJN6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDVFDAPT","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IDVFDAPTGTHSDJN66OLRGROPNY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"707574426ca3206aa7707692192d5f4c5c2e8c6f8f7a1d28750ec57f2d17a720","abstract_canon_sha256":"4813cbb74bcf6df6d60dffd215a24e9836abd1fbf8b414dcfc4f5897f4233b94"},"schema_version":"1.0"},"canonical_sha256":"40ea5181f334cf21a5bef3971345cf6e06f2480864214d7b907120eaf6b4fd56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:41.111680Z","signature_b64":"W6aNcan/kXy4AIs2dbLF448Lo6gb/WXm5JrDk9hEInGbFocTbGw1rmmeSjHcc64UbkkavsVB7FpgYhv2As/lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ea5181f334cf21a5bef3971345cf6e06f2480864214d7b907120eaf6b4fd56","last_reissued_at":"2026-05-17T23:48:41.111192Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:41.111192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05123","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-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AROVJLIS6Ko9HvCCJtfV2V7Py6bn8iW1zsL/MSbUUT7pfm9HzLIxSF6x2wKp09+YckvGgN0eFktE4wK0pa3jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:06:52.346794Z"},"content_sha256":"a43083241dafcb000620ea854d22f026368982fb1a0e8c62ee8bb2ae24e83e7d","schema_version":"1.0","event_id":"sha256:a43083241dafcb000620ea854d22f026368982fb1a0e8c62ee8bb2ae24e83e7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IDVFDAPTGTHSDJN66OLRGROPNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The New Multi-Edge Metric-Constrained PEG/QC-PEG Algorithms for Designing the Binary LDPC Codes With Better Cycle-Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junyi Du, Liang Zhou, Xuan He","submitted_at":"2016-05-17T12:01:58Z","abstract_excerpt":"To obtain a better cycle-structure is still a challenge for the low-density parity-check (LDPC) code design. This paper formulates two metrics firstly so that the progressive edge-growth (PEG) algorithm and the approximate cycle extrinsic message degree (ACE) constrained PEG algorithm are unified into one integrated algorithm, called the metric-constrained PEG algorithm (M-PEGA). Then, as an improvement for the M-PEGA, the multi-edge metric-constrained PEG algorithm (MM-PEGA) is proposed based on two new concepts, the multi-edge local girth and the edge-trials. The MM-PEGA with the edge-trials"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05123","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-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyYrsn6tavFx4v6wTYwIFJoeLDQRcXIi0PJ45dEAXY/2MFrjQpRgMjHvxuDhJwmkTlNys1JywO3vCdTunnQ/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:06:52.347392Z"},"content_sha256":"ff6fce3b2c780d272fa3d9b95eccf3c3f61e635ef1c90de3b2c6e388949710cf","schema_version":"1.0","event_id":"sha256:ff6fce3b2c780d272fa3d9b95eccf3c3f61e635ef1c90de3b2c6e388949710cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDVFDAPTGTHSDJN66OLRGROPNY/bundle.json","state_url":"https://pith.science/pith/IDVFDAPTGTHSDJN66OLRGROPNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDVFDAPTGTHSDJN66OLRGROPNY/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-07-05T15:06:52Z","links":{"resolver":"https://pith.science/pith/IDVFDAPTGTHSDJN66OLRGROPNY","bundle":"https://pith.science/pith/IDVFDAPTGTHSDJN66OLRGROPNY/bundle.json","state":"https://pith.science/pith/IDVFDAPTGTHSDJN66OLRGROPNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDVFDAPTGTHSDJN66OLRGROPNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IDVFDAPTGTHSDJN66OLRGROPNY","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":"4813cbb74bcf6df6d60dffd215a24e9836abd1fbf8b414dcfc4f5897f4233b94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:01:58Z","title_canon_sha256":"707574426ca3206aa7707692192d5f4c5c2e8c6f8f7a1d28750ec57f2d17a720"},"schema_version":"1.0","source":{"id":"1605.05123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05123","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05123v1","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05123","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"IDVFDAPTGTHS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDVFDAPTGTHSDJN6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDVFDAPT","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ff6fce3b2c780d272fa3d9b95eccf3c3f61e635ef1c90de3b2c6e388949710cf","target":"graph","created_at":"2026-05-17T23:48:41Z","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":"To obtain a better cycle-structure is still a challenge for the low-density parity-check (LDPC) code design. This paper formulates two metrics firstly so that the progressive edge-growth (PEG) algorithm and the approximate cycle extrinsic message degree (ACE) constrained PEG algorithm are unified into one integrated algorithm, called the metric-constrained PEG algorithm (M-PEGA). Then, as an improvement for the M-PEGA, the multi-edge metric-constrained PEG algorithm (MM-PEGA) is proposed based on two new concepts, the multi-edge local girth and the edge-trials. The MM-PEGA with the edge-trials","authors_text":"Junyi Du, Liang Zhou, Xuan He","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:01:58Z","title":"The New Multi-Edge Metric-Constrained PEG/QC-PEG Algorithms for Designing the Binary LDPC Codes With Better Cycle-Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05123","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:a43083241dafcb000620ea854d22f026368982fb1a0e8c62ee8bb2ae24e83e7d","target":"record","created_at":"2026-05-17T23:48:41Z","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":"4813cbb74bcf6df6d60dffd215a24e9836abd1fbf8b414dcfc4f5897f4233b94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:01:58Z","title_canon_sha256":"707574426ca3206aa7707692192d5f4c5c2e8c6f8f7a1d28750ec57f2d17a720"},"schema_version":"1.0","source":{"id":"1605.05123","kind":"arxiv","version":1}},"canonical_sha256":"40ea5181f334cf21a5bef3971345cf6e06f2480864214d7b907120eaf6b4fd56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40ea5181f334cf21a5bef3971345cf6e06f2480864214d7b907120eaf6b4fd56","first_computed_at":"2026-05-17T23:48:41.111192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:41.111192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W6aNcan/kXy4AIs2dbLF448Lo6gb/WXm5JrDk9hEInGbFocTbGw1rmmeSjHcc64UbkkavsVB7FpgYhv2As/lBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:41.111680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a43083241dafcb000620ea854d22f026368982fb1a0e8c62ee8bb2ae24e83e7d","sha256:ff6fce3b2c780d272fa3d9b95eccf3c3f61e635ef1c90de3b2c6e388949710cf"],"state_sha256":"0c42ed31cc96cd81189be4653f25ebb3baa1e8a302df372c44e66ded60edbfd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fz/tLfzcW0fJ7/f15RkIbp2RKoWCdswGA/xFzpYx48CWvWeaxWaqIyCpTc8T0hNa89zn14OOnr8A/Ucy3ujIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:06:52.350621Z","bundle_sha256":"cc2945c549054766b850b45c2f28df6735c3e76aa67e2611cd068177eeb03cf2"}}