{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DM46EKNMVMS4G4S2LGQCIXOEUL","short_pith_number":"pith:DM46EKNM","canonical_record":{"source":{"id":"1103.2690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T15:29:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98e4e0ce5ab7b483dd153e107b4801246fb1555b3c55de711f1043c41cf6084e","abstract_canon_sha256":"c9001cdf381c7a994a25d5b05bf9c395b8eda9c9fc7f14df472a0cb66bbfc616"},"schema_version":"1.0"},"canonical_sha256":"1b39e229acab25c3725a59a0245dc4a2ce97eea1c1ec00295b85df75aad92e20","source":{"kind":"arxiv","id":"1103.2690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2690","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2690v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2690","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"DM46EKNMVMS4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DM46EKNMVMS4G4S2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DM46EKNM","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DM46EKNMVMS4G4S2LGQCIXOEUL","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T15:29:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98e4e0ce5ab7b483dd153e107b4801246fb1555b3c55de711f1043c41cf6084e","abstract_canon_sha256":"c9001cdf381c7a994a25d5b05bf9c395b8eda9c9fc7f14df472a0cb66bbfc616"},"schema_version":"1.0"},"canonical_sha256":"1b39e229acab25c3725a59a0245dc4a2ce97eea1c1ec00295b85df75aad92e20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:54.358844Z","signature_b64":"zuFqAizK1X3x70Pq2/QodYQg8pTQ3rV+fEWH+viNkyxTxIwAbWVAZkofhVuvNJfpv9e4VYMGkphXACWE6yXnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b39e229acab25c3725a59a0245dc4a2ce97eea1c1ec00295b85df75aad92e20","last_reissued_at":"2026-05-18T04:26:54.358233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:54.358233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2690","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-18T04:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+QMEhUKxbnyx04hoh20KA/V9nJX35FVwQIbvJtz/4wYk6oqYFk+l9zVtJR8mvSvZL3k8KtqRRElsmLDkF/rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:26.524407Z"},"content_sha256":"ac1630f6f499e08c9ad57882ea342f43a425ad8c43d950b3e60e11a9a008f466","schema_version":"1.0","event_id":"sha256:ac1630f6f499e08c9ad57882ea342f43a425ad8c43d950b3e60e11a9a008f466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DM46EKNMVMS4G4S2LGQCIXOEUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduled-PEG construction of LDPC codes for Upper-Layer FEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Declercq, Lam Pham Sy, Nghia Pham, Valentin Savin","submitted_at":"2011-03-14T15:29:02Z","abstract_excerpt":"The Progressive Edge Growth (PEG) algorithm is one of the most widely-used method for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling distribution that yields \"the best\" performance in terms of decoding overhead, performance metric specific to erasure codes and widely used for upper-layer forward error correction (UL-FEC). We rigorously formulate this optimization problem, and we show that it can be addressed by usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2690","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-18T04:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0xFCxRf/UxO/UI6Y03JXwrdgmRkXF3eK2+fTI2lRouDtos24GNhxbJWtN6SDKELxgAYYCPkciwLwbR8e7kdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:26.524761Z"},"content_sha256":"eaf9f86391829ee0689c9de9ea5d733bed5e6f61cdc2e84dc85255d1976e7deb","schema_version":"1.0","event_id":"sha256:eaf9f86391829ee0689c9de9ea5d733bed5e6f61cdc2e84dc85255d1976e7deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/bundle.json","state_url":"https://pith.science/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/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-23T04:13:26Z","links":{"resolver":"https://pith.science/pith/DM46EKNMVMS4G4S2LGQCIXOEUL","bundle":"https://pith.science/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/bundle.json","state":"https://pith.science/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DM46EKNMVMS4G4S2LGQCIXOEUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DM46EKNMVMS4G4S2LGQCIXOEUL","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":"c9001cdf381c7a994a25d5b05bf9c395b8eda9c9fc7f14df472a0cb66bbfc616","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T15:29:02Z","title_canon_sha256":"98e4e0ce5ab7b483dd153e107b4801246fb1555b3c55de711f1043c41cf6084e"},"schema_version":"1.0","source":{"id":"1103.2690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2690","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2690v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2690","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"DM46EKNMVMS4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DM46EKNMVMS4G4S2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DM46EKNM","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:eaf9f86391829ee0689c9de9ea5d733bed5e6f61cdc2e84dc85255d1976e7deb","target":"graph","created_at":"2026-05-18T04:26:54Z","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":"The Progressive Edge Growth (PEG) algorithm is one of the most widely-used method for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling distribution that yields \"the best\" performance in terms of decoding overhead, performance metric specific to erasure codes and widely used for upper-layer forward error correction (UL-FEC). We rigorously formulate this optimization problem, and we show that it can be addressed by usin","authors_text":"David Declercq, Lam Pham Sy, Nghia Pham, Valentin Savin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T15:29:02Z","title":"Scheduled-PEG construction of LDPC codes for Upper-Layer FEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2690","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:ac1630f6f499e08c9ad57882ea342f43a425ad8c43d950b3e60e11a9a008f466","target":"record","created_at":"2026-05-18T04:26:54Z","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":"c9001cdf381c7a994a25d5b05bf9c395b8eda9c9fc7f14df472a0cb66bbfc616","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T15:29:02Z","title_canon_sha256":"98e4e0ce5ab7b483dd153e107b4801246fb1555b3c55de711f1043c41cf6084e"},"schema_version":"1.0","source":{"id":"1103.2690","kind":"arxiv","version":1}},"canonical_sha256":"1b39e229acab25c3725a59a0245dc4a2ce97eea1c1ec00295b85df75aad92e20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b39e229acab25c3725a59a0245dc4a2ce97eea1c1ec00295b85df75aad92e20","first_computed_at":"2026-05-18T04:26:54.358233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:54.358233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zuFqAizK1X3x70Pq2/QodYQg8pTQ3rV+fEWH+viNkyxTxIwAbWVAZkofhVuvNJfpv9e4VYMGkphXACWE6yXnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:54.358844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac1630f6f499e08c9ad57882ea342f43a425ad8c43d950b3e60e11a9a008f466","sha256:eaf9f86391829ee0689c9de9ea5d733bed5e6f61cdc2e84dc85255d1976e7deb"],"state_sha256":"799c3f6afc20c9280e9624e9497d9d48eafeb60683a38e3f593c6be45e230b8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TvMH8ENMbbwo4sypID1BMHEzBCN09kfIrfXaJhoG2XZAWwAsC7Yd1EuRm2RgtoSm1XtyqV6EVs3cck+jiNFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:13:26.526763Z","bundle_sha256":"9ab2a9cae0248aa07ab151663660a64f16ec25bc45d5624af3596a87181199fa"}}