{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:UTPPBDHVIXL4TUM3742W2C2YXO","short_pith_number":"pith:UTPPBDHV","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"},"canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","source":{"kind":"arxiv","id":"0810.2781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2781","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2781v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2781","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"UTPPBDHVIXL4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"UTPPBDHVIXL4TUM3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"UTPPBDHV","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:UTPPBDHVIXL4TUM3742W2C2YXO","target":"record","payload":{"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"},"canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","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"},"source_kind":"arxiv","source_id":"0810.2781","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6JTzV6rzuQvcauxAIf8Lt/nnaVnYZkTQAvz/g3bTXeWL/L3xzPCux2w+FgRDfzhxItltLJ6iwVB0NdZ/wBbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:13.834827Z"},"content_sha256":"3bde13f825de20f75d179444c4f8fb0fee5ed3fc1c3c1a08261f16054fa5a28e","schema_version":"1.0","event_id":"sha256:3bde13f825de20f75d179444c4f8fb0fee5ed3fc1c3c1a08261f16054fa5a28e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:UTPPBDHVIXL4TUM3742W2C2YXO","target":"graph","payload":{"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"},"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhIPBF6XjGx9LxEM2eV4WYXpk1X2CMIo4hmxmsoEDH+CyYFGZwW7KeV5cYeGL4JJ1lqQwMfpIm9HowgmJA92CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:13.835169Z"},"content_sha256":"4064f102a155d68991516ca4191918c6006f97994e8526bb8811f5c6b9654206","schema_version":"1.0","event_id":"sha256:4064f102a155d68991516ca4191918c6006f97994e8526bb8811f5c6b9654206"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/bundle.json","state_url":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTPPBDHVIXL4TUM3742W2C2YXO/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-05T09:24:13Z","links":{"resolver":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO","bundle":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/bundle.json","state":"https://pith.science/pith/UTPPBDHVIXL4TUM3742W2C2YXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTPPBDHVIXL4TUM3742W2C2YXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:UTPPBDHVIXL4TUM3742W2C2YXO","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":"422e261780eaf107d1506adf2d3a4854135fc9720f7725d0a744a86e76e49c72","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2008-10-15T19:32:48Z","title_canon_sha256":"67f40328df0b4db2179715b76e359b866256baac08895decbd81d525461f6cc7"},"schema_version":"1.0","source":{"id":"0810.2781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2781","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2781v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2781","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"UTPPBDHVIXL4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"UTPPBDHVIXL4TUM3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"UTPPBDHV","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:4064f102a155d68991516ca4191918c6006f97994e8526bb8811f5c6b9654206","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"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","authors_text":"Jin Lu, Jos\\'e M. F. Moura","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2008-10-15T19:32:48Z","title":"Linear Time Encoding of LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2781","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:3bde13f825de20f75d179444c4f8fb0fee5ed3fc1c3c1a08261f16054fa5a28e","target":"record","created_at":"2026-05-18T00:57:58Z","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":"422e261780eaf107d1506adf2d3a4854135fc9720f7725d0a744a86e76e49c72","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2008-10-15T19:32:48Z","title_canon_sha256":"67f40328df0b4db2179715b76e359b866256baac08895decbd81d525461f6cc7"},"schema_version":"1.0","source":{"id":"0810.2781","kind":"arxiv","version":1}},"canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4def08cf545d7c9d19bff356d0b58bbbf3275ee7ddef8bdfeec979fbf35601a","first_computed_at":"2026-05-18T00:57:58.426115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.426115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w+2qXgceC7hqRqilKvekByVofWxIn6+f4i0MSbdmLp6u8eCNTWucn72+jm0Dht/V0FbwcdQyYPlGtEzE9SniDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.426689Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.2781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bde13f825de20f75d179444c4f8fb0fee5ed3fc1c3c1a08261f16054fa5a28e","sha256:4064f102a155d68991516ca4191918c6006f97994e8526bb8811f5c6b9654206"],"state_sha256":"ac45d24b7fc4c0ef3a933ab1da9b7b87d35e777084f5a41dd8df0c417b8aba57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qP0+jpw7l6n8dbG+yoGeP1mg9kL09bhZupUN095hn4dhguumjMYqYYidORVNd2SP8Tc4XMIy++NygLokBH14AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:24:13.837127Z","bundle_sha256":"3dcf66932588f3852893a72bf31241d6ec3205a9a995d3c29664153d966e881a"}}