{"as_of":"2026-08-08T10:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c122fad9c455c387e46b332cdb49986608cd35713214004c70b8379e66b76c9e","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:01:56.066353Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.04163/citation-record","integrity":"/paper/2506.04163/integrity","json":"/paper/2506.04163/citation-record.json","paper":"/paper/2506.04163"},"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-07T11:01:57.209224Z","title":"Extremes of information combining,","venue":null,"work_id":"10affc16-94ab-4307-bc5b-b66c322ecf07","year":2005},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.436316Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:e67cecae739946e09e1ef54af412f80561d9b20e0dc3297e8474462173778b51","observation_id":"48e253c9-fc77-45a6-99db-63c134ac5b15","resolution":{"observed_at":"2026-08-07T11:01:57.219091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:55.470370Z","title":"Richardson and R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.470370Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:955310cd4ccd9aad4eab4efdb7fc13d7646fa325ec981fcdec0475329c5312cc","observation_id":"42e0c1fc-d723-4783-9e71-6c9b4e9c2807","resolution":{"observed_at":"2026-08-07T11:01:55.470370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:01:55.491079Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.491079Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:92710465dd1e1e350f9347761f7d3fef79110df4fb5eb4697b99e099f04562de","observation_id":"fc482080-b9df-40c2-8924-2195ac5e1afd","resolution":{"observed_at":"2026-08-07T11:01:55.491079Z","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-07T11:01:57.165480Z","title":"Performance of polar codes with the construc- tion using density evolution,","venue":null,"work_id":"6bd36b67-21c0-4ab1-9aba-e73b4b5ebe2c","year":2009},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.532571Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:fcbe2ec9cbef61ec83aa4d9dc69c8ad1ecd7966f58c5707bb7a547a0bd4ccf27","observation_id":"684fe00a-9548-41ba-8b21-c57507242d03","resolution":{"observed_at":"2026-08-07T11:01:57.181984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:57.095395Z","title":"Polar codes for channel and source coding,","venue":null,"work_id":"cad38c52-27f4-487b-967f-638dc243cf66","year":2009},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.577997Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:fd57c8a79d3410ddb5b0c2c3dcd8a56b7411966b539d0ee7e0186848a774dd23","observation_id":"90d92482-cc82-4e60-ab09-425bd1ba9945","resolution":{"observed_at":"2026-08-07T11:01:57.125522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:57.040439Z","title":"Efficient design and decoding of polar codes,","venue":null,"work_id":"33099c19-2fb3-40a6-8841-57448efdb0c0","year":2012},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.618334Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:cc095800f4aa91e925e44ad3688efb42bb11adde8fe459ffed864d31bff33073","observation_id":"b09c1e4c-89ae-4149-8cd3-024291e85842","resolution":{"observed_at":"2026-08-07T11:01:57.064012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:55.634481Z","title":"How to construct polar codes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.634481Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:198968a675250433e15b5883185a9052042402a13e66803530f303b4afcaf894","observation_id":"3ee10f92-046d-4da6-a4be-b0191349d9fb","resolution":{"observed_at":"2026-08-07T11:01:55.634481Z","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-07T11:01:56.960845Z","title":"A partial order for the synthesized channels of a polar code,","venue":null,"work_id":"6538fd66-ddd9-4e0c-8cd8-e41cc85cb387","year":2016},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.689813Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:b74e91eea9dc2bcdc611cf0bcfafd2de2657ac95b8f49a93f45d18aab3f34630","observation_id":"5e192b47-cdd4-48ce-b3f7-ce362192edbc","resolution":{"observed_at":"2026-08-07T11:01:56.995063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.885045Z","title":null,"venue":null,"work_id":"86b697ae-f6a1-4d25-8d9a-d61285f6a887","year":null},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.727882Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:f721b6e0521404cd0eac48c5a25cd79111f2ec5bbd82034ea3ccb3f2b53209f0","observation_id":"b0957de7-c854-4f1e-adcb-1fcf45f38c57","resolution":{"observed_at":"2026-08-07T11:01:56.921213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.840957Z","title":"Polar code constructions based on LLR evolution,","venue":null,"work_id":"5385d38e-9133-410f-875a-989066a71e83","year":2017},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.737292Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:1692e3ab354a2dd85a0b7b45d6facff8b6fcd191c67c18424bed6424877f2435","observation_id":"8966d5c8-53eb-4330-9260-ddc23f331cfb","resolution":{"observed_at":"2026-08-07T11:01:56.860904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.796900Z","title":"β-expansion: A theoretical framework for fast and recur- sive construction of polar codes,","venue":null,"work_id":"d287ef4a-64e6-40ba-aafe-baacbc467014","year":2017},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.767727Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:f425d58b71e3914d7084bd832f25dbbcd02a0d09bfdde4e2e4a4dcbcc5dff18c","observation_id":"7cfe8505-5eb5-4bc4-b520-6f5816cc84c1","resolution":{"observed_at":"2026-08-07T11:01:56.816464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.714490Z","title":"Construction of polar codes for arbi- trary discrete memoryless channels,","venue":null,"work_id":"c9cc8768-1261-4436-851d-10a7b64e767a","year":2018},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.785434Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:07251a67c7a92a03bd997271b305555f94f61308c94a6fcf168fb8af1633c4e8","observation_id":"e40a503c-470e-4b79-9570-4a53a0e069f8","resolution":{"observed_at":"2026-08-07T11:01:56.749548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.654618Z","title":"Bounds on information combining with quan- tum side information,","venue":null,"work_id":"04694122-afce-47c8-9dd5-2a6561f2fb79","year":2018},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.828174Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:e24de556f1a394092ee7ed90117b7328eb7cc7804e65a9da164282cc1b3a02b4","observation_id":"6a90ce51-f510-4b8d-9c62-76f02d7788af","resolution":{"observed_at":"2026-08-07T11:01:56.696658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.577892Z","title":"Construction of polar codes with sublinear complexity,","venue":null,"work_id":"07770faf-5f81-4547-92bb-843d9c533585","year":2019},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.863411Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:bacecf5d72999bc46777f749e74d503273c49ef74504176e35724124dbfac653","observation_id":"6d16eed9-cccd-48d0-b632-af81f0b4e186","resolution":{"observed_at":"2026-08-07T11:01:56.613080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.503382Z","title":"Generalized partial orders for polar code bit- channels,","venue":null,"work_id":"90d55309-8523-4b11-bf28-24d4ef0b8ee0","year":2019},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.896800Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:a5f7d69b71a32bc1562bf62eeaf019dd52a0ddea01f3a8b35a3842b37e54d392","observation_id":"7161bf05-1c77-42ad-ae48-1f6deb5a8c0a","resolution":{"observed_at":"2026-08-07T11:01:56.533902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.416198Z","title":"Transformation of binary linear block codes to polar codes with dynamic frozen,","venue":null,"work_id":"5129948a-a4d7-449f-b37e-ba7ec5a9b416","year":2020},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.940302Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:1f8d22de8e80b2eb820d684c991635f2a6d1be3a1b59668ed04535770d45a241","observation_id":"360dafea-b9a7-4ca3-adba-6210cec722d0","resolution":{"observed_at":"2026-08-07T11:01:56.456076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.340161Z","title":"Capacity-approaching polar codes with long codewords and successive cancellation decoding based on improved Gaussian approximation,","venue":null,"work_id":"2d9ae0fb-a4fe-4101-aaf2-8b617e257033","year":2021},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:55.977084Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:5647c91e2e8eaa967da07af7fe4dc2e5fbc7daddec9fa0a7a869fa9e60f2983c","observation_id":"2785ad0f-b0ed-4a4b-9350-2c6e27af531c","resolution":{"observed_at":"2026-08-07T11:01:56.381858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.263180Z","title":"Adjacent-bits-swapped polar codes: A new code construction to speed up polarization,","venue":null,"work_id":"c5246e10-9a7d-48c0-b1e3-27c1d20ef9dd","year":2023},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:56.012181Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:8177803e591b3e6005f5ea926983395d798791bdf9bcdc85e4fe8dea055d1096","observation_id":"beb810d5-ae40-440c-9652-6be06f3c0b8d","resolution":{"observed_at":"2026-08-07T11:01:56.298894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.193309Z","title":"Construction of polar codes based on memetic algorithm,","venue":null,"work_id":"1d4635cf-ed51-4509-be2f-7ed26d2c436d","year":2023},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:56.039361Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:ffe6f585c8602b417a717f4fb9dad03e8e67eabcf69bae591ff46d0f96a15a5c","observation_id":"57f5af6e-5fca-47f1-9a99-0f9e0e1e7ad4","resolution":{"observed_at":"2026-08-07T11:01:56.225126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:01:56.115768Z","title":"A balanced tree approach to construction of length- flexible polar codes,","venue":null,"work_id":"dc72b6fc-67f3-41fb-9dde-dc59cd2c3990","year":2024},"citing_paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:01:56.066353Z"},"links":{"citing_paper":"/paper/2506.04163"},"observation_digest":"sha256:c31a7b033dd0b2f3d4fb99bed2128d323a4e371579ea2b4b5efa30d101ad420e","observation_id":"a8f70e68-2df1-4ac0-ac73-847c51a07f41","resolution":{"observed_at":"2026-08-07T11:01:56.150354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04163","last_updated":"2025-06-04T17:02:04Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T10:44:18.834491Z","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":20},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2506.04163."}