{"as_of":"2026-08-09T02:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:268c758e8a495775a6938cd109810fa3ba3ee5537e9fe3d436b6b0e1f4665162","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:53:33.115123Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.04436/citation-record","integrity":"/paper/2506.04436/integrity","json":"/paper/2506.04436/citation-record.json","paper":"/paper/2506.04436"},"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-07T10:53:42.128178Z","title":null,"venue":null,"work_id":"270c32bd-4158-466e-8ff8-349fce2bcad6","year":1998},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.326073Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:925d4f7c09ff2a519117dda54253ce2c29341f30a03c356cfadcb27282bc7b03","observation_id":"58e38873-7814-4ec2-b411-ab1b237b5976","resolution":{"observed_at":"2026-08-07T10:53:42.197301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:27.406268Z","title":"Arora and B","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.406268Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:7de8528f6340b9ccaa15c35d0caf87c7d35b5141e21721312e1c9c5dd6fe1ad1","observation_id":"584b34b0-360f-4e36-97b8-bd1f662b28f4","resolution":{"observed_at":"2026-08-07T10:53:27.406268Z","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-07T10:53:27.487849Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.487849Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:cdc0160830206e0530f004094afac29014fdab9c81a6d54fa7d8e1f5a3d21507","observation_id":"17696612-561c-43a1-b5af-e7671f6b77ba","resolution":{"observed_at":"2026-08-07T10:53:27.487849Z","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-07T10:53:27.557128Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.557128Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:5b61316c508f19ec144ff9c9780e11423e9eba0488f6b88f2ff8486ef2649e27","observation_id":"c3394b59-cd94-4dad-80db-82885a04938b","resolution":{"observed_at":"2026-08-07T10:53:27.557128Z","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-07T10:53:27.608089Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.608089Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:98a66b266967dac681166f95d604d990d14381f62ec527c943f2a121549264d0","observation_id":"3693addc-6bc7-4f0e-ac9b-9d32dce99da0","resolution":{"observed_at":"2026-08-07T10:53:27.608089Z","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-07T10:53:41.959758Z","title":null,"venue":null,"work_id":"f8b77fd6-6f1f-4475-b182-dd9ada6e794d","year":2011},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.720456Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:252a79aeb4750be089a9cf742d4e189ce58cf8c81ce4ebd30530ef031a86a669","observation_id":"de975f92-d5ac-4747-9d59-f71e1d8f2576","resolution":{"observed_at":"2026-08-07T10:53:42.034095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-38896-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":"Grundlehren der mathematischen Wissenschaften","work_id":"665b5d76-120a-4d95-ab8f-308e80c7aafb","year":2013},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.810609Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:3b8c1ffea5faeac3e0da563dc70cb66e9922e8be9867b53106c697789968236f","observation_id":"9db31f01-c93c-4af7-8872-ff468415059a","resolution":{"observed_at":"2026-08-07T10:53:35.704078Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2011.08.022","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:35.418809Z","title":"Burr and Felix Krahmer","venue":null,"work_id":"e2046cc0-06f6-4937-b7ec-5a306df77a3a","year":2012},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.903678Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:d3253f816685810deb8a862f27c359ce5bd1ce321c8d732a3632c759628f1bbb","observation_id":"66d6d775-aa2c-4ddd-a61d-92b9603c7ea4","resolution":{"observed_at":"2026-08-07T10:53:35.484735Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s002080010017","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Castro, J","venue":"Foundations of Computational Mathematics","work_id":"8b6e19d4-47f0-4697-b17c-99c85a11b0a0","year":2002},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:27.985509Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:94d55233044b810109b0d6f5b25a25bd283d9d7ec75e2752c7b3c53ff4b3c40f","observation_id":"72ed1c6f-6afb-4f55-90ab-41a9091dd293","resolution":{"observed_at":"2026-08-07T10:53:35.340900Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.839308Z","title":null,"venue":null,"work_id":"1c3def41-e061-4331-bda3-ce55d19bddb8","year":1988},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.066417Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:ef3c41dbca4e72dd09a5101ce4ca5964367dbb00230a41860182e0156a8ad986","observation_id":"69455dae-02b8-4a49-86ed-90ca17d3e144","resolution":{"observed_at":"2026-08-07T10:53:41.891200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.697914Z","title":null,"venue":null,"work_id":"cac3f7af-9f46-4010-9abb-f2da004e63cc","year":2006},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.115784Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:84085efd1eaec9f1fa56b12eb40c558c9d584d77f02a844e2acfdce5203aaca0","observation_id":"01270e19-795c-4116-a5cc-cda4b91cc61f","resolution":{"observed_at":"2026-08-07T10:53:41.772800Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.556636Z","title":null,"venue":null,"work_id":"eaf6f97c-7c69-45cd-bd03-37cb38040dc6","year":2023},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.203210Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:ca8da99d03618757972b8fe8a5aaff95b354972cb10a7d02be912f972995f701","observation_id":"7690b198-af53-4ed0-ab61-04fe0d50236a","resolution":{"observed_at":"2026-08-07T10:53:41.614335Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.411294Z","title":null,"venue":null,"work_id":"87fd7467-0328-464a-ab5c-13ba3b84080c","year":2013},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.294913Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:01cc70fcb73aa7619dbf19b879a8b6accf300608ad9bbf4e202996606ca7c8f3","observation_id":"67ed764f-9b10-43bd-b834-9eb6e2946806","resolution":{"observed_at":"2026-08-07T10:53:41.481663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-7643-7984-1_8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Birkhäuser Basel eBooks","work_id":"5ff17976-00d1-4d19-b979-3c8db9de67f1","year":2007},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.366564Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:fd4cb915b7549a264e5d7bf76b97680f41da8e34bfb842b048af6f7adfb7cca2","observation_id":"4717c403-a1c2-4c43-b49d-60d8bffce60f","resolution":{"observed_at":"2026-08-07T10:53:35.172469Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11555964_12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":"Lecture notes in computer science","work_id":"1e48c97b-ace7-4a89-a7da-323bc6589abb","year":2005},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.438240Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:c812b721941edcf792b47601d16e0bc0d21616bd79d204d219d74e79f28dbd08","observation_id":"8cde05ea-ceab-4cbe-8bdc-1155b9d08d4a","resolution":{"observed_at":"2026-08-07T10:53:35.023338Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2019.07.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:34.769327Z","title":null,"venue":null,"work_id":"c89dcef1-26d9-42be-9db1-4875c93c8652","year":2020},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.573179Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:b6f192b1e05ba6bd76a871b034c8280449eed5065c3c313ce508e8bfbfc82b68","observation_id":"e126928d-137b-4f7c-a505-a814897c7379","resolution":{"observed_at":"2026-08-07T10:53:34.814335Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7934.18379","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:37.821046Z","title":"Emiris, André Galligo, and Elias P","venue":null,"work_id":"6b8136df-661d-476f-9355-17a915544a10","year":2010},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.669625Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:d85eae98139cf4ac74157c9d90c35a26234986a4a28bee22c3381bb1d1c70c3d","observation_id":"aadd31a2-6dc5-44cc-9901-23d5b894cb99","resolution":{"observed_at":"2026-08-07T10:53:37.865275Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.304134Z","title":null,"venue":null,"work_id":"33c0e489-fd55-4ae7-a591-b2d130ce45ff","year":2008},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.737138Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:048a6def0fc6e25959d1a86259d937b433ef91c808b19ca7d2821b713f725ec8","observation_id":"b01e9251-0ec0-4484-b85a-58c3c397a888","resolution":{"observed_at":"2026-08-07T10:53:41.345136Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.147706Z","title":"Emiris, Victor Y","venue":null,"work_id":"d46abdcd-f25a-4824-8a41-edd1d44518bd","year":2012},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.792789Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:1a09f2c450eb68e9ab7e0459fede4148ff47da1ad3d9fd8d68238da4931fd314","observation_id":"dd6f5387-dcb3-4c34-a71b-9d6fd97bbcf1","resolution":{"observed_at":"2026-08-07T10:53:41.207442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:41.009540Z","title":null,"venue":null,"work_id":"7cefd8b7-af8c-48b5-807c-52231ed19b60","year":2021},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.845349Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:7fe9a6e5e011fe9a2312158b24fb054fb8386f4e04db00f20017f1f574f08678","observation_id":"9794f661-eab8-452b-907d-654272c11302","resolution":{"observed_at":"2026-08-07T10:53:41.079622Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.888006Z","title":null,"venue":null,"work_id":"7c146bd6-2f7c-4a94-b776-d155aba8c666","year":2022},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.911173Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:9fb75fc4cf1f699774c632e304c84c87aa87fb01496ad03e38562d29eb67ad2f","observation_id":"24ca8a5d-9838-4a65-87fc-b50fb6a5f53d","resolution":{"observed_at":"2026-08-07T10:53:40.965805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:28.979959Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:28.979959Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:ced97f16c22b7506ac170c7e07a2de39cdd618308464c9e21a964db18bdc4c0a","observation_id":"1c901596-398d-428c-b19d-005f2d7fb831","resolution":{"observed_at":"2026-08-07T10:53:28.979959Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2002.0526","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:37.603139Z","title":null,"venue":null,"work_id":"f0029cb7-e737-4beb-a0cd-f642965e9de3","year":2002},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.042035Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:cd96a1984946fc9bd436d9895d5eeeabd219110bb31991196b7c4830989a983d","observation_id":"1343ae01-d353-419f-a50d-b21918fa5cad","resolution":{"observed_at":"2026-08-07T10:53:37.695736Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.751319Z","title":null,"venue":null,"work_id":"1584c4ef-a097-4cd4-85e6-744d7a3942c5","year":2020},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.135047Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:b76aeff579b5960290423caa04ce628882d308ad8ae2cde9dc47eab3040e68f2","observation_id":"16023290-da6e-4187-bf28-147f2484a165","resolution":{"observed_at":"2026-08-07T10:53:40.809925Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.619293Z","title":null,"venue":null,"work_id":"a707bdc0-1fb3-4c41-9884-b5f22da9c21b","year":2011},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.228427Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:652511d8f8c921d6db0676b9165ad7f5d02e504c41ef477a9acef8cd2a988d8f","observation_id":"91e4f67d-a83c-4ea3-978b-53d261f27980","resolution":{"observed_at":"2026-08-07T10:53:40.684332Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:29.315123Z","title":"Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.315123Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:188f1185c1a62671e342b9688e4b625013af0f0a9e0e21d6f39e72f621617fd7","observation_id":"7aa732f8-6e3f-4804-86fc-046bd8e741b2","resolution":{"observed_at":"2026-08-07T10:53:29.315123Z","resolver_source":null,"status":"malformed_identifier"},"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-07T10:53:29.411669Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.411669Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:a64c9493336dbb109b1cc795588321a24c7ff083fa49a9bf4231eac0e9de1c42","observation_id":"3f64d404-4fdf-4580-a08c-821cd37f5a5e","resolution":{"observed_at":"2026-08-07T10:53:29.411669Z","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-07T10:53:29.485169Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.485169Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:f13a1840d4693843adaea21a8666d8fbff9e6df77b6629d293c5425113680936","observation_id":"55d2882f-0e1e-41a7-8b64-500e4af0beaa","resolution":{"observed_at":"2026-08-07T10:53:29.485169Z","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-07T10:53:40.461086Z","title":null,"venue":null,"work_id":"8ff0fb2a-41a5-4bd1-9e70-0ac5f78da282","year":2020},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.568572Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:9daa9c1b8d024ebdcb81d024a59526ccb91e87cf63084bd837587daac294249c","observation_id":"ee51dafc-4b23-4410-a21f-711168069d78","resolution":{"observed_at":"2026-08-07T10:53:40.537402Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.330910Z","title":null,"venue":null,"work_id":"b0b3b8c1-1646-4cee-b87a-4e4baecc4bf9","year":2017},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.683865Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:4aaa705b7c6e6214436a086b76e79cf3bd83810712277f5669c54c90c2453584","observation_id":"92e64a4d-fe7f-4abb-a5c9-4e2a325ee59c","resolution":{"observed_at":"2026-08-07T10:53:40.379040Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5768.11457","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:38.019445Z","title":"Johnson, Werner Krandick, Kevin Lynch, David G","venue":null,"work_id":"ce6a5c1f-3de1-4875-9d0c-88bd55d1e97f","year":2006},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.836039Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:b4efada3d92e18791a80e8e719a1a59a52277aa0afb3bf062387db20e41161e0","observation_id":"90db4c7e-6a24-4249-841a-f2c47570a5dd","resolution":{"observed_at":"2026-08-07T10:53:38.054593Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.0481","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:37.256592Z","title":null,"venue":null,"work_id":"a65738aa-6b86-4011-8be5-81bb1db4340f","year":1998},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:29.957252Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:275a401cb569666049ce3d1549de9672bdb52f566b1497a714c3f89e637fe376","observation_id":"a0b46536-ab5a-4023-9b9c-6c274c711f0f","resolution":{"observed_at":"2026-08-07T10:53:37.307819Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:30.076746Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.076746Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:b853197482355a58f2df335e1f9ce9cdd1e8d183b8af6bbd19455f45a3581d45","observation_id":"74b1be0a-2433-41bc-94b8-b817d78a0c8d","resolution":{"observed_at":"2026-08-07T10:53:30.076746Z","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.1016/j.jsc.2005.02.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:34.595211Z","title":null,"venue":null,"work_id":"47c2bcf1-877c-4cb3-ad30-c3a1d691baed","year":2006},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.233981Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:04ad5570d27348fe5882eb7008d4e8c3cc5bc8fb7355ffb181ae24d36e0efaaf","observation_id":"bc3df6b8-bd79-4e51-b1df-9d1af052da1f","resolution":{"observed_at":"2026-08-07T10:53:34.664229Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11856-016-1431-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:34.419625Z","title":"Livshyts, G","venue":null,"work_id":"fd6a1193-ebbe-4a8b-be20-d192ae080e7f","year":2016},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.379430Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:5d63cbbadc7c42205dd602b7addf177815a90831ee40fb5f4b139020f142e0a0","observation_id":"1999ac70-9da5-4d23-8696-28982615e0e7","resolution":{"observed_at":"2026-08-07T10:53:34.508351Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.190120Z","title":"McNamee and Victor Y","venue":null,"work_id":"3dfea0e4-0828-44f0-b749-013c1f46dba8","year":2013},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.496322Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:9b9cf9fc189ec9175133d645d479f70a28db42131116539064ddd2f966bc5c1e","observation_id":"85087169-e787-4e6e-aedf-eeec78c07a2a","resolution":{"observed_at":"2026-08-07T10:53:40.273696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2014.02.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:34.270733Z","title":null,"venue":null,"work_id":"30f31d4d-abee-46e6-b3df-406b3fb7477f","year":2015},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.610667Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:3dfea6757695b7d0400dbb7ae7615b61a51c6a518aa1d35273cafe085a72b4f3","observation_id":"5051051d-d0b5-4c7d-aaef-dfe1aca6c263","resolution":{"observed_at":"2026-08-07T10:53:34.336115Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02505","last_updated":"2021-11-29T10:03:51Z","snapshot_observed_at":"2026-07-06T11:15:59.390488Z","submitted_at":"2021-06-04T14:20:05Z","title":"New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems","version":4},"cited_work":{"arxiv_id":"2106.02505","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.02505","snapshot_observed_at":"2026-08-07T10:53:37.002592Z","title":"New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems","venue":"cs.SC","work_id":"8316f8c7-7bf4-4ef5-ab5f-f073d8720077","year":2021},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.696341Z"},"links":{"cited_paper":"/paper/2106.02505","citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:2d5cf79702a55fb746c01e3dcd81b6a63b09b29f61c858bb6ab6ab5c443b98eb","observation_id":"fe4cb5b6-739d-409a-be67-9beaee07a888","resolution":{"observed_at":"2026-08-07T10:53:37.063830Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:40.041525Z","title":"Obreshkoff","venue":null,"work_id":"5150d5e4-86f2-4ff9-a112-2b03c8302b2b","year":2003},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.785193Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:dce679aff2e99eef3cc364c10065c70adf805a996b73876a595ccffb41976119","observation_id":"3064f017-23ba-4555-9799-f08caaf7c928","resolution":{"observed_at":"2026-08-07T10:53:40.086195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0036144595288554","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:34.136339Z","title":null,"venue":null,"work_id":"d7dc096d-a490-478b-944e-4b1257d79b74","year":1997},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.876155Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:d7a2778c8e86d4477166206774125bf7350d2c6dd4c05e46dc4789b1f9100c48","observation_id":"dcdeaa0e-36f4-452b-b2f9-14dea1ca5906","resolution":{"observed_at":"2026-08-07T10:53:34.196953Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1999.0532","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:36.871095Z","title":null,"venue":null,"work_id":"d2778d4d-4d31-421d-9725-759a825d377e","year":2000},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:30.965434Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:91374992e8c9948ed8fae9ac0ce7406c9dfa21e341682803f0a92c410b7f1fba","observation_id":"6d30a98b-3f03-425c-8827-8c5e35a811e4","resolution":{"observed_at":"2026-08-07T10:53:36.927815Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2002.0531","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:36.662584Z","title":null,"venue":null,"work_id":"7853df53-4c69-496c-a291-53c962173abf","year":2002},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.047509Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:324244254f55dd23cf4221ecd6963c8f4a1627b6f04b6a55c1beb4522ff3b90c","observation_id":"2465474c-6154-48a2-bef5-3c157a4da014","resolution":{"observed_at":"2026-08-07T10:53:36.726921Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.907743Z","title":null,"venue":null,"work_id":"fff9cbb0-8116-4601-af9b-0bae4fb8016f","year":2022},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.157730Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:9d02582765ff43e92498fea91e2cfb82de4cdbb808fde645fc96ec69954ee333","observation_id":"fafcf2b0-09ae-4c34-a5c4-74eab604acec","resolution":{"observed_at":"2026-08-07T10:53:39.980176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.811211Z","title":null,"venue":null,"work_id":"a56686d4-50bf-474f-a852-940f05442d79","year":2024},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.236795Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:c1c6f0769749f3a9abf9f1cd3b8deaa0f620361ec1d2317b60cfc2552fbe5f19","observation_id":"4c7d9d8f-127b-4e5b-bc2f-c5bc485a5bf8","resolution":{"observed_at":"2026-08-07T10:53:39.851969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5506.24659","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:36.443356Z","title":"Pan and Elias P","venue":null,"work_id":"5e7fee52-58e8-478e-859b-f1aaf85ce58c","year":2013},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.300716Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:8b7331a595a6b1a9bd4115a559646540da189b09bb049cfb7f4aad7ff932ff5f","observation_id":"60924d0f-5fca-4f27-b00f-82ebf512b457","resolution":{"observed_at":"2026-08-07T10:53:36.510973Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.630149Z","title":null,"venue":null,"work_id":"b9fffb7b-a569-4903-a94c-4735b73bee3d","year":1997},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.385720Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:4e14f8c6a3311b7431a8487fd077f40271b762000ffcfc7aad27defa01a36989","observation_id":"7f67b21b-7790-4ff9-8f17-0f3f546d8411","resolution":{"observed_at":"2026-08-07T10:53:39.719125Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.443399Z","title":"Roughgarden","venue":null,"work_id":"02787c4f-ce69-4533-8bec-283794ba12b4","year":2021},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.452042Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:3b1f0fa5ab3703646a69bfd927fcc7949d31a32b55f8a53e388697f5f6b25e4a","observation_id":"b4650381-0120-406a-9a11-83445a329bb2","resolution":{"observed_at":"2026-08-07T10:53:39.541030Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cam.2003.08.015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.999741Z","title":null,"venue":null,"work_id":"33bb0663-f5d5-4a61-9868-52db4ed04a20","year":2004},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.533584Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:820fa6907ecb0941ee5126861e942df93ccc207bb65bffa36746542e2e55699f","observation_id":"0acb54ef-441e-41a2-ba44-6e2e7fc1c30b","resolution":{"observed_at":"2026-08-07T10:53:34.062716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:31.593301Z","title":"Rudelson and R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.593301Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:52cfc2d6553943b44a741dffd6f85490722d2e3187a080a1a11dd980ff2f967c","observation_id":"4a695991-bd13-4eb3-b014-d21fa29d9458","resolution":{"observed_at":"2026-08-07T10:53:31.593301Z","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-07T10:53:31.671475Z","title":"Rudelson and R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.671475Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:cd74fd036fc5c3c29bdf2e2c87891f6c07720d2c53bbb33458555c4de634fe7b","observation_id":"cdb65da6-ea3f-4689-a9da-d3cfd32c66d5","resolution":{"observed_at":"2026-08-07T10:53:31.671475Z","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.1016/j.jsc.2014.01.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.809675Z","title":null,"venue":null,"work_id":"baf48f21-2a80-49d6-8852-bdfecd51bbac","year":2014},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.762205Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:bb3b1c3326f6066120ed2fd7e0edbc7f6ac11b3dea61681bce9a797376910e3c","observation_id":"eb6e6d66-7e55-43e3-a4c3-1a8dd1441876","resolution":{"observed_at":"2026-08-07T10:53:33.884501Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2015.03.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.663550Z","title":null,"venue":null,"work_id":"cae4e591-9175-4b34-a920-688497251ac1","year":2016},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.846161Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:eec951585e50095d35f65287bb744d7bdea6243295fbb84ff474306a0d8242ce","observation_id":"58b21437-9512-4847-8172-32f8d398528a","resolution":{"observed_at":"2026-08-07T10:53:33.736023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/1993886","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.528062Z","title":null,"venue":null,"work_id":"85314fb8-21df-4276-9215-5358d6b36410","year":2011},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.930680Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:592f926ef80aa00400734010e41d59a1752fa1177e404ddf3cd022b5783371c3","observation_id":"c427935e-186f-4210-934d-39c5f8b4b7ba","resolution":{"observed_at":"2026-08-07T10:53:33.596139Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.268267Z","title":null,"venue":null,"work_id":"568c4a86-dd0c-4eb2-bd4b-f41d387c212b","year":1982},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:31.988496Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:e246c34d2646ec1c6a55d010d7d53e5cb158baf20f481ea8090051aa22c71868","observation_id":"3eff3d68-4308-4828-b07c-89d0b31d62a2","resolution":{"observed_at":"2026-08-07T10:53:39.373355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2008.09.017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.346395Z","title":null,"venue":null,"work_id":"bd037893-dbd2-4054-8193-e5bb2cfe2858","year":2008},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.067271Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:1a3ea6ad491698e4d979316dd6d40bc7af30c63694c84a2b445eb11f036939a4","observation_id":"8d8d6c99-c327-4710-9ed1-79906a5cdbf5","resolution":{"observed_at":"2026-08-07T10:53:33.426225Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:39.103196Z","title":null,"venue":null,"work_id":"6bd9744d-3449-4d87-9660-3b1f18dc9dcf","year":2004},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.131193Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:fca06575fb3e9a12861a682bb03fbf1bbb416795dd7c170aacb8461180319d37","observation_id":"17efea0e-9afa-41cd-832e-974eb2e1e17c","resolution":{"observed_at":"2026-08-07T10:53:39.186462Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.976063Z","title":"PARI/GP version 2.11.2","venue":null,"work_id":"d1a5fb82-d48f-4879-bcfd-fabdbb5b5646","year":2019},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.211822Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:b948a9d88a93663eac4ced88911a6713707ddbdca22730a8ec1b85444157cd55","observation_id":"b041090c-e989-4cd5-b9e7-e92d7e49b8a7","resolution":{"observed_at":"2026-08-07T10:53:39.041327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.846887Z","title":null,"venue":null,"work_id":"836ce682-5e78-4fae-aaeb-11716744c50d","year":1939},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.300479Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:907fd28caaacf5866651efd857a78ca91b37e7cfc889b15c3d964420a3e18540","observation_id":"fe4c82ed-2c99-4a4d-a16f-f19ffccc2a09","resolution":{"observed_at":"2026-08-07T10:53:38.889659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3207.34040","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:36.243936Z","title":"Tonelli-Cueto and E","venue":null,"work_id":"1e36c9a3-b16d-44ab-a70d-986072428118","year":2020},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.378560Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:dda2d7fdc9815be550a5643d9192f0a732ab87303a3cb595f3436284c2a88005","observation_id":"7ac0daac-6837-45c9-b9e3-01bda54a64ee","resolution":{"observed_at":"2026-08-07T10:53:36.283418Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04423","last_updated":"2021-09-12T09:21:40Z","snapshot_observed_at":"2026-07-06T09:26:52.676528Z","submitted_at":"2020-06-08T09:09:40Z","title":"Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces","version":3},"cited_work":{"arxiv_id":"2006.04423","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.04423","snapshot_observed_at":"2026-08-07T10:53:36.027996Z","title":"Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces","venue":"cs.CG","work_id":"8230d0c1-fce2-4bfe-80f3-bf5f1a88aedc","year":2020},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.474197Z"},"links":{"cited_paper":"/paper/2006.04423","citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:6794d98c1801a08ea20bb6c07a6b63249859e5cdfa701987ef4dd8cd5b087815","observation_id":"3ea8ae7d-70a5-4bf8-82d0-07da7731eb03","resolution":{"observed_at":"2026-08-07T10:53:36.090400Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.703006Z","title":null,"venue":null,"work_id":"5dc5e84e-5ee3-4cd4-ad0b-52286b01e272","year":1992},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.567629Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:45e3b3e1945f9d1c16d01938251f0148d0f7a663a6d5ee77a5cac3d752b91e8f","observation_id":"af3174c7-7bff-45ba-bf74-cad9a384774d","resolution":{"observed_at":"2026-08-07T10:53:38.788385Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.574918Z","title":null,"venue":null,"work_id":"15bc94ef-5430-442b-bb01-17fa163ab45c","year":2016},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.634308Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:c5886db9621541d85545464d246c8d90128b34de6e0376a0180009da999764d4","observation_id":"83890f95-c0a2-464b-951f-f1dfe91e38bf","resolution":{"observed_at":"2026-08-07T10:53:38.617030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2007.10.010","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:33.207076Z","title":"Tsigaridas and Ioannis Z","venue":null,"work_id":"e8cf0555-bd39-4ca3-8969-e9bea49e9230","year":2008},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.719795Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:fdfd13b82450c57862977d8abd092572f6146d64db7e5283a575611096bb82d6","observation_id":"114e2020-ad61-40c4-aab5-fdc2435043d0","resolution":{"observed_at":"2026-08-07T10:53:33.265374Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.415711Z","title":null,"venue":null,"work_id":"1dc26bc2-c905-4574-9889-c4d640ab8950","year":1948},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.839827Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:eec0e54bb41d99353f7f8923ca483ff491f9975421b14c020032442076adcde1","observation_id":"ed6b54cc-1523-4168-b40e-1c1ccbdd678e","resolution":{"observed_at":"2026-08-07T10:53:38.478136Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.258651Z","title":null,"venue":null,"work_id":"4a6adf05-c7f8-4255-a6c0-b4bbaa86fbe3","year":2003},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.909124Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:c35f5583b75ad0fab9c64ec4a722f975de7774c4fcb4548309f425a4ce9cdc45","observation_id":"5d92e81a-dadd-4c05-9072-fb0854e8353c","resolution":{"observed_at":"2026-08-07T10:53:38.318315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1637.32163","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:53:35.909594Z","title":null,"venue":null,"work_id":"5a14df51-3b73-490b-8d74-c0a220c4af21","year":1971},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:32.989352Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:15ddae27005377a5555ec094ac7a3f1734b308c862cc8176ba7a04760eb3b6f5","observation_id":"7858d34b-bb4c-4f8e-a774-d8355452fff3","resolution":{"observed_at":"2026-08-07T10:53:35.952359Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:53:38.117693Z","title":null,"venue":null,"work_id":"5d0b02bf-5946-461a-bd73-dc7f7dc1ce1e","year":2000},"citing_paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T10:53:33.115123Z"},"links":{"citing_paper":"/paper/2506.04436"},"observation_digest":"sha256:0aa27889fb972a1d0c8c785098ac445b171dcda19555bc8485d17a21b5ebd929","observation_id":"b94a1187-ea2e-481a-acb4-a73ef7521fc0","resolution":{"observed_at":"2026-08-07T10:53:38.182396Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04436","last_updated":"2025-06-04T20:38:31Z","latest_version":1,"primary_category":"cs.SC","snapshot_observed_at":"2026-08-08T13:38:28.747316Z","submitted_at":"2025-06-04T20:38:31Z","title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":5,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":32,"verified_exact":22,"verified_fuzzy":4},"total_outbound_references":67},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2506.04436."}