{"as_of":"2026-08-16T04:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99e565919aa06375e9f0ed314f71b32daa49ca0e794eb358e14ebb8a8f542e06","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:20:16.128949Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/1908.03513/citation-record","integrity":"/paper/1908.03513/integrity","json":"/paper/1908.03513/citation-record.json","paper":"/paper/1908.03513"},"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-14T14:20:16.317989Z","title":"Switched symplectic graphs and their 2 -ranks","venue":null,"work_id":"816f0b7e-cbbe-448a-bd8a-3a12b856a18d","year":2016},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.071384Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:ce8c4bf8f35e41e97db3eb72fd172fa1fbecccadfc27fa85b039248ac770e675","observation_id":"ddd6f47d-350e-4d14-85d3-bdad0f9acf50","resolution":{"observed_at":"2026-08-14T14:20:16.322418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.306249Z","title":"Te rnary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45 , 12, 3) designs","venue":null,"work_id":"d4e5bd73-f3a9-445e-a9bb-d69d6d38bd7e","year":2012},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.076500Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:2a739064b0ae506379d0b4b755fc3e44b3c19ac6603e0ab400f4d685935e4aea","observation_id":"7762f7f0-9007-4d8b-b2b8-5c4223821776","resolution":{"observed_at":"2026-08-14T14:20:16.310094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.294961Z","title":"Self-orthogonal codes from the strongly regular graphs on up to 40 vertices","venue":null,"work_id":"23fa63b3-17b6-4e53-ac1b-85a69848e9e9","year":2016},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.080783Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:55bcc4f764c968da426ed9c4e9f8e5f84a8c567a293a523bc0ec4d5d2abca417","observation_id":"006daf13-2825-41f4-8a83-79b3cd9cac1f","resolution":{"observed_at":"2026-08-14T14:20:16.299108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.281391Z","title":"A Characterizatio n of Graphs by Codes from their Incidence Matrices","venue":null,"work_id":"8c79f65f-9b5f-4e04-b6c7-030ece80ece9","year":2013},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.084759Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:cfb5089cf3840260583796edcaf336cbedd7e0ec659ee947a23aa6346fe4d1e9","observation_id":"de8816b2-0bf5-4349-8ac1-b1303aa52de2","resolution":{"observed_at":"2026-08-14T14:20:16.286275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.269680Z","title":"Binary codes from the comple ments of the tri- angular graphs","venue":null,"work_id":"f8db1890-ab4f-4941-b7ff-d099fb489520","year":2010},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.090220Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:a72df25100a011e51d19645b5d5b4bcb999ab90c5a8b4a04b7cb22360f86d5ec","observation_id":"e34d399b-1521-4c6e-af16-93ddc093b93a","resolution":{"observed_at":"2026-08-14T14:20:16.273695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.258984Z","title":"Codes on Graphs: Fundamentals","venue":null,"work_id":"87cfc1f7-62bc-45b2-b08e-a4ccf746a38b","year":null},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.095697Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:1851c97ac9facb1d9de7a733bc4063b334ebe63ee4136587ba3dfadcbd5b68bf","observation_id":"76810d33-fdf7-4741-828e-599ec996c5a7","resolution":{"observed_at":"2026-08-14T14:20:16.262215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.247766Z","title":"Chromatic Number and the 2-Rank o f a Graph","venue":null,"work_id":"9e995b29-c9af-46d5-b06f-b2e38d4d295c","year":2001},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.099777Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:0479ee05d54465fbc63e4b30532b536e3fe6039a64540048e7db1e0a1f91b1d7","observation_id":"69f0ab65-380f-46b2-9ed1-936c47d46ac0","resolution":{"observed_at":"2026-08-14T14:20:16.251669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.235818Z","title":"New self-dual additive F4-codes constructed from circulant graphs","venue":null,"work_id":"b4347a00-46d5-4da2-ad0d-f52da48ae14f","year":2017},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.103412Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:9264a2fe4127bf278e247a7bec85c1e8f6c6cb8e4af6d223213c90999c878ea2","observation_id":"43a73539-50f0-4cde-8db0-346803dc560e","resolution":{"observed_at":"2026-08-14T14:20:16.239907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.223275Z","title":"LCD codes from adjacency matrice s of graphs","venue":null,"work_id":"adf6d5aa-e9c9-4341-bdf8-88214418804c","year":2018},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.106784Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:05723a49d50f50e02826d42347756b72ccab9242b8a9959f6d3b8cb4114ec469","observation_id":"ca5fe283-13ac-45e7-84b5-f68e17faa85c","resolution":{"observed_at":"2026-08-14T14:20:16.227214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.210965Z","title":"Codes from graphs related to the categorical prod- uct of triangular graphs and Kn","venue":null,"work_id":"90a379e3-c93b-4db5-a219-fe4001d14c32","year":2010},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.109951Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:c784562b96f58ba20a65cdc3e4341a4cd7eb4218e1034316a81af41d550556f5","observation_id":"2bc3fd60-dd97-47a6-b817-5547661ab68e","resolution":{"observed_at":"2026-08-14T14:20:16.215645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.200134Z","title":"Classes of graphs with minimum skew ra nk 4","venue":null,"work_id":"83f4dd67-f5d5-45e3-ae21-1743a8e4a48b","year":2013},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.113212Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:e200e0c96382e3f1187588fa09ad1a69922bbf332a07824a2e339cb17a2cd44d","observation_id":"5422c662-ac3b-48d5-b7a1-6f8af9bd3881","resolution":{"observed_at":"2026-08-14T14:20:16.203451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.187721Z","title":"Self-dual Codes and Graphs","venue":null,"work_id":"29349a6e-bb28-47c0-a680-6956324f050a","year":1989},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.116499Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:b7938236702624ac4bbbc0e734a98c9e018a2b1fcc823e1ba68f2b9ae2112afc","observation_id":"8aaa32f1-6665-4e86-9e6b-771d5a9f149f","resolution":{"observed_at":"2026-08-14T14:20:16.192186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.175857Z","title":"Shadow Bounds for Self Dual Codes","venue":null,"work_id":"2f6e5f33-f625-4689-a31c-6d3cd46aa43a","year":1998},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.120660Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:6ea7f1d8558eaefe6b7d738f040bc583e04522d35a715c8bd37082a6cff2079b","observation_id":"ee6d3c5d-eba7-4ef8-aced-9647006c51dc","resolution":{"observed_at":"2026-08-14T14:20:16.180022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.164909Z","title":"Error-correcting codes from graphs","venue":null,"work_id":"dc74477b-3d86-4d85-8019-874d79d8214c","year":2002},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.125430Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:33274fa85f242f0b97e36cd14fc52108f3b892fd22d5dda93f8110e9100f6f47","observation_id":"981a0b6c-01be-4df6-a423-7f9b83e22a34","resolution":{"observed_at":"2026-08-14T14:20:16.168272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:20:16.149969Z","title":"Rank-3 Graphs, Block Designs, and Codes with Un equal Symbol Protec- tion","venue":null,"work_id":"4eaa1b82-2837-44ca-991e-e99108c53317","year":1981},"citing_paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:20:16.128949Z"},"links":{"citing_paper":"/paper/1908.03513"},"observation_digest":"sha256:4295c8a45377e8611bd3011f11487d98675ec15f29d0a208bb9563d48db8f2ad","observation_id":"3c2e1b85-9a3c-4279-a3b0-1e2bf67a5d64","resolution":{"observed_at":"2026-08-14T14:20:16.156473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03513","last_updated":"2021-01-06T23:19:10Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T14:08:27.960357Z","submitted_at":"2019-08-09T16:07:35Z","title":"Isodual and Self-dual Codes from Graphs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":15},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:1908.03513."}