{"as_of":"2026-08-08T13:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1fa1778925e99423b1a91adfa167058c2275804e898820129637f60876959bf","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:06:32.091034Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T21:43:58.783103Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T21:48:34.600232Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"cited_work":{"arxiv_id":"2506.03805","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03805","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ball and T","venue":null,"work_id":"e49d7545-fa30-4006-bc91-374077312d07","year":2025},"citing_paper":{"arxiv_id":"2512.16327","last_updated":"2026-04-30T13:30:55Z","snapshot_observed_at":"2026-07-06T22:39:23.633419Z","submitted_at":"2025-12-18T09:09:39Z","title":"Generalized Hamming weights of additive codes and geometric counterparts","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T21:43:58.783103Z"},"links":{"cited_paper":"/paper/2506.03805","citing_paper":"/paper/2512.16327"},"observation_digest":"sha256:582e437e602ff4d547166d470ec14c24e8960a46ac9ca915f0951fea763bb862","observation_id":"eb8e2251-36f4-423b-b2f1-45b404d863ab","resolution":{"observed_at":"2026-05-16T21:48:34.601667Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03805/citation-record","integrity":"/paper/2506.03805/integrity","json":"/paper/2506.03805/citation-record.json","paper":"/paper/2506.03805"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.192444Z","title":"Adriaensen and S","venue":null,"work_id":"4b1d3eb8-58e8-4876-be76-a4510e45040c","year":2023},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.065001Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:dd4908256f3bee590a812fd1dba18d5e7bbb2486d61f455e9da8b357d7995108","observation_id":"8a954429-088e-4760-9bc1-cf1636d7818f","resolution":{"observed_at":"2026-08-07T11:06:32.195219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.183672Z","title":null,"venue":null,"work_id":"b21455ab-26e3-4c0a-975c-400363816e72","year":2025},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.068580Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:913069bd1ed89d14ee08c61d7e9c1159f505a9144098fe19329632db6f230b01","observation_id":"c05de028-1eab-445b-bf7e-5ca79e5b470a","resolution":{"observed_at":"2026-08-07T11:06:32.186416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.175033Z","title":"De Clerck, M","venue":null,"work_id":"9b0efbc1-8c48-448b-bc80-352a3a0ee90f","year":2002},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.071531Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:d1b3a1925b8019cec24dea8b24cddf75b9cfe052bf0ee82e1a2f88acc9d860c1","observation_id":"d40991a3-a3b3-4ee2-86b6-5d05f6fe0ae8","resolution":{"observed_at":"2026-08-07T11:06:32.177751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.166037Z","title":null,"venue":null,"work_id":"014a0415-a411-4387-9514-5b8b185d6b56","year":2023},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.074728Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:df1bea269b304ba64550811a2144508cf467c76b356a98140eed8a1bacf15aef","observation_id":"b5c882f3-3e7e-4324-ab87-7d341116dbab","resolution":{"observed_at":"2026-08-07T11:06:32.169043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.157012Z","title":"Grassl, Bounds on the minimum distance of linear codes, www","venue":null,"work_id":"23fe1fc3-408b-4968-b3aa-b6e94bd99939","year":null},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.077796Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:f099e0ab96daa85feae77423f8f80cf76c78aa7af884385ad543751bc5db4492","observation_id":"3f1fcbab-1031-45ca-a0ea-a33ad3b60913","resolution":{"observed_at":"2026-08-07T11:06:32.160183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.147997Z","title":"Ketkar, A","venue":null,"work_id":"2879ce1b-6cc6-495f-8bd6-2d8851ce983a","year":2006},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.081284Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:b0c52e8344efaa6353cee8d8898e794ebb1785a03e18ce0f208ee1bf04391cc9","observation_id":"54feaece-16ec-4ed0-b898-c01f36ddb1d9","resolution":{"observed_at":"2026-08-07T11:06:32.150709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14615","last_updated":"2026-05-08T10:48:09Z","snapshot_observed_at":"2026-08-03T00:49:49.053802Z","submitted_at":"2024-12-19T08:04:34Z","title":"Additive codes attaining the Griesmer bound","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14615","snapshot_observed_at":"2026-08-07T11:06:32.084172Z","title":"Kurz, Additive codes attaining the Griesmer bound, arxiv.org/abs/ 2412.14615","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.084172Z"},"links":{"cited_paper":"/paper/2412.14615","citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:5c99e20c8e05e5d4ac3b922300edbddbda17b89600947c149ca91d6ddada195a","observation_id":"6364d8ce-e201-4850-ae36-31b0b4b82295","resolution":{"observed_at":"2026-08-07T11:06:32.084172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.137956Z","title":"Lavrauw, Finite semifields and nonsingular tensors, Des","venue":null,"work_id":"154df6b7-e2c2-4afe-82fd-499168338338","year":2013},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.087798Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:04900ee3bfb6e5e6bd695d3cca785d3ae02fe84e052366efb060ec45a1382309","observation_id":"d5530b93-9e3e-46e7-ab3e-cf34f9767e0f","resolution":{"observed_at":"2026-08-07T11:06:32.141042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:06:32.126465Z","title":"Sheekey, New semifields and new MRD codes from skew polynomial rings, J","venue":null,"work_id":"f8876a01-5e0a-4fb0-a063-ef5428aa2102","year":2020},"citing_paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:06:32.091034Z"},"links":{"citing_paper":"/paper/2506.03805"},"observation_digest":"sha256:bc65ce39a20d03100136866ad29976673e99d616e0d241ab091a74009c5fb377","observation_id":"1c7f0404-cf2b-4e39-9d36-c7093c32f317","resolution":{"observed_at":"2026-08-07T11:06:32.131097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03805","last_updated":"2025-06-04T10:26:24Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T10:52:37.262178Z","submitted_at":"2025-06-04T10:26:24Z","title":"Additive codes from linear codes"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":9},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 1 inbound Pith citation observation for arXiv:2506.03805."}