{"as_of":"2026-08-15T12:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:147fc61b20a0e972a44218cfee2c0b569f9d7dc5709243850680245750aef565","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T06:10:52.758336Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:21:59.008556Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T20:08:01.437077Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"cited_work":{"arxiv_id":"2502.08210","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08210","snapshot_observed_at":"2026-08-07T20:08:01.437077Z","title":"A new method for reducing algebraic programs to polynomial programs","venue":"math.OC","work_id":"206a0ace-e106-4590-a310-dd0432418adb","year":2025},"citing_paper":{"arxiv_id":"2608.05978","last_updated":"2026-08-10T09:28:12Z","snapshot_observed_at":"2026-08-15T02:49:42.861898Z","submitted_at":"2026-08-06T12:56:30Z","title":"Exact DC Representation of Multi-Tier Offloading Product in SAGINs via Quantifier Elimination","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T20:08:01.374520Z"},"links":{"cited_paper":"/paper/2502.08210","citing_paper":"/paper/2608.05978"},"observation_digest":"sha256:9f61098843c43b18c337b6653b23694851e1a688fbd9df08dd4e7383a110ad3c","observation_id":"f8308ff2-f026-4a78-8136-f744a886e4b9","resolution":{"observed_at":"2026-08-07T20:08:01.443872Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08210","snapshot_observed_at":"2026-08-11T04:21:59.008556Z","title":"A new method for reducing algebraic programs to polynomial programs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05978","last_updated":"2026-08-10T09:28:12Z","snapshot_observed_at":"2026-08-15T02:49:42.861898Z","submitted_at":"2026-08-06T12:56:30Z","title":"Exact DC Representation of Multi-Tier Offloading Product in SAGINs via Quantifier Elimination","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T04:21:59.008556Z"},"links":{"cited_paper":"/paper/2502.08210","citing_paper":"/paper/2608.05978"},"observation_digest":"sha256:0a65dd7b1c6782ea78e3e058e45956566e98f57f1daca3ef8278f650c1dda866","observation_id":"67cdf057-0760-47dd-ae8b-7dbff96b1f45","resolution":{"observed_at":"2026-08-11T04:21:59.008556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08210/citation-record","integrity":"/paper/2502.08210/integrity","json":"/paper/2502.08210/citation-record.json","paper":"/paper/2502.08210"},"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-08T06:10:53.456652Z","title":"Mémoire sur les équations algébriques, ou l'on démontre l'impossibilité de la résolution de l'équation générale du cinquième degré","venue":null,"work_id":"f691986d-c189-4093-ac99-109c61138e36","year":null},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.192849Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:63c398bd6c371b5b8eb5a315cd90843de66e30616206bc1ee421faa599419cf6","observation_id":"d5cc47ef-5b42-4aa7-bd1f-f056a91bd861","resolution":{"observed_at":"2026-08-08T06:10:53.460414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.446897Z","title":"Démonstration de l'impossibilité de la résolution algébrique des équations générales qui passent le quatrième degré","venue":null,"work_id":"190c127b-4589-4083-8286-eaefadacdd71","year":null},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.216628Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:3ec8fc9def378ea6c5e2a01372271b4de6e344849aa20a8dad28408444b5a5c3","observation_id":"c8fd7072-0ad2-4e50-be9d-afd906b7288e","resolution":{"observed_at":"2026-08-08T06:10:53.450261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.15388/na.2005.10.4.15110","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Akritas and Adam W","venue":"Nonlinear Analysis Modelling and Control","work_id":"23ddb5c5-5834-41bb-b5cd-bdd3a710aa55","year":2005},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.254670Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:1f5f751814d1f7d761e32ff5a452c72d194198284ff9bfa510b99f4925bb1aa9","observation_id":"00ea687e-0157-475e-ad5b-cb09e9522fba","resolution":{"observed_at":"2026-08-08T06:10:53.037855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:52.318582Z","title":"U ber die zerlegung definiter funktionen in quadrate. Abhandlungen aus dem Mathematischen Seminar der Universit \\","venue":null,"work_id":null,"year":1927},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.318582Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:89b5da8dbbc438922502dc9289560e33f5601db2dabadf3887775fb4b07f212d","observation_id":"eaaf1923-928d-40c9-9fe8-8594c9968a50","resolution":{"observed_at":"2026-08-08T06:10:52.318582Z","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-08T06:10:53.437311Z","title":null,"venue":null,"work_id":"d6326a86-4049-4ad2-8a9b-0b8dea01b89b","year":1999},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.349986Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:30a5372026bc42657f5648819169960bd36f13fe90f71b3382558844cd800dcf","observation_id":"b3c66411-b80c-4cdd-adb6-19e434466eb4","resolution":{"observed_at":"2026-08-08T06:10:53.440520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.426899Z","title":"On the number of cells defined by a family of polynomials on a variety","venue":null,"work_id":"637c82ce-b1ad-413b-bdec-ba6794fdb822","year":1996},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.388294Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:6e0606bd0aea75b31a6b4af2acc29356eade7468a6ef7647835f82116e682a54","observation_id":"0d8cbf60-7b3f-4864-b396-6fdcb24596be","resolution":{"observed_at":"2026-08-08T06:10:53.430501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.416067Z","title":"Algorithms in Real Algebraic Geometry","venue":null,"work_id":"e290f931-d507-41fe-a69b-ab0ee9cfcaa2","year":2006},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.392801Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:449d738f9b544559a86ddfce5e54da8bc05f14e64bf3d97d3b3d2cee99a25a26","observation_id":"77844dcf-b41b-4582-b0dc-320167949a06","resolution":{"observed_at":"2026-08-08T06:10:53.419801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:52.396648Z","title":"Semidefinite optimization and convex algebraic geometry","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.396648Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:6a9cac12bcf605f688718d2d964e23dafc7fcb41894bb5d0c4b075986be60c1d","observation_id":"734491a5-c6aa-46df-8dec-065bfc5580ba","resolution":{"observed_at":"2026-08-08T06:10:52.396648Z","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-08T06:10:53.398047Z","title":"A tutorial on geometric programming","venue":null,"work_id":"5f571be9-a64e-4ff1-b6e5-f0ff62237c24","year":2007},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.401629Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:cc216462a33c1f5aebc813a7a3de079b9256dbb1f7fbf00a3ed8c230979e856d","observation_id":"6ed799a9-ff63-4596-a9be-76f6760056f8","resolution":{"observed_at":"2026-08-08T06:10:53.402360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.387712Z","title":null,"venue":null,"work_id":"eba888f6-5b85-40cc-8587-f58cab00abee","year":1988},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.405109Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:0777ffc7c11c857408c34f41cfdf620701b3c6a4b7fead8464e3abe440c48323","observation_id":"74ebb63d-2d5d-43b3-b3a3-e84b18fa607d","resolution":{"observed_at":"2026-08-08T06:10:53.391109Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.377258Z","title":"Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report","venue":null,"work_id":"1a5ed6d5-3afe-4ee3-ab10-5a78ac2cfde1","year":1974},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.408476Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:f973ba7b46109304c2fd1bd67757aded7a7ef17474690a8f8772d90e58fe1b91","observation_id":"18da9c12-fb35-4e0a-bd03-b35125142a49","resolution":{"observed_at":"2026-08-08T06:10:53.380633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.367481Z","title":"Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets","venue":null,"work_id":"c331b5e8-b9f8-404a-bf37-6502fa4d3105","year":1988},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.412136Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:0a24c75bc6cfeef5cb23559d78be52c9c8e554487db769c81acd255a8047b662","observation_id":"dd63c9b3-39de-472c-91c3-be8bf4968090","resolution":{"observed_at":"2026-08-08T06:10:53.370837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.358672Z","title":"Z3: An efficient smt solver","venue":null,"work_id":"28425e05-21aa-42a3-9389-145da2d8041e","year":2008},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.415257Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:711902b80a8c173cb3d2eac367dd8bd348aa2b2784540b3486ae30ff02b76fcc","observation_id":"fb5c297e-eb81-4e9d-adac-3d188e325994","resolution":{"observed_at":"2026-08-08T06:10:53.361701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01444162","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Ueber die vollen invariantensysteme","venue":"Mathematische Annalen","work_id":"60efc6cd-102e-4ded-bcce-d2cf53b10eb0","year":null},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.418473Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:97ecbd0a5fd98399632e3358fea85679267f58d2c5b329885518ff21ea30ec39","observation_id":"67eb8ccc-a6b0-482e-b9b5-8882388f9d91","resolution":{"observed_at":"2026-08-08T06:10:53.015493Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.349143Z","title":"Global optimization of rational functions: a semidefinite programming approach","venue":null,"work_id":"5c174683-8b2e-4e1e-b563-ab57c60f12e0","year":2006},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.421708Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:020a878170ac3d020b585011cb2f10c237dc17aa5474de4954e094755998ee39","observation_id":"9536f1e3-5001-4827-b321-88306fe4a8c1","resolution":{"observed_at":"2026-08-08T06:10:53.353007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.339788Z","title":"Solving non-linear arithmetic","venue":null,"work_id":"a6b13255-13e0-45a7-8d87-04edbc6e5e40","year":2013},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.425972Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:2c7a7f2d6392145040fd302b2b199383fe6e10eaf335b41d6d86ea8236ff2543","observation_id":"f553813b-3769-499c-a056-5368c1f599c7","resolution":{"observed_at":"2026-08-08T06:10:53.343028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.329699Z","title":"Algebraic Functions, pages 119--134","venue":null,"work_id":"1ee783fa-516f-4333-8eb3-e87f208bec09","year":1996},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.429095Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:041a2505640b169b6d818d725f7d9f52f23520754ed638b643d33e1a26a76793","observation_id":"39861e28-ae3a-4fd4-8609-a5059dd865c5","resolution":{"observed_at":"2026-08-08T06:10:53.333064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02807438","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Journal d Analyse Mathématique","work_id":"a2a0f9c5-a5be-4abc-be10-ddb32841fda8","year":1964},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.432179Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:e39aedc325e2e2a1e283cf2d9be3fc4d2dd4193b8504fcfd896f577e5805c29b","observation_id":"833812a7-757b-402f-8b3c-eef1be6fd07b","resolution":{"observed_at":"2026-08-08T06:10:52.917257Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.319837Z","title":"Semidefinite programming for min--max problems and games","venue":null,"work_id":"216b6c38-4795-400f-ac7e-4b8d42cb8eb5","year":2012},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.436226Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:b5dfb6f2544d69696b396e1f8b2def8a83575349da5d713880b6968c4d35d957","observation_id":"305b3028-aa6d-4537-bb90-c8752e6df522","resolution":{"observed_at":"2026-08-08T06:10:53.323208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.310204Z","title":"Global optimization with polynomials and the problem of moments","venue":null,"work_id":"6e866545-372a-437f-aea7-5e474968236a","year":2001},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.439266Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:4bf9be4d09dcecfdc6a24c7d5f3a5f1c6521b82c40b62554eb20fea1ba70f213","observation_id":"e7ad6f77-0624-4427-9221-d2e6a5177757","resolution":{"observed_at":"2026-08-08T06:10:53.313668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.299892Z","title":"Semidefinite programming relaxations for semialgebraic problems","venue":null,"work_id":"c2676902-7157-418b-a050-c381dab1f24b","year":2003},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.443459Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:01ca256eee4c144650445fb3175954c1ce7c8e2af61963bf7690b4ad5d471bdb","observation_id":"d05de7ae-dcd7-4cbd-8986-ebc86de2a3f7","resolution":{"observed_at":"2026-08-08T06:10:53.302917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:52.446846Z","title":"Positive polynomials on compact semi-algebraic sets","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.446846Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:58f63d320ad7373442efb7e1cf8d441cf0d4b495a0b8cbdac294e3000a3bb89e","observation_id":"b295e045-8b13-468c-aa88-2ec36cf66a02","resolution":{"observed_at":"2026-08-08T06:10:52.446846Z","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-08T06:10:53.290392Z","title":"Riflessioni intorno alla soluzione delle equazioni algebraiche generali opuscolo del cav","venue":null,"work_id":"8e0577fd-7212-4e2a-8f3d-89ed874336ed","year":null},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.449877Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:395ef91a2ec846be0acc4666e6cfe98af4783e8be908d5f120ea3e94908a256f","observation_id":"62f2a6f0-d9f3-4d14-91de-b69e390e6de6","resolution":{"observed_at":"2026-08-08T06:10:53.293660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.21105/joss.03915","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"PICOS : A Python interface to conic optimization solvers","venue":"The Journal of Open Source Software","work_id":"a109ceb9-a3fa-45e5-8bee-f288687a401d","year":2022},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.453785Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:1a821e43a7900eae86314dc3c3cdd6648b626060e84be8bf4dfed6b27ccdd7cf","observation_id":"e233411c-1c4a-4c8f-9507-884d6ab51a94","resolution":{"observed_at":"2026-08-08T06:10:52.819381Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:52.457092Z","title":"The k-moment problem for compact semi-algebraic sets","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.457092Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:d087eb06f210752b34c472b84cdbd5c49dec268a917fde172cad92987e31d8d1","observation_id":"226b5e7c-4521-4bd7-9281-1f384d20f00e","resolution":{"observed_at":"2026-08-08T06:10:52.457092Z","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-08T06:10:53.282005Z","title":"A nullstellensatz and a positivstellensatz in semialgebraic geometry","venue":null,"work_id":"8d5fb098-2c48-46d5-896e-ace1444b8ee5","year":1974},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.460585Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:3b55bf512e9e68202a4ea1926f2fef5746aa2971b84f34fb49231c88f4ee3e1d","observation_id":"384bee1a-e542-405c-abac-3d67f15164e0","resolution":{"observed_at":"2026-08-08T06:10:53.285144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"publication/2709048","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T06:10:53.172101Z","title":"Strzebo \\'n ski","venue":null,"work_id":"50c32118-d6cf-4d5c-930c-75c0349a519e","year":1999},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.472978Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:e4ab687ba0ed5fd41b50d34d9eaf45373f0fc0bfc94171ed31f432d4e632aab4","observation_id":"0934a7a9-56d2-4c3f-8881-80a874dd931f","resolution":{"observed_at":"2026-08-08T06:10:53.177283Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.273639Z","title":"Strzebo \\'n ski","venue":null,"work_id":"17d00c8a-3edd-4a12-ad1b-d28c280331aa","year":2000},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.513931Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:34d8bc3514e30bcc07f6be51cf2a58846bb166daa16e81fc8317b6e094833df6","observation_id":"d20dcd66-de52-4729-97a2-c2d0a163824c","resolution":{"observed_at":"2026-08-08T06:10:53.276529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.264681Z","title":"Strzebo \\'n ski","venue":null,"work_id":"4202b6c0-7426-42d8-a946-939e0ec80b7b","year":2017},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.565600Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:5355ee0aedb758bf97a79e1837a8c5ca0a39b7ef44c24887788960896c32f477","observation_id":"3633ef60-c5a0-4d01-821d-22922b97c518","resolution":{"observed_at":"2026-08-08T06:10:53.268097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.254653Z","title":"Surjanovic and D","venue":null,"work_id":"e677e535-543f-4acb-8418-57f66488a9e4","year":2024},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.612873Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:d9977ba90f416509316145dcf5c54c24a6f33667ef50263563b1b0d50f55256d","observation_id":"ca33c05a-0794-4021-84e1-7a58085befae","resolution":{"observed_at":"2026-08-08T06:10:53.258188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.244846Z","title":"A decision method for elementary algebra and geometry","venue":null,"work_id":"4a94cd0b-13a4-4c1e-b3c9-118b4f4cc720","year":1951},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.641417Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:d4df64f1f9c25b9d1b3fbbb389a2b061a3ab0bb4c99eb1e510b086add1902ef2","observation_id":"c51f978a-0f74-4442-8842-87364f9a1aa5","resolution":{"observed_at":"2026-08-08T06:10:53.248499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.234692Z","title":null,"venue":null,"work_id":"d9c9205c-9fc3-4e46-9065-69cf56f4e7b7","year":1931},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.685183Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:bfcbf0011963c2defa1b229915d045221d4aeeb373d0c2d814eb0e66c7f74179","observation_id":"f03484d0-f162-40d9-9624-36e8dd4afbe0","resolution":{"observed_at":"2026-08-08T06:10:53.238400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.224683Z","title":"Geometric optimization and sums of algebraic functions","venue":null,"work_id":"196aec5e-9ea9-4df1-8c25-1982bdf8c037","year":2014},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.728393Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:df2feb6b624b6ec573ac2ed0294c4997328f5a335e3db5e021b6ef0d956970fa","observation_id":"b3211254-1951-4846-b7cc-a65f81dc0af7","resolution":{"observed_at":"2026-08-08T06:10:53.228280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.214601Z","title":"SumOfSquares.py , 2024","venue":null,"work_id":"64cc5b7c-916f-4296-949c-b30b7ffc0fcd","year":2024},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.746561Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:3918486a37de2d70a88a23a01635aade692526f3836eb3e4ebc65c470c093fd6","observation_id":"17869691-4582-4a05-9b4b-7ec6b2521424","resolution":{"observed_at":"2026-08-08T06:10:53.217943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.205043Z","title":"Geometric programming","venue":null,"work_id":"b5f1ec62-d734-4188-8007-ad4fa35a089f","year":1967},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.750286Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:28577452b4fa1b28537702408d363c075eb8ea9385aa3f795394b068b42ce9f6","observation_id":"90c0131e-43e4-4c01-bc43-23367bf5dc35","resolution":{"observed_at":"2026-08-08T06:10:53.208284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.196139Z","title":"Effective Polynomial Computation","venue":null,"work_id":"98e47675-f7cd-424b-8053-012ca1dfc3bb","year":1993},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.753836Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:e1311d0bef0a3e223b07388bf9e60aec4247b9174219d1946f81b67d02dda4e1","observation_id":"4ccac808-a48f-4fd0-9338-b9cb290650ec","resolution":{"observed_at":"2026-08-08T06:10:53.199055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08T06:10:53.186549Z","title":"Zero testing of algebraic functions","venue":null,"work_id":"a993ef14-1c50-4064-b51d-4230b1e574f9","year":1997},"citing_paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T06:10:52.758336Z"},"links":{"citing_paper":"/paper/2502.08210"},"observation_digest":"sha256:d3b189a1dc21771c4f8ada205bfd2c3390e747f1b68cb1d745eef803470e07d7","observation_id":"24093a25-3c28-4196-bb0d-a59c93a4debd","resolution":{"observed_at":"2026-08-08T06:10:53.189649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08210","last_updated":"2025-02-12T08:40:26Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T23:55:56.564858Z","submitted_at":"2025-02-12T08:40:26Z","title":"A new method for reducing algebraic programs to polynomial programs"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":5,"verified_fuzzy":25},"total_outbound_references":37},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 2 inbound Pith citation observations for arXiv:2502.08210."}