{"as_of":"2026-08-19T05:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1facc3ae65d89fb4ec1a9b4f8acf0873cfdfc17e1c90329d37d372f79dd417b0","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:50:44.752156Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2507.10068/citation-record","integrity":"/paper/2507.10068/integrity","json":"/paper/2507.10068/citation-record.json","paper":"/paper/2507.10068"},"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-06T17:50:44.995101Z","title":"Application of Boolean algebra to switching circuit design and to error detection,","venue":null,"work_id":"b67d2be1-0330-4b84-be7e-73a0aefbf2ea","year":1954},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.674380Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:1c6c703f0de814e7c2eae21a11c8e4352a4c978f1a37f4b9d0d7e0b25409b208","observation_id":"fafc8cc7-51b7-45ba-9e54-ec92369f2157","resolution":{"observed_at":"2026-08-06T17:50:44.997600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.988009Z","title":"A class of multiple-error-correcting codes and the decoding scheme,","venue":null,"work_id":"6bc50b18-b1cc-47d5-b400-ff67e3b8537c","year":1954},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.677897Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:ba3b0460e7a83a6c9b249017412936d9a64762ac77c9a991e4d617b8179c1e58","observation_id":"75e5671b-3323-4997-99a1-46dad2ba7b49","resolution":{"observed_at":"2026-08-06T17:50:44.990436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.980979Z","title":"Reed–Muller codes: Theory and algorithms,","venue":null,"work_id":"7c84ab8a-2088-46ea-928c-a515d65ea657","year":2021},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.681396Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:bce749c8f3d523e7fb2bf39a50472b7404c84327f713d5822fa1de8cb6cb370e","observation_id":"000360e5-5f7b-44b6-ac0c-af9940b705db","resolution":{"observed_at":"2026-08-06T17:50:44.983694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.974887Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"03a2426d-d4ea-4ee5-bb89-c9a839a0a6d0","year":2009},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.683691Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:dc751c602fb918bb39c0b3c790c947b49579b19bdfb4febeb2416d21ff14d4a6","observation_id":"a93e296f-e25f-48f0-bf66-d56f233f068e","resolution":{"observed_at":"2026-08-06T17:50:44.977455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.966865Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels,","venue":null,"work_id":"2a6db172-89ce-4864-a883-3e5b1513e2c7","year":2023},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.686550Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:84e1a118ee538cd11bec4de56ae37a5f3406ae9b6c31518cbb3f6c19754d90fd","observation_id":"0f069c23-f8dc-43f7-9c04-0c385420eda4","resolution":{"observed_at":"2026-08-06T17:50:44.970510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.959661Z","title":"Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity,","venue":null,"work_id":"a1d1b8c5-050f-46e5-a1ef-076f13ddd172","year":2024},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.690274Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:1524fb8342491fa2608f2c4313611737168c60a55173b63061a017b9a664a38a","observation_id":"83e32812-7216-4948-8c61-537f50f4eb5c","resolution":{"observed_at":"2026-08-06T17:50:44.962269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.953125Z","title":"From Polar to Reed- Muller Codes: A Technique to Improve the Finite-Length Performance,","venue":null,"work_id":"3261b9ca-fec6-46ff-b8d7-39ca52a8109a","year":2014},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.692945Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:297eeb5d7a0b8b8da5dd92ac10a2dc689a186b9f03c4728150270122900012dc","observation_id":"710d7e0f-3878-4f78-ace0-934985c93361","resolution":{"observed_at":"2026-08-06T17:50:44.955851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.947206Z","title":"Polar codes: Characterization of exponent, bounds, and constructions,","venue":null,"work_id":"f4d30994-bb4e-46fb-98b1-40bccee92934","year":2010},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.695900Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:155743b35356cf76ceba8b01ee644f78b7065a2929ddcec0fe8c8e53ae498cb8","observation_id":"d49921a8-a3e8-416c-8783-887a213848aa","resolution":{"observed_at":"2026-08-06T17:50:44.949677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.939847Z","title":"Berman codes: A generalization of Reed–Muller codes that achieve BEC capacity,","venue":null,"work_id":"ee44102b-d764-4ba9-9fa7-4c705b3d452d","year":2023},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.698326Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:2170d7c1fbcd28336d906f6d5d5b72aea661baddccd890153fbf6122ee5f9845","observation_id":"7df60277-2c2c-4687-a62a-581b44e587ce","resolution":{"observed_at":"2026-08-06T17:50:44.942327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.930661Z","title":"Semisimple cyclic and Abelian codes. II,","venue":null,"work_id":"396c1638-bd94-43b5-a02c-47b639dee93b","year":1967},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.700520Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:59d13ecb835af980ae0d20658bbff4dc787f691f3626672899d8c16a737ef764","observation_id":"bd12d7e3-f998-4754-b999-7b5d961fd459","resolution":{"observed_at":"2026-08-06T17:50:44.933947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.922575Z","title":"On a family of abelian codes and their state complexities,","venue":null,"work_id":"c11c1c5d-7a7d-49d6-9c1c-cd92f4f3e405","year":2001},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.702692Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:528e2a9311f6bfd7c0c09fd0f5a8f427eae6433a922abb0c51ba0a1589284b48","observation_id":"f2e8cce4-845e-47b7-8758-62a0a926a713","resolution":{"observed_at":"2026-08-06T17:50:44.926291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.912697Z","title":"Successive Cancellation Ordered Search Decoding of Modified GN-Coset Codes,","venue":null,"work_id":"d845f707-2726-4796-a832-64625f749592","year":2024},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.705409Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:5077846e33c5eab163de8510028744dee5ce746da2de88365e112e13630085b5","observation_id":"0ee27266-678d-4a28-bf9d-6f6dc2ebcbcb","resolution":{"observed_at":"2026-08-06T17:50:44.916068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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":"1407.5483","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.5483","snapshot_observed_at":"2026-08-06T17:50:44.791837Z","title":"A RM-Polar Codes","venue":"cs.IT","work_id":"e25ca454-033d-4680-9309-4e903bbf192d","year":2014},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.708435Z"},"links":{"cited_paper":"/paper/1407.5483","citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:6d6643ed6ec795ba63f7e40e14e77bed5e334657192342c271b461c5c322b573","observation_id":"de562067-97af-4622-a71b-51ac91014525","resolution":{"observed_at":"2026-08-06T17:50:44.794989Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.906338Z","title":"Transform domain characterization of abelian codes,","venue":null,"work_id":"3554b824-e171-4ffe-8ffd-8afac06f964e","year":1992},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.711033Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:145e4efeb4eed3ef68737f27d98678039b17f52befd8d07548891c60c80feb50","observation_id":"15aa886c-7386-4176-aae8-32fd153d084d","resolution":{"observed_at":"2026-08-06T17:50:44.908843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.899302Z","title":"Reed–Muller codes achieve capacity on erasure channels,","venue":null,"work_id":"c874852b-16c3-47e8-a16b-6b37aa486b58","year":2017},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.713331Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:94379b806b750fe2290bc10b1d594cfac7e20f09da9cdcc7111b51ee32356b47","observation_id":"f5fd2b33-fad2-4b6a-88bd-4c51d16ddeb5","resolution":{"observed_at":"2026-08-06T17:50:44.901769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.892999Z","title":"Polar codes for channel and source coding,","venue":null,"work_id":"168768c7-63b0-45c8-b53a-f54c7b8b5a55","year":2009},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.715622Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:26882f7ad048d85354bb697284448fe472236fd226d905233ed357abe4b0965b","observation_id":"c178dcf0-1ec9-4bee-a2b2-16dde96fd7af","resolution":{"observed_at":"2026-08-06T17:50:44.895615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.886037Z","title":"Complexity-adaptive maximum-likelihood decoding algorithms with a successive cancellation schedule,","venue":null,"work_id":"2d032dc3-fae0-42f1-ba17-f4c0c9c8c51e","year":2023},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.717841Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:cbf08b95ad2e78a67d058be9c2ce5234cc255d5f001de97412a00a46b4dcafea","observation_id":"25f82278-027e-4216-acfd-b36e44e06566","resolution":{"observed_at":"2026-08-06T17:50:44.888543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.879440Z","title":"List decoding of polar codes,","venue":null,"work_id":"a6d3acd0-301c-446a-a501-c20116c93d60","year":2015},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.720093Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:771cefbdce136bd5cf656fe99686f729ae074cbe710cf0e37df16ed7e8318112","observation_id":"e3a3b08c-c45f-4471-b339-b04fe9067c66","resolution":{"observed_at":"2026-08-06T17:50:44.882422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:04:37.031374Z","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-06T17:50:44.722338Z","title":"From sequential decoding to channel polarization and back again,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.722338Z"},"links":{"cited_paper":"/paper/1908.09594","citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:413d5ffe835847048c08c671e035cd84762020d9767ab3c7a9b3f6ca4fa94301","observation_id":"dc6be65c-dd13-4d17-a990-0b963c5d2a18","resolution":{"observed_at":"2026-08-06T17:50:44.722338Z","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-06T17:50:44.871705Z","title":"Polar subcodes,","venue":null,"work_id":"d519acb5-7a83-4fa5-9933-7d496daeafe2","year":2016},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.724787Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:b2aa8a67bf00490260b9ddbba058f0b710a06f4b5cfa578db0f55218fd556e85","observation_id":"b2d9779a-123b-4fde-84d5-8d7354aa0802","resolution":{"observed_at":"2026-08-06T17:50:44.874254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.865294Z","title":"List Decoding of Arıkan’s PAC Codes,","venue":null,"work_id":"c105baeb-9a44-4a6e-a372-797112f96cdd","year":2021},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.727082Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:e1bed1d309d22f787be6f8c7e019b57dfb6c066f8b420d2dda7b2b67356a6a37","observation_id":"bb8c0c78-432f-42d7-8121-ba0e88c0f8b0","resolution":{"observed_at":"2026-08-06T17:50:44.867626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.858122Z","title":"Polarization-adjusted convolu- tional (PAC) codes: Sequential decoding vs list decoding,","venue":null,"work_id":"323dfae2-41c1-4ed7-be83-9918cb0129f7","year":2021},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.730937Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:f2e65216805e733c9947d4f423021451c42f3f6d6a607d9ffa65323bafc82106","observation_id":"ded4e9cb-59bc-4e09-8240-901f50cdaf53","resolution":{"observed_at":"2026-08-06T17:50:44.861433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06359","last_updated":"2019-12-13T08:41:38Z","snapshot_observed_at":"2026-08-07T23:46:27.659097Z","submitted_at":"2019-12-13T08:41:38Z","title":"On Pre-transformed Polar Codes","version":1},"cited_work":{"arxiv_id":"1912.06359","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.06359","snapshot_observed_at":"2026-08-06T17:50:44.772425Z","title":"On Pre-transformed Polar Codes","venue":"cs.IT","work_id":"629100da-1e1f-44a6-990f-14b6ffeb1c0e","year":2019},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.733707Z"},"links":{"cited_paper":"/paper/1912.06359","citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:67a96e63f9939c0a85bb0ddc2791015c2068e554de70ea6d2bc2523f45a8d4ae","observation_id":"98004fca-b98a-4e1e-8c9a-7d87a3b6552d","resolution":{"observed_at":"2026-08-06T17:50:44.776760Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.849366Z","title":"On the weight spectrum of pre-transformed polar codes,","venue":null,"work_id":"609e9f9d-7c2a-4a32-af5d-b106dc9b5715","year":2021},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.736945Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:dd0c24c95dcc32badbf9991503227939333af2c6e7c2852fe273c86814694fb9","observation_id":"0a580014-5fd2-4d06-bd20-6029a138a767","resolution":{"observed_at":"2026-08-06T17:50:44.852422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.841841Z","title":"On the Minimum Weight Codewords of PAC Codes: The Impact of Pre-Transformation,","venue":null,"work_id":"6d001659-f00d-4405-8717-504ca8647ab1","year":2023},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.740027Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:f948e2c551d9cb89b1d1b0f3ba91050c269c329daeb0c43ff4c1ea8ae9b4ede5","observation_id":"34988874-543f-4dcf-9153-460949ea01b5","resolution":{"observed_at":"2026-08-06T17:50:44.845212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.834254Z","title":"Channel coding rate in the finite blocklength regime,","venue":null,"work_id":"1101dc84-7d1c-40fa-bdc0-ccb08c194a2d","year":2010},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.742274Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:bb7364f52651fd977c6678731af1ec005f1eb1233e7e8fb488898bfcfacb111a","observation_id":"14037b3e-74a1-4e11-a4e2-8b2988da701d","resolution":{"observed_at":"2026-08-06T17:50:44.836823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.827323Z","title":"Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations,","venue":null,"work_id":"4cdc63b5-466a-4454-9805-7576a246bc49","year":2016},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.744490Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:5ae5def9ea5d3d2eb891c72e56a82f8880686f905dff9f8ed9b3392fdf86b156","observation_id":"c4588b17-69be-4ae1-975f-72b8a4fb5372","resolution":{"observed_at":"2026-08-06T17:50:44.829949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.818765Z","title":"SPECTRE: Short-Packet Communication Toolbox,","venue":null,"work_id":"8bd0685a-ae3a-4358-85f7-1c26573c3210","year":2020},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.746923Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:2fbd74ceb4f488df1b6134893e0fc517cf3cc6d3de78caa29fe587ecb8b5b31e","observation_id":"6473c0c2-0db1-4f47-9c08-0fd24b472e7b","resolution":{"observed_at":"2026-08-06T17:50:44.822208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.808822Z","title":"Recursive projection-aggregation decoding of Reed- Muller codes,","venue":null,"work_id":"36c68021-5e5a-40dd-b776-a5b9e2b7ac36","year":2020},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.749326Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:779e719e11a1336e7418a81623eeca296e103768256a1f04a10ea792d3d58db6","observation_id":"2d5c7de5-7a47-413a-92c7-802814854610","resolution":{"observed_at":"2026-08-06T17:50:44.813047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T17:50:44.800209Z","title":"r1 ≤ mX i=1 Zi ≤ r2 # = P","venue":null,"work_id":"66f560dc-b6ad-4a66-aa8c-4382e6e1ba03","year":null},"citing_paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:44.752156Z"},"links":{"citing_paper":"/paper/2507.10068"},"observation_digest":"sha256:2ab3b86f4cb89d24e3ca3b983c36eb1061d02cdf168355f6bc59af6afb5e379c","observation_id":"a7212b00-c7b6-47f6-8b8f-8336a124131e","resolution":{"observed_at":"2026-08-06T17:50:44.802444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10068","last_updated":"2025-07-14T08:52:58Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-11T20:24:27.572650Z","submitted_at":"2025-07-14T08:52:58Z","title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2507.10068."}