{"as_of":"2026-08-23T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8b526654240cab2eadf3d3238cb602709ed3bf2838798f0f87b745cd6e38de12","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-03T03:44:15.163828Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T19:30:43.940487Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.02364","snapshot_observed_at":"2026-07-11T19:30:43.940487Z","title":"Deterministic polynomial-time exact-root computation for sparse polynomials with bounded total degree, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04394","last_updated":"2026-07-05T16:37:40Z","snapshot_observed_at":"2026-08-18T02:00:02.874077Z","submitted_at":"2026-07-05T16:37:40Z","title":"MechMath Agent Team: LLM Driven Agents for Mathematical Research","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T19:30:43.940487Z"},"links":{"cited_paper":"/paper/2607.02364","citing_paper":"/paper/2607.04394"},"observation_digest":"sha256:3309b2d14e7a95ae00016b18cd1e482df1c79552f35eabdadde587a28eafa70b","observation_id":"c973fa3d-0aa1-4992-8713-cb57981fb282","resolution":{"observed_at":"2026-07-11T19:30:43.940487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.02364/citation-record","integrity":"/paper/2607.02364/integrity","json":"/paper/2607.02364/citation-record.json","paper":"/paper/2607.02364"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T15:01:15.813643Z","title":"2026 , publisher =","venue":null,"work_id":"3b7fc410-ea49-46ba-b7f0-9e899366c219","year":2026},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:6df8d7c156891d85e7afc6b2b544af30f7460c79f75fa002ad132e8abff668db","observation_id":"069ff225-80a0-4b7c-b847-60705eb63395","resolution":{"observed_at":"2026-07-05T15:01:15.815708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.816844Z","title":"Computational Complexity , volume =","venue":null,"work_id":"ced94165-a481-4249-85e0-7732581271d5","year":2025},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:2152c411696be6eead206346421f3e4da4e58fff9aa46e617509f3c07e739bfb","observation_id":"d5b7a837-2619-46ff-8d58-179c43aa9308","resolution":{"observed_at":"2026-07-05T15:01:15.818675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.825555Z","title":"Journal of the ACM , volume =","venue":null,"work_id":"8cda916e-6eb3-479a-8da1-634f6c8cd0a9","year":2020},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:941097d2b414f7e1deb16f5684a0d4db3bf93333794e828c8cbdd7e21474d6df","observation_id":"3c02c0e6-a937-4125-98bf-8cbaa985068f","resolution":{"observed_at":"2026-07-05T15:01:15.827643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.802882Z","title":null,"venue":null,"work_id":"36db5388-d460-48e2-b4e5-f508aec1249c","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:2cfe2a2622217999a5011ae041ea7ccb09ad93f51f476d87bc5a30fb2346f130","observation_id":"064b9c10-1804-4614-b45a-72d981d21d70","resolution":{"observed_at":"2026-07-05T15:01:15.804658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.805541Z","title":null,"venue":null,"work_id":"469ce7d6-df5d-40a1-9beb-0d85abc01f8f","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:95f79b2d7988949c864f59cafebbd0be8f62aed1cf8f9e6f408995639020901b","observation_id":"5849feef-3e1d-4e32-a53a-a2f0fbfcc02e","resolution":{"observed_at":"2026-07-05T15:01:15.811325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.820064Z","title":"Journal of the ACM , volume =","venue":null,"work_id":"8a9b3448-8772-47a0-ab99-0e98d8df8ee7","year":2020},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:3593b9a9b291d0bf97c94e75a89fc138a871aab911c51a7042a1ca5162d2929f","observation_id":"44f0e353-7c00-47c4-b9ca-881a3468ae65","resolution":{"observed_at":"2026-07-05T15:01:15.821933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.958029Z","title":"Roche , title =","venue":null,"work_id":"f8a4f59a-a878-467a-900a-431095b4c44c","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:a69d9498893ef21fdae846f622848e6ee86e7888dc29263c09760df2fb00df76","observation_id":"7a14d085-d835-4437-b4c8-57bade0a7b00","resolution":{"observed_at":"2026-07-05T15:11:10.960049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.954030Z","title":"Bernstein , title =","venue":null,"work_id":"c503672b-ea90-4a83-ab52-13ccd58b4ffb","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:9b5e45b0e8345ccbf80bd505a455e523cb5e65befbd4e29880d699587110aa62","observation_id":"8d5a288d-b53f-4c10-a477-50adea8a336a","resolution":{"observed_at":"2026-07-05T15:11:10.955440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.960731Z","title":"Algorithmica , volume =","venue":null,"work_id":"f03c12fe-7f9a-4095-93a9-ce9423cf8b82","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:5364c9a79574f309681ed5d6ff363a137f9ac2e2c9522a200f3d7c52541c79d2","observation_id":"bef419dd-3cd5-456d-9bf0-778ddba3418b","resolution":{"observed_at":"2026-07-05T15:11:10.962109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:12.061859Z","title":"Plaisted , title =","venue":null,"work_id":"45940667-13d4-413b-84dd-bc2160f2b612","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:b7e1c3c98147e6e22fcf6f00f00224120c1d471e1ba75296335a1112daf2e5d1","observation_id":"5cd38880-b0dd-4254-a063-af9eb19cb7ed","resolution":{"observed_at":"2026-07-05T15:01:12.063458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.956023Z","title":"To appear / preprint , year =","venue":null,"work_id":"3c1fe0a2-351e-4086-a584-80b33d07fc7c","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:1aadda97ff0ef27f09211f56817241b6722201eb5ce30bf6f874ecf9a28d88d5","observation_id":"20f48f4a-8032-425d-831b-51b4a97f3179","resolution":{"observed_at":"2026-07-05T15:11:10.957439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:12.056339Z","title":"Mignotte , title =","venue":null,"work_id":"31301ae2-c80d-47ca-8dff-060a907123c2","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:9ad06d178d9a47e6747f22f8898eebdd46ca804f76b8fa8d56bdc87f98708edd","observation_id":"40696a93-65d1-461f-a419-61caaf313b83","resolution":{"observed_at":"2026-07-05T15:01:12.058165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:12.053191Z","title":null,"venue":null,"work_id":"0fd5701d-dc00-4043-bc27-21f855ab28e0","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:501060763874385c6374ffe2bbdb181fd22a8047bfc9de7e3c04604f2112b856","observation_id":"eab14186-7e66-4b6d-8d6b-90c814a975d8","resolution":{"observed_at":"2026-07-05T15:01:12.055205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.964899Z","title":"Rendiconti Lincei -- Matematica e Applicazioni , volume =","venue":null,"work_id":"d5197cde-caa2-42c8-94d3-5604d9495068","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:6a402d1a1e86e88044d8084681a78a71598202879e7508ba1a6c6bda8037e5b3","observation_id":"ae7aff82-c454-4edd-9b78-5b127bea5a6f","resolution":{"observed_at":"2026-07-05T15:11:10.966213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:12.059230Z","title":"Mathematics of Computation , volume =","venue":null,"work_id":"b024182a-febf-41c8-b4a4-d52330934388","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:8131a3e7de95bcc0c02926277f3b6b6eaf07a7857fa4bad83c4b1efe3b6096b4","observation_id":"d808c6f7-3528-4d3f-9d3e-457ac75a00b6","resolution":{"observed_at":"2026-07-05T15:01:12.060913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:11:10.962732Z","title":null,"venue":null,"work_id":"304d47f8-feae-43f7-ab63-37f4fa09b7e5","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:eeef0156981b11ddddf945f803fe542cc7575e94f8e5380a6530d1070ef61067","observation_id":"fe29da74-9470-4d1f-a7ca-48f8dfbf73c4","resolution":{"observed_at":"2026-07-05T15:11:10.964263Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.829449Z","title":"Inventiones Mathematicae , volume =","venue":null,"work_id":"902cc03f-c43e-4c90-ad5a-02b5eb48f768","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:837c1783df0a6a768d0f8f39ac84543b5a834c9e5ad41ac3cd2c559ba3431aaa","observation_id":"019cb70e-11d1-461e-8e37-b8a6ce72d5d4","resolution":{"observed_at":"2026-07-05T15:01:15.831621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:15.823007Z","title":"Acta Arithmetica , volume =","venue":null,"work_id":"7948ef07-69cb-48c1-a574-fed5c08ea110","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:921b5339e52959bea4ffe83d0e54f691f2b67c5cc068327e6bcb332a2fb82464","observation_id":"a4c663f2-c143-40fe-805a-72eba3df808b","resolution":{"observed_at":"2026-07-05T15:01:15.824702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-05T15:01:12.041932Z","title":"Journal of Symbolic Computation , volume =","venue":null,"work_id":"08c256f1-126d-4836-9ede-ce2bc07fc792","year":null},"citing_paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-03T03:44:15.163828Z"},"links":{"citing_paper":"/paper/2607.02364"},"observation_digest":"sha256:12348499cd549da11626ca3b5a8f8a3eecf00e4c09bb4770ae713a39f7839241","observation_id":"def492f5-5d73-4d5c-a361-508881f1e7c6","resolution":{"observed_at":"2026-07-05T15:01:12.043555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.02364","last_updated":"2026-07-02T16:06:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T10:23:58.980213Z","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":19},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 1 inbound Pith citation observation for arXiv:2607.02364."}