{"as_of":"2026-08-13T21:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f7e5cc51dff335cf1b0daf916ce90fd187942ca0639d5691d638875a4c25493","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-05-09T14:34:40.912183Z","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-13T06:32:02.005865+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/2605.00995/citation-record","integrity":"/paper/2605.00995/integrity","json":"/paper/2605.00995/citation-record.json","paper":"/paper/2605.00995"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Annals of Combinatorics , volume=","venue":null,"work_id":"14ab8c38-09fc-4d82-a465-ff553366eb2a","year":2012},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:6701d4c02445286ca822bdcf59adb0851fe7d0884b2ff9e76572a5239afcb684","observation_id":"762e410c-a486-41e5-a67e-b5fe8567f56a","resolution":{"observed_at":"2026-05-26T01:56:30.535336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Foundations and Trends","venue":null,"work_id":"05c95a5a-7ef1-4702-aa4b-f7f056a7c7a4","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:9c93850aaf97b80657163ed15d8dd7577297302969e8ff88720f1d86f98698bc","observation_id":"240c8ba1-751c-4de4-9f2f-6c2dc6d2f13e","resolution":{"observed_at":"2026-05-26T01:56:30.539298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"1996 , place=","venue":null,"work_id":"505225a6-ed7e-4699-a801-ba971a002d5b","year":1996},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:79821ace2046d7a7b82aedfddbcb717924c1b839c55bb9d8c7577a8f1d163b19","observation_id":"a7647475-35aa-42bf-86f0-89bfe0228bf5","resolution":{"observed_at":"2026-05-26T01:56:30.523932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages=","venue":null,"work_id":"8c0c6823-19b8-46c9-bd51-9331e1ce32ca","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:44c78735a9f417463c4173ead1a7bd9a5e31d6d5634732f98b53147e00829440","observation_id":"88328eca-8f15-4cbc-9ec3-b9dc19011a90","resolution":{"observed_at":"2026-05-26T01:56:30.527880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":"3a1ff237-05e4-4dcf-8d2c-e9a4809be390","year":2014},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:e5f5f69fa1669a529a58f1d3ec3350cd33a3ffe33c00ac84da273af600f3dba3","observation_id":"6e16b343-99c6-47fc-9b23-ded01b3397cb","resolution":{"observed_at":"2026-05-26T01:56:30.517006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Electronic Colloquium on Computational Complexity (ECCC) , year =","venue":null,"work_id":"f09deba4-43f4-4a9c-9116-5f49f69d783f","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:60e109dde1785615d5df553456b504696d63db498f0bdd2a39eba0bc007a064d","observation_id":"2bcaf734-d02b-4e42-8ae7-71d02e2ab461","resolution":{"observed_at":"2026-05-26T01:56:30.513040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":"da5a8fb2-00d5-47c1-93b7-0c430392efec","year":2008},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:43459f262544339dd2b50ae5c52f1a799704d1d96fda713644ba6c235b0bb67c","observation_id":"79566570-b417-4024-8879-b4ce55533585","resolution":{"observed_at":"2026-05-26T01:56:30.520476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Contributions to Discrete Mathematics , volume =","venue":null,"work_id":"cbd1d672-3649-4c30-bfd2-65f44b3b23e6","year":2009},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:85de18a9c552a3a03d716902b7ee683115e5a8db68c00028e5a80526b6448d85","observation_id":"c9c1614f-f153-4d44-95be-48173d5dafd9","resolution":{"observed_at":"2026-05-26T01:56:30.531608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"38th Computational Complexity Conference (CCC 2023) , pages=","venue":null,"work_id":"3e1131af-3c2f-4337-9895-5a34b57af083","year":2023},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:9aef6be57e1d763b063a6f23f750f0f9dc8bf14d4d4c19353b5314bd87ccde9f","observation_id":"4261fd62-2e68-4fd6-9f6e-b00f2bfc3b3e","resolution":{"observed_at":"2026-05-26T01:56:30.543638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"9f49cc66-f874-4df4-8044-464221523ad4","year":2012},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:cf28925ab1f53210d06b389774ab3cc942e5821697cbc53b58ce47dc1335e1de","observation_id":"4724c6d5-da28-4c79-ab54-e94646b991e3","resolution":{"observed_at":"2026-05-26T01:56:30.494163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.14127","last_updated":"2026-07-23T20:17:48Z","snapshot_observed_at":"2026-08-03T21:47:39.588129Z","submitted_at":"2025-11-18T04:23:42Z","title":"Symmetric Distributions from Shallow Circuits","version":2},"cited_work":{"arxiv_id":"2511.14127","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2511.14127","snapshot_observed_at":"2026-07-27T01:19:52.532817Z","title":"arXiv preprint arXiv:2511.14127 , year=","venue":null,"work_id":"4dfe1587-2d2f-4e91-ace8-85fca6626735","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"cited_paper":"/paper/2511.14127","citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:76b0ff60fa9b68fe61b39fe220e452aa9d57b8e304993cb291d3a1297541c171","observation_id":"1c5b9a72-e9b3-425e-9d28-56b29b58cafd","resolution":{"observed_at":"2026-07-27T01:19:52.532817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"7bfbea6c-558b-44aa-83c6-c1dbb213039b","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:f354348899a81b8531ff5bc21846fb3272d716fed1ac6e3aed07c6f9dcb059d7","observation_id":"8a892716-b363-44ee-a081-9738a32acc40","resolution":{"observed_at":"2026-05-26T01:56:30.497897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"bbff01c6-1474-42b4-87a5-1f42876f0e32","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:2565332c04ab37e94ce157c5e244a4afe13e406d6588e5bdf8797c61467520b1","observation_id":"ee6a0a32-7173-4f48-9735-086b1df8aa98","resolution":{"observed_at":"2026-05-26T01:56:30.490548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2026.17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"17th Innovations in Theoretical Computer Science Conference (ITCS 2026) , pages =","venue":"arXiv (Cornell University)","work_id":"2b1ecc5d-30b5-4571-8ea9-46ca7e46a69b","year":2026},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:8c8088d183a87a43270313b07eb6fff5804c9ffc7262fde00020eb8eee5bc1fc","observation_id":"5609e7da-a906-408b-a011-5b8846b50a75","resolution":{"observed_at":"2026-05-09T22:24:01.042231Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , pages=","venue":null,"work_id":"0bbd02f4-d0b5-4cc1-8dbf-f6370723d51a","year":2024},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:63065693421f0e5eae4ecec2cbf68ef453514c41c03942bbe8f50df9a9453b25","observation_id":"d8d128c7-14e8-4e33-9695-8ce38771159e","resolution":{"observed_at":"2026-05-26T01:56:30.478947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Journal of the London Mathematical Society , volume=","venue":null,"work_id":"1eaa0747-0dc2-4d29-9eaa-e9d43211839c","year":1960},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:413c07a245bbe849fa618d2ee5b10f7328c316fbd2d4aba61a1b39fa72a18528","observation_id":"525470a8-7cfa-4814-800c-83d8a4c0cfbd","resolution":{"observed_at":"2026-05-26T01:56:30.475370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Information and control , volume=","venue":null,"work_id":"00953f0a-90ac-4d47-9e73-49c4e2f1def5","year":1976},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:7895cfbd3de6c4d82a6bb92a75e6176ed1b7da55471ba3f33f33a8a1f9142a1c","observation_id":"ceaccbc4-f9d1-43cc-ad88-ad77d98e5dab","resolution":{"observed_at":"2026-05-26T01:56:30.482583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":"0012107e-5d5b-4da6-b5eb-391a1ec3a20a","year":1970},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:e1bc1c66fea006ae2602c66a2236bb700b4ccc9e68a9aab751f64df816faee66","observation_id":"7aa6185b-1f7e-4e9d-96c6-6829b117a0ff","resolution":{"observed_at":"2026-05-26T01:56:30.486492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"IEEE transactions on information theory , volume=","venue":null,"work_id":"b3358154-2216-41ba-91e8-208ea3d9b14c","year":2012},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:3eb39ceee775e1c20ac16ee2161a677d14698c1e59f67999960c537f4144fd1d","observation_id":"ff15a334-c057-4483-92ed-51358b0b340a","resolution":{"observed_at":"2026-05-26T01:56:30.501536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the fortieth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"42e76704-a77f-4a9d-bf82-c815d27cf32b","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:73fe69b58b0a0942ee413c53a3c553d0affb8a34d0178cdbe193e1f8fc376147","observation_id":"a3fc82f4-b8cf-4807-86e0-f21f7476d73c","resolution":{"observed_at":"2026-05-26T01:56:30.505230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Mathematical systems theory , volume=","venue":null,"work_id":"b30f5be2-5600-4248-95e5-d138434fe613","year":1984},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:4d8dcc821c173d47115412c8039c0b9368fd6e109cd9fe81fed257acdab0c2dd","observation_id":"4380a689-6431-46b8-ab01-82e3777fe6b6","resolution":{"observed_at":"2026-05-26T01:56:30.508812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Annals of pure and applied logic , volume=","venue":null,"work_id":"f828b30c-b2b0-4a73-8fcf-87611714e32a","year":1983},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:fee0d0e157b05ee35c95ca29fe0c9970a92fad880f75c3bbe428823794f20e64","observation_id":"9010d2b5-6c91-43f6-a900-7a28e48d9972","resolution":{"observed_at":"2026-05-26T01:56:30.547183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the eighteenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"de1234a3-f2a9-457c-bf71-4d34ff58be73","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:373f1ac13b09e86c5ad701cc6c6cb1697a1bc5d78261a9b9ad5456ed2e26d2a7","observation_id":"0380c43d-1f4c-421f-9285-ffacded008e5","resolution":{"observed_at":"2026-05-26T01:56:30.579400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"c7b0d795-51b5-4284-b586-fb6f3a88a3ac","year":null},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:b37e9f3d74eafe7b01a31d664f778ed80654d27f650d56b743031cf3f95aa974","observation_id":"8f7911a0-8139-4f4e-9641-dc3c45fedbe4","resolution":{"observed_at":"2026-05-26T01:56:30.568550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2023.36","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":"arXiv (Cornell University)","work_id":"8188b2d5-6a5c-4a5d-80d1-77503934408c","year":2023},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:7ff43b06a8d5106b48210111aa89e324ec4e334b926661e7317c16e0adc7ee2a","observation_id":"c5f4145c-ebee-4005-a065-8bc74ea6cdef","resolution":{"observed_at":"2026-05-09T22:24:01.045174Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"13th Innovations in Theoretical Computer Science Conference (ITCS 2022) , pages=","venue":null,"work_id":"8b855dd8-b5e7-4edc-a689-4e8326dbee27","year":2022},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:44bab1bb4c5eaafd3899a76de47ea37d9d0aa56fbd88ee076ad97f8c373acfed","observation_id":"b7a88773-ecb6-4a85-b356-36ad7686a11d","resolution":{"observed_at":"2026-05-26T01:56:30.575820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"0a7dc8b3-ae96-4cc3-a243-9edbfbd0e52e","year":2020},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:b4f4180641c707778768698dffe3f686fcc236a3331f796a28a5198d2184c9d4","observation_id":"d7f418a8-fa76-4e5f-b6d1-d4d4ec523987","resolution":{"observed_at":"2026-05-26T01:56:30.572484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"9f496b58-c07f-4a22-aea4-ee8ddd007d8a","year":2020},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:1a9c93e53223765ff6c126a19669e12ea30439a5a7540da65e7224b83ff944ff","observation_id":"77dd893f-8179-452d-b82b-4f2fea1fbb16","resolution":{"observed_at":"2026-05-26T01:56:30.564749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"20fccb01-fb58-4e06-b531-42491c8d69ed","year":2016},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:43b2f81a978072558e8330cc41e7521a971f92fa7bcc6322a83ef603ba554069","observation_id":"fa7473cc-6a52-41c5-a576-65c7457bb209","resolution":{"observed_at":"2026-05-26T01:56:30.561111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"0e5a56d0-64e5-49c0-a7f7-0da6ffd93b3b","year":2012},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:2328308a396b1595f96bcd127c71a63173d99fb1cb2b79c4865fac00f056e178","observation_id":"4c3f1ea1-6d18-4c88-a54f-3c080e67c867","resolution":{"observed_at":"2026-05-26T01:56:30.557736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":"60674d80-cc69-4fb3-a759-4e44567ceea4","year":2012},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:b3689b586041b950f22d9276fdba4de81c48eb9c806e2df7f9623f40b8808aac","observation_id":"d2aed236-81f7-40e2-b900-784d1d1690b9","resolution":{"observed_at":"2026-05-26T01:56:30.554156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2011 IEEE 26th Annual Conference on Computational Complexity , pages=","venue":null,"work_id":"edd934d3-40b2-47f5-8609-4fd4aaf6b682","year":2011},"citing_paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-09T14:34:40.912183Z"},"links":{"citing_paper":"/paper/2605.00995"},"observation_digest":"sha256:e5d271f05a9b50899e002c20e2f5370e245c074a1bef445db8269bb6862c8370","observation_id":"43470f16-1f56-4dbe-b903-336b4ee48d91","resolution":{"observed_at":"2026-05-26T01:56:30.550585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.00995","last_updated":"2026-05-01T18:01:12Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T23:14:20.123289Z","submitted_at":"2026-05-01T18:01:12Z","title":"On Sampling Lower Bounds for Polynomials"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":29},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2605.00995."}