{"as_of":"2026-08-14T07:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdf031fe62aaada90355658d1abdf607441e9b6b72400cf86a70c8d3efcf6258","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T12:42:05.477529Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2601.02330/citation-record","integrity":"/paper/2601.02330/integrity","json":"/paper/2601.02330/citation-record.json","paper":"/paper/2601.02330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:42:04.174226Z","title":"Efficient maximum likelihood decoding of linear block codes using a trellis,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.174226Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:38f8d02ff7be34aa2d001efdafe1a5def8df6512ea2b8ed53b717009a33647e6","observation_id":"e74f5733-eebb-411c-994a-1990b901166b","resolution":{"observed_at":"2026-08-03T12:42:04.174226Z","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-03T12:42:04.226927Z","title":"Minimal trellises for block codes,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.226927Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:92703dcc6850066cf6574ecd088e1e1bcdc64e847118da5dfb24e20fb4286f3a","observation_id":"4ff2cbeb-518f-46cd-927d-0924d166d9ab","resolution":{"observed_at":"2026-08-03T12:42:04.226927Z","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-03T12:42:04.346657Z","title":"Coset codes. ii. binary lattices and related codes,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.346657Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:81b92882456da8e747cbee8137e10440a880d37add1adb1b7f08a9e3746241a3","observation_id":"cf2edc00-a4fd-4c8a-8b59-7c89a8737869","resolution":{"observed_at":"2026-08-03T12:42:04.346657Z","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-03T12:42:04.404441Z","title":"On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.404441Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:c3810b09b0b36d9b31baf39bc488f858c824bd666f750eb569c1a9ddf02eeeac","observation_id":"a7012d10-a2bd-44a0-b461-6765b4bc99ad","resolution":{"observed_at":"2026-08-03T12:42:04.404441Z","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-03T12:42:04.533135Z","title":"Maximum likelihood soft decoding of binary block codes and decoders for the golay codes,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.533135Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:fd848c3b47fae368ed0d883beebc1b97093855a5fdce3e2db28701610d50da38","observation_id":"4bf58b21-6c1a-40cf-972c-d6d228957ac3","resolution":{"observed_at":"2026-08-03T12:42:04.533135Z","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-03T12:42:04.674098Z","title":"On survivor error patterns for maximum likelihood soft decoding,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.674098Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:2317cd1fdd228e7e1d7487ede628c5c31798d2416212ed757a577dc6a6c53937","observation_id":"e1624a73-8808-4234-b9a6-5f295894353b","resolution":{"observed_at":"2026-08-03T12:42:04.674098Z","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-03T12:42:04.761154Z","title":"Reduced lists of error patterns for maximum likelihood soft decoding,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.761154Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:9bf92c6860dc0d75e568d9567b0f26411317f4f696d05547bf8b243603c43623","observation_id":"373814b3-6bab-4f57-b4e7-974ef4f0490e","resolution":{"observed_at":"2026-08-03T12:42:04.761154Z","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-03T12:42:04.831203Z","title":"Further results on survivor error patterns for maximum likelihood decoding,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.831203Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:bcd18973ddb90c7583593c14c83c43c2914cbdd3f25bdea2507146b624d3e181","observation_id":"2bb7d1fe-f4aa-42e7-9ba2-706e03200427","resolution":{"observed_at":"2026-08-03T12:42:04.831203Z","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-03T12:42:04.928079Z","title":"Guessing noise, not code-words,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:04.928079Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:b1e854ac71c301afd4ce263cfcaad1c2b92d44d2bbb159705f7f047b90e52c65","observation_id":"b15c9bdb-738a-46b0-8c4f-7507b869ee53","resolution":{"observed_at":"2026-08-03T12:42:04.928079Z","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-03T12:42:05.036346Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.036346Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:a6b03d3c501d8e533595b7eb2a4c81d76cfc1e4d6aff3a4dc0142c3858e467e8","observation_id":"f576740e-484a-47ce-8666-74111256381c","resolution":{"observed_at":"2026-08-03T12:42:05.036346Z","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-03T12:42:05.158114Z","title":"Soft maximum likelihood decoding using grand,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.158114Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:3268cb6600788f612ec77a3419209b3bb6dd54916e3b8e7badacc072e51830c9","observation_id":"85c78be2-a2cc-4cb7-9451-351683d58edf","resolution":{"observed_at":"2026-08-03T12:42:05.158114Z","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-03T12:42:05.252814Z","title":"Optimal soft decision block decoders based on fast hadamard transform,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.252814Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:ef44f5ad353dd1eff7050589b8ef0e51e65cf5f57de4ce23517aef5809237ca9","observation_id":"5397ca18-c95e-4afe-9a54-d8a15bad7031","resolution":{"observed_at":"2026-08-03T12:42:05.252814Z","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-03T12:42:05.349399Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.349399Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:3d51fab6aa2290c06c4687c5f8a87c1de9d738ad3138377340474578ba6d8df4","observation_id":"71d88c3d-336d-4033-9a1d-e7d44a6b15a9","resolution":{"observed_at":"2026-08-03T12:42:05.349399Z","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-03T12:42:05.391426Z","title":"Extended hamming and bch soft decision decoders for mobile data applications,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.391426Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:2eeb5c98550c3b5d7324ff0051d1e489584adb98372a5ce23beeddf98ba02332","observation_id":"ca43c94a-207e-46b1-ac8a-51653cce0691","resolution":{"observed_at":"2026-08-03T12:42:05.391426Z","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-03T12:42:05.477529Z","title":"Class of algorithms for decoding block codes with channel measurement information,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T12:42:05.477529Z"},"links":{"citing_paper":"/paper/2601.02330"},"observation_digest":"sha256:0e158bc59e56efd65430ab7f293109190cbc4c466d1f363ddcde4f21dcde0d5d","observation_id":"24b8e11d-65e6-4206-9b6d-a8c84de6f3a9","resolution":{"observed_at":"2026-08-03T12:42:05.477529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.02330","last_updated":"2026-06-17T17:13:02Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-03T12:42:01.757905Z","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2601.02330."}