{"as_of":"2026-08-19T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0efa4257c766092af8d1da3b60c460f14970768263fe40d77e30d5a977322072","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:40:07.514853Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.00974/citation-record","integrity":"/paper/2505.00974/integrity","json":"/paper/2505.00974/citation-record.json","paper":"/paper/2505.00974"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:40:07.913507Z","title":"Application of boolean algebra to switchi ng circuit design and to error detection,","venue":null,"work_id":"6cd40119-3eb5-4556-a1fd-af310a954189","year":1954},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.381545Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:09e79ab72f8ca4dcc271561872db9f6b0a8874ac915929f74ba084f36bcf4acc","observation_id":"3ee36d0e-60c8-4c77-9770-216b03e4d83b","resolution":{"observed_at":"2026-08-16T04:40:07.918791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.386991Z","title":"A class of multiple-error-correcting codes an d the decoding scheme,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.386991Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:d63c1fd8a28652e15e4304356278fb3e5680052bdc56cfc45b467aec5f58563b","observation_id":"de77a153-8e35-474d-97b4-8e301ce96404","resolution":{"observed_at":"2026-08-16T04:40:07.386991Z","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-16T04:40:07.886993Z","title":"Reed–muller codes achieve capacity on erasure ch annels,","venue":null,"work_id":"b3fcd314-8875-48a2-9eeb-e03ffe8a70ce","year":2017},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.392303Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:e359c7f64381d1bb990db397c54211905a9c7abe55eaf9d77bc56a40270f2533","observation_id":"f05e27b0-627f-4999-a161-62b3fe896d01","resolution":{"observed_at":"2026-08-16T04:40:07.892167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.397431Z","title":"Reed–muller codes on bms chan nels achieve vanishing bit-error probability for all rates belo w capacity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.397431Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:275042ad86d0933bb86cdaeb56a48166494ea941caf48ad0fa996bc04e134fbb","observation_id":"20e98b34-b2e2-4aa8-a3eb-8a7148a42608","resolution":{"observed_at":"2026-08-16T04:40:07.397431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02509","last_updated":"2023-04-05T15:31:55Z","snapshot_observed_at":"2026-08-18T20:11:53.847603Z","submitted_at":"2023-04-05T15:31:55Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels","version":1},"cited_work":{"arxiv_id":"2304.02509","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.02509","snapshot_observed_at":"2026-08-16T04:40:07.669309Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels","venue":"cs.IT","work_id":"9656ac5d-19d5-4a38-92dd-a93578aa0a42","year":2023},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.402452Z"},"links":{"cited_paper":"/paper/2304.02509","citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:9ebeaebeb14efe4cf9e89817e5bdc5c8a0b0408a439446251e9266b27e8d856a","observation_id":"04c3681b-8c78-4909-a94d-c5f24a0f8ad8","resolution":{"observed_at":"2026-08-16T04:40:07.674938Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.860003Z","title":"A serial orthogonal decoder,","venue":null,"work_id":"25cee305-2650-4863-a34e-52c2b1ad7929","year":1966},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.408692Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:f96dca1ca22cb7872becc5bc30ce55239e57be7e48959936495e558ac1b37903","observation_id":"12a492f3-dae0-4b48-b81d-56ce3802fcb7","resolution":{"observed_at":"2026-08-16T04:40:07.865029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.843457Z","title":"Recursive projection-aggregation de coding of reed- muller codes,","venue":null,"work_id":"f4c760ea-82b7-4f97-8fc8-cd988db4df4f","year":2019},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.418181Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:77400c6259dbd63dd5a445eec00314bee55092fbd479db9b630c194ece3cf082","observation_id":"bae659b1-41bd-49ca-b3f7-bf706a3b5535","resolution":{"observed_at":"2026-08-16T04:40:07.849099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-16T04:28:02.392640Z","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:3cbb0df3f4e6a4ed57f4b6a528df5056131dce3ac73efc7286b40f62c3764e17","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.823981Z","title":"Recursive decoding and its performance for lo w-rate reed- muller codes,","venue":null,"work_id":"7316244b-d72d-40f1-841c-18c2b866c36e","year":2004},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.429111Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:aaa0ae285d05593e2a52a65640d0d6fb262c6e863fb03ebd92919671f95c845a","observation_id":"ea5330c9-c412-4a55-912a-7e21025aa0dd","resolution":{"observed_at":"2026-08-16T04:40:07.830263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.805760Z","title":"Decoding of second order reed-muller code s with a large number of errors,","venue":null,"work_id":"8184ab48-610a-48e3-b6b5-2dd339d74d8a","year":2005},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.465461Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:06f1fe62ba2f4ec55d93c74e20ad7a47b96b7f36fc9dc508869b4b92d3d3059c","observation_id":"d28a82b7-9d62-4bb4-9dec-c5f1a0df0277","resolution":{"observed_at":"2026-08-16T04:40:07.810926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.474455Z","title":"Comparing the bit-map and block-map decoding thresholds o f reed- muller codes on bms channels,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.474455Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:660ce4c544bd742143c21157058a8718be526d5b89ead5215e5108ed85544948","observation_id":"fa552f55-b874-4fe0-804c-34814fb06136","resolution":{"observed_at":"2026-08-16T04:40:07.474455Z","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-16T04:40:07.788520Z","title":"On α -decodability and α -likelihood decoder,","venue":null,"work_id":"54b0b4ea-17c9-4648-9140-6a58079129de","year":2017},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.480163Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:976dfbf5ff85d0c8a9b90d55d95c30b88f55fa51875ef00eb281a4f478e3c942","observation_id":"c81da48d-69c3-40e7-8786-0ee5aafe4ff9","resolution":{"observed_at":"2026-08-16T04:40:07.793952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.771913Z","title":"Monte carlo decoding of LDPC codes,","venue":null,"work_id":"5ebdaf6a-10c2-4adf-a676-7539c9ba0c43","year":2001},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.486479Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:7cb9303fb0a0bb8850f996229db026bd104f1cc7f73158f7cf66c4f9a34224e4","observation_id":"7f41a27d-b80d-4259-9913-c2198ed4e755","resolution":{"observed_at":"2026-08-16T04:40:07.777018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.753015Z","title":"Estimating th e weight enu- merators of reed-muller codes via sampling,","venue":null,"work_id":"003d65eb-c3e5-4f7d-bbb0-9b7a97e5efd0","year":2024},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.492910Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:bfe5d3d4272a22ca82ff334eb69ff52e12119c0f21a36f7edca59377c9e86f0c","observation_id":"87e83c50-e448-427c-8f9c-7bc31c14109e","resolution":{"observed_at":"2026-08-16T04:40:07.758985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.734960Z","title":"Markov chain monte carlo methods for dete ction and decoding,","venue":null,"work_id":"d1b2c407-eeda-4303-85fe-2873b5de8e36","year":2023},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.498079Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:1543bcf70840a722e06e6314487eb642c67ec343c204403e508404b2176c73af","observation_id":"fedd2b0f-8bb6-404e-8b5e-3a2837702a3e","resolution":{"observed_at":"2026-08-16T04:40:07.740519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.503916Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.503916Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:11074d948be9e39efa53abe2a6cc9149a49f2ed8833732e16454b1c467048aef","observation_id":"22afa8b3-027c-4cf0-bd7c-264fb074a2ac","resolution":{"observed_at":"2026-08-16T04:40:07.503916Z","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-16T04:40:07.705272Z","title":"Parallel monte carlo markov chain decoding of linear codes,","venue":null,"work_id":"d325888a-f0d2-4be5-ad6f-ef5ce18b55f0","year":2023},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.509586Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:ed307d37a3cfc1fc48be96f4ccf586b1e5fdcf523b06cc977caca173cd754259","observation_id":"a950a42f-4dc6-4667-b36d-1ea36c025c46","resolution":{"observed_at":"2026-08-16T04:40:07.711306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:40:07.689166Z","title":"MCMC decoding of LDPC codes with BP preprocessing,","venue":null,"work_id":"3e598fc1-9a25-46e2-a495-82cc19e99458","year":2020},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.514853Z"},"links":{"citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:9337603600f6bc533f4d1b3c6962394dfb1d70f14a90f494eed37d9a3341a19f","observation_id":"4f28c656-6a77-46d1-9603-b72ea97377cc","resolution":{"observed_at":"2026-08-16T04:40:07.694313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":18},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2505.00974."}