{"as_of":"2026-08-20T18:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b8c5122cd569c889e431227d951f56df199c0d9dd32dcf9b36645c9e189af95","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:20:43.262007Z","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-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:10:58.112927Z","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-11T20:10:58.201138Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"cited_work":{"arxiv_id":"2506.11345","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.11345","snapshot_observed_at":"2026-08-11T20:10:58.201138Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","venue":"cs.IT","work_id":"9f7ada58-b8a3-4dd4-ab78-5b73bf6d9720","year":2025},"citing_paper":{"arxiv_id":"2412.06072","last_updated":"2025-08-14T16:52:55Z","snapshot_observed_at":"2026-08-19T08:31:50.365803Z","submitted_at":"2024-12-08T21:34:04Z","title":"PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.112927Z"},"links":{"cited_paper":"/paper/2506.11345","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:61dd36e8f821cfd30cfa9d0e7863ef912fb55a0009e7ee3b966067b62616004e","observation_id":"bdc930a7-67ec-4865-8c49-c165df716728","resolution":{"observed_at":"2026-08-11T20:10:58.208845Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.11345/citation-record","integrity":"/paper/2506.11345/integrity","json":"/paper/2506.11345/citation-record.json","paper":"/paper/2506.11345"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:20:42.237451Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.237451Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:0ae1498174bf40f619f853b8ebc6466a1ea70957ecdfd50c9b0b588c190c4710","observation_id":"8f277154-0909-48fe-9628-66607c9ac462","resolution":{"observed_at":"2026-08-07T04:20:42.237451Z","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-07T04:20:45.513782Z","title":"Good codes based on very sparse ma- trices,","venue":null,"work_id":"a6f9bea2-8892-47e3-9a76-0f03c1c46c2c","year":1995},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.293789Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:8416ba7a089fbda82d1a1280441ff26195471f831417a35162bdfde1835242fd","observation_id":"4a349a4b-18b7-47eb-a90e-012daed57a16","resolution":{"observed_at":"2026-08-07T04:20:45.607969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:45.296548Z","title":"NR; multiplexing and channel coding,","venue":null,"work_id":"0d20055f-f2ef-4467-99b3-8886327db7c6","year":2018},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.362359Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:a99037ec765121ec9f6292e98185be283a4a9676032818c5d514eeedfd6b042e","observation_id":"1de42e02-4276-4a5e-bdaa-7b25c027be1c","resolution":{"observed_at":"2026-08-07T04:20:45.419170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:45.142015Z","title":"On the road to 6G: Visions, requirements, key technologies, and testbeds,","venue":null,"work_id":"21d0327c-f1ff-4b32-a7d2-9b347e17702f","year":2023},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.434199Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:c823d34db61330228456c2c6d53878e557f4f6545bc13af7b345faa2ca5d2752","observation_id":"7609c7ff-69ce-48dc-a7ea-e7ee159ed1f7","resolution":{"observed_at":"2026-08-07T04:20:45.209469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:44.931512Z","title":"Spatially coupled LDPC codes constructed from protographs,","venue":null,"work_id":"3f21055f-161c-434e-b0db-535915c5e4ac","year":2015},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.520883Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:c293c13a0f371e91099205f5515533b71f097921144e838190af440692b71329","observation_id":"7c9fbb94-39ab-4460-b2c6-6977d25b4096","resolution":{"observed_at":"2026-08-07T04:20:45.019352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:44.761727Z","title":"LDPC block and convolutional codes based on circulant matrices,","venue":null,"work_id":"9efb1cb5-ffe9-480c-8d92-c97b71e7df84","year":2004},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.583665Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:1262765207e888c07342a5a46569230ad46f028c3ecbe8deabf807ca7fb976c5","observation_id":"284a8623-3100-4998-8765-7c9bc831e70a","resolution":{"observed_at":"2026-08-07T04:20:44.838511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:44.600842Z","title":"Deriving good LDPC convolutional codes from ldpc block codes,","venue":null,"work_id":"8523ac4c-1456-4507-984d-dccbc90b6451","year":2011},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.658969Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:cf6f92aa9d31dded159a8dc3a7d488956aad5dcfc8ec98d69bc785e6b7dc9d52","observation_id":"a91eea81-8bdb-4f26-905e-5546713f3bf6","resolution":{"observed_at":"2026-08-07T04:20:44.689389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:42.728221Z","title":"Quasi-cyclic LDPC codes based on pre-lifted protographs,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.728221Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:05ca981f4b08cfaedc0c67e11cad366149c7aafe213dbb325519a6d4e702e97c","observation_id":"8f2bcc29-0888-4a0a-a657-e2bf8b623590","resolution":{"observed_at":"2026-08-07T04:20:42.728221Z","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-07T04:20:44.457501Z","title":"Spatially coupled sparse codes on graphs: theory and practice,","venue":null,"work_id":"91079c18-d6be-44fa-a0e7-9349c4be9ed2","year":2014},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.794407Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:6bc62bd6774510fb6af2d4fe9b31a47ed37e7a9a3a58328b772546a716a2d78c","observation_id":"f8a5d0b8-009f-459d-8e88-c1431999672c","resolution":{"observed_at":"2026-08-07T04:20:44.523079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:44.314311Z","title":"Design and analysis of NB QC-LDPC codes over small alphabets,","venue":null,"work_id":"27a8ea99-7ac9-490d-9ccd-b9fa7fa606da","year":2022},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.845702Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:c2f46c92b5886422e8feb45e507b30b0cf6377eef478d704bf7005914e7d6eb9","observation_id":"daf2d016-6804-47d3-8d2b-a89f0c298146","resolution":{"observed_at":"2026-08-07T04:20:44.391578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:44.079491Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"04023307-17d7-4fed-bfa7-c69dd6dcb25a","year":2009},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.889885Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:a9fd9d41e2729ad255c9d0561f7cb151783e0c121a8db170722c901ec36ed549","observation_id":"3bec5211-bdf6-4264-9123-feb4553b6a39","resolution":{"observed_at":"2026-08-07T04:20:44.212097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:42.952347Z","title":"List decoding of polar codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:42.952347Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:101da6002f34ba0faecf40c7012a9e49d10d934f34dbf510afc6ece39c6c4a9f","observation_id":"8c78f430-eb44-4dcd-bda6-ac3338498b19","resolution":{"observed_at":"2026-08-07T04:20:42.952347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-19T20:52:22.618634Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":"2402.06814","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-07T04:20:43.345738Z","title":"High-Rate Fair-Density Parity-Check Codes","venue":"cs.IT","work_id":"71425f3c-b28b-41ae-bde4-3db6ca8d20e1","year":2024},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.002570Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:e6cd885cc0dd9e864031933e49fa51f09912cc4bb2d517548558e1e641fee217","observation_id":"edda983b-1487-4e80-bbe3-5dbe69e7dda8","resolution":{"observed_at":"2026-08-07T04:20:43.434899Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:43.875422Z","title":"Design of low-density parity check codes for 5G new radio,","venue":null,"work_id":"726d8af3-b11e-4072-93fc-7a444fb6e0e6","year":2018},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.066477Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:54c6d6b1acfc2e73e70f23b5954f277600db1b1ee868c24f42c468a1b97d250d","observation_id":"52ccf27a-a6d9-4251-9a02-f7047893b09c","resolution":{"observed_at":"2026-08-07T04:20:43.937729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:43.751675Z","title":"Polarization-adjusted convolutional (PAC) codes as a concatenation of inner cyclic and outer polar- and Reed-Muller-like codes,","venue":null,"work_id":"bfe7f933-dfe8-4b31-bbe2-3e23208e9c1a","year":2024},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.129041Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:48c6969c86d8745339e689dcba7d1e8c9598c9b9534c3230daa9c4fa81dd0b8b","observation_id":"d72b17db-e90c-46c7-b75b-8d81b84f2dc8","resolution":{"observed_at":"2026-08-07T04:20:43.801460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:43.636966Z","title":"Polar codes: A pipelined implementation,","venue":null,"work_id":"a3d1b738-a549-46e8-a895-1dcaac92b294","year":2010},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.195140Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:3829404f86f205a22fa346e7714ad84b7ea4d91fdb2ede4bddc4f41080c870c9","observation_id":"b191110d-f683-4db2-a07e-41d029974709","resolution":{"observed_at":"2026-08-07T04:20:43.686274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T04:20:43.505525Z","title":"Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders,","venue":null,"work_id":"98b1f44a-ad1a-423c-a30b-1f7c547bd3cb","year":2014},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.262007Z"},"links":{"citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:1c4fcc1371e4295964f2683c8705740cc6ee2a48e983152c1ed6d2c1259ca440","observation_id":"d51b95b8-396f-455e-9b0e-5e510afbe5cf","resolution":{"observed_at":"2026-08-07T04:20:43.566284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":17},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2506.11345."}