{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ESCCMJUAT3ET5EMEF5X5ZL4ECC","short_pith_number":"pith:ESCCMJUA","schema_version":"1.0","canonical_sha256":"24842626809ec93e91842f6fdcaf84108cfaad318c0b906f83447e481e15c26d","source":{"kind":"arxiv","id":"2412.08129","version":2},"attestation_state":"computed","paper":{"title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"V. Arvind Rameshwar, V. Lalitha","submitted_at":"2024-12-11T06:31:47Z","abstract_excerpt":"In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA decoder, over a binary symmetric channel (BSC). Importantly, we focus on the events where a \\emph{single} iteration of the RPA decoder, in each recursive call, is sufficient for convergence. Key components of our analysis are explicit estimates of the probability of incorrect decoding of first-order RM codes using a maximum likelihood (ML) decoder, and estimates o"},"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":"2412.08129","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-11T06:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4da168697aabc40b687915c6fd4e6deaa17ef5b3253aaf3085b2a06f0d54cf18","abstract_canon_sha256":"b984056e9b5e3661364c89a6bacafe49a04dea8b74a70ac4ba56a2160b7d4ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:05.075125Z","signature_b64":"6Ixn7yK/OD2vQ/MhVvou9mkxIJFhMwzTIVf3OfMZkwN7RmOYKPjHzqP4EMUYi0qnN9f2Y6fj8Z/udL483wwVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24842626809ec93e91842f6fdcaf84108cfaad318c0b906f83447e481e15c26d","last_reissued_at":"2026-07-05T11:09:05.074694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:05.074694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"V. Arvind Rameshwar, V. Lalitha","submitted_at":"2024-12-11T06:31:47Z","abstract_excerpt":"In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA decoder, over a binary symmetric channel (BSC). Importantly, we focus on the events where a \\emph{single} iteration of the RPA decoder, in each recursive call, is sufficient for convergence. Key components of our analysis are explicit estimates of the probability of incorrect decoding of first-order RM codes using a maximum likelihood (ML) decoder, and estimates o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08129","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.08129/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.08129","created_at":"2026-07-05T11:09:05.074756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08129v2","created_at":"2026-07-05T11:09:05.074756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08129","created_at":"2026-07-05T11:09:05.074756+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESCCMJUAT3ET","created_at":"2026-07-05T11:09:05.074756+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESCCMJUAT3ET5EME","created_at":"2026-07-05T11:09:05.074756+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESCCMJUA","created_at":"2026-07-05T11:09:05.074756+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/ESCCMJUAT3ET5EMEF5X5ZL4ECC","json":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC.json","graph_json":"https://pith.science/api/pith-number/ESCCMJUAT3ET5EMEF5X5ZL4ECC/graph.json","events_json":"https://pith.science/api/pith-number/ESCCMJUAT3ET5EMEF5X5ZL4ECC/events.json","paper":"https://pith.science/paper/ESCCMJUA"},"agent_actions":{"view_html":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC","download_json":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC.json","view_paper":"https://pith.science/paper/ESCCMJUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08129&json=true","fetch_graph":"https://pith.science/api/pith-number/ESCCMJUAT3ET5EMEF5X5ZL4ECC/graph.json","fetch_events":"https://pith.science/api/pith-number/ESCCMJUAT3ET5EMEF5X5ZL4ECC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC/action/storage_attestation","attest_author":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC/action/author_attestation","sign_citation":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC/action/citation_signature","submit_replication":"https://pith.science/pith/ESCCMJUAT3ET5EMEF5X5ZL4ECC/action/replication_record"}},"created_at":"2026-07-05T11:09:05.074756+00:00","updated_at":"2026-07-05T11:09:05.074756+00:00"}