{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:UU72ULVXOB2F4MQIVMSJSBNS6W","short_pith_number":"pith:UU72ULVX","canonical_record":{"source":{"id":"0709.0599","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-09-05T12:25:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f0638ef4f531edcce69dad004cdfec7191e958169e8bf0296927d9f87472a84","abstract_canon_sha256":"744f4406e3d00a9e4c2f5ea2aa7a2db99fd3ffdeee766d2ce0e2d6e84a40974a"},"schema_version":"1.0"},"canonical_sha256":"a53faa2eb770745e3208ab249905b2f580abe7372504f638b5ec8c6d114f71e1","source":{"kind":"arxiv","id":"0709.0599","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.0599","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0709.0599v5","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.0599","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"UU72ULVXOB2F","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"UU72ULVXOB2F4MQI","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"UU72ULVX","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:UU72ULVXOB2F4MQIVMSJSBNS6W","target":"record","payload":{"canonical_record":{"source":{"id":"0709.0599","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-09-05T12:25:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f0638ef4f531edcce69dad004cdfec7191e958169e8bf0296927d9f87472a84","abstract_canon_sha256":"744f4406e3d00a9e4c2f5ea2aa7a2db99fd3ffdeee766d2ce0e2d6e84a40974a"},"schema_version":"1.0"},"canonical_sha256":"a53faa2eb770745e3208ab249905b2f580abe7372504f638b5ec8c6d114f71e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.024097Z","signature_b64":"u3yUiM2X+xucgNsYnB4cKUB2/BSNkI7lko5FoORLHgcV6cbH0gpVhQWlnQW3K43LZ47TQfkUEqz+aUjZ8WCiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53faa2eb770745e3208ab249905b2f580abe7372504f638b5ec8c6d114f71e1","last_reissued_at":"2026-05-18T00:58:26.023425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.023425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0709.0599","source_version":5,"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:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5i+U7P9nOH7K1zQqPGGDAAP+xw6X7moWS91ThSfYochpG7+4KenboVygJ3ijPET4x8qGVITWU1F7Kkc5ohnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:02:16.223719Z"},"content_sha256":"a6c49886d2da6bbb05bbe2dd3c53ff85b32ccbe3dd30614fb8e6c42cd4e08751","schema_version":"1.0","event_id":"sha256:a6c49886d2da6bbb05bbe2dd3c53ff85b32ccbe3dd30614fb8e6c42cd4e08751"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:UU72ULVXOB2F4MQIVMSJSBNS6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Universal Properties of Capacity-Approaching LDPC Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igal Sason","submitted_at":"2007-09-05T12:25:58Z","abstract_excerpt":"This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/ bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.0599","kind":"arxiv","version":5},"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:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8a2vwoYZ5VCUIcrbTXeri5Q88jRL8JkQp3WFExZHRQreB2mj0VamIH1CUCLyhGdjbflzGp+c8ABdjpy/pCoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:02:16.224429Z"},"content_sha256":"a8682f200b8ccf6e486d6acd888f926c75dacc7a1e79ca548c2d26dd3511cfb2","schema_version":"1.0","event_id":"sha256:a8682f200b8ccf6e486d6acd888f926c75dacc7a1e79ca548c2d26dd3511cfb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/bundle.json","state_url":"https://pith.science/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/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-11T05:02:16Z","links":{"resolver":"https://pith.science/pith/UU72ULVXOB2F4MQIVMSJSBNS6W","bundle":"https://pith.science/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/bundle.json","state":"https://pith.science/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UU72ULVXOB2F4MQIVMSJSBNS6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:UU72ULVXOB2F4MQIVMSJSBNS6W","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":"744f4406e3d00a9e4c2f5ea2aa7a2db99fd3ffdeee766d2ce0e2d6e84a40974a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-09-05T12:25:58Z","title_canon_sha256":"5f0638ef4f531edcce69dad004cdfec7191e958169e8bf0296927d9f87472a84"},"schema_version":"1.0","source":{"id":"0709.0599","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.0599","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0709.0599v5","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.0599","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"UU72ULVXOB2F","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"UU72ULVXOB2F4MQI","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"UU72ULVX","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:a8682f200b8ccf6e486d6acd888f926c75dacc7a1e79ca548c2d26dd3511cfb2","target":"graph","created_at":"2026-05-18T00:58:26Z","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 is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/ bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and","authors_text":"Igal Sason","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-09-05T12:25:58Z","title":"On Universal Properties of Capacity-Approaching LDPC Ensembles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.0599","kind":"arxiv","version":5},"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:a6c49886d2da6bbb05bbe2dd3c53ff85b32ccbe3dd30614fb8e6c42cd4e08751","target":"record","created_at":"2026-05-18T00:58:26Z","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":"744f4406e3d00a9e4c2f5ea2aa7a2db99fd3ffdeee766d2ce0e2d6e84a40974a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-09-05T12:25:58Z","title_canon_sha256":"5f0638ef4f531edcce69dad004cdfec7191e958169e8bf0296927d9f87472a84"},"schema_version":"1.0","source":{"id":"0709.0599","kind":"arxiv","version":5}},"canonical_sha256":"a53faa2eb770745e3208ab249905b2f580abe7372504f638b5ec8c6d114f71e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a53faa2eb770745e3208ab249905b2f580abe7372504f638b5ec8c6d114f71e1","first_computed_at":"2026-05-18T00:58:26.023425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.023425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u3yUiM2X+xucgNsYnB4cKUB2/BSNkI7lko5FoORLHgcV6cbH0gpVhQWlnQW3K43LZ47TQfkUEqz+aUjZ8WCiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.024097Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.0599","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6c49886d2da6bbb05bbe2dd3c53ff85b32ccbe3dd30614fb8e6c42cd4e08751","sha256:a8682f200b8ccf6e486d6acd888f926c75dacc7a1e79ca548c2d26dd3511cfb2"],"state_sha256":"beb568113e587179f3b8a9f397a8e73e2e30d91caa3a51b30c3f07483935fbc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfHawuYXIznjwBcKYfa7pvKz2d/xM4SBJej2p0HZuNhC8w1c1mpLdph4gdeBxSgVqbggXQNwJ+FQdJTbOdiVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:02:16.228469Z","bundle_sha256":"b452e25a359651e921f801042b5e2be5b23f8d0c407da9c1fefc784cf6650476"}}