{"as_of":"2026-08-11T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de80af868e4961476bc66cea02a14ad2c1ae2e0b687f2e8a67b49fa8a262577d","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:11:18.642606Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.09290/citation-record","integrity":"/paper/2507.09290/integrity","json":"/paper/2507.09290/citation-record.json","paper":"/paper/2507.09290"},"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-06T18:11:23.078366Z","title":"Ahlswede, H","venue":null,"work_id":"21915f13-c1dd-4496-825e-e7f265881027","year":2001},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.469227Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:369f64c1e66450c4cf0c1c98a6c74ae5e9363c045360e4c32673267e05701b83","observation_id":"3f5473b4-7c86-40a2-b666-2be0d7e79de9","resolution":{"observed_at":"2026-08-06T18:11:23.120856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.983297Z","title":"Ben-Sasson, T","venue":null,"work_id":"22c8ad6a-9b23-410b-b8a0-dcb792ec1ffd","year":2016},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.560672Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:0c540720d01bbf9d8bfdfa97f3ea8645a4c135dc078ae9ddfe2e427aa098e1ed","observation_id":"40e04e0d-813b-4ed9-888b-bc67832c9c3a","resolution":{"observed_at":"2026-08-06T18:11:23.023090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.823911Z","title":"Castello","venue":null,"work_id":"8cb67d0e-5840-4e44-827c-465785d7a1dc","year":2025},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.659927Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:6346cb33f1212ecf20ff05847993cde92c5f95cc2f53f7f46ef615c33f266fc0","observation_id":"af925e5c-efe2-45cc-8d2f-1ed719c4675b","resolution":{"observed_at":"2026-08-06T18:11:22.935142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03802","last_updated":"2025-01-07T14:14:14Z","snapshot_observed_at":"2026-08-11T16:50:54.867244Z","submitted_at":"2025-01-07T14:14:14Z","title":"Quasi-optimal cyclic orbit codes","version":1},"cited_work":{"arxiv_id":"2501.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.03802","snapshot_observed_at":"2026-08-06T18:11:18.729909Z","title":"Quasi-optimal cyclic orbit codes","venue":"cs.IT","work_id":"33f222da-21a3-4f8b-b851-8de06a1eee29","year":2025},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.740643Z"},"links":{"cited_paper":"/paper/2501.03802","citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:58fa9049be98611dae32d876c255cecbdb15a7db0e3e62e813b4eaeae4ebf456","observation_id":"4c3b8009-d12c-419a-80fd-969c3ca9296e","resolution":{"observed_at":"2026-08-06T18:11:18.758490Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.568902Z","title":"Castello, O","venue":null,"work_id":"0b0a1eed-b3c8-4b8d-a0b4-caceabc67efb","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.802037Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:9f313b493132d1df933330d04b933df4be15bc529d99f741b857da361523e695","observation_id":"1293c36f-ae53-404e-9334-f221269fbd29","resolution":{"observed_at":"2026-08-06T18:11:22.702074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.373417Z","title":"Cossidente, S","venue":null,"work_id":"45836c87-9a80-4822-bab5-b55a1a111d6b","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.847806Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:c9e4c80a02e3cf7612d5eba86f9bb0d9f54c08165ba589d7b75530e2c319a364","observation_id":"c6deb3bd-cef4-4775-a6ee-0647017b149b","resolution":{"observed_at":"2026-08-06T18:11:22.425621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.313849Z","title":"Etzion and A","venue":null,"work_id":"38bdfdae-d4dd-486a-8d0b-4cfbc11575bb","year":2011},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.907551Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:75bb2ff3ab503a184ca874aa1f739ddca8808bbede0e09ff9b6a131cd91b17af","observation_id":"33131072-8b2d-4dce-a1cd-a6cde96b5cee","resolution":{"observed_at":"2026-08-06T18:11:22.359635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.226877Z","title":"Feng and Y","venue":null,"work_id":"526378d7-2857-4f1c-9482-cbd6aa900771","year":2021},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.955807Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:133792604db1ed7afba8e556bdf7150b90b6e292b640ae9f102ff6457e07a577","observation_id":"d8eb584e-da9b-414c-b19c-a740fe428997","resolution":{"observed_at":"2026-08-06T18:11:22.248617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.153104Z","title":"Greferath, M","venue":null,"work_id":"724a6181-1f52-4c17-8a08-71f8a1520ce4","year":2018},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.999394Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:c71ad3f3ebf9bf96701efebcc0e645e998785e6154f4c17508d01acafc1d4a97","observation_id":"b3a462cc-4e85-4603-acb6-25e6013f6447","resolution":{"observed_at":"2026-08-06T18:11:22.190866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:22.081162Z","title":"Han and X","venue":null,"work_id":"1a575c81-0bdd-44a5-b065-f2b79c956b9d","year":2024},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.055833Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:bb54cbe8c24e48a4d4d0f13ac41c54069a7b2694264fa1185f7a67e0f92c6ff6","observation_id":"835aab08-c8ce-4cb3-83a6-3a9439bb9170","resolution":{"observed_at":"2026-08-06T18:11:22.106163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1601.02864","last_updated":"2019-12-21T21:46:52Z","snapshot_observed_at":"2026-08-11T08:27:49.781298Z","submitted_at":"2016-01-12T13:59:06Z","title":"Tables of subspace codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1601.02864","snapshot_observed_at":"2026-08-06T18:11:17.101456Z","title":"Heinlein, M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.101456Z"},"links":{"cited_paper":"/paper/1601.02864","citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:963e82027278cb8fa3f5e46341b8c99cf730a062da51b080aabdececf10e21e4","observation_id":"5f6acd86-5cb2-4a2c-a4fe-7c2849a9b555","resolution":{"observed_at":"2026-08-06T18:11:17.101456Z","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-06T18:11:22.020448Z","title":null,"venue":null,"work_id":"cf8292e5-a28e-4752-90fa-9ce5c1cdc167","year":2021},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.136052Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:e5065d280c247aeb4950c9fa9284986f06ea6c3fcc90e15e76888b932d5756a3","observation_id":"8fe0eca6-a12a-4538-b532-81861af1bbad","resolution":{"observed_at":"2026-08-06T18:11:22.045334Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.934795Z","title":"Khaleghi, D","venue":null,"work_id":"03263eeb-be11-4326-ad37-f3bae9d14932","year":2009},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.159033Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:ad2ff155b29ac7cb4c5c0804d08b58e8aebee2e5123428d7b60cdc24f2689bc6","observation_id":"3efd655c-068c-45a4-b6a7-2fbc3f50e223","resolution":{"observed_at":"2026-08-06T18:11:21.986038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.810095Z","title":"Koetter and F","venue":null,"work_id":"10c19272-c5bc-4ea1-a6eb-cdbc5b03b5d9","year":2008},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.165933Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:e08af58a07d705fe95cef03d060c6cd199f380b9032e96ebc3a38ba801ecac52","observation_id":"eb6c6a9d-a185-4736-8884-c578b0c45228","resolution":{"observed_at":"2026-08-06T18:11:21.858157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.682467Z","title":null,"venue":null,"work_id":"fe45a11d-a010-40b3-afa2-a7aeed9b047f","year":2021},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.217271Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:d4146fac0401cf17dd9f8aefd24165ec577d5938f80ce1b768e5aa6dc63c5b28","observation_id":"9ae7a02c-f7cc-4086-b870-62faab5bde7e","resolution":{"observed_at":"2026-08-06T18:11:21.725963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.610462Z","title":null,"venue":null,"work_id":"b9b1cec6-b117-457c-958e-0a3140da231e","year":2024},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.275461Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:bb2a597c210a946818155ac27ae308a60eecd6d2e184787b80581d537e018463","observation_id":"93b9a246-a9ff-43c3-8d50-eef48085f04a","resolution":{"observed_at":"2026-08-06T18:11:21.634000Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.536120Z","title":"Li and H","venue":null,"work_id":"cb948398-ca43-47d4-bd14-0ab8c49c7938","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.367331Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:9575b46c29f0923962e953317b9f3400ee62b5879dcf27f48df9eb77262bd32a","observation_id":"9d180fa5-e82c-4b12-8b68-f2e83865159b","resolution":{"observed_at":"2026-08-06T18:11:21.568990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.464516Z","title":null,"venue":null,"work_id":"d9837062-4671-436a-a369-c25bdea34ca3","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.427572Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:9e80dc7c6256e6d44108b6bb46ee90854b970dee2756b068c1c26536e782bbfb","observation_id":"446be3ba-dac2-4c55-b46c-1b10d1244927","resolution":{"observed_at":"2026-08-06T18:11:21.494618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.397093Z","title":"Manganiello, E","venue":null,"work_id":"6d2b54f5-44b5-48a8-9b66-da3055d46ee9","year":2008},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.506695Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:20153a753113b7fefba2ae2a02c3a6887aa4ad0cf30d25442dfabc5cfa634365","observation_id":"c06828ed-5b90-429d-bd9a-7ffeb453293a","resolution":{"observed_at":"2026-08-06T18:11:21.426839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.335838Z","title":null,"venue":null,"work_id":"79733a4a-f9a8-4332-b572-68ae14d1efed","year":2024},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.540237Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:32146a8d9ef8eada464edd29a57bb13c0735863ea45adefc99450d248b58f412","observation_id":"04807807-7c9a-4793-89a7-62f25d049bc9","resolution":{"observed_at":"2026-08-06T18:11:21.368469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.267437Z","title":null,"venue":null,"work_id":"c84bce9d-5714-441c-837b-d3c4067d2faa","year":2020},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.585054Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:7f30739912655539dcd73b339f39926f1e9fb8d9a3d0b8430124cdf64f21cc77","observation_id":"6206c1dc-db08-4587-830a-e48847d378e1","resolution":{"observed_at":"2026-08-06T18:11:21.292814Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.187483Z","title":"Otal and F","venue":null,"work_id":"a666caa2-a2a5-412d-81db-d5092ca48821","year":2017},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.653307Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:3415a0e3fc8eba45ca4c9e899cea939f9ca104eba37d1e5b231049fec54db349","observation_id":"9b07b894-fb57-4d1f-a58b-f309acfba128","resolution":{"observed_at":"2026-08-06T18:11:21.232113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:21.051382Z","title":"¨Ozbudak, P","venue":null,"work_id":"b5cf8dc9-b74b-44e8-aac5-4d9a7d5d811d","year":2025},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.718426Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:1674ddb91aca7e987911f267882bfb81266d39ff2ababb7b0590d1b34559d3d8","observation_id":"ca192d11-d594-45e3-ab79-c88a6f76b506","resolution":{"observed_at":"2026-08-06T18:11:21.098234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.918104Z","title":null,"venue":null,"work_id":"27f63abc-ed28-430c-a820-c0a798a6385e","year":2017},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.743143Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:532f34a78de839b505af7c11c77b0e5db965bef1f4a224bdda0254900dbbfe2e","observation_id":"92375856-46f1-48e7-a46d-582044e8b2ff","resolution":{"observed_at":"2026-08-06T18:11:20.986094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.809250Z","title":"Santonastaso and F","venue":null,"work_id":"d9aaf2cf-f8cb-4704-8543-e057453a61c8","year":2022},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.796689Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:771b25e883fd0e00261a2fad1ccc0842f277d9c8b696f8d04b083b7b1733da62","observation_id":"066cc8f2-e0e9-45c8-ac7e-5dccd87ea0eb","resolution":{"observed_at":"2026-08-06T18:11:20.845964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.714085Z","title":"Silva, F","venue":null,"work_id":"7bd8dc3c-2c27-45eb-b546-c4599457b44b","year":2008},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.857017Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:2e97f7c3422cd256d5eddb60d0e364417ee68b79baf07b2ed7aae4bb3f1910f0","observation_id":"6bbbb37f-687e-4576-a9d7-743d65181962","resolution":{"observed_at":"2026-08-06T18:11:20.757674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.573326Z","title":"Trautmann, F","venue":null,"work_id":"6cf8519a-fe2c-4eb1-819d-39d38e1dc8a1","year":2013},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.906996Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:669ccb8c624084717142bf0b664d96b4dfcc1d884f8ad89874204ed5d4adf8ef","observation_id":"0c435efb-fc3b-4c6e-a423-42817b23d4fc","resolution":{"observed_at":"2026-08-06T18:11:20.629322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.483689Z","title":null,"venue":null,"work_id":"a3ae34a1-1eea-4a4b-9b8b-025c30693af9","year":2003},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.943328Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:cf332679bbd9fdb0a63dd60b42f538d7db2e01f27edf0bf0dfbdaac98a434c4e","observation_id":"fae8d60f-8396-44b5-8cba-120d0b6266e9","resolution":{"observed_at":"2026-08-06T18:11:20.514581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.333481Z","title":null,"venue":null,"work_id":"c3ab6439-c88d-4468-b1c2-070828639a04","year":2025},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:17.988827Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:efc12eec55a733f299bf34cd8e7d27b803629ec3bbff1814fef1e1b30b8a0f06","observation_id":"98c72bfe-1d35-4a77-bb9a-a43ac582dea1","resolution":{"observed_at":"2026-08-06T18:11:20.403515Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.227214Z","title":"Xia and F.-W","venue":null,"work_id":"a79cd367-9d4c-4dec-a17c-46d10e1a3a51","year":2009},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.078006Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:d376fe117333a79bd1b0a904f4341c2b67567e681c4050127e16c481c9ca921f","observation_id":"e17e8d61-e0b6-4f6a-b917-9d2c030453ff","resolution":{"observed_at":"2026-08-06T18:11:20.261760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:20.107336Z","title":"Yu and L","venue":null,"work_id":"3d1adf77-47c7-4d5f-9b91-c4e8709c0780","year":2024},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.141754Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:d74b25c5286cd455cc9a8f32db7194cd0aa73dfe76bbe2bea1a02cb4e1d8ee9f","observation_id":"534b8a48-c3b1-4678-9970-b5ebed169d8b","resolution":{"observed_at":"2026-08-06T18:11:20.169106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.890615Z","title":"Zhang and X","venue":null,"work_id":"841ecd05-ffe3-4c5f-a0c8-1a8cf428fe58","year":2022},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.221265Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:f86e9dea99ab991b32d7e46ad3d125eaa8c87dc34746c9ecb87545b4896d92d8","observation_id":"de11f2fd-f523-40ef-b550-a785cb551cfe","resolution":{"observed_at":"2026-08-06T18:11:19.974114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.726886Z","title":"Zhang and C","venue":null,"work_id":"64795a20-c4e9-478d-9f12-fb1c3ee283c8","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.250309Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:ef1457bcf2cfd56b0de2f2661e338c4d9d75ac6017d813843c49a70fea635dcd","observation_id":"82f3ae81-9bce-4113-89ba-62118b45f183","resolution":{"observed_at":"2026-08-06T18:11:19.808565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.616591Z","title":"Zhang and C","venue":null,"work_id":"70dbef20-9cbe-49d8-9513-a642581af571","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.295640Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:ea46d80d4193e671d11a05bfa46cceb7f830247510ef8e0b3c46671c324afe42","observation_id":"c6cad5d0-1f8e-42d1-a1c3-d7470aedb31a","resolution":{"observed_at":"2026-08-06T18:11:19.663666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.460226Z","title":"Zhang, C","venue":null,"work_id":"d1bdcee3-7fc7-4c07-b5af-a07f3efdf2e0","year":2024},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.387198Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:6e4c5a04a4492801ecc6672cea2c8166e63a3bcea7b24f5b963d0497878b0151","observation_id":"52269870-1566-4027-bd5a-b092460e72c5","resolution":{"observed_at":"2026-08-06T18:11:19.517438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.359853Z","title":"Zhang, C","venue":null,"work_id":"23eac26a-d700-44b1-95f2-8c98e3d3ef50","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.440782Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:42787d1e1f6ba9f81e849a8a00ed3f7bc95d4456e86bb27b70152714376f8b2f","observation_id":"b9d7cf0f-a74a-41c2-9aa2-01b17bec98cd","resolution":{"observed_at":"2026-08-06T18:11:19.419826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.179334Z","title":"Zhang, C","venue":null,"work_id":"5da1a0b7-4db0-435c-8b21-fe3a60648f92","year":2025},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.489019Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:7507898fe3299610721723c4ad1f25f37d65c558ffb2757431d021cf82d9ab6d","observation_id":"4beda4c4-fe9b-4854-85fa-934cee7f7ee6","resolution":{"observed_at":"2026-08-06T18:11:19.224322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:19.033409Z","title":"Zhang and G","venue":null,"work_id":"d6ee1bcf-ecb3-4513-86ce-ed1eda585c44","year":2022},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.534218Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:5eb62bf050903b77559f2134865ae63c72f8b5d70bac708c2e59af6ca880888a","observation_id":"d736e556-9658-4475-82f2-e892bb8932f9","resolution":{"observed_at":"2026-08-06T18:11:19.107461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:18.890635Z","title":"Zhao and X","venue":null,"work_id":"e46e1227-bce3-44d5-9087-3cbd8eb685aa","year":2019},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.565280Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:bac9cd79aa6a68575b4cc1766d190f58b4d5a0a4166e13373d5f9524a28c1f63","observation_id":"f43b10f6-ad92-43ba-bd17-8138e300b007","resolution":{"observed_at":"2026-08-06T18:11:18.941306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T18:11:18.815786Z","title":"Luigi Vanvitelli","venue":null,"work_id":"59e23241-dc45-4027-9585-758cd06f1102","year":2023},"citing_paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:18.642606Z"},"links":{"citing_paper":"/paper/2507.09290"},"observation_digest":"sha256:604323dcea2c836772a9958c9aa33e3ef0b98bf1910ee220b93ee292c0cee93b","observation_id":"d8e924e1-4025-41e3-8b63-84b66cf36494","resolution":{"observed_at":"2026-08-06T18:11:18.833284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09290","last_updated":"2025-07-12T14:00:11Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T17:57:03.432893Z","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":40},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2507.09290."}