{"as_of":"2026-08-19T12:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ae002da2e6a7df3063da1c74c0e4fbafb7ae44aba90d76ffd58dec25f6a81ad","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-15T22:38:55.752045Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.06867/citation-record","integrity":"/paper/2505.06867/integrity","json":"/paper/2505.06867/citation-record.json","paper":"/paper/2505.06867"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:38:56.947715Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"6d8c64ea-42fe-4ba0-871b-a4ceceba188f","year":2009},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.306686Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:af043f781cab17784b108dff73f8ed14fb727fd35af79572fb2970a046130cb1","observation_id":"3801d620-bb69-4f86-b079-91109fcf8141","resolution":{"observed_at":"2026-08-15T22:38:56.952664Z","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-15T22:38:56.858995Z","title":"NR; multiplexing and channel coding,","venue":null,"work_id":"9b2e2955-35a8-4af6-af38-da71c3ab0fb8","year":2020},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.312113Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:f4ee2758d9ef907aff26a0301564d0800293662c3f0148d81d8b1492b68f39f1","observation_id":"c8f1e5e7-b5f4-4599-bff1-c682acab4896","resolution":{"observed_at":"2026-08-15T22:38:56.906381Z","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-15T22:38:55.317057Z","title":"Short block-length codes for ultra-reliable low latency communications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.317057Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:76278a48656e326c40faaf0025644336451bd49eab801be4965fd31d1c1991cf","observation_id":"490c4905-96e4-4341-a331-9bbada022ac2","resolution":{"observed_at":"2026-08-15T22:38:55.317057Z","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-15T22:38:56.770866Z","title":"Efficient decoders for short block length codes in 6G URLLC,","venue":null,"work_id":"96d6c4b0-4e90-4d89-9701-141b46795a11","year":2023},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.321678Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:8845d4fd35c42b5c10e84f4fa553038d2e775a66d658f72cba1d4b99a519b273","observation_id":"9f1ac726-9446-462b-bb05-6c7188e3dd36","resolution":{"observed_at":"2026-08-15T22:38:56.814699Z","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-15T22:38:56.740159Z","title":"6G: A welcome chance to unify channel coding?","venue":null,"work_id":"f4d1c736-64f8-4a0d-954c-d5b8d4d3553f","year":2023},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.326532Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:080b216bed515d40ff197952dfe25f3486e7e9bd65bdf69481072de1f311f7b6","observation_id":"c140f4d2-e5f1-45c6-bc70-092fdaa8961e","resolution":{"observed_at":"2026-08-15T22:38:56.744562Z","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-15T22:38:56.726058Z","title":"Block orthogonal sparse superposition codes for ultra-reliable low-latency communica- tions,","venue":null,"work_id":"02527051-baf7-4edf-95f1-b6956b82058d","year":2023},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.330999Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:35103c715426b3294fc6f99f69916a22d7bc3d816b11bde39182318b44976509","observation_id":"57fe332d-d8f2-4e85-ab7a-342fcc656342","resolution":{"observed_at":"2026-08-15T22:38:56.730907Z","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-15T22:38:56.711988Z","title":"Block orthogonal sparse superposition codes for L3 communications: Low error rate, low latency, and low transmission power,","venue":null,"work_id":"4c318aea-5496-4152-ac86-29778c8fdd21","year":2025},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.335813Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:9638f02b211ac1c1b1716f3bf2bcc02f4d1cdc8454476ce0a48b271f98394128","observation_id":"4bd27435-39c7-4576-ac44-f54af19a9b1f","resolution":{"observed_at":"2026-08-15T22:38:56.716885Z","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-15T22:38:56.697768Z","title":"From polar to Reed- Muller codes: A technique to improve the finite-length performance,","venue":null,"work_id":"afc640be-890d-4cbe-bcef-61949d15f674","year":2014},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.339800Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:9dcaeac7ba5863bd2bb0694eb8979c0a7f8691243b28cccb025f573d4649f8f1","observation_id":"08882fce-876d-409b-a435-12eacf50c26b","resolution":{"observed_at":"2026-08-15T22:38:56.702448Z","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-15T22:38:56.683771Z","title":"CRC-aided decoding of polar codes,","venue":null,"work_id":"ac61069b-9ff2-429d-b2d5-3da8ae36fe49","year":2012},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.344128Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:56ccfb244e3c6c714671fff7e8909f0c62ebd50b86895e8b3392ff1dac8351fb","observation_id":"7846dad2-20f1-4c49-b9a1-d45913ceba92","resolution":{"observed_at":"2026-08-15T22:38:56.688390Z","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-15T22:38:56.669441Z","title":"Polar codes with dynamic frozen symbols and their decoding by directed search,","venue":null,"work_id":"6b018184-6053-495d-8754-b62b9a7d0b94","year":2013},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.348369Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:16392e54353dae1748440c1679d06aa800e69cc94155624838b3e3273fdcbd39","observation_id":"75323f78-b85f-4bb9-a8b3-1b578591deea","resolution":{"observed_at":"2026-08-15T22:38:56.674291Z","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-15T22:38:56.655915Z","title":"Parity-check-concatenated polar codes,","venue":null,"work_id":"9a552351-c01f-4d7f-81fb-0d5f93090f46","year":2016},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.352651Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:8ef5cb171164d12d6b1f2d5a1985f1dea3a215c044dc905a179c0f2bb408769e","observation_id":"1b49975c-5b09-474c-97a3-069be08fb4b3","resolution":{"observed_at":"2026-08-15T22:38:56.660334Z","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-15T22:38:56.554749Z","title":"Parity-check polar coding for 5G and beyond,","venue":null,"work_id":"b53df70e-b436-4945-9cce-61233eb300cc","year":2018},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.356969Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:0f68f38ceec806119ec7fa5a86e7fbde244046c41282e340ff3a1014f7a865e2","observation_id":"1aa6926d-f005-4a47-aa09-b0186f52f2ad","resolution":{"observed_at":"2026-08-15T22:38:56.588114Z","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":"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-15T22:38:55.361493Z","title":"From sequential decoding to channel polarization and back again,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.361493Z"},"links":{"cited_paper":"/paper/1908.09594","citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:3af29c52effd56fa0eb18c275e8279fdf3ebebfa9501e0874f7f68483db16ac8","observation_id":"05c9695b-97f3-4205-8ed1-14b7402fb16e","resolution":{"observed_at":"2026-08-15T22:38:55.361493Z","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-15T22:38:56.466828Z","title":"Deep polar codes,","venue":null,"work_id":"ad46c247-6810-44b5-9155-40216b564bd7","year":2024},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.387733Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:1e2b155d79c27f516caf1a7e8899f7a44118dc5b7c0bd2daa034da78bdb1b006","observation_id":"6e4e88bb-38fa-4409-a0d8-cc735eaa34d0","resolution":{"observed_at":"2026-08-15T22:38:56.510673Z","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-15T22:38:56.382643Z","title":"Sparsely pre-transformed polar codes for low-latency SCL de- coding,","venue":null,"work_id":"e326c41e-228f-4865-afc3-f41d6476cad1","year":2025},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.466798Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:a44af9be94edd73027575f4623928bbe8aae31665fcd0b2adca9ed9b387aded7","observation_id":"6d2c64ce-3bbf-490e-b794-88750916fd2f","resolution":{"observed_at":"2026-08-15T22:38:56.422014Z","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-15T22:38:56.368241Z","title":"Deep polar codes: An efficient error correction code for short blocklength transmission,","venue":null,"work_id":"701cc56e-ab72-4d0f-9aff-f5b9b45eecc5","year":2023},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.527597Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:1c86cb01dcd2ae1b5510e07a5f8bc544b1a2dea8937206ae6c16fa854eb6aa34","observation_id":"eefc4164-e250-4c01-9c13-64f60265332c","resolution":{"observed_at":"2026-08-15T22:38:56.373400Z","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-15T22:38:56.353995Z","title":"Sparsely pre-transformed polar codes for low-complexity SCL decoding,","venue":null,"work_id":"23090387-0e27-40b4-929a-b6e1e64c0dd0","year":2024},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.567265Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:9728162faca950af5e3e800448f0aa830a2f733a6c525a33e619b54a8d61f245","observation_id":"acb704a9-f651-477a-9326-0f1b6f93b42e","resolution":{"observed_at":"2026-08-15T22:38:56.358383Z","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-15T22:38:56.340047Z","title":"Design of length-compatible polar codes based on the reduction of polarizing matrices,","venue":null,"work_id":"f70d99f2-6dca-4748-aebf-50daf141531d","year":2013},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.659598Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:195f6dedb5175a2ecc41a45679678d5c600352686f24813e5a7e909305bceb64","observation_id":"e1b7efd2-87ca-4fcd-93c4-238ba06477dc","resolution":{"observed_at":"2026-08-15T22:38:56.344925Z","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-15T22:38:56.325276Z","title":"A hybrid ARQ scheme based on polar codes,","venue":null,"work_id":"7486d498-dba1-4050-8914-8b41637dc2c1","year":1996},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.691455Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:2ac01f1855d320fe9564f66150960b3cff5419d41d545ce6698ef501134b94be","observation_id":"884e4162-a385-401b-b2c5-b9cb4082e10a","resolution":{"observed_at":"2026-08-15T22:38:56.330181Z","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-15T22:38:56.311357Z","title":"Beyond turbo codes: Rate-compatible punctured polar codes,","venue":null,"work_id":"d18756d6-5199-4dbc-8707-d723c94787f9","year":2013},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.696065Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:ae41dc73736349e7cb791f06d4bb620fedad1ab757b983f6ac8a7069036e5774","observation_id":"0c1ab54b-025a-44e0-8b3a-164af57db77e","resolution":{"observed_at":"2026-08-15T22:38:56.315788Z","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-15T22:38:56.297048Z","title":"A novel puncturing scheme for polar codes,","venue":null,"work_id":"926bc1a6-9717-427d-ad19-faf4410a9a98","year":2014},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.700664Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:8ea11da3f2f3f17dc117d07181144321477a74ad40d9cb8b9e29cd0885a5d08c","observation_id":"687a2a85-9f30-4831-bac3-39bad44451f7","resolution":{"observed_at":"2026-08-15T22:38:56.301638Z","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-15T22:38:56.282373Z","title":"Shortened polar codes,","venue":null,"work_id":"17c2c09c-b8eb-4de9-9c46-1f4464872e43","year":2015},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.704774Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:bc25c38a105b1b4cdda4cb4867f8e50d41406e841b820a1f66686192a8742c2d","observation_id":"3cba475b-32ac-43d7-911b-3c22513ac2fe","resolution":{"observed_at":"2026-08-15T22:38:56.287139Z","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-15T22:38:56.158840Z","title":"An incremental redundancy hybrid ARQ scheme via puncturing and extending of polar codes,","venue":null,"work_id":"40e545a5-02e7-4ffa-976e-96015093dc9e","year":2015},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.709080Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:efb67e871860220a3037a854168300042148f4e7f6480e605c802f8073ad3354","observation_id":"053a0b9a-70f4-454b-aa63-632b827148bf","resolution":{"observed_at":"2026-08-15T22:38:56.235319Z","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-15T22:38:56.143449Z","title":"An adaptive ir-harq scheme for polar codes by polarizing matrix extension,","venue":null,"work_id":"0016d63c-9a8f-4318-a580-a4ae4e8f5445","year":2018},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.713465Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:42d322d355ec9aa0848231430cc89b95478fdf01ed99bad0ee62066fc8610c4e","observation_id":"8265e981-4ec1-465c-8959-1be2d0fe9237","resolution":{"observed_at":"2026-08-15T22:38:56.148117Z","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-15T22:38:56.128193Z","title":"Rate matching for polar codes based on binary domination,","venue":null,"work_id":"1d9eda00-87c6-4478-9001-be9df272c1c6","year":2019},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.717468Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:aa398b02480634407796b6671cacb274ee168dbd8560ce746a21a45f670c8e65","observation_id":"be2dcbdb-d46b-4c18-a358-e4bfed625f3d","resolution":{"observed_at":"2026-08-15T22:38:56.133305Z","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-15T22:38:56.112774Z","title":"Structural extension of polar codes via simplex kernels,","venue":null,"work_id":"bb5d14fd-64a5-4329-912e-56c62e95a330","year":2020},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.720938Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:7e9dbd34a34106b932f237c12e1e6e6153f26adde149f783998798bc3998a4bd","observation_id":"a5b87b1d-64f7-448a-8f0d-2934a612c7b0","resolution":{"observed_at":"2026-08-15T22:38:56.117388Z","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-15T22:38:55.940389Z","title":"Soft-out successive cancelation decoding and its list version for polar codes,","venue":null,"work_id":"2d8e7303-25ec-4e95-9be3-71611e3f24ae","year":2025},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.724989Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:b6dff36a04fb476e00305de0239fdb73eb50afdba05b9fd4acc843703de2bb4a","observation_id":"bddd2304-1e54-4db9-9135-d855c00bc87b","resolution":{"observed_at":"2026-08-15T22:38:55.989329Z","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-15T22:38:55.861412Z","title":"Performance of polar codes with the construc- tion using density evolution,","venue":null,"work_id":"ac6d1531-a61f-4040-bb16-4e2d997d16eb","year":2009},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.730238Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:b17035435f9073df894305170dcb2abf46374602ffaa8a4b3ec29a7b7894e97b","observation_id":"ab89ac4d-0d78-4f67-b57e-7f4d66776c3d","resolution":{"observed_at":"2026-08-15T22:38:55.894571Z","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-15T22:38:55.734627Z","title":"Efficient design and decoding of polar codes,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.734627Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:84812d948a6d9a3ffb84703576c3b2b9e0063577344560fab79a802dd06fefcc","observation_id":"f9b38445-222e-4df1-bf3f-1cdffe67f0f7","resolution":{"observed_at":"2026-08-15T22:38:55.734627Z","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-15T22:38:55.837122Z","title":"Construction and block error rate analysis of polar codes over AWGN channel based on gaussian approximation,","venue":null,"work_id":"44b68f94-1ca1-41e6-8625-873a5d0bbc85","year":2014},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.739395Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:c5f8c87b795c614de62c1b29c2f2a09d3db224d69be08be65eeee3ce3b3823ec","observation_id":"0301be18-e52c-4ecd-8d56-bcdb25bbd425","resolution":{"observed_at":"2026-08-15T22:38:55.842400Z","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-15T22:38:55.822844Z","title":"Polar codes: Primary concepts and practical decoding algorithms,","venue":null,"work_id":"c6049c32-e9a4-4812-95d6-2bc28471ec2a","year":2014},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.743545Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:f070c8576cb9db0df3d56464f154a460e946798d9efc4aa8d72c1233e3888f74","observation_id":"95533755-7901-4b18-805a-7c7574c7b8d7","resolution":{"observed_at":"2026-08-15T22:38:55.827381Z","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-15T22:38:55.747780Z","title":"List decoding of polar codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.747780Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:91b8f3ab99a81889ade945b12c8bc3c74c754c9b90f6b04d5c7df5392311ccb5","observation_id":"c664dd5b-5223-4b51-bd9f-f5ae8b93c98a","resolution":{"observed_at":"2026-08-15T22:38:55.747780Z","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-15T22:38:55.797068Z","title":"LLR-based successive cancellation list decoding of polar codes,","venue":null,"work_id":"c1cf4aa0-f955-47da-9c6b-429fafd5f63d","year":2015},"citing_paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T22:38:55.752045Z"},"links":{"citing_paper":"/paper/2505.06867"},"observation_digest":"sha256:ffc828c06c982580aa39f6c87a2a1478112da56b288d6f7c1b0b7f73ebf06a5f","observation_id":"513edd59-4cfa-4a12-989e-bf6fd8ed6271","resolution":{"observed_at":"2026-08-15T22:38:55.803461Z","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"}}],"paper":{"arxiv_id":"2505.06867","last_updated":"2025-05-11T06:32:29Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T11:13:29.480532Z","submitted_at":"2025-05-11T06:32:29Z","title":"Rate-Matching Deep Polar Codes via Polar Coded Extension"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":29},"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 0 inbound Pith citation observations for arXiv:2505.06867."}