{"as_of":"2026-08-13T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:496c5df3b42a990e44cd1dd3789b60d271f71072e3320bb9bd5b191e01b5bb0d","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-12T13:29:31.681947Z","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-13T06:32:02.005865+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/2411.16203/citation-record","integrity":"/paper/2411.16203/integrity","json":"/paper/2411.16203/citation-record.json","paper":"/paper/2411.16203"},"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-12T13:29:32.112930Z","title":"Extending checksum-based abft to tolerate soft errors online in iterative methods,","venue":null,"work_id":"9174ca62-1e5f-4e84-9d9c-a59f8b04bc7d","year":2014},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.570385Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:eba5231cd9593e1b9ba46af7fc66e0a4e957985252b71da2c2ebd91de35c80ca","observation_id":"30d843a2-402a-44a5-abdb-30e5a6360bda","resolution":{"observed_at":"2026-08-12T13:29:32.118604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:32.091819Z","title":"Coding for distributed multi-agent reinforcement learning,","venue":null,"work_id":"66807ba6-9c6f-4387-af2e-16e4b7fe70bb","year":2021},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.576400Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:5cc241783230c683ebb640d7a41ca1ffd9c1272bf75e2b257dbf26f513e5733e","observation_id":"139bc68e-f763-4dec-bf86-9df9468b88bf","resolution":{"observed_at":"2026-08-12T13:29:32.099629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:32.071712Z","title":"Exploiting burst-sparsity in massive mimo with partial channel support information,","venue":null,"work_id":"8f19f0f0-0823-463c-a3bd-05b6a18b6b23","year":2016},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.582572Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:78a2bc1f0cacfaab5903780659ebb4bf4bab8cc7da356f291aa699087ee3826b","observation_id":"7a6fdcdb-5905-4ed1-bb5a-40e7770634ed","resolution":{"observed_at":"2026-08-12T13:29:32.078279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:32.050502Z","title":"Distributed source-channel coding based on real-field bch codes,","venue":null,"work_id":"66eb50a5-e1b8-4049-a386-a0d98d16c3d4","year":2014},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.588725Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:a291c215b3268c9ac7026ecd31dbf0f2523b2d822b9b9b213156bbe6715bf594","observation_id":"9bb19ad9-479f-4aea-aeec-ce0888f0d181","resolution":{"observed_at":"2026-08-12T13:29:32.056459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:32.023121Z","title":"Tensor product dft codes vs standard dft codes,","venue":null,"work_id":"a8ae74c9-6c9d-4946-bf49-1fdd5a8c09d3","year":2019},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.605077Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:f73c75f3118f0487beef1d6303508fa063bf7df66295ff6fd7c8da0dc47ebf19","observation_id":"56a3baef-6723-4432-8ca1-058ff4dd4cb8","resolution":{"observed_at":"2026-08-12T13:29:32.033866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.995442Z","title":"Robust turbo analog error correcting codes based on analog crc verification,","venue":null,"work_id":"debce41c-4eb8-4d7b-ac73-49ba8159ba7e","year":2016},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.611456Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:9e4c80f899169d89b347a613f546d5e67021b3dd58b1be17b70f7d869db39060","observation_id":"aa7e99fb-2a81-4442-b707-565d1a1925f8","resolution":{"observed_at":"2026-08-12T13:29:32.003392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.974522Z","title":"Class of majority decodable real-number codes,","venue":null,"work_id":"a1c9cd01-e8cb-4134-8daa-90c52faa4da6","year":1996},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.618385Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:780e45565eeead7ce14904883402f5bad065b5fcc44ab2820605213c25b0e2d4","observation_id":"7d62d8e1-7cd5-4751-935e-4afdfb4f6eef","resolution":{"observed_at":"2026-08-12T13:29:31.981357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.949989Z","title":"Decoding real-number convolutional codes: change de- tection, kalman estimation,","venue":null,"work_id":"c5f3204a-4cd1-45bc-ad41-ec32145dcf98","year":1997},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.626451Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:2547d2758283b3e07134aff6faf43bb3730bbfe3572b44a9d4baa0f91d2655db","observation_id":"96cde2f0-e7c2-4723-995c-5895d208583b","resolution":{"observed_at":"2026-08-12T13:29:31.959007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.922915Z","title":"The capacity of low-density parity- check codes under message-passing decoding,","venue":null,"work_id":"1a3309d6-35c3-48b1-801d-83c47efc2692","year":2001},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.631986Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:fc0eee7d98ac83c20c782ee4226eb9596e3411901ae81e244d748294bf871381","observation_id":"8a7c890d-b0c4-40c1-82eb-f1f44c1e7aad","resolution":{"observed_at":"2026-08-12T13:29:31.932211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.898278Z","title":"Design of capacity- approaching irregular low-density parity-check codes,","venue":null,"work_id":"547ba66f-8043-4e40-b9e1-8e7052bf428c","year":2001},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.637548Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:593cc624fd2ccd3996efc62fb48abc823afafb775fb7e0e02223f848a442f1bc","observation_id":"3f38f865-4303-47da-b2a6-a001210a108b","resolution":{"observed_at":"2026-08-12T13:29:31.905603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.871827Z","title":"The renaissance of gallager’s low- density parity-check codes,","venue":null,"work_id":"080cfaa6-2e9c-42eb-9314-79f984b02cda","year":2003},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.643023Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:1ebb3148c2e7c0c5946a5b60e66f83423b85470276f4517105d9b36c8b32535c","observation_id":"8158d15a-b0d6-42d5-84f7-d4745a58a38c","resolution":{"observed_at":"2026-08-12T13:29:31.882071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.852004Z","title":"Quasicyclic low-density parity-check codes from circulant permutation matrices,","venue":null,"work_id":"09210a4e-1573-4248-969b-c537f29fc460","year":2004},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.648739Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:74ddcd32d684071a22a2dd7816a92c37999105f16e0839cd3a41fa5ffb934de6","observation_id":"a642b016-fe68-4b6a-94db-67b82a6e1049","resolution":{"observed_at":"2026-08-12T13:29:31.858485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.827251Z","title":"Efficient encoding of low-density parity- check codes,","venue":null,"work_id":"ab009c5f-ef4a-46a6-af8a-96729ac2ffd2","year":2001},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.655587Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:263554edb0841b493b983f9568fb6092141eb91469386c2a077c17e7f69abf5f","observation_id":"ef651679-286d-40a9-9398-be8731781c85","resolution":{"observed_at":"2026-08-12T13:29:31.835959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.804185Z","title":"7.7gbps encoder design for ieee 802.11n/ac qc-ldpc codes,","venue":null,"work_id":"37546b70-f474-4f69-8c68-7c6d8e54f3ce","year":2012},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.660953Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:0d6ad93375e1bfc230646efe338a88173c3f8f2e46c7e5b601abad78c8951e38","observation_id":"07d2f037-ef89-43f0-92df-218f85f77baf","resolution":{"observed_at":"2026-08-12T13:29:31.810592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.666403Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.666403Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:7ff95a3ed0ff882cd70aa1029d68bc76717ab761739a8a1d9f649647d97fea78","observation_id":"b1950b7f-1491-4f41-8a70-1a20b16d8180","resolution":{"observed_at":"2026-08-12T13:29:31.666403Z","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-12T13:29:31.769948Z","title":"Gradient descent bit flipping algorithms for decoding ldpc codes,","venue":null,"work_id":"6a9a7406-351a-4de9-83f4-588b347ea05a","year":2008},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.671569Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:96ba470b0a25885702406fc753c22c5fb02be1d7ab445e8bfe1e92f39a08dfed","observation_id":"2be7b9a2-46fb-4ae1-ad14-0ba00eeb407c","resolution":{"observed_at":"2026-08-12T13:29:31.775609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.746894Z","title":"Real-number codes for fault-tolerant matrix operations on processor arrays,","venue":null,"work_id":"47433e43-4074-4c12-bf72-b2f6e09e2b27","year":1990},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.676617Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:47747a28d9ef5abaef9521db109db4383c556105f05d59ccf8583d4845f33030","observation_id":"fc6a76d1-ffd7-4c08-8dfc-d1b7c6f4577a","resolution":{"observed_at":"2026-08-12T13:29:31.754080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:29:31.719144Z","title":"Designing checksums for detecting errors in fast unitary transforms,","venue":null,"work_id":"af8409c4-d2bd-4a47-9d05-4adb0e2f8d8d","year":2018},"citing_paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:29:31.681947Z"},"links":{"citing_paper":"/paper/2411.16203"},"observation_digest":"sha256:ed74e0e1402eecc78e1a77c2ed13d7b03eb40ac9f3a153adf6b87ecab96cf863","observation_id":"57700a11-c022-438b-b19b-000b049e2335","resolution":{"observed_at":"2026-08-12T13:29:31.727508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16203","last_updated":"2024-11-25T09:02:45Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T13:20:36.491540Z","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":17},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2411.16203."}