{"as_of":"2026-08-19T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:015e3127da8fce52eb29416c7a73bcee5ee24e78a3a9a7fba66a378a45cf1263","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:10:58.124428Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-05-19T18:36:20.936453Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T18:37:42.822172Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2412.06072","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.06072","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.06072 , year =","venue":null,"work_id":"c974be27-dadc-4fc8-a7d1-6e603df7a554","year":null},"citing_paper":{"arxiv_id":"2605.16225","last_updated":"2026-05-15T17:35:52Z","snapshot_observed_at":"2026-08-15T01:46:52.386431Z","submitted_at":"2026-05-15T17:35:52Z","title":"Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-19T18:36:20.936453Z"},"links":{"cited_paper":"/paper/2412.06072","citing_paper":"/paper/2605.16225"},"observation_digest":"sha256:5f0dfa3a050c9c618d48f2f46890b036ee5c4b052b2638276b6732cc8bc009e8","observation_id":"b3de305d-f4d4-4889-bc84-396d8a30311e","resolution":{"observed_at":"2026-05-19T18:37:42.824253Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.06072/citation-record","integrity":"/paper/2412.06072/integrity","json":"/paper/2412.06072/citation-record.json","paper":"/paper/2412.06072"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.09594","last_updated":"2019-09-09T16:15:56Z","snapshot_observed_at":"2026-08-19T09:37:40.619438Z","submitted_at":"2019-08-26T11:05:47Z","title":"From sequential decoding to channel polarization and back again","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09594","snapshot_observed_at":"2026-08-11T20:10:57.939709Z","title":"From sequential decoding to channel polarization and back again,","venue":null,"work_id":null,"year":2019},"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":1,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.939709Z"},"links":{"cited_paper":"/paper/1908.09594","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:858cfe9bff4c6e6143b3107ecf93a7cd3108cd88904bf195ba2ffc5a158b4445","observation_id":"abc5aadd-b306-4e86-b673-f57290ea53ce","resolution":{"observed_at":"2026-08-11T20:10:57.939709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04990","last_updated":"2020-12-17T12:01:59Z","snapshot_observed_at":"2026-08-16T18:59:51.353490Z","submitted_at":"2020-12-09T11:42:47Z","title":"Performance and Complexity of Sequential Decoding of PAC Codes","version":2},"cited_work":{"arxiv_id":"2012.04990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.04990","snapshot_observed_at":"2026-08-11T20:10:58.305754Z","title":"Performance and Complexity of Sequential Decoding of PAC Codes","venue":"cs.IT","work_id":"f138e869-85c3-46d9-9f71-bf70723091c9","year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.946978Z"},"links":{"cited_paper":"/paper/2012.04990","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:01e871e85800d3be6aba391c3968eca5657678550d53bcccc373857f3aae75a9","observation_id":"89b49125-63b4-4f0d-a27d-5896ef6d28a0","resolution":{"observed_at":"2026-08-11T20:10:58.311642Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.805837Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"e6edf33a-5480-44c0-a0bf-5c863e722d9f","year":2009},"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":3,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.952925Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:3c6fc9e8e143d44bdb0c827423d82abf200ba634d00714e88c361e0885a9a86a","observation_id":"1dde1098-f988-47bb-90af-031f27efc8ac","resolution":{"observed_at":"2026-08-11T20:10:58.811091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.787819Z","title":"Sequential decoding for reliable communication,","venue":null,"work_id":"8577a088-14d4-4cae-81ea-d54260e8b420","year":1957},"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":4,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.958316Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:160add1e4d4c216f9a8b546cd562a68bb3d995aa375d5bc0fc460b7ee94ad0f3","observation_id":"576dac37-3540-4ff1-adc4-2ad7418f1737","resolution":{"observed_at":"2026-08-11T20:10:58.792923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.771523Z","title":"A heuristic discussion of probabilistic decoding,","venue":null,"work_id":"4ec538af-1869-4197-b5af-6bdd7d930313","year":1963},"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":5,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.963883Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:fac132e5251ebbf74343b921c82e2ace4da37e9087b4b836fdc9800121a33c10","observation_id":"22aa839e-8395-4c78-81ed-0fbf3ebb4df2","resolution":{"observed_at":"2026-08-11T20:10:58.776883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.756389Z","title":"Variable-length codes and the Fano metric,","venue":null,"work_id":"1f31c9d3-097d-4197-947a-322a81979245","year":1972},"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":6,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.969723Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:ab0799efbcafb08eaaf021abec76eafe63125c92fb115bb6dfb94719e5730439","observation_id":"63da301d-6bf7-4e09-b137-f370d29e16d9","resolution":{"observed_at":"2026-08-11T20:10:58.761346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.736966Z","title":"On sequential decoding metric function of polarization- adjusted convolutional (PAC) codes,","venue":null,"work_id":"9cea70d6-d21b-4ea5-aafb-9c32b5b79ce4","year":2021},"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":7,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.977333Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:195751356fc2b03af1fb594e6ff377a1de30f16b5b000f3c258f1642df98c503","observation_id":"b21cc19d-d092-4e21-b577-deec350df3fb","resolution":{"observed_at":"2026-08-11T20:10:58.743326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03840","last_updated":"2025-09-04T21:04:28Z","snapshot_observed_at":"2026-08-18T13:28:46.478668Z","submitted_at":"2024-08-07T15:25:50Z","title":"A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders","version":3},"cited_work":{"arxiv_id":"2408.03840","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.03840","snapshot_observed_at":"2026-08-11T20:10:58.277773Z","title":"A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders","venue":"cs.IT","work_id":"64a91556-5e91-40f9-952c-a4d058fc87bc","year":2024},"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":8,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.982195Z"},"links":{"cited_paper":"/paper/2408.03840","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:7e79595426236911f6c0d86360f243bf31aef30cedeafd468c342b40c2763920","observation_id":"bd4af390-6127-4212-8ce7-7a2f03b139f5","resolution":{"observed_at":"2026-08-11T20:10:58.284024Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:57.987027Z","title":"Stack decoding of polar codes,","venue":null,"work_id":null,"year":2012},"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":9,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.987027Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:d6190fbecac663629a6ee7904d5f131ee89bfb3067b62632f34240498123cba7","observation_id":"1dcfb2bf-e075-4243-919f-576cccbe8ba7","resolution":{"observed_at":"2026-08-11T20:10:57.987027Z","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-11T20:10:58.707482Z","title":"Sequential decoding of polar codes,","venue":null,"work_id":"957a788d-87df-4991-bb45-d73f9d1178f8","year":2014},"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":10,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.991943Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:2d117ddc267038a5e50692f4b134a520e997b4131460e515f2607d4b853d46f5","observation_id":"d3b43c38-09ea-40c4-bee3-da09f595c347","resolution":{"observed_at":"2026-08-11T20:10:58.713385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.688223Z","title":"A score function for sequential decoding of polar codes,","venue":null,"work_id":"57c971d1-70e3-4b4e-b5e0-50d7dc7a9367","year":2018},"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":11,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.996179Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:4317dab770e4b977d4013c600e587e14bbf272421825aebd1aa96ccdebafbd5b","observation_id":"a395c232-a947-4530-b964-781d2fca1695","resolution":{"observed_at":"2026-08-11T20:10:58.693663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.665510Z","title":"List decoding of Arıkan’s PAC codes,","venue":null,"work_id":"f2671e15-c08a-4e70-8c31-cefe0e906040","year":2021},"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":12,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.001779Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:3882397f4b05f5aa335fc41741071bf118e23aec6128b1ff783055d03b2d12d3","observation_id":"a981de43-22a8-4ac1-b161-e30512f8d016","resolution":{"observed_at":"2026-08-11T20:10:58.676289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.646741Z","title":"Polarization-adjusted con- volutional (PAC) codes: Sequential decoding vs list decoding,","venue":null,"work_id":"37c97b03-f4dd-46a7-bdf1-bd497808b7ed","year":2021},"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":13,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.007628Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:fc772e073315937259da1ca0b030324ada82e48bab6eec2f6db98999cc11de61","observation_id":"ee9598a1-3787-4ba0-8f7e-8db0c94fc8fb","resolution":{"observed_at":"2026-08-11T20:10:58.653180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.627046Z","title":"Approximate weight distribution of polarization-adjusted convolutional (PAC) codes,","venue":null,"work_id":"f9838e1e-fe87-4be6-a48e-3606a5adb06a","year":2022},"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":14,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.012152Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:f0ee11958359ab7da9dcce7be951510b3318e55d356a35c95e8d6eaa01189398","observation_id":"e69cacb0-07da-444b-95c5-9c937a02ba43","resolution":{"observed_at":"2026-08-11T20:10:58.632395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.606868Z","title":"On the minimum weight codewords of PAC codes: The impact of pre-transformation,","venue":null,"work_id":"dfe22a9c-e743-47d6-8fff-f29cd65841a2","year":2023},"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":15,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.017871Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:9d4170fd9c8e4751cd5719120aa36ea0c26702c5c5b9c50580b9a5301519c85f","observation_id":"bf7e52f1-d8f0-426f-9173-9052486ae26b","resolution":{"observed_at":"2026-08-11T20:10:58.612450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.586219Z","title":"Soft-decision decoding of Reed-Muller codes: recursive lists,","venue":null,"work_id":"ff63c239-e154-435f-83be-20aeaef89430","year":2006},"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":16,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.022766Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:6221c3f80b08e6f8562e524ca5153239bf6c545043b89a1291123d5260845a74","observation_id":"c391e3d2-216d-4859-93c2-650b434295b1","resolution":{"observed_at":"2026-08-11T20:10:58.592476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.5483","last_updated":"2014-07-21T13:15:43Z","snapshot_observed_at":"2026-08-14T23:26:01.012882Z","submitted_at":"2014-07-21T13:15:43Z","title":"A RM-Polar Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.5483","snapshot_observed_at":"2026-08-11T20:10:58.028540Z","title":"A RM-polar codes,","venue":null,"work_id":null,"year":2014},"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":17,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.028540Z"},"links":{"cited_paper":"/paper/1407.5483","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:340799af5db9862dd3231bee3cf1bc87b5107aac02cb72462da3fed71a1ffb4b","observation_id":"0a7b28f4-b8d0-43f0-9a34-b41be53452e7","resolution":{"observed_at":"2026-08-11T20:10:58.028540Z","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-11T20:10:58.565167Z","title":"Application of guessing to sequential decoding of polarization-adjusted convolutional (PAC) codes,","venue":null,"work_id":"3a009b5f-aa02-4d83-a7e7-c7404bd604f0","year":2023},"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":18,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.034537Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:ba12ae7ba4f1aa2849cfcb8c0e3e90d585c860e2a22fd47910a48eff9e642f69","observation_id":"c4c3c1d7-3291-45c4-8029-7c5f1b7a0a0c","resolution":{"observed_at":"2026-08-11T20:10:58.570957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.545944Z","title":"Design of compactly specified polar codes with dynamic frozen bits based on reinforcement learning,","venue":null,"work_id":"139b20db-1893-4378-af9d-63236c23cd2c","year":2024},"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":19,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.042350Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:ccd9ac86ccc85407e585679db489654092fa6945a279c3f4ec884e14874032e3","observation_id":"66ffae5d-2c6e-443a-911e-55e74a0adcf8","resolution":{"observed_at":"2026-08-11T20:10:58.551059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.529353Z","title":"Polar codes with dynamic frozen symbols and their decoding by directed search,","venue":null,"work_id":"733bb71e-b7e6-4772-bba0-5a48dccf9a13","year":2013},"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":20,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.049742Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:974d24c890fead138ebc90f8d833a9f990cfb8e2b82e6376c996c5e7a87aa600","observation_id":"0d5a7c19-89bb-419c-8ca4-3f0bb0adbac4","resolution":{"observed_at":"2026-08-11T20:10:58.534516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.513471Z","title":"On the road to 6G: Visions, requirements, key technologies, and testbeds,","venue":null,"work_id":"922341dd-69fd-4576-b6c0-fd5f5994882c","year":2023},"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":21,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.055617Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:822d8f56abc629a3aa316c08c1e361cff35757e768c4ad9d155eaa8f97890d3b","observation_id":"13efca29-cce5-4521-86cd-fd52ddcea287","resolution":{"observed_at":"2026-08-11T20:10:58.518273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.493496Z","title":"The computation problem with sequential decoding","venue":null,"work_id":"3f66b9bb-2772-4565-b5dd-933dda8f33fc","year":1965},"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":22,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.061375Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:2d23a2325650d26a00ecc3905aa953327a4fdc1325857c45a475b9b34fa451a3","observation_id":"2cb27dd6-466b-4d98-92b3-b5b00122189e","resolution":{"observed_at":"2026-08-11T20:10:58.500033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.475135Z","title":null,"venue":null,"work_id":"664dce31-7ea4-42dc-ab0e-017045a9c4b5","year":1965},"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":23,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.066999Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:cd35465aaab4dab3028276ad8b9fb53ba22b73c9512f0593b2040700e4c7a934","observation_id":"2b0d178d-fd4f-4b15-a9f8-0ac0261d54bc","resolution":{"observed_at":"2026-08-11T20:10:58.480434Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.455997Z","title":null,"venue":null,"work_id":"54a2e271-5160-4630-9263-60f496bb0e76","year":1968},"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":24,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.072391Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:c70b1f409cff2e84fe4769c0045c29a2fed215c3b51b967ff7e0983f1b87d6bf","observation_id":"9a72ee4e-cc4c-4612-ac07-10e6af91a595","resolution":{"observed_at":"2026-08-11T20:10:58.462662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.433938Z","title":"An inequality on guessing and its application to sequential decoding,","venue":null,"work_id":"e25a72f6-0343-4ba3-bce4-4ad1b13ec6bf","year":1996},"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":25,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.077276Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:9cde1c5c57ccdb7ea8bb5756296399b999d0052e375a41cfc7151a486a82a62c","observation_id":"540ff8ce-7fbf-4dda-be3e-5e72ef8b976e","resolution":{"observed_at":"2026-08-11T20:10:58.440447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.415060Z","title":"Hardware implementation of Fano decoder for polarization-adjusted convolutional (PAC) codes,","venue":null,"work_id":"9e2cfde7-4576-46fd-9559-46582052d4f6","year":2022},"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":26,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.082106Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:52aa1300a5edc94e3386bcabcf76d3bb3d5adc8f6e1a8a9cfacae0c0e87f05b6","observation_id":"fa8f56b5-28ad-4ae9-be02-a3f62f9c365c","resolution":{"observed_at":"2026-08-11T20:10:58.421260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.396068Z","title":"A tree pruning technique for decoding complexity reduction of polar codes and PAC codes,","venue":null,"work_id":"501c33e2-81d0-4577-8bc4-dbeaf440b954","year":2023},"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":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.087650Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:26e080ac002aac34b4ffa164ecba87336f8ed6730e64c5deba79b6ecd423058d","observation_id":"e39013d8-0464-4b35-9dea-2dde12ac733f","resolution":{"observed_at":"2026-08-11T20:10:58.402306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.093332Z","title":null,"venue":null,"work_id":null,"year":2013},"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":28,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.093332Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:c501072982225070309e6a4192a2e80b5b6c55c4895fbcd6f417572804ded824","observation_id":"351e16d9-cb09-4412-b282-908737b45ae6","resolution":{"observed_at":"2026-08-11T20:10:58.093332Z","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-11T20:10:58.367759Z","title":"An information-theoretic perspective on successive cancellation list decoding and polar code design,","venue":null,"work_id":"0b87d617-cba5-4e98-95ce-3e3ad21658ba","year":2022},"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":29,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.098950Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:c46fa53451f882c8241f23e4e4c9fc064d72994c5011c0adc8abc9888a2af496","observation_id":"102c0ee9-c28a-4edd-8c03-0f0ad0954ef2","resolution":{"observed_at":"2026-08-11T20:10:58.373091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-16T14:19:44.832125Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-11T20:10:58.106923Z","title":"High-rate fair-density parity-check codes,","venue":null,"work_id":null,"year":2024},"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":30,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.106923Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:d38668b907d49399be10b5e8957dd0f7d85b962825229fc8c389dc8ee9e759ae","observation_id":"446b2124-a24b-4dee-b15b-0f55abefffb5","resolution":{"observed_at":"2026-08-11T20:10:58.106923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:30f70722e5c0d1f36d2382841d2a9e60e28886d3e69da74c401b5652f997a7d1","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:10:58.347931Z","title":"A weighted sum based construction of pac codes,","venue":null,"work_id":"16665c14-c7fc-4f38-acd9-8d8794e9e2a8","year":2023},"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":32,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.118689Z"},"links":{"citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:8f819443928b2cdcd634813f4d37144080c912635b07d0d1e6897aeaf09e826e","observation_id":"2676b42d-c44f-483b-ba91-b561bcf3ec17","resolution":{"observed_at":"2026-08-11T20:10:58.355136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11554","last_updated":"2023-04-23T06:50:54Z","snapshot_observed_at":"2026-08-18T11:10:42.407816Z","submitted_at":"2023-04-23T06:50:54Z","title":"Construction of PAC Codes with List-Search and Path-Splitting Critical Sets","version":1},"cited_work":{"arxiv_id":"2304.11554","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.11554","snapshot_observed_at":"2026-08-11T20:10:58.169603Z","title":"Construction of PAC Codes with List-Search and Path-Splitting Critical Sets","venue":"cs.IT","work_id":"540430a7-50df-458f-afea-0ef390a3d170","year":2023},"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":33,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.124428Z"},"links":{"cited_paper":"/paper/2304.11554","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:aaf0cac3183e35179d0b5fbb54ba00b7c334d19f29f750dd358a92a2e8491a89","observation_id":"83741e94-f63d-49cb-a4e2-7dab29078735","resolution":{"observed_at":"2026-08-11T20:10:58.179203Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.06072","last_updated":"2025-08-14T16:52:55Z","latest_version":2,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":4,"verified_fuzzy":22},"total_outbound_references":33},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 1 inbound Pith citation observation for arXiv:2412.06072."}