{"as_of":"2026-08-22T23:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2461c258e8434723ef788a0be0a953d381c01c48a659033277caaf3a58c4f8cf","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:27:16.396635Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:34:52.339800Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T04:40:07.638339Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08129","snapshot_observed_at":"2026-08-16T11:34:52.339800Z","title":"An upper bound on the err or probability of RPA decoding of Reed-Muller codes over the BSC,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-19T18:22:02.762171Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:34:52.339800Z"},"links":{"cited_paper":"/paper/2412.08129","citing_paper":"/paper/2504.15394"},"observation_digest":"sha256:4129f8e6ab575ad9cb8c748f0a5a0765c8d9ffaf1370ef7b1fcc65ac513d0761","observation_id":"c32127a8-480d-4603-b4b9-ec2a6fa98562","resolution":{"observed_at":"2026-08-16T11:34:52.339800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"cited_work":{"arxiv_id":"2412.08129","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.08129","snapshot_observed_at":"2026-08-16T04:40:07.638339Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","venue":"cs.IT","work_id":"e0a92279-ad62-4f59-bc2d-0727ab89de71","year":2024},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-20T07:54:41.921814Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.424293Z"},"links":{"cited_paper":"/paper/2412.08129","citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:d7e9979af41312b584dfcfc97b8a7e4247a855fd1ba394b73245ce987f82d289","observation_id":"396e7c5f-43a7-4270-a934-e122f996e6b3","resolution":{"observed_at":"2026-08-16T04:40:07.646543Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.08129/citation-record","integrity":"/paper/2412.08129/integrity","json":"/paper/2412.08129/citation-record.json","paper":"/paper/2412.08129"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.045292Z","title":"A class of multiple-error-correcting codes and the decoding scheme,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.045292Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:46db74dba9b1c27497a40a2a6ade9079c5b8b032fc6ada7bfb851756d87cea7c","observation_id":"cc99aea4-8ea2-45c1-931a-1d29877f525f","resolution":{"observed_at":"2026-08-11T18:27:16.045292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.054183Z","title":"Application of boolean algebra to switching circuit design and to error detection,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.054183Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:001193b9d1adfa5b66a44f04b7bab556e0726cf678993d4c16b342c6df1e9f65","observation_id":"0bd43518-a068-4395-ad3a-49a03f20452b","resolution":{"observed_at":"2026-08-11T18:27:16.054183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.548747Z","title":"Reed-Muller codes achieve capacity on erasure channels,","venue":null,"work_id":"6413cf95-4b5a-420c-8b4f-ac6a7938385b","year":2017},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.064095Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:775c2339756228af8622d9b582a7cf309ae01969cd1f266c10d19c20d5afec50","observation_id":"81b1eb9f-1168-4b36-8e4d-b20426cbacae","resolution":{"observed_at":"2026-08-11T18:27:17.558433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.501492Z","title":"Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,","venue":null,"work_id":"1c96d60c-853b-4b87-b870-efc9e4549233","year":2023},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.071466Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:27372992e77a1c808d7df4b0433637b5fcc8e49d1306f9ca6002d3fe0ec78216","observation_id":"a0da19b4-c087-405c-ae79-fd3e6c5df46d","resolution":{"observed_at":"2026-08-11T18:27:17.525651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.468385Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels,","venue":null,"work_id":"740dba44-0219-4f86-b66e-93ae7f7fe4ae","year":2023},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.081244Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:d7ab4894fdfb601c64fc22978d327d551711efefb1360cecabfa106f2f6afe84","observation_id":"3315b10f-499e-4e85-9a01-2dbe6b33bb23","resolution":{"observed_at":"2026-08-11T18:27:17.474606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.434617Z","title":"A performance comparison of polar codes and Reed-Muller codes,","venue":null,"work_id":"72db3d8f-5bef-4ae9-bdcb-4685b021b151","year":2008},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.087328Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:b78dd40b241bc2ed945056adbfceda025977b43b1e89e94133521a09cd703eb1","observation_id":"4025b8a6-22d4-4c47-83fd-90d4cdbed2cc","resolution":{"observed_at":"2026-08-11T18:27:17.441115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.412885Z","title":"A survey of Reed-Muller codes from polar coding perspective,","venue":null,"work_id":"b1708340-b9cd-4927-bc97-eafd6bd9f2dd","year":2010},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.115540Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:a9caaccf46b8d7bc25578dff394fae5d4f638213b09855aca776628a34140f57","observation_id":"c254009b-8ae5-4989-b659-26c967f61aa0","resolution":{"observed_at":"2026-08-11T18:27:17.419945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.391606Z","title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"20cc8615-ad3e-4b24-815e-f32b880d06ce","year":2009},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.127920Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:466be7d14495d1bda15cfe482da6a7462d47a63f57a45404000ad3c57bb5dcea","observation_id":"1a727b67-98e5-4b22-b628-96ab20802bc0","resolution":{"observed_at":"2026-08-11T18:27:17.397222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.366255Z","title":"Fast polarization for processes with memory,","venue":null,"work_id":"a52a96bd-bac1-48cf-bc43-6d8d92e99c81","year":2004},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.143040Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:338ceebb57ecb0b28e0485c97d52c5eb3e0446c4dc997c93f3f9fd91c3bcd6a7","observation_id":"40e8bc4d-034e-45be-811e-51725164d1c5","resolution":{"observed_at":"2026-08-11T18:27:17.376358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.340517Z","title":"Polar coding for processes with memory,","venue":null,"work_id":"258ef68a-e152-43b8-8fe7-298e8d28b091","year":1994},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.152969Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:3e77832d9ead7854c6603e1cc83f12ebf1f69930d688a64cb0d3d75f38005d5f","observation_id":"14468b52-eb60-4b3f-9e54-c48167d63726","resolution":{"observed_at":"2026-08-11T18:27:17.348808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.318618Z","title":"A serial orthogonal decoder,","venue":null,"work_id":"483338f5-c326-485f-b55d-6a2d9e0e2e72","year":1966},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.164814Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:53f99adaf711d8ae7718187b6620446615d6318a16246729acb34761b4173636","observation_id":"c7aeb34e-49fa-454a-99ff-52e11efbbe53","resolution":{"observed_at":"2026-08-11T18:27:17.325252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.291549Z","title":"Optimal soft decision block decoders based on fast Hadamard transform,","venue":null,"work_id":"ce0ded62-d9f1-4ba3-9109-6360531a3c05","year":1986},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.175277Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:f2410837f09c8ea7d500540bcbabf1d0d390c5c5839d42eede57b722d96b6ef9","observation_id":"686fb039-b258-4779-9200-22dc66f3fb25","resolution":{"observed_at":"2026-08-11T18:27:17.303816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.241674Z","title":"Decoding of Reed-Muller codes with a large number of errors,","venue":null,"work_id":"9f571430-5f60-4469-a053-8ac8147483a8","year":1992},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.181685Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:c37de0a93362c575e5271e8b054fa8521264564b67bf626334096709b487ef39","observation_id":"c3984da9-3e53-4de3-b7a6-1a1c05b70a8e","resolution":{"observed_at":"2026-08-11T18:27:17.260414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.214550Z","title":"Decoding of second order Reed-Muller codes with a large number of errors,","venue":null,"work_id":"b1a5461b-0ee2-47cb-bb74-7fd40354f05c","year":2005},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.203101Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:00e594d580e3d989ebdc4b660e94a10d2f93887eb92e5e6a05dc885a744ad08a","observation_id":"5836b3b5-04d8-407a-a072-58d5a3bbf09a","resolution":{"observed_at":"2026-08-11T18:27:17.222471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.185705Z","title":"Recursive decoding and its performance for low-rate Reed-Muller codes,","venue":null,"work_id":"c5ec0768-35fe-48ba-b893-f20ac4ab2339","year":2004},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.226430Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:3eead5d6208a78451596d29080455e6fc2dbfe8d58280a52d942ff5ce3d7f713","observation_id":"7aef4c22-d369-45a7-9b66-182443bc9523","resolution":{"observed_at":"2026-08-11T18:27:17.193485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.143876Z","title":"Soft-decision decoding of Reed-Muller codes: a simplified algorithm,","venue":null,"work_id":"81e4b948-8276-47e6-aab1-63db3cb9d892","year":2006},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.236156Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:db551193cd223b1512b66196e869b2f30273998d9a8095245e9cae97295a50f8","observation_id":"82b5cda1-bfd3-40a6-bd6a-00d963a0469e","resolution":{"observed_at":"2026-08-11T18:27:17.155601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.120038Z","title":"Soft-decision decoding of Reed-Muller codes: recursive lists,","venue":null,"work_id":"4f82e044-a36b-4523-9b71-2523b0e782fb","year":2006},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.243023Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:9ea9a6b8dc441d5e285e218f83c6f95fec9ee345e8edebafe9e62e4e66f3fe1b","observation_id":"d64250e4-5f62-4189-a3d5-02e6e9f41bf0","resolution":{"observed_at":"2026-08-11T18:27:17.126205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.087964Z","title":"Error exponents for recursive decoding of Reed–Muller codes on a binary-symmetric channel,","venue":null,"work_id":"cf3d6b95-1fec-44da-b389-723507feefeb","year":2006},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.250513Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:5fc318f020f8f3c77d6cd8a10efbb749b6ee55275a6dfcf5c2be550267988928","observation_id":"f6ec3d5d-fb43-4b36-8f2a-dcdadcba438c","resolution":{"observed_at":"2026-08-11T18:27:17.097137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.060352Z","title":"KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning,","venue":null,"work_id":"a3c34de0-b4cd-433d-8af1-e26c7c3ab4f3","year":2021},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.261572Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:ab5da276f26c100e0bd7ec33a9f6e68569c721793218b3aa3a8dd7d99b9acb9f","observation_id":"c219ff73-557a-49fb-989f-e4e134606cad","resolution":{"observed_at":"2026-08-11T18:27:17.067567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.030387Z","title":"Machine learning-aided efficient decoding of Reed-Muller subcodes,","venue":null,"work_id":"dd8060e8-912e-43ad-b7b4-cadaf3dc85f0","year":2023},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.267305Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:73bf5bf1ec5be9263d907844b6d3faa54dd207155f75a95095b5161a9faecded","observation_id":"c5b61450-0ac7-46c5-8f82-78846e72dd9e","resolution":{"observed_at":"2026-08-11T18:27:17.040720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:17.004284Z","title":"Decoding Reed-Muller codes using minimum- weight parity checks,","venue":null,"work_id":"c109e49d-9f4d-4e11-92a3-c4ca557581c9","year":2018},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.273668Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:b164dc081d1f11988b8901ce47abb4854585b434a72f761a3d7c6f6c3b5addb7","observation_id":"6a84dd29-4625-4922-b86b-47a3a3fa2d4c","resolution":{"observed_at":"2026-08-11T18:27:17.011499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.971065Z","title":"Decoding Reed-Muller codes using redundant code constraints,","venue":null,"work_id":"22857732-306c-4a77-9505-84348d6a2c65","year":2020},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.282921Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:edd5569a35a69592c034b094dda0fdc7a4bd21cad9e892a98380173c434c0e05","observation_id":"62f5563a-3b75-4032-9d72-1f085ae06bdc","resolution":{"observed_at":"2026-08-11T18:27:16.978432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.931710Z","title":"Recursive projection-aggregation decoding of Reed-Muller codes,","venue":null,"work_id":"b225a3b1-aa11-4c35-aa3a-d7054021c64d","year":2019},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.294248Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:1872b5de5ef43002984f4ec2793a41f209f4fc0b5a2a0933e034bcd9410d461c","observation_id":"9654fd49-5458-4fe9-92d6-cd4dfc4d91a6","resolution":{"observed_at":"2026-08-11T18:27:16.938326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.901446Z","title":"Reduced complexity RPA decoder for Reed-Muller codes,","venue":null,"work_id":"a039b67c-c79a-436d-b607-e26ca976837b","year":2021},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.302174Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:2c8245fcbf1292d4190f6a54e2e6073feec0fb68b0eb8db4b36062f32ef7e910","observation_id":"a428fc25-2597-431f-842a-4914dd245572","resolution":{"observed_at":"2026-08-11T18:27:16.910193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.874544Z","title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes,","venue":null,"work_id":"94957bd7-6a76-4271-bf4e-2ac612499d9f","year":2021},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.310237Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:d33d01eae5c64fd098205cccd62b453e471ba7ad70f38b2c35092cead0df0ea8","observation_id":"707ac5ff-9144-4c43-8213-2c5d3ef94aa6","resolution":{"observed_at":"2026-08-11T18:27:16.884887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.829420Z","title":"Reed–Muller codes for random erasures and errors,","venue":null,"work_id":"6c17b611-c6d2-41c2-bd35-61d8da235139","year":2015},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.318803Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:00b9c952eee904a5ea871cc38e4a5c7092d0a4dc84bd1a71d5e56a8f07d20b8d","observation_id":"3f6f6253-086a-441f-994a-2352cf790661","resolution":{"observed_at":"2026-08-11T18:27:16.836177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.805290Z","title":"On the performance of Reed-Muller codes with respect to random errors and erasures,","venue":null,"work_id":"6871764f-7ede-46a5-86be-2f045c8c1308","year":2020},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.326249Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:68a906b9b983b9076aede8fd6e6a523b646cfd16d50d4bbfd54185836b8bc7a2","observation_id":"cdb8c1da-2f78-4043-a5fa-bd56c9128fab","resolution":{"observed_at":"2026-08-11T18:27:16.811794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.772764Z","title":null,"venue":null,"work_id":"7320986e-ac61-4b41-b689-a585c0be08b9","year":1978},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.335937Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:7cac60894fe9e8027ebfba85abeffc6b178b079a602f3dfc87daa9822b9d41ea","observation_id":"4b54ff38-0f31-4599-851f-a515250fca29","resolution":{"observed_at":"2026-08-11T18:27:16.784478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.739680Z","title":"Reed-Muller codes: Theory and algorithms,","venue":null,"work_id":"7ac51628-33f3-4fc3-9b75-e3d932d5d019","year":2021},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.345923Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:7279c8854ccfb613de6b96f5a91043e6b0e1c84116729f146c63384caf490cef","observation_id":"69bd5501-adfe-4ea5-a4be-0eae16a4f8dd","resolution":{"observed_at":"2026-08-11T18:27:16.749503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.706001Z","title":"O’Donnell, Analysis of Boolean Functions","venue":null,"work_id":"d88bfce9-63e7-4d3b-a10c-0a3c2a521277","year":2014},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.354515Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:7deac07e7db2c1dc7d29af91b3ac1fbefd96b0e35470413fea8c8a795788f4a3","observation_id":"b533c793-4df0-4fb3-92c1-029cd7b1180c","resolution":{"observed_at":"2026-08-11T18:27:16.714373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.363354Z","title":"Probability inequalities for sums of bounded random variables,","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.363354Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:9831837812f2f9c677a0857bf5c0df25e28e0fb7b22f934ea0e83c94f4a29d11","observation_id":"fcea69f2-4f65-4ece-bafb-b80762990f90","resolution":{"observed_at":"2026-08-11T18:27:16.363354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.370095Z","title":"Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science , ser","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.370095Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:363165dba001275b7a5f8cafef7527a6c02a2997a4ed2f4a84b78c067ea17973","observation_id":"71d58c54-afe7-4653-82a5-7f527a331937","resolution":{"observed_at":"2026-08-11T18:27:16.370095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.649531Z","title":"Coset error patterns in recursive projection-aggregation decoding,","venue":null,"work_id":"1f0df6e5-9bfd-4680-92a0-e15a1152d761","year":2024},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.377560Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:7c447936d9a25b012f58755a1185c24cccd1fecc2115e735c3dfb2e863769696","observation_id":"d5daacda-ef00-46a7-8067-48bca02d3abb","resolution":{"observed_at":"2026-08-11T18:27:16.660172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.619793Z","title":"Raginsky and I","venue":null,"work_id":"0eb62ba7-0a94-44a6-9615-77dec84c7bce","year":2018},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.384623Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:37587098f6ef1613b51c4316bd09c8d6cb0f7b746939deda6a60a38a92f01d25","observation_id":"f726500f-5cdf-4992-996a-426c7d2852c0","resolution":{"observed_at":"2026-08-11T18:27:16.629148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:16.588400Z","title":"Greferath, M","venue":null,"work_id":"3bfd8247-02b9-4641-8807-ef2c72b2f6b5","year":2018},"citing_paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:16.396635Z"},"links":{"citing_paper":"/paper/2412.08129"},"observation_digest":"sha256:21eb42b87e7e0fb4e524b883c222fb367c89e08d771eae419fb1822cb32d02a9","observation_id":"3a0c3fd9-78be-4a23-b453-41c8480a562f","resolution":{"observed_at":"2026-08-11T18:27:16.598063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.08129","last_updated":"2025-05-24T12:30:17Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T03:27:24.502659Z","submitted_at":"2024-12-11T06:31:47Z","title":"An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":30},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2412.08129."}