{"as_of":"2026-08-12T09:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba9b9c3c6eeb88afcd8461d586fd9486a75df7c35883aa9e18fffe71db11a204","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T01:44:09.049816Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2606.27293/citation-record","integrity":"/paper/2606.27293/integrity","json":"/paper/2606.27293/citation-record.json","paper":"/paper/2606.27293"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T01:44:09.049816Z","title":"Constant-depth arithmetic circuits for linear algebra problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:23502e1ea977bde2ce889e6fec6cec2d7347b4209160d45fa7f2cc5e5a0e0072","observation_id":"47bb5a8c-7bb7-4af4-848b-05ba268acb9a","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08T19:44:54.749343Z","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:555683e6503739eb237dddb73c049395defb4decb89f74be89b19fc0527c6ca7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06-26T01:44:09.049816Z","title":"Berlekamp","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:bba7718fcc0a830c4294ffff4d04e9afb91897f5fd079d9b486f3fe78ab22a11","observation_id":"beeeb690-e79f-490d-9767-ea3f75672f42","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23220","last_updated":"2025-06-29T13:04:49Z","snapshot_observed_at":"2026-08-10T00:35:01.430820Z","submitted_at":"2025-06-29T13:04:49Z","title":"Constant-depth circuits for polynomial GCD over any characteristic","version":1},"cited_work":{"arxiv_id":"2506.23220","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23220","snapshot_observed_at":"2026-07-04T15:19:56.577106Z","title":"Rai, Varun Ramanathan, Ramprasad Saptharishi, and Shubhangi Saraf","venue":null,"work_id":"24c047d6-ec96-41d2-9e3b-80ef1ac95286","year":2025},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"cited_paper":"/paper/2506.23220","citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:1895dbf22901b142e30d64da400f8cbb91531ba6d77c8a2f8111501fc9b47bdc","observation_id":"08a9c4a9-ded2-42ac-ae40-8ff267a3c01c","resolution":{"observed_at":"2026-07-04T15:19:56.578713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06-26T01:44:09.049816Z","title":"Deterministic factorization of constant-depth algebraic circuits in subexponential time","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:3945fb71363a075c9b0a4dc93166763ecc625ecaf1114c8c731ebcd74efe687d","observation_id":"d693f5e0-0fa2-4efb-9555-5490171bc88a","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Rai, Varun Ramanathan, Ramprasad Saptharishi, and Shubhangi Saraf","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:12b4cde2dbe86d5fcc914f6ab1d177ae2ead9fcceb37b65f42e9f5b680eddb35","observation_id":"9ca0fbe7-7e33-4d2d-95bf-c18fd6702f8d","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"A deterministic algorithm for sparse multivariate polynomial interpolation","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:f89b90bb8c0516f2fc91ca8a02127a6c1009e19ea41fc03bbcadf5b7475dc751","observation_id":"f85a7421-538e-4f60-8106-cbfd32418714","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Deterministic factorization of sparse polynomials with bounded individual degree","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:017ad739a96427b0d2e9fe6626391f78102a1b3114a0527ccecc97441924c01f","observation_id":"c9775472-3348-4eed-989f-c179a089c784","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"On solving sparse polynomial factorization related problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:619339fbc3f6feae96ac81b35adecc9e0d1d1d4888897cc4ea65e23390e0e976","observation_id":"c5d350f4-dd35-4d52-a42f-ea1164e12f85","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:6cc009c42a781ee7e8cd46a7d0e71752724698476b35ee49c5968e3422cdde1d","observation_id":"fcc2c0a3-a85f-49c1-8283-940191f143f1","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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":"2603.07589","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T15:19:56.579884Z","title":"On factorization of sparse polynomials of bounded individual degree","venue":null,"work_id":"3e5ce582-c435-4598-8b81-71aef8114c50","year":2026},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:2592cd7324fa5d26aa9fc005242b1256e8e0dfbf97a4093595bcf514695ce07e","observation_id":"5f1e8ae7-8117-4649-9dbf-8f63cbbfe2a8","resolution":{"observed_at":"2026-07-04T15:19:56.581281Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06-26T01:44:09.049816Z","title":"Derandomizing Multivariate Polynomial Factoring for Low Degree Factors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:b6bd0ef14b3855896aa223211bde6a35c14d0110d006f705ab86c75c4d2e2d0e","observation_id":"bc905890-3ece-4804-bf4c-824476618a2a","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Commutative Algebra with a View Toward Algebraic Geometry , volume 150 of Graduate Texts in Mathematics","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:1f7cf0144fe0359624ffb015bd539ea59f2e89e9d8c446edbb7341701d92fc17","observation_id":"6dc4a37c-fc58-4482-ac01-6b8fac5e49e6","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:207831a1ee1a6afc1425ae82595e2640ae93c9f7c21c0ae8dfaa2ebeca4a39ad","observation_id":"4e872cd3-59fd-434a-b973-afb458f03087","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Algebraic functions over finite fields","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:423a5c357ccc67a435aeed5843610eda5535253d7c3b224ee3b783efb8ed831a","observation_id":"c3356d9c-cedd-4a60-bb06-d02415118188","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"The matching problem for bipartite graphs with polynomially bounded permanents is in nc","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:c6f4819d7ed2409b0517df8d323257fead3a8155d5b3a559a3edaf90f7106163","observation_id":"2f31864c-3004-4ffd-bc0f-17c438b99ae3","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:b77683e7c7d47cbeba592d34b74ce05cae017a2940a1d258ac2622e17b1af0ef","observation_id":"89e18979-2898-44a2-939d-23aebb37ad3a","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Factorization of Polynomials Given by Straight-Line Programs","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:8212c39fb5852b5698d28f949b66c237089260703f3685d9026b169b1a3ca91c","observation_id":"903d3970-3860-453d-8ad7-b44860c920ae","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits , pages 3901--3918","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:0e0a2454b7800e9e068247716c85cefac84bf34b714adf1e9c8e54001dfcf888","observation_id":"d31bbaa0-fa99-444d-90af-af102a1093e4","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Towards deterministic algorithms for constant-depth factors of constant-depth circuits","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:d2ead16532ee6120ff0b34a312d436eaa8cc38a919a27f5fa766c0cf842ba954","observation_id":"27a145c1-a8aa-4df7-8fc1-f3f1c6a0e8f5","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Klivans and Daniel Spielman","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:24d2a2f90ec94034fa6e8f3d0c4ab0d51d5bfb6f2e0b78679d582045d7a87da5","observation_id":"979f4b3b-184b-4efd-bf97-a915d56430cb","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Equivalence of polynomial identity testing and polynomial factorization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:78ad05c24ab0dbb3b54290b2691d88e67bcc91194a2f9e62c5c950b091e58236","observation_id":"b0f2c3d6-fc8f-4b2e-aead-9f2181a2bd45","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:25ea78b3044e2df4a70d36a8579743cb26b176511f0725bf478440edcd6702b0","observation_id":"292701da-ddae-4585-ae3e-6d88c78319b4","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:81d049c0457f2cf07757423fdc9b67b105596f444431a76cac0c1f6360f8bdb7","observation_id":"7ccc9a36-d7dc-46ee-9226-9113e15e6f2e","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:30c53770cd910222d3f70998927b67291d9db222c6b52c2f588f02ca17f973f8","observation_id":"fb77e049-3ac6-4c6c-8e7d-9dbdaf577220","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:431cd8df6b4c3e816a98c570a2c7f8428438ff07732098a5d80d2da094453233","observation_id":"42b8dcc5-a235-44d7-ba43-9c25a7301196","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Vermeidung von D ivisionen","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:a3a893add4ed30475b3244650e4fd91135ceb68792a7fe9fbeccf866e0e7d3ee","observation_id":"104d3671-07dd-403e-983b-a9122f83a4c2","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"On the relation between polynomial identity testing and finding variable disjoint factors","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:1d6437bc9c7e9232b0d1c86105e742231ba175816031bec55132a22481d5fda7","observation_id":"e57bd1fb-c8b5-4e37-ac25-69bf38582c78","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:39e79ca4e58d8e2483f2b2e7f0661c08064241d24144b5fddc9b7766ea39a062","observation_id":"9dea44e6-e21c-443c-84c6-b2757aa138e5","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"On Some Computations on Sparse Polynomials","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:4e772d27833d6fae6cf10cb086476ce297ca5bac5964abab2f0785b37de675fe","observation_id":"74941e04-bf6a-4743-af8a-648945db02f3","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Modern Computer Algebra","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:4418b2a28e06f7e2f85bbe61b1b67d7fd4ecbb8d0331cc0ba7ae8cec967b7aca","observation_id":"8d9f164f-f673-4fb8-81d9-20f25e5463c6","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","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-06-26T01:44:09.049816Z","title":"Factoring sparse multivariate polynomials","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-26T01:44:09.049816Z"},"links":{"citing_paper":"/paper/2606.27293"},"observation_digest":"sha256:3349dfd8696807621289356dd78a609b33c919600872932d9770f89b7009f880","observation_id":"e48e9af4-0868-425a-b27f-b175f0648d75","resolution":{"observed_at":"2026-06-26T01:44:09.049816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27293","last_updated":"2026-06-25T17:12:57Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-08T19:44:54.749343Z","submitted_at":"2026-06-25T17:12:57Z","title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":32},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2606.27293."}