{"as_of":"2026-08-19T07:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ec33e7243352934b3f69320423721b9d5bdfa8acc482100e52412914c44626c","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-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/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:074831394929d0d3c7aeb2d5229fb0bdf4a408b6c087d8e181618059ef2e8c62","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-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-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:86590061063b7c5b79c454e15fc69656a683bb760258521dd867317098c055ab","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-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-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:98540880e3e1b4018ed160767e1c30032c53bcc0691a1cdf53e9c9b5bec502e9","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-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-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:d3f241251018fa588f440c972c465cd98ef23a5464a158ac1c227f4cbc6de3bb","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-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-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:11276b0b5270223f0c660c2a7caa6d9738b0846dddc7045464f9116619a2bae7","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-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-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:1bc83b7fc7f1ffe9df8a956a2def52296d0652128140a6e5158c5b6b4d7497b4","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-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-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:fcf579d1e5310d34fcc0dce250307330fc73eca8d3d23a5c20084e9c80c92196","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-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-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:b407f519ae09b4c4544c1cac70e9f98448b4ccab16d7925780075326cb15ff7e","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-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-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:80a1c3faa9c1a2636d456034d29dccbf22b63deec6b00129914a5ccd3c653f71","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-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-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:6a8eac2bb06275b52ca59c29972c529bef39c87e0114cbb63a80e733f9eb1460","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-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-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:89a1a22dd3c255d834dde89e420ee6ffb0760c2a26c0f69122bfd09344553edd","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-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-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:bd2e264a4592f39857ed4b85a1d7f3b68528c2a8208f3d224594ee9abafa6244","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.5483","last_updated":"2014-07-21T13:15:43Z","snapshot_observed_at":"2026-08-14T23:26:01.012882Z","submitted_at":"2014-07-21T13:15:43Z","title":"A RM-Polar Codes","version":1},"cited_work":{"arxiv_id":"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:a3354fb320770fe5bad6623c27cd8f9d0b3a5da63a2fadda54f4d8d022dd6209","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-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-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:9ab3a6d7efe9395f0f33960af72122c190d9f45ca8c97ad8534dbe82e815e928","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-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-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:6daac12fbd5bd9200573af408f13efba1e4523f46f676fd260fb1f3fd893ae07","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-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-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:577984d5a8563c6832a524874c67194bcb490129ee14a7e12358fce91c7a2ff4","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-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-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:8d21d3b924e9579251c5f679508d6f362d1f568aed456aedc63a2d6209585d7f","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-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-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:05a839d8a203e912164085dc441b4a24684f0069308bbeafc15726966da4d431","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-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-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:bb5f891816fb296cabff8cc6e97f4253c36e5df086ab8563a272ca37b15c34b4","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-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-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:740a5a387527759816b5bb708974f1e2aae470ef702c9d309e06cb74a6cb5d0a","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-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-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:14fbc46166f4f99d3ec410965375d97c0e9f7d1ff179b75cc135f00614ea918e","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-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":"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:8e9c81ae36d1c96558b98962905a52d6763ecb2b5d39017d690c039fb8c09b17","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-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-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:72ba0df5319f384acaf52856663dc28f304b5fdc2a42f813045cb973af63d87c","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-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-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:6efd5249f3b8a06446c64ada51634471accac8ef87266c10976974506239cc6d","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-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-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:b66eae3c337a65ce987290bc092bdf8d35327cb75fc4d0f5a34fa239e7defc35","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-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-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:3ca56282e919fc1c1863179cef09060513b85bb18e2f039fd010204e2365a3d0","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-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-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:471d654ab23e441a7ad134d9d0ba20426fcd94a8d11c89a2c23986fa599b59b6","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-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-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:7c44a8a5fa2060021172bf87929473c657664d8eda831b3cd0d87891ffa0d8ea","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-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-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:98691bb41f8cc58007eef341f525d814f7d5c23f4ae652279d080e3b1b54ada1","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-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":"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-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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2507.10068."}