{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y26OBNEMYSLWGAELSE6S3TAKZL","short_pith_number":"pith:Y26OBNEM","schema_version":"1.0","canonical_sha256":"c6bce0b48cc49763008b913d2dcc0acaf8f2b1f2b93b99123d972e2f52e7ee5d","source":{"kind":"arxiv","id":"1107.3177","version":1},"attestation_state":"computed","paper":{"title":"Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Yung-Yih Jian","submitted_at":"2011-07-15T22:58:53Z","abstract_excerpt":"Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions required for convergence and/or the optimality of converged solutions. This paper presents an analysis of both attenuated max-product (AMP) decoding and weighted min-sum (WMS) decoding for LDPC codes which guarantees convergence to a fixed point when a weight parameter, {\\beta}, is sufficiently small. It also show"},"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":"1107.3177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-15T22:58:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"816d457e5ab8947d8b86e3dcb149e7ed1d6461a5e486481bafbfc0aa937176f4","abstract_canon_sha256":"ee11e93879a2b653fd1534e52152652924cd1b151d9bea9853cb225f8af27346"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:03.755456Z","signature_b64":"3pBsyL0VPWJPqF40dHg2JMMQuBiWKrL4TP2//iScAduEj8HOGQH6IdMCFZacMuHPw5K8py9Hv2327hp74IeXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6bce0b48cc49763008b913d2dcc0acaf8f2b1f2b93b99123d972e2f52e7ee5d","last_reissued_at":"2026-05-18T04:18:03.754854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:03.754854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Yung-Yih Jian","submitted_at":"2011-07-15T22:58:53Z","abstract_excerpt":"Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions required for convergence and/or the optimality of converged solutions. This paper presents an analysis of both attenuated max-product (AMP) decoding and weighted min-sum (WMS) decoding for LDPC codes which guarantees convergence to a fixed point when a weight parameter, {\\beta}, is sufficiently small. It also show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3177","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":"1107.3177","created_at":"2026-05-18T04:18:03.754941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3177v1","created_at":"2026-05-18T04:18:03.754941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3177","created_at":"2026-05-18T04:18:03.754941+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y26OBNEMYSLW","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y26OBNEMYSLWGAEL","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y26OBNEM","created_at":"2026-05-18T12:26:47.523578+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/Y26OBNEMYSLWGAELSE6S3TAKZL","json":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL.json","graph_json":"https://pith.science/api/pith-number/Y26OBNEMYSLWGAELSE6S3TAKZL/graph.json","events_json":"https://pith.science/api/pith-number/Y26OBNEMYSLWGAELSE6S3TAKZL/events.json","paper":"https://pith.science/paper/Y26OBNEM"},"agent_actions":{"view_html":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL","download_json":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL.json","view_paper":"https://pith.science/paper/Y26OBNEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3177&json=true","fetch_graph":"https://pith.science/api/pith-number/Y26OBNEMYSLWGAELSE6S3TAKZL/graph.json","fetch_events":"https://pith.science/api/pith-number/Y26OBNEMYSLWGAELSE6S3TAKZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL/action/storage_attestation","attest_author":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL/action/author_attestation","sign_citation":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL/action/citation_signature","submit_replication":"https://pith.science/pith/Y26OBNEMYSLWGAELSE6S3TAKZL/action/replication_record"}},"created_at":"2026-05-18T04:18:03.754941+00:00","updated_at":"2026-05-18T04:18:03.754941+00:00"}