{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U4G7PDOED6UAR5LU4LU67KARSX","short_pith_number":"pith:U4G7PDOE","schema_version":"1.0","canonical_sha256":"a70df78dc41fa808f574e2e9efa81195fe5d13e4edd8809d7849c8640b03c96d","source":{"kind":"arxiv","id":"1411.2169","version":1},"attestation_state":"computed","paper":{"title":"The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"John O. Brevik, Michael E. O'Sullivan","submitted_at":"2014-11-08T22:35:02Z","abstract_excerpt":"The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets."},"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":"1411.2169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-08T22:35:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83e30166813ae91d486a11acce98448082bc44df529341833c751ceeba307357","abstract_canon_sha256":"2073ce766d5a168c5850f2c2cef15ce8eb3aab6f050b683e09633d568c6cecaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.293776Z","signature_b64":"/sk180pmfjWePzn/0ZVLvLg/J5Et3upbTIg3bUr8tzx0h6MZZ0fRXCguQtybOolOu2QGhDco0t7rV+2X/CBKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70df78dc41fa808f574e2e9efa81195fe5d13e4edd8809d7849c8640b03c96d","last_reissued_at":"2026-05-18T02:38:08.293310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.293310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"John O. Brevik, Michael E. O'Sullivan","submitted_at":"2014-11-08T22:35:02Z","abstract_excerpt":"The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2169","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":"1411.2169","created_at":"2026-05-18T02:38:08.293394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2169v1","created_at":"2026-05-18T02:38:08.293394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2169","created_at":"2026-05-18T02:38:08.293394+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4G7PDOED6UA","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4G7PDOED6UAR5LU","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4G7PDOE","created_at":"2026-05-18T12:28:52.271510+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/U4G7PDOED6UAR5LU4LU67KARSX","json":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX.json","graph_json":"https://pith.science/api/pith-number/U4G7PDOED6UAR5LU4LU67KARSX/graph.json","events_json":"https://pith.science/api/pith-number/U4G7PDOED6UAR5LU4LU67KARSX/events.json","paper":"https://pith.science/paper/U4G7PDOE"},"agent_actions":{"view_html":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX","download_json":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX.json","view_paper":"https://pith.science/paper/U4G7PDOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2169&json=true","fetch_graph":"https://pith.science/api/pith-number/U4G7PDOED6UAR5LU4LU67KARSX/graph.json","fetch_events":"https://pith.science/api/pith-number/U4G7PDOED6UAR5LU4LU67KARSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX/action/storage_attestation","attest_author":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX/action/author_attestation","sign_citation":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX/action/citation_signature","submit_replication":"https://pith.science/pith/U4G7PDOED6UAR5LU4LU67KARSX/action/replication_record"}},"created_at":"2026-05-18T02:38:08.293394+00:00","updated_at":"2026-05-18T02:38:08.293394+00:00"}