{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:UTPPBDHVIXL4TUM3742W2C2YXO","short_pith_number":"pith:UTPPBDHV","schema_version":"1.0","canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","source":{"kind":"arxiv","id":"0810.2781","version":1},"attestation_state":"computed","paper":{"title":"Linear Time Encoding of LDPC Codes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jin Lu, Jos\\'e M. F. Moura","submitted_at":"2008-10-15T19:32:48Z","abstract_excerpt":"In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method ``label-and-decide.'' We prove that the ``label-and-decide'' method is applicable to Tanner graphs with a hierarchical structure--pseudo-trees-- and that the resulting encoding complexity is linear with the code block length. Next, we define a second type of Tanner graphs--the encoding stopping set. The encoding stopping set is encoded in linear complexity by a revised label-and-decide algorithm--the ``label-decide-recompute.'' Finally, we prove that any Ta"},"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":"0810.2781","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2008-10-15T19:32:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67f40328df0b4db2179715b76e359b866256baac08895decbd81d525461f6cc7","abstract_canon_sha256":"422e261780eaf107d1506adf2d3a4854135fc9720f7725d0a744a86e76e49c72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.426689Z","signature_b64":"w+2qXgceC7hqRqilKvekByVofWxIn6+f4i0MSbdmLp6u8eCNTWucn72+jm0Dht/V0FbwcdQyYPlGtEzE9SniDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","last_reissued_at":"2026-05-18T00:57:58.426115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.426115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Encoding of LDPC Codes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jin Lu, Jos\\'e M. F. Moura","submitted_at":"2008-10-15T19:32:48Z","abstract_excerpt":"In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method ``label-and-decide.'' We prove that the ``label-and-decide'' method is applicable to Tanner graphs with a hierarchical structure--pseudo-trees-- and that the resulting encoding complexity is linear with the code block length. Next, we define a second type of Tanner graphs--the encoding stopping set. The encoding stopping set is encoded in linear complexity by a revised label-and-decide algorithm--the ``label-decide-recompute.'' Finally, we prove that any Ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2781","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.2781","created_at":"2026-05-18T00:57:58.426192+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.2781v1","created_at":"2026-05-18T00:57:58.426192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2781","created_at":"2026-05-18T00:57:58.426192+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTPPBDHVIXL4","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTPPBDHVIXL4TUM3","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTPPBDHV","created_at":"2026-05-18T12:25:58.018023+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/UTPPBDHVIXL4TUM3742W2C2YXO","json":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO.json","graph_json":"https://pith.science/api/pith-number/UTPPBDHVIXL4TUM3742W2C2YXO/graph.json","events_json":"https://pith.science/api/pith-number/UTPPBDHVIXL4TUM3742W2C2YXO/events.json","paper":"https://pith.science/paper/UTPPBDHV"},"agent_actions":{"view_html":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO","download_json":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO.json","view_paper":"https://pith.science/paper/UTPPBDHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.2781&json=true","fetch_graph":"https://pith.science/api/pith-number/UTPPBDHVIXL4TUM3742W2C2YXO/graph.json","fetch_events":"https://pith.science/api/pith-number/UTPPBDHVIXL4TUM3742W2C2YXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/action/storage_attestation","attest_author":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/action/author_attestation","sign_citation":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/action/citation_signature","submit_replication":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/action/replication_record"}},"created_at":"2026-05-18T00:57:58.426192+00:00","updated_at":"2026-05-18T00:57:58.426192+00:00"}