{"as_of":"2026-08-14T10:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9602a89dffd6d65a7bc87b4a927266864c11f3aa265c6498b269c19b2ee665c","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T11:58:17.903027Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1907.00527/citation-record","integrity":"/paper/1907.00527/integrity","json":"/paper/1907.00527/citation-record.json","paper":"/paper/1907.00527"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memo ry- less channels","venue":null,"work_id":"2ac84b72-6300-4e7d-8578-e95c93425674","year":2009},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:2bb69c84729b9e2751e578ac02ebc1bd5002a6af7b1813e6dea4da9d2298f6c9","observation_id":"5c528f71-5563-434e-860e-3dfebf21dbac","resolution":{"observed_at":"2026-05-25T12:00:46.417405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"Performance of po lar codes for channel and source coding","venue":null,"work_id":"eebc3876-a80a-44c4-963e-ae91e82c3682","year":2009},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:db980275184344c3fcee14364260b94ec636785c24ba93eb5996f80e0346a8cc","observation_id":"11307138-9715-4a5e-9cce-9f7316f070a8","resolution":{"observed_at":"2026-05-25T12:00:46.410911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"List decoding of polar codes","venue":null,"work_id":"e9c016e0-06f5-451b-bcf3-b1c127ca2244","year":2015},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:92534736d1e42c67772b9a29c28faf056e3552eaf8e3bf43cd25fae4b45dc396","observation_id":"134b58f4-f1d2-48ff-87e6-d69aed92b63f","resolution":{"observed_at":"2026-05-25T12:00:46.424165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"CRC-aided decoding of polar codes","venue":null,"work_id":"8bb841c6-bc4c-45b6-9040-6fe8e15ff9ee","year":2012},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:4b550101c0f50fbaef2cec7ccf98e0008a5f336b14b349842a121ff374bbf296","observation_id":"d573c481-4f8a-42fb-8ad1-f447fe7f7e02","resolution":{"observed_at":"2026-05-25T12:00:46.420871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"Improved successive cancell ation decoding of polar codes","venue":null,"work_id":"1e4a3ea7-e59a-44c8-ae54-6c24b1ef1f6d","year":2013},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:3adab4635b9fceea2a88cad60d8842fb11e4f3bb49482df89ea9bb5fac178e7c","observation_id":"ef88e0e0-dfed-40f2-9654-bc4c7ef67848","resolution":{"observed_at":"2026-05-25T12:00:46.430331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"A performance comparison of polar codes and reed- muller codes","venue":null,"work_id":"d11575c7-dad6-405a-9149-ac9301985a2e","year":2008},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:983e3e156274f3bf5eee2f138cbd1ace96007dda2667a9fe40e50b240054d6c6","observation_id":"05f1c60d-349c-4951-b49f-6fc7dcbe7430","resolution":{"observed_at":"2026-05-25T12:00:46.394551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"On bit error rate performan ce of polar codes in finite regime","venue":null,"work_id":"c8866ba8-b7ee-41ff-a102-7bf4e4e5435c","year":2010},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:a25d7093d320af2128dc00ae3fc82c6aff49270a8b5adcf0b950d03a4d0a44c4","observation_id":"731d0720-ae10-4430-98dd-7bf58e192bd1","resolution":{"observed_at":"2026-05-25T12:00:46.397945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"An FPGA implementation of succes- sive cancellation list decoding for polar codes","venue":null,"work_id":"b69af570-cb81-465d-b60d-7e5da72f4d6b","year":2016},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:7095fcc01bc1340bde141e028e2b5608c7ba42a0b15391bc8f502f18ef566d39","observation_id":"2b21ab72-94fb-4e52-931f-a3778192699a","resolution":{"observed_at":"2026-05-25T12:00:46.401448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"How to construct polar codes","venue":null,"work_id":"76d6a791-6312-43e7-83a3-7493e14e9c0f","year":2013},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:30491e21f5e10263a85010a6b215854a05478ec429eb5ae015aa3f40fcd47494","observation_id":"94176655-ef74-4761-a58b-4d2b64889d03","resolution":{"observed_at":"2026-05-25T12:00:46.404290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"Low-latency sequential and over lapped architectures for successive cancellation polar decoder","venue":null,"work_id":"92fa3dcd-e069-4297-9d9b-cc10af54da35","year":2013},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:68c54cb9ff36179cad5bd96863031b5d26d2813af70f5c1fa7ea63ac2c2f3f96","observation_id":"3a10892f-37d6-4f87-b7f3-593b201e77a4","resolution":{"observed_at":"2026-05-25T12:00:46.407545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"Interleaved successive cance llation polar decoders","venue":null,"work_id":"c163221c-5f70-42e2-ba59-1291e85ef1b7","year":2014},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:3abad3c053af0d46d7c328e5a4d02c337765c2eb5da2c1e592dc3be178d310d9","observation_id":"e1949834-1463-4490-a9e0-8ed1143390ad","resolution":{"observed_at":"2026-05-25T12:00:46.414107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-06-05T21:23:00.469572Z","title":"High throughput decoding methods and archi tecture for polar codes with high energy-efficiency and low latency","venue":null,"work_id":"319d3844-68e3-484b-a676-fedaf18a13db","year":2017},"citing_paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:17.903027Z"},"links":{"citing_paper":"/paper/1907.00527"},"observation_digest":"sha256:8ded034f0292f6ef919c947c52fda8f231095d0832d7ec12c93cc70c87b31051","observation_id":"a52dc0d7-59b7-47f8-b945-c3557f22ebf7","resolution":{"observed_at":"2026-05-25T12:00:46.427331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.00527","last_updated":"2019-07-01T03:21:51Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-03T18:45:35.887837Z","submitted_at":"2019-07-01T03:21:51Z","title":"Polar Codes with Memory"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":12},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1907.00527."}