{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FKQZL7BBECHUEFVB4Y4JOJVIRQ","short_pith_number":"pith:FKQZL7BB","schema_version":"1.0","canonical_sha256":"2aa195fc21208f4216a1e6389726a88c1a012b7dfab1bcb754993ec382828eab","source":{"kind":"arxiv","id":"1710.09651","version":2},"attestation_state":"computed","paper":{"title":"Protograph LDPC Codes with Block Thresholds: Extension to Degree-1 and Generalized Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Asit Kumar Pradhan","submitted_at":"2017-10-26T11:47:16Z","abstract_excerpt":"Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes and doubly-generalized LDPC (DGLDPC) codes, conditions are derived to ensure equality of bit-error threshold and block-error threshold. Using this condition, low-rate codes with block-error threshold close to capacity are designed and shown to have better error rate performance than other existing codes."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1710.09651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-26T11:47:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"194c4aa16eb2ef5a9e758814c4e3acbff37c5e9858692fbb26205178868eae6e","abstract_canon_sha256":"eed10b1337fd8ec751bdd738a1e1ba044379c60cb7f5271866a8f18742e883eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:01.632116Z","signature_b64":"M851eAI399Ndi4/b63jS9e1QZT5JVlkhAYkUAaCgIBx89tv7D7KVhtsGvFsUZQEGXXanQrr8Q+0Z1lED3XMiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa195fc21208f4216a1e6389726a88c1a012b7dfab1bcb754993ec382828eab","last_reissued_at":"2026-05-18T00:17:01.631621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:01.631621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Protograph LDPC Codes with Block Thresholds: Extension to Degree-1 and Generalized Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Asit Kumar Pradhan","submitted_at":"2017-10-26T11:47:16Z","abstract_excerpt":"Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes and doubly-generalized LDPC (DGLDPC) codes, conditions are derived to ensure equality of bit-error threshold and block-error threshold. Using this condition, low-rate codes with block-error threshold close to capacity are designed and shown to have better error rate performance than other existing codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09651","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.09651","created_at":"2026-05-18T00:17:01.631721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09651v2","created_at":"2026-05-18T00:17:01.631721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09651","created_at":"2026-05-18T00:17:01.631721+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKQZL7BBECHU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKQZL7BBECHUEFVB","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKQZL7BB","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ","json":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ.json","graph_json":"https://pith.science/api/pith-number/FKQZL7BBECHUEFVB4Y4JOJVIRQ/graph.json","events_json":"https://pith.science/api/pith-number/FKQZL7BBECHUEFVB4Y4JOJVIRQ/events.json","paper":"https://pith.science/paper/FKQZL7BB"},"agent_actions":{"view_html":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ","download_json":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ.json","view_paper":"https://pith.science/paper/FKQZL7BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09651&json=true","fetch_graph":"https://pith.science/api/pith-number/FKQZL7BBECHUEFVB4Y4JOJVIRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FKQZL7BBECHUEFVB4Y4JOJVIRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ/action/storage_attestation","attest_author":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ/action/author_attestation","sign_citation":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ/action/citation_signature","submit_replication":"https://pith.science/pith/FKQZL7BBECHUEFVB4Y4JOJVIRQ/action/replication_record"}},"created_at":"2026-05-18T00:17:01.631721+00:00","updated_at":"2026-05-18T00:17:01.631721+00:00"}