{"as_of":"2026-08-10T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a3ae68ee5e0af573f87acb42321d3a23ae4a980577b49167738544f40377aa89","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T02:08:58.723289Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-07-11T19:30:43.940487Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.00476","snapshot_observed_at":"2026-07-11T19:30:43.940487Z","title":"Complexity of low-degree skew polynomial multiplication over finite fields, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04394","last_updated":"2026-07-05T16:37:40Z","snapshot_observed_at":"2026-08-06T14:56:49.924545Z","submitted_at":"2026-07-05T16:37:40Z","title":"MechMath Agent Team: LLM Driven Agents for Mathematical Research","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-11T19:30:43.940487Z"},"links":{"cited_paper":"/paper/2607.00476","citing_paper":"/paper/2607.04394"},"observation_digest":"sha256:81fbd4517f7a4297ede614d24dc2255dfd225c9cf66767b2f1d2f37a60be1f19","observation_id":"d81dee67-510d-41ab-a8c9-99eac19167f9","resolution":{"observed_at":"2026-07-11T19:30:43.940487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.00476/citation-record","integrity":"/paper/2607.00476/integrity","json":"/paper/2607.00476/citation-record.json","paper":"/paper/2607.00476"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7604.308761","doi":"10.1145/3087604.3087611","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fieker, W","venue":null,"work_id":"d3a005e4-63fd-4121-a05a-2ae1ac31f90f","year":2017},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:c9fd1a163aad4cffe8f1e2377e41713438cf438b1622b586a3f9d22cac05deb1","observation_id":"978b16d4-d69f-4015-bc04-52b223acee5e","resolution":{"observed_at":"2026-07-02T02:16:25.681669Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6000.366967","doi":"10.1145/3666000.3669677","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A quasi-optimal lower bound for skew polynomial multiplication","venue":null,"work_id":"6d2d16ea-281c-45b1-a4b5-0e3bc3dff11a","year":2024},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:5ab826efefb17065f3fa365cc682fa876d637d9330a9fbc17c80fb4145bd375a","observation_id":"23f619c5-ac39-49b2-abea-8e05eb0fb92c","resolution":{"observed_at":"2026-07-02T02:16:25.675328Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jalgebra.2023.01.022","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The equivariant complexity of multiplication in finite field ex- tensions.Journal of Algebra, 622:694–720, 2023","venue":"Journal of Algebra","work_id":"d019e578-15a0-4029-8f41-8fad428d6858","year":2023},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:0eb295cace5a4bb6b743905afdd355539c40dad3ff807501b4c090728176190d","observation_id":"d6d7d1cc-69f7-4f16-88e0-a714aa0dc20f","resolution":{"observed_at":"2026-07-02T02:16:25.683850Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2007.11.008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Coding with skew polynomial rings.Journal of Symbolic Compu- tation, 44(12):1644–1656, 2009","venue":"Journal of Symbolic Computation","work_id":"ca897159-abde-4a0b-a7e4-2cf1dfea9e81","year":2009},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:0de1d5ccae620fcf284e0f1c0ea726cedfcf2368936d5c9924158d886ab7031b","observation_id":"ab3f8fc3-8897-4193-865b-6bd4b5119f1d","resolution":{"observed_at":"2026-07-02T02:16:25.681016Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10623-012-9704-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Designs, Codes and Cryptography70(3), 405–431 (2014).https: //doi.org/10.1007/s10623-012-9704-4","venue":"Designs Codes and Cryptography","work_id":"e322c73c-9c8b-4978-a866-b06538bf338e","year":2014},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:964069054d5109e63380f950995d9f9e248da2838f569417657a99d5316ab719","observation_id":"4df22a01-e591-49af-be03-d5523255c2bd","resolution":{"observed_at":"2026-07-02T02:16:25.678491Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.0224","doi":"10.1006/jsco.1998.0224","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Factoringinskew-polynomialringsoverfinitefields.Journal of Symbolic Computation, 26(4):463–486, 1998","venue":"Journal of Symbolic Computation","work_id":"9a5dd756-0115-403f-8247-ae31ffe3fe82","year":1998},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:e927cef0e7c9d2fe63339a616c43462c8093e50c4803333e023b9518d4fc73b9","observation_id":"16fb115a-00a2-4836-b9f4-37b611ceeb8a","resolution":{"observed_at":"2026-07-02T02:16:25.677983Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3207.340402","doi":"10.1145/3373207.3404023","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse multiplication for skew polynomials","venue":null,"work_id":"958eb848-49d6-4456-8c80-9c43cfbb7b21","year":2020},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:b5c12e4da3590dd228ba41283b85cfbd69436a0c0afdbed72b4709121d3f4c8d","observation_id":"fd3c3f12-e72d-41a6-a8c8-3bf609d08e45","resolution":{"observed_at":"2026-07-02T02:16:25.630159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.102240","doi":"10.1016/j.jsc.2023.102240","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skew-polynomial-sparse matrix multiplication.Journal of Symbolic Computation, 121:Paper No","venue":"Journal of Symbolic Computation","work_id":"600e410f-b4e4-4467-becf-841de77253b1","year":2024},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:55016604a3511b11e5f31a5b5bc9cee982ef27d7f5f4a06389f4ab5732feecba","observation_id":"9a2f6822-2c1d-4b4f-9bb9-4abfbecdf948","resolution":{"observed_at":"2026-07-02T02:16:25.639104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T09:12:10.789718Z","title":null,"venue":null,"work_id":"983384f4-e422-4568-bbe7-1e8d199a96e1","year":2026},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:8925ce51f2065fc0122a7a7ee0963fa88a0085bfce3a88bd6738afeca70baa5e","observation_id":"bf75bf73-8afd-4f59-950e-ba064d56465d","resolution":{"observed_at":"2026-07-06T09:12:10.790836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2012.05.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skew polynomial rings, Gröbner bases and the letter- place embedding of the free associative algebra.Journal of Symbolic Computation, 48:110–131, 2013","venue":"Journal of Symbolic Computation","work_id":"d5300224-423c-49cf-b908-7d93abc23576","year":2013},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:fd01512a54360e4621c23c49dd0d3a3aefd8ea739bd8556a62ffb3807e294773","observation_id":"0c3a5d81-0773-4e90-b4b0-0e8409586394","resolution":{"observed_at":"2026-07-02T02:16:25.673253Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T09:12:10.787430Z","title":"Sub-quadratic decoding of Gabidulin codes","venue":null,"work_id":"b898da32-e579-48b9-bb0e-2588bcc7e43e","year":2016},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:b0e930f460551f470cfa2a06a305692defe5b2f01ea8ff1c6eaee180ee1dd735","observation_id":"210541dd-b0c0-44a1-959d-dc37c72ba435","resolution":{"observed_at":"2026-07-06T09:12:10.789006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2017.11.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast operations on linearized polynomials and their applications in coding theory.Journal of Symbolic Computation, 89:194–215, 2018","venue":"Journal of Symbolic Computation","work_id":"b3263fc6-d12c-429b-9fdd-3b0a9177cc2f","year":2018},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:e50e1cbfa953dd5a2dd7145d425f1a310c8ae93b343c8b4c2ccfd46307ef8d23","observation_id":"64a5c1d6-2f17-4bfe-8dbd-537c695d74e6","resolution":{"observed_at":"2026-07-02T02:16:25.633182Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/1968173","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Annals of Mathematics 34(3), 480–508 (1933).https://doi.org/10.2307/1968173","venue":"Annals of Mathematics","work_id":"015cb213-97e2-40fb-bf80-b615f700c22f","year":1933},"citing_paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-02T02:08:58.723289Z"},"links":{"citing_paper":"/paper/2607.00476"},"observation_digest":"sha256:55ae63ea2a18a07554cfbfcc162074af0b241f3d418f3a3c5d46330a90b49e8f","observation_id":"206fefbe-0066-4494-85ac-bda3bff0f519","resolution":{"observed_at":"2026-07-02T02:16:25.630792Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00476","last_updated":"2026-07-01T05:50:36Z","latest_version":1,"primary_category":"cs.SC","snapshot_observed_at":"2026-07-07T00:06:09.887791Z","submitted_at":"2026-07-01T05:50:36Z","title":"Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":10,"verified_fuzzy":1},"total_outbound_references":13},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 1 inbound Pith citation observation for arXiv:2607.00476."}