{"as_of":"2026-08-17T08:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d573d0b81de56d4ef61b984226439acabc5bd0c3e89b83b9bc6f20ed2a01ea2","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:02:48.833473Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2506.23214/citation-record","integrity":"/paper/2506.23214/integrity","json":"/paper/2506.23214/citation-record.json","paper":"/paper/2506.23214"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:02:52.500230Z","title":"write newline toupdate empty","venue":null,"work_id":"58dde325-99f6-4a31-8239-830e9e5059ff","year":null},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:44.755544Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:423179a6c49a788e03a393a558b2db346166e6409a60d61187d49386eac4ef54","observation_id":"bbacf292-5bdb-447c-b748-149e9a34c2d7","resolution":{"observed_at":"2026-08-06T22:02:52.604174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:44.811794Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:44.811794Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:f490023f69aa253ec0d53c7e9b2df9e6d922aca20933016dac85b49aba80c8ca","observation_id":"37e43c74-69fe-4f6b-9f86-05d2ab8718eb","resolution":{"observed_at":"2026-08-06T22:02:44.811794Z","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-06T22:02:44.883314Z","title":"http://dx.doi.org/10.1109/FOCS61266.2024.00138 Constant-Depth Arithmetic Circuits for Linear Algebra Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:44.883314Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:5024ef5ba2b461c19cef362c99a424f19648aa1fd1f4c4d8b43c3771ee78f2ca","observation_id":"4b386a6c-f508-4913-9512-56f4182c1679","resolution":{"observed_at":"2026-08-06T22:02:44.883314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08063","last_updated":"2025-06-14T12:10:57Z","snapshot_observed_at":"2026-08-16T12:42:15.260583Z","submitted_at":"2025-04-10T18:43:12Z","title":"Deterministic factorization of constant-depth algebraic circuits in subexponential time","version":2},"cited_work":{"arxiv_id":"2504.08063","doi":"10.48550/arxiv.2504.08063","metadata_source":"pith","pith_arxiv_id":"2504.08063","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deterministic factorization of constant-depth algebraic circuits in subexponential time","venue":"cs.CC","work_id":"9ca66dd3-a2b2-4bd2-8339-54461fa60a44","year":2025},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:44.974980Z"},"links":{"cited_paper":"/paper/2504.08063","citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:4c24175990d125ffe3f481e78ca4f4b681b4130e178e9dca810420f0a347f1f2","observation_id":"4d75ca38-e343-4263-9793-a3877b3a5a64","resolution":{"observed_at":"2026-08-06T22:02:50.432402Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:45.074059Z","title":"http://dx.doi.org/10.1145/3365667 Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.074059Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:b69bf4496ed3959ee5542f1fa30d314e0cc064412920cf8d152f16f794f9722f","observation_id":"702f6b4f-15bb-426d-b844-34df61e15ed7","resolution":{"observed_at":"2026-08-06T22:02:45.074059Z","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-06T22:02:45.161087Z","title":"http://dx.doi.org/10.1007/S10208-002-0059-5 The Complexity of Factors of Multivariate Polynomials","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.161087Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:0d6aea54c6b6489a3c2e7d542d19ee7819db390a0a7120c91a9e18e41df4eeba","observation_id":"b58eed5d-b9a2-49eb-be63-1e82d1c6b95c","resolution":{"observed_at":"2026-08-06T22:02:45.161087Z","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-06T22:02:45.244439Z","title":"http://dx.doi.org/10.4086/toc.2019.v015a013 Closure Results for Polynomial Factorization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.244439Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:0ced561758f05385f6558652692cb9cee9dd62b6fb4c8367ed9e666ddeac6ca3","observation_id":"705afbc6-f668-4010-b0dc-44056abae85b","resolution":{"observed_at":"2026-08-06T22:02:45.244439Z","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-06T22:02:45.397556Z","title":"http://dx.doi.org/10.1145/3510359 Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.397556Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:e6d1a9cb76adac43b5ddbf9c502da2a578637ebc1f3b5df33ec9dfa24f8293cf","observation_id":"e84a3a69-e490-429f-8b2d-4cb7769234cb","resolution":{"observed_at":"2026-08-06T22:02:45.397556Z","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":"2411.17330","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:02:51.732301Z","title":"https://arxiv.org/abs/2411.17330 Derandomizing Multivariate Polynomial Factoring for Low Degree Factors , 2024","venue":null,"work_id":"8806ad34-66ff-4c19-bdb8-5387c8c92d17","year":2024},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.554153Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:3eba5fcead2be88704c7813584c1282a7ee7658c51d3d155129b5f5ba4dbc970","observation_id":"11b7ebb0-d63d-41ec-90a9-cd777f7a16f9","resolution":{"observed_at":"2026-08-06T22:02:51.801230Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:45.709368Z","title":"http://dx.doi.org/10.1137/080735850 Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.709368Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:5852bcf3c716d5c413af88f43175a5759fc7baa9bda95f3561841a914befbbf2","observation_id":"162f4329-b1e1-41a3-93d2-5a236e1d28ed","resolution":{"observed_at":"2026-08-06T22:02:45.709368Z","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-06T22:02:52.330194Z","title":"Polynomial identity testing of read-once oblivious algebraic branching programs","venue":null,"work_id":"d0e1470e-f2f6-4ef2-9476-e22192a6c6f3","year":2014},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.831685Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:5740ecfa70dbad0f98f4aba41bbf23485ff866d95bb3cab15d4d896b13d3a8e0","observation_id":"58068a8d-0e00-417d-90b7-1df39f1f529d","resolution":{"observed_at":"2026-08-06T22:02:52.395449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2015.35","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"f15ff22c-fec0-4df2-8ef5-3167f2798235","year":2015},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:45.983153Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:a8faa161a37eca2b50af294b9943b86f0f11796ef7e5b5ca0e592205b778c0bf","observation_id":"87d52dac-e95b-4698-9bab-f3f3ec5e8591","resolution":{"observed_at":"2026-08-06T22:02:50.251929Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2040.28520","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:02:51.514989Z","title":"Forbes and Amir Shpilka","venue":null,"work_id":"55125276-968b-40fc-afc2-2c1136da47d3","year":2015},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:46.162028Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:18714c26f41c4219d64519934bef26dd5e6aeff21fb21d9b093fc7fe3b15a4ec","observation_id":"53dd1e02-0870-4924-a636-968fda65f06f","resolution":{"observed_at":"2026-08-06T22:02:51.592139Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0021-8693(67)90061-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"http://dx.doi.org/https://doi.org/10.1016/0021-8693(67)90061-0 Algebraic functions over finite fields","venue":"Journal of Algebra","work_id":"173fc7b3-6d54-43c1-8a02-25ec4df8d354","year":1967},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:46.301225Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:e012c0067f1ea593e21cdfa3cffcf6d949f17175075e39f5cab7efa8a16bdae5","observation_id":"8a5ad887-14c8-4217-88c6-3c89fd305969","resolution":{"observed_at":"2026-08-06T22:02:50.080423Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:46.779917Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:46.779917Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:5258206183895d79c02501c452d048fe097c4f323e5fd72153c3583393027cbf","observation_id":"ea89e227-040a-4eda-9784-6b831c7ea902","resolution":{"observed_at":"2026-08-06T22:02:46.779917Z","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-06T22:02:47.216870Z","title":"von zur Gathen and E","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.216870Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:22ebdef353864691c411755810287f9d86f89489e950c51969a9ca0b18ebdc9e","observation_id":"a1828e50-377c-4f30-ba44-5cdd5b9bba9c","resolution":{"observed_at":"2026-08-06T22:02:47.216870Z","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-06T22:02:52.189697Z","title":"Essential coding theory","venue":null,"work_id":"d5d8cd72-5330-4436-8858-b82e4900d6c6","year":2023},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.272778Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:4d8db392c72e6e73857442abc78dff81d528d1fe2229b336c36a2201af2dda1f","observation_id":"0754ce19-5a0c-4e72-a3fe-8d68b742493c","resolution":{"observed_at":"2026-08-06T22:02:52.250382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01415","last_updated":"2016-11-17T09:37:56Z","snapshot_observed_at":"2026-08-14T21:32:50.387557Z","submitted_at":"2016-10-30T13:03:07Z","title":"Explicit Implicit Function Theorem for All Fields","version":2},"cited_work":{"arxiv_id":"1611.01415","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.01415","snapshot_observed_at":"2026-08-06T22:02:51.242068Z","title":"Explicit Implicit Function Theorem for All Fields","venue":"math.AC","work_id":"4ce3feec-4ec3-4ef8-9d35-de84bc5c8bcc","year":2016},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.394022Z"},"links":{"cited_paper":"/paper/1611.01415","citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:6abdb8990738fa5b1ac3ff6dfa5a1614854fe289c9c6ccfdfdc6c6f9df46a049","observation_id":"f52b7fcf-7258-4d35-aca3-841b55b412f9","resolution":{"observed_at":"2026-08-06T22:02:51.305463Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1982.56","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Kaltofen","venue":null,"work_id":"def7e6e2-d00f-474a-a3de-0a2fedc0732a","year":1982},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.489728Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:195601a326628357c35a1efa4f929640e7b87d241d1578a8349de972552c8545","observation_id":"e520768d-cb41-41b1-942d-5996f0cf11a2","resolution":{"observed_at":"2026-08-06T22:02:49.900230Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0214035","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"http://dx.doi.org/10.1137/0214035 Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization","venue":"SIAM Journal on Computing","work_id":"a9dcd917-e4e5-468c-bbe6-d75094bdc9a2","year":1985},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.567575Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:42f7d7752be580c12c57258049f00d8598b130af02f85295a4cfe02903c7e863","observation_id":"7ea968af-ef63-4124-9014-a855080848c3","resolution":{"observed_at":"2026-08-06T22:02:49.687866Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:52.029883Z","title":"https://users.cs.duke.edu/ elk27/bibliography/89/Ka89_slpfac.pdf Factorization of Polynomials Given by Straight-Line Programs","venue":null,"work_id":"65757dd3-762e-493a-a001-a26215bcb801","year":1989},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.621526Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:03e306aceed45a2225e43cdd4ba839289c0e292d22353d1fb045839b737e19b8","observation_id":"e2c67980-38cd-4f2c-a1ad-646016bb3fbc","resolution":{"observed_at":"2026-08-06T22:02:52.111983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:47.703544Z","title":"http://dx.doi.org/10.1007/s00037-004-0182-6 D erandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.703544Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:594cb26712954a5af1ec0344cb26a87c108d38f7b23f94d694b2cf36336c8fec","observation_id":"ed975e44-facb-4ad1-99bf-ac20ee7a8164","resolution":{"observed_at":"2026-08-06T22:02:47.703544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.09701","last_updated":"2023-09-18T12:07:41Z","snapshot_observed_at":"2026-08-16T14:59:50.416803Z","submitted_at":"2023-09-18T12:07:41Z","title":"Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits","version":1},"cited_work":{"arxiv_id":"2309.09701","doi":"10.48550/arxiv.2309.09701","metadata_source":"pith","pith_arxiv_id":"2309.09701","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits","venue":"cs.CC","work_id":"16f93a3e-8560-466e-bdee-637a954890b2","year":2023},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.777050Z"},"links":{"cited_paper":"/paper/2309.09701","citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:25363e1167a92b16b1ae141afa4679b43ef2b4cd85b249cd8bb18e9c124106fa","observation_id":"c43616a1-9347-4de6-9ee9-7d2d96f8820d","resolution":{"observed_at":"2026-08-06T22:02:49.554394Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01965","last_updated":"2024-03-04T12:09:16Z","snapshot_observed_at":"2026-08-16T14:13:07.005011Z","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":"2403.01965","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.01965","snapshot_observed_at":"2026-08-06T22:02:51.060390Z","title":"Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits","venue":"cs.CC","work_id":"eb72893d-7d20-4a00-8271-df29fed0063f","year":2024},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.853309Z"},"links":{"cited_paper":"/paper/2403.01965","citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:2e0dd6334bbb0dc5e6c493c4a280171d8b5d8049d1562f43dbdd0cf8db1452b6","observation_id":"f73c5af4-48a1-4f1e-84f1-1a1a2b6c8028","resolution":{"observed_at":"2026-08-06T22:02:51.151334Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-015-0102-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"http://dx.doi.org/10.1007/s00037-015-0102-y Equivalence of Polynomial Identity Testing and Polynomial Factorization","venue":"Computational Complexity","work_id":"9275b0e1-8443-4a11-af1e-3d0ed87d95d7","year":2015},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:47.984730Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:cb9f1abeeba4d6a41b073c8168b8885eff88e5a5442832ee03bc31622a7f8797","observation_id":"2e97004a-0012-4dca-b791-53ce5ca43dac","resolution":{"observed_at":"2026-08-06T22:02:49.376873Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1988.21946","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:02:50.846855Z","title":"Kaltofen and Barry M","venue":null,"work_id":"a06eecf9-a0b8-48e4-b230-81c4519a02e6","year":1988},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.160368Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:1cd3d4fe023d7717f02084e6945645c6b38d7fcd577fc9bcf1a9bd01a6c95482","observation_id":"ce9d54d4-3af5-4159-8655-5e9c298c02ae","resolution":{"observed_at":"2026-08-06T22:02:50.970147Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2007.01.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"http://dx.doi.org/https://doi.org/10.1016/j.jsc.2007.01.003 Improved dense multivariate polynomial factorization algorithms","venue":"Journal of Symbolic Computation","work_id":"4afbdc16-5e3b-4c9c-ba4d-044cd281552e","year":2007},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.246128Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:3eea92f74924316f3231090e372e062c1a7a855fe36a1a6922dab60aec2d27d5","observation_id":"111aa4e0-c2c0-4e25-9597-dcd9f538955d","resolution":{"observed_at":"2026-08-06T22:02:49.183225Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:48.324350Z","title":"http://dx.doi.org/10.1109/FOCS52979.2021.00083 Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.324350Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:10dcfec3e842f25ce403559e784ed4a5e4d237dcefdc25f957747eb8cb79d143","observation_id":"d8d6b7f7-d1be-4f28-89ea-f3103e24bb5f","resolution":{"observed_at":"2026-08-06T22:02:48.324350Z","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-06T22:02:48.424078Z","title":"http://dx.doi.org/10.1007/S00037-016-0130-2 Factors of low individual degree polynomials","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.424078Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:6a85861d99f545b98d59cd03bbeb5a9760901a2c02dce79f6f647b74e57976e5","observation_id":"97b66229-959a-4599-85f0-a4c928b0e451","resolution":{"observed_at":"2026-08-06T22:02:48.424078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0902.0069","last_updated":"2009-01-31T14:11:07Z","snapshot_observed_at":"2026-08-15T05:56:13.779677Z","submitted_at":"2009-01-31T14:11:07Z","title":"A ridiculously simple and explicit implicit function theorem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.0069","snapshot_observed_at":"2026-08-06T22:02:48.511993Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.511993Z"},"links":{"cited_paper":"/paper/0902.0069","citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:99cd4b53eb6eb391cc561cfa75ad65ac4961c81ae4ed9e4fc272f5bebbbf43dd","observation_id":"b1b1bb3f-ec6c-4abf-8e0b-29eff46d90e0","resolution":{"observed_at":"2026-08-06T22:02:48.511993Z","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":"10.4230/lipics.ccc.2020.33","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"http://dx.doi.org/10.4230/LIPIcs.CCC.2020.33 Factorization of Polynomials Given By Arithmetic Branching Programs","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"da7360e1-0209-48e1-ae0d-5bb7a00ecc23","year":2020},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.599582Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:6bdbf52dbea9065b83d1b0cb50e2ae53ba611b0ade28eb7c2ba64ec10fc513a8","observation_id":"5087d3c3-2d59-4465-bd4d-01263ada98c0","resolution":{"observed_at":"2026-08-06T22:02:48.996929Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T22:02:48.663717Z","title":"http://dx.doi.org/10.1017/CBO9780511609589 Enumerative Combinatorics - Volume 2","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.663717Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:ef48f73e359d859f1ed0963247ed46e1c59621f832e4612a85d7676ee7ad45f8","observation_id":"1dc9ceb6-b1e7-4dbf-91ff-0a0a7054a771","resolution":{"observed_at":"2026-08-06T22:02:48.663717Z","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-06T22:02:48.756702Z","title":"http://dx.doi.org/10.1080/00029890.2023.2251344 Lagrange Inversion Formula by Induction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.756702Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:4f0db124fcdb72d870c12bfa0504b9f71738a5501b22e82b662935945aa86398","observation_id":"7276b65c-ebff-41d8-9f4f-97423275b9d8","resolution":{"observed_at":"2026-08-06T22:02:48.756702Z","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-06T22:02:48.833473Z","title":"http://dx.doi.org/10.1017/CBO9781139856065 Modern Computer Algebra","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T22:02:48.833473Z"},"links":{"citing_paper":"/paper/2506.23214"},"observation_digest":"sha256:1094419c89826adf1bab4cdf3a483c3915013a516007b9384bb8e3cee96cfec2","observation_id":"7e6dfb24-01d1-45d5-af5e-f78bf2b60dc4","resolution":{"observed_at":"2026-08-06T22:02:48.833473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.23214","last_updated":"2025-06-29T12:54:30Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T21:45:35.359278Z","submitted_at":"2025-06-29T12:54:30Z","title":"Closure under factorization from a result of Furstenberg"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":13,"verified_fuzzy":4},"total_outbound_references":34},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2506.23214."}