{"as_of":"2026-08-07T23:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:027e3a70c4b74f6b7d7e9a3f3dbf46af2eae1cfc37bdbf50aee3f48e9d11557e","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:14:16.671894Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06-26T01:44:09.049816Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T15:19:56.574104Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"cited_work":{"arxiv_id":"2506.19604","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.19604","snapshot_observed_at":"2026-07-04T15:19:56.574104Z","title":"A primer on the closure of algebraic complexity classes under factoring","venue":"cs.CC","work_id":"21f7f486-7128-47fa-bb7b-5f1298cf5963","year":2025},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-07T09:52:28.732992Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"cited_paper":"/paper/2506.19604","citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:f70d6cc71b23fd6fad21a5d5b4195cbcd36409495e7508ffe229083d1723bbb7","observation_id":"645f67dd-97e5-4804-8dc4-b069a97bce2a","resolution":{"observed_at":"2026-07-04T15:19:56.575544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.19604/citation-record","integrity":"/paper/2506.19604/integrity","json":"/paper/2506.19604/citation-record.json","paper":"/paper/2506.19604"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:10.513057Z","title":"Proving Lower Bounds via Pseudo-Random Gen- erators","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:10.513057Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:c78ffdbcb876868dfed420ba89614cdfc9f6fcb8756e382fa2fa50e8a6f8c670","observation_id":"301775f5-8a05-4430-9615-1c7a619e16e1","resolution":{"observed_at":"2026-08-06T23:14:10.513057Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.826285Z","title":"Cook’s versus Valiant’s Hypothesis","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.826285Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:9fb6c91f331d96b586109cd1f0ada4876d85d2d394e91b9ba4c26edb3c055ce0","observation_id":"b4427145-84dc-4820-ae4a-36272faee7d6","resolution":{"observed_at":"2026-08-06T23:14:11.826285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06217","last_updated":"2024-06-10T12:33:22Z","snapshot_observed_at":"2026-08-07T15:08:41.859489Z","submitted_at":"2024-06-10T12:33:22Z","title":"Completeness classes in algebraic complexity theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06217","snapshot_observed_at":"2026-08-06T23:14:12.014824Z","title":"On the Structure of Valiant’s Complexity Classes","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.014824Z"},"links":{"cited_paper":"/paper/2406.06217","citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:1c17ddb92db424f665ad88c10ff4fe406fb953c814893eb6516bbfefa6e9a43c","observation_id":"73f414b6-ede9-4ce8-bbd0-7f0dfa047bc4","resolution":{"observed_at":"2026-08-06T23:14:12.014824Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.870541Z","title":"Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.870541Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:c4e87f884d3e5bac6dee9f6766f60cdd18de3b55ebcc85b06b9812180b664e58","observation_id":"a9e2c5a3-5e35-40fc-8b9d-66e9130e3668","resolution":{"observed_at":"2026-08-06T23:14:12.870541Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.040241Z","title":"Eine Neue Theorie Der Algebraischen Zahlen","venue":null,"work_id":null,"year":1918},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.040241Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:e609a4df40c29b2ed5f50f44cdf1e39414dac0dfd7887165ff5065e47613ee0f","observation_id":"ca60d53f-24b2-424c-aab3-2dfccf97843a","resolution":{"observed_at":"2026-08-06T23:14:13.040241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01965","last_updated":"2024-03-04T12:09:16Z","snapshot_observed_at":"2026-07-06T17:39:07.926765Z","submitted_at":"2024-03-04T12:09:16Z","title":"Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01965","snapshot_observed_at":"2026-08-06T23:14:14.193159Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.193159Z"},"links":{"cited_paper":"/paper/2403.01965","citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:882e90d89c2a1f92e8963887cde2a720037c60e1fe41696a4d093a507250e96f","observation_id":"4e3016a2-4be6-426a-9e30-b40b6644d143","resolution":{"observed_at":"2026-08-06T23:14:14.193159Z","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-06T23:14:21.684747Z","title":"Factoring Polynomials with Rational Coefficients","venue":null,"work_id":"7acbeb0d-c1aa-499b-b5b6-b2d6cbcf2c2e","year":1982},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.415071Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:11720a981b50bb3e1ba9b0d335fdaa43b93c516742cc6bcc22831abb46751301","observation_id":"6cb6e80a-5086-44e3-a80f-807efedee34f","resolution":{"observed_at":"2026-08-06T23:14:21.846599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.238899Z","title":"Factorization of Polynomials","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.238899Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:ed253978299b310e8679b8a81a29163a90860fd21273bb52375254055ca179a6","observation_id":"e7b5c467-322c-4dcf-bde1-ab9ac24cdd6e","resolution":{"observed_at":"2026-08-06T23:14:13.238899Z","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-06T23:14:21.299696Z","title":"Polynˆomes et coefficients","venue":null,"work_id":"277b771a-56b4-4eba-b0e6-5c6fbb25f37d","year":2008},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.584449Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:9b7c79d20eed7cb81e0133470bcf0d857337538e83461f349adc1c5b5278e493","observation_id":"c7660367-3e3a-4b3d-8d1f-77bed89cc3ac","resolution":{"observed_at":"2026-08-06T23:14:21.401346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:20.834821Z","title":null,"venue":null,"work_id":"2a1402f0-bd15-4aeb-886d-0b4059a42f60","year":2014},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.702449Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:eb31dcef31ce0649652b21891628b04c61ced1d23cf8895920a1126f682c1fe6","observation_id":"158241db-9b8c-46fa-afbe-7c27234227c6","resolution":{"observed_at":"2026-08-06T23:14:21.074766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:17.824737Z","title":"Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials","venue":null,"work_id":"0bb58e3c-2ed6-4493-bc5c-1d93a879cd0e","year":1982},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:16.220146Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:23f7b88c080b89e037b68140e1211aee23208b530a0cf88367cdc29f48dbcb13","observation_id":"2936e5c5-1045-40ad-be14-1e9e963a796b","resolution":{"observed_at":"2026-08-06T23:14:18.047408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:17.541413Z","title":"On Some Computations on Sparse Polynomials","venue":null,"work_id":"379ce007-aea9-44c0-b698-39288aaac3ae","year":2015},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:16.360441Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:617735894ddbed1994dfcccc5b33bd1f9738307ca4f1e1f2e2179deb8f3cd067","observation_id":"c3dd9e6c-ddc1-43c8-8d9d-faccf682fd66","resolution":{"observed_at":"2026-08-06T23:14:17.691215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:19.603142Z","title":"Power series in complexity: Algebraic Dependence, Factor Conjecture and Hitting Set for Closure of VP","venue":null,"work_id":"c6b72d6d-b7b5-46e3-8a0b-5ec04699820d","year":2016},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:15.421867Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:7b5a7ad3b5a92db3130cb4b8a60cd95424ab38a588686c9403c0ef2932ad1cad","observation_id":"c63c35a9-f579-4934-a718-34a92c237448","resolution":{"observed_at":"2026-08-06T23:14:19.731965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:22.177065Z","title":"Deter- ministic Algorithms for Low Degree Factors of Constant Depth Circuits","venue":null,"work_id":"b75fc36f-3f09-4d4f-9370-667d452a0660","year":2006},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.035876Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:215cf2f70fde482af569d63e6c7c3b79008396e88bd974176c15f35985cb543d","observation_id":"59a51366-1c08-4970-a7d9-99aa6f06aa07","resolution":{"observed_at":"2026-08-06T23:14:22.364878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:17.030478Z","title":"Newton’s Iteration and the Sparse Hensel Algorithm (Extended Abstract)","venue":null,"work_id":"b073304c-b025-4da2-b0e5-cf9cd2181cdf","year":1979},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:16.671894Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:1247b37cd54d0b87a4585102b500e5aa3e71e699b6272dbd27f1a6291c6fa212","observation_id":"e18d5497-3e76-4a8d-b4e2-6b2b17d1c625","resolution":{"observed_at":"2026-08-06T23:14:17.148213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T23:14:19.974829Z","title":"Fast Probabilistic Algorithms for Verification of Poly- nomial Identities","venue":null,"work_id":"d588fda6-8804-4dd3-8d90-eae6b9c74893","year":1980},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:15.161329Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:03ce6420e9e21c7b3af5733edf1aa6d92fa939db492c619a4c23f045021d48fc","observation_id":"ec6a5b13-75da-419e-9d34-dcbd807d7fe0","resolution":{"observed_at":"2026-08-06T23:14:20.129309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.605715Z","title":"Discovering the Roots: Uniform Closure Results for Algebraic Classes under Factoring","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.605715Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:796bccf796933bc35785b0b25046a2e17a9f7b16ab62e1c5df662a78fc905aa0","observation_id":"9801cbb2-e8a7-4b66-8978-9bec7060c8b6","resolution":{"observed_at":"2026-08-06T23:14:12.605715Z","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-06T23:14:17.275796Z","title":"Hensel Meets Newton–Algebraic Constructions in an Analytic Setting","venue":null,"work_id":"3d612655-83ae-48f2-8b55-8a5f8d2e336a","year":2017},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:16.494838Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:f27929cd011cb945b9027d95db512ea3b026b58b94b575d8efbfc51496dcc5ce","observation_id":"61e313dd-2ed5-4d2e-943f-60c729c76912","resolution":{"observed_at":"2026-08-06T23:14:17.397001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:10.884754Z","title":"Leibniz Int","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":169,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:10.884754Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:207ceb3243f0ab9c3f8b577a67d960c6e2aee8861b7e4d9da53a2bb927dc8d95","observation_id":"76ae5d6b-3393-4661-a364-e5ab938bd418","resolution":{"observed_at":"2026-08-06T23:14:10.884754Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.859602Z","title":"Cambridge University Press, Cambridge, 2019 (cit","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":170,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.859602Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:8ca6c452666ae18b9814b9b9738fe4a80357d39aba8c9e2210d90a00f97d1921","observation_id":"13ad8cef-58ab-409a-bcf9-fe23197278a8","resolution":{"observed_at":"2026-08-06T23:14:13.859602Z","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-06T23:14:19.222207Z","title":"Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2022, 118:1–118:33 (cit","venue":null,"work_id":"16272393-ea7b-472e-ac7d-70e888ec6a4b","year":2022},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":215,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:15.769825Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:3a79f198e6722d6168b4dab077b29748bc805100ed312bc3ea8f5e9d2768765d","observation_id":"15c83518-a5a5-44db-8a02-63490fadce99","resolution":{"observed_at":"2026-08-06T23:14:19.352259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.076549Z","title":"Improved Low-Degree Testing and Its Applications","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":222,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.076549Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:b5e50ea04a24282638779b34665b8434ee38c8d27ec08eab12ef09cea4b3984e","observation_id":"62cbaaf6-a701-4036-92d5-566fe49e563a","resolution":{"observed_at":"2026-08-06T23:14:11.076549Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.404936Z","title":"Learning the Coef- ficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":315,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.404936Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:639909973fc29d879b6c9284f2633bd8079e704aa43544de90edf3376cc9d4d2","observation_id":"d8720c13-cf2a-4c72-b295-30d936be77db","resolution":{"observed_at":"2026-08-06T23:14:11.404936Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.474835Z","title":"A Probabilistic Remark on Algebraic Program Testing","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":317,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.474835Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:f7820f1b9a010661ba88364edd9b5f21afe01a57852bcb05c09e4e9eb0e95a71","observation_id":"e2b06267-1a37-4e49-a6b3-808d8c2184fe","resolution":{"observed_at":"2026-08-06T23:14:12.474835Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.376013Z","title":"Effective Noether Irreducibility Forms and Applica- tions","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":583,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.376013Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:eed3e239a31a3b3a584380a51ed28af8b21acd2a58570d5ec5d3e337b0a149cf","observation_id":"5c1ec71d-085c-4c04-a5ef-79210225e2c8","resolution":{"observed_at":"2026-08-06T23:14:13.376013Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.134751Z","title":"Efficient Factorization of Polynomials over Local Fields","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":1838,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.134751Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:a87cd359a5015149b15ceb3280992b87989129f26d503134758856bf8199924a","observation_id":"f80317b7-7543-40ed-b114-f8800ac8eabc","resolution":{"observed_at":"2026-08-06T23:14:12.134751Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.664884Z","title":"Derandomization via Symmetric Poly- topes: Poly-time Factorization of Certain Sparse Polynomials","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":1858,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.664884Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:77a8bfa13cbc5d57a7ffd1195bcddf7a341b336c55398a6037f9cfe4a3b98a79","observation_id":"0bbcc061-74e0-41e8-973e-9c5a3f68e3c0","resolution":{"observed_at":"2026-08-06T23:14:11.664884Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.314747Z","title":"Closure Results for Polynomial Factorization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":1903,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.314747Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:b6ba11dd399d9410f61c8403ad0951a62662ee77ac0f72f3d690c6955d96d277","observation_id":"25ad3ed9-a603-4729-89bc-fdadaec6dc38","resolution":{"observed_at":"2026-08-06T23:14:12.314747Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.555238Z","title":"Factoring High-Degree Polyno- mials by the Black Box Berlekamp Algorithm","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.555238Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:1dd88a8a54fa5dec5429e2e6d67de8011d7b17ddd7507315b2eee9653dd9e709","observation_id":"7c6f8fac-b05d-4d50-866a-61ee2010a470","resolution":{"observed_at":"2026-08-06T23:14:13.555238Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.114650Z","title":"87–100 (cit","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.114650Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:4a74eb3e245ff49d72e9d6bfb89fc540608c4e83aafe9255ac7976121b62cf6f","observation_id":"c2750120-4526-43f8-a6d6-98e98f9b52e0","resolution":{"observed_at":"2026-08-06T23:14:13.114650Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:12.956483Z","title":"Complexity Theory Column 88: Challenges in Polynomial Factorization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:12.956483Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:2da0cf5ead2ff08252cfa5b6d00818e17d45e111ddc4bfa9cf533fb8126d7f91","observation_id":"29978904-2ad3-4de7-9a61-2f3dc744de45","resolution":{"observed_at":"2026-08-06T23:14:12.956483Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:13.734689Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:13.734689Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:f8693fc5b4b6354b6e12d0b2954d83725324f6a97cb31559f992688bac0514cd","observation_id":"aaefbdc1-c7b5-4596-bbb5-c857ab27ca52","resolution":{"observed_at":"2026-08-06T23:14:13.734689Z","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-06T23:14:20.434775Z","title":null,"venue":null,"work_id":"2c8c540b-805c-4db0-b663-67d40d1ac540","year":2023},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:14.904617Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:6376d54033860152b6f1f1ed82fecfd3e4ac6149cbf85410bd927144788eb18b","observation_id":"057c2fe9-9ff2-4f09-aa82-78e1ffebd6e1","resolution":{"observed_at":"2026-08-06T23:14:20.555042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.224890Z","title":"2367–2386 (cit","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.224890Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:609cf88d23d8b26d52b74660a45d6d53fdf59d650eb6024a594e6380291244d3","observation_id":"f3a91f7e-ff14-4ecd-bf81-529ed0a33630","resolution":{"observed_at":"2026-08-06T23:14:11.224890Z","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-06T23:14:18.622603Z","title":"A Case of Depth-3 Identity Testing, Sparse Factorization and Duality","venue":null,"work_id":"edb264ba-c68d-464e-b001-4e332069aa26","year":2013},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:15.938317Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:aa524f272a839c918c745c963fd1d80c8f8deb863d30fadcc927bee59c4bfa7a","observation_id":"ac37d540-c9f9-4b3a-85be-57664a83036b","resolution":{"observed_at":"2026-08-06T23:14:18.815612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:11.545057Z","title":"Introduction to Geometric Complexity Theory","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":2504,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:11.545057Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:dcb339c3faf066b0976017f6a2b196d698a59f80fa32f5b1fa45ed447ae0e51c","observation_id":"6b2be21a-9953-4176-b09f-48706b0a1270","resolution":{"observed_at":"2026-08-06T23:14:11.545057Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:14:10.724825Z","title":"Determinant versus Permanent","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":3821,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:10.724825Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:8716d3f99663180fa7f4a3355a4ea030122c3e939f3ff6ce2c4536f3148ef9de","observation_id":"afe11d9c-92f7-4e1c-88ae-c9fd5fe378fb","resolution":{"observed_at":"2026-08-06T23:14:10.724825Z","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-06T23:14:18.274764Z","title":"Arithmetic Circuits: A Survey of Recent Results and Open Questions","venue":null,"work_id":"b4f452ca-cc2c-40cc-9ad7-23b257d6d930","year":2010},"citing_paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring","version":2},"reference_index":6198,"source":"pdf_text","source_observed_at":"2026-08-06T23:14:16.069918Z"},"links":{"citing_paper":"/paper/2506.19604"},"observation_digest":"sha256:828d8f674322c5c862e0f30bb73ffc8cd3b83961578856710494ecf62b869235","observation_id":"85e2c066-aaff-4fc5-9b7c-ae70acd6a732","resolution":{"observed_at":"2026-08-06T23:14:18.424814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19604","last_updated":"2026-06-09T18:15:01Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T18:18:24.556179Z","submitted_at":"2025-06-24T13:17:37Z","title":"A primer on the closure of algebraic complexity classes under factoring"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":38},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2506.19604."}