{"as_of":"2026-08-17T02:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:75e3320a4318de4972e7e43fc92db2d9f302daddb9f58c8bb81bd6c60ee98d4e","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:45:44.078509Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2507.02120/citation-record","integrity":"/paper/2507.02120/integrity","json":"/paper/2507.02120/citation-record.json","paper":"/paper/2507.02120"},"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-06T20:45:47.491081Z","title":"Bakonyi and C.R","venue":null,"work_id":"72583b24-b92b-46cb-9635-66b4a5f74eae","year":1995},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:41.985025Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:4649ce462102ae4c4c25a1ad36bde61b66829b1f75bf148e90c71248c9d0bfb1","observation_id":"f2fc04b5-b83a-471f-bf7b-bda10d9ec43d","resolution":{"observed_at":"2026-08-06T20:45:47.544444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:47.396873Z","title":"Bertsimas and D","venue":null,"work_id":"8823dd7a-9811-4b4d-94a7-63b6d979604b","year":2022},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.067813Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:0f9a16c2f721bd486c510123e236578390bb1b483cd28e36c37170474b242a2c","observation_id":"d2cc589a-07dd-4320-93e7-2f02cc933b96","resolution":{"observed_at":"2026-08-06T20:45:47.457586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:47.245809Z","title":"Bertsimas, D","venue":null,"work_id":"3f017cf1-8bd3-49a5-99b9-3f1841950f3f","year":null},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.164519Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:0334010395d66ee42c3cb976b8067956066e9b3d511e3b83426aef5fddd818e1","observation_id":"2709d519-8f2f-4d95-b6b2-784d294d7cf3","resolution":{"observed_at":"2026-08-06T20:45:47.344899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:47.129374Z","title":"Bertsimas, D","venue":null,"work_id":"717b5f72-032a-4374-a907-5d4ffb06db9c","year":null},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.242995Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:ac04efdf2c4553388fda338289d98ee95f514558054f301f95cf88267dd09d27","observation_id":"deba728b-fe26-42bc-85ec-53041545285f","resolution":{"observed_at":"2026-08-06T20:45:47.173930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:47.024756Z","title":"Boyd, S.J","venue":null,"work_id":"6bf22795-8c99-4e7a-90ac-7550543f683f","year":2007},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.346578Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:c7afa7d044dd8bfc3bbfff7c435def3b94cd8f04c11a816c09191b964d42b580","observation_id":"b09e0e2c-0b0e-47ce-93c7-a5a93ff2640f","resolution":{"observed_at":"2026-08-06T20:45:47.065303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.939197Z","title":"Burer and A","venue":null,"work_id":"c41531c0-b8d3-4a7d-9c4f-0d399360926d","year":2009},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.434934Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:83f66d6214dde4c7877dab3fc15815da5f6e39fee0e13881f7e17d75f342d28e","observation_id":"e6f9ab7f-96c5-4dff-bf8f-f2f2fedfd279","resolution":{"observed_at":"2026-08-06T20:45:46.982143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.823440Z","title":"Dalkiran and H.D","venue":null,"work_id":"1045e544-155e-47b2-9aaa-6708067d7c50","year":2016},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.508329Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:f101078b8e8e30343d2c178bc6fd0979bb8dae66251748b4db9494bbf5ff191e","observation_id":"cf584c29-f51c-40ca-bb5e-a11138e50f9d","resolution":{"observed_at":"2026-08-06T20:45:46.884506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.676598Z","title":"Gershgorin","venue":null,"work_id":"9483a5be-a6c0-4f2d-97f4-0014ad21f9aa","year":1931},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.595755Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:f7ad50fcd109d18a9a53cc7b7ee1982d509a960665d59b98c793cfcc86b7b218","observation_id":"a9fffa76-5ca5-48b0-bc18-ee92e166cc6d","resolution":{"observed_at":"2026-08-06T20:45:46.737680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.543094Z","title":"Lasserre","venue":null,"work_id":"e179e4d9-9dde-43a7-bbaa-499092d2d5a4","year":2001},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.684442Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:278a29a7ec594238fba40c6020870d7e9482035a7e286a369cd9945d46fa9208","observation_id":"4220e759-bb94-45d1-a521-e0ca22807a8f","resolution":{"observed_at":"2026-08-06T20:45:46.602374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.345817Z","title":"Lasserre","venue":null,"work_id":"ca9f3f8d-1ee5-43ea-93d6-1533544b4928","year":2008},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.803607Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:6587aacda06a81c1848dcfe398aa6678a7d13c56a8ec3f7eef51ce8092eeb699","observation_id":"1e2fcbab-af7a-4252-89f4-a91a9827bd5b","resolution":{"observed_at":"2026-08-06T20:45:46.444899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.210638Z","title":"Lasserre","venue":null,"work_id":"af1ee6c1-a9b0-4171-954f-d7f2650322bd","year":2009},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.878008Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:9b0c45c06a69d3a08392040f6cac7eb1e8edd74df48384bc6d4a14a610d4e5e6","observation_id":"d2cf2b32-a8c0-45c7-a684-5e970da3bccc","resolution":{"observed_at":"2026-08-06T20:45:46.274680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:46.082622Z","title":"Lavaei and S.H","venue":null,"work_id":"4488f4b5-317f-4f01-b78a-356f811f3c76","year":2011},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:42.992785Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:8713a8f4b4645cf511eab7a1a1fd50194d768cab52e4af4fe2d1a32a2922a3e6","observation_id":"40cb49c2-9718-4b2d-865f-ded4ab687917","resolution":{"observed_at":"2026-08-06T20:45:46.138220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:45.908289Z","title":"Majumdar, A.A","venue":null,"work_id":"e0fe7f47-c8f0-4b85-abe5-6e502ce6ccf9","year":2014},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.076171Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:8e1f57f65caa43a906908adea7c82d61a9403461011ef6348a98b811ca1a6f25","observation_id":"41d4dda9-a599-4d43-80be-af2ab0d5ab86","resolution":{"observed_at":"2026-08-06T20:45:45.976094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:45.745274Z","title":"The MOSEK optimization toolbox for MATLAB manual","venue":null,"work_id":"3c4d30a2-51c0-4105-b651-6f7c70ded824","year":2024},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.182571Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:e9186bf46e2a7d63745f68aa842d81386b5f134afb7a0bdcbdc3d8b653a5c64e","observation_id":"fb0fd053-193e-4dbb-9e0b-e918b7fafb59","resolution":{"observed_at":"2026-08-06T20:45:45.812284Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:45.607442Z","title":"Mutapcic and S","venue":null,"work_id":"6577a848-8979-49c3-8d9a-5d8fa81d2fa6","year":2009},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.273727Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:064b3a06de80c888f5ddb493f4e475fec5c602f9a4fa07665d4ca2e897e69d3a","observation_id":"792756cc-ccfd-4cd6-922f-28bfa048c6de","resolution":{"observed_at":"2026-08-06T20:45:45.668388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01509","last_updated":"2022-05-06T00:33:54Z","snapshot_observed_at":"2026-08-16T20:09:38.825888Z","submitted_at":"2019-06-04T15:20:48Z","title":"High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sums-of-Squares","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01509","snapshot_observed_at":"2026-08-06T20:45:43.372663Z","title":"Niu, Y.J","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.372663Z"},"links":{"cited_paper":"/paper/1906.01509","citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:3281de3dd0f6835387fb003b816d6b0d0b023266d7a2816489c724a76ca7525c","observation_id":"b6ff5a10-c530-4f8c-be08-35f8d8f8b189","resolution":{"observed_at":"2026-08-06T20:45:43.372663Z","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-06T20:45:45.448881Z","title":null,"venue":null,"work_id":"d2d20072-2419-42b6-9c75-fea42c32f5a5","year":2003},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.447056Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:e7bbdacdf6d72c7ba823eeb1108b58d1d11b6d57c59c4498f698423d25152b03","observation_id":"7d84735e-cbb6-4ab9-b6d2-e0ddfc5e6dc8","resolution":{"observed_at":"2026-08-06T20:45:45.519848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:45.286558Z","title":"Parrilo and B","venue":null,"work_id":"1170250d-fe7d-4a93-8c58-719f32c80290","year":2003},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.562152Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:aecb222dbe035177de80c51532817ac124f30d3ac7b55ae994918d787dcfa190","observation_id":"76ae03da-4ba1-41a2-9f94-67f23479f113","resolution":{"observed_at":"2026-08-06T20:45:45.372767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:45.159957Z","title":"Pham and Y.S","venue":null,"work_id":"6dec5274-78c7-4d27-93a9-36462127f59f","year":2011},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.669417Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:cccc1acd01f930415b37411a791133d9b6be6d482a624cbfd4f5437838d9273c","observation_id":"4a22c034-8551-40fa-a1dc-34f0ffaaacea","resolution":{"observed_at":"2026-08-06T20:45:45.213444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:44.951122Z","title":"Prajna, A","venue":null,"work_id":"f5b19ca3-ffd9-441e-bc50-6eaffc2479c2","year":2002},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.748001Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:02fdf20dd617cc7375d0e06b51db69f887eedda039c6e1d98e38c36e77bb366a","observation_id":"d2db756b-af23-4601-be1c-7e9e708cc6c4","resolution":{"observed_at":"2026-08-06T20:45:45.024357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:44.776795Z","title":null,"venue":null,"work_id":"9914f15a-6084-4244-b8d6-6894f871aa84","year":2000},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.828251Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:8ba7a95852de5a6b4056ade0498c0173abab20d6e37da7dd63f4f2d6ebf578eb","observation_id":"30e6d55a-646d-4ac3-a062-3cfd9112d0c7","resolution":{"observed_at":"2026-08-06T20:45:44.838475Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:44.611781Z","title":"Sahinidis","venue":null,"work_id":"928f3a7c-8b5c-4809-ba96-acbc0c67c6a4","year":1996},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.902009Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:a0ffddca05220c28f6de8ae2e2fb366e1014f13d03767415f75391ed62a60967","observation_id":"dd0c2db6-c39d-45c4-86f8-2afc14e0d99c","resolution":{"observed_at":"2026-08-06T20:45:44.674098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:44.415163Z","title":"Sherali and W","venue":null,"work_id":"5364a799-3e85-4382-8ab8-a33fbfad2f9d","year":1990},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:43.989016Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:ef5a2a20435033add0e2b7ab6c0432ab529b69a9021dfb24cb524c6dd44cc3c2","observation_id":"e2884e8d-0824-486d-9e85-c314daa26de0","resolution":{"observed_at":"2026-08-06T20:45:44.511254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T20:45:44.211872Z","title":"Sherali and W","venue":null,"work_id":"8543a28f-3ab2-4671-85ac-0b6a426a7956","year":1999},"citing_paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T20:45:44.078509Z"},"links":{"citing_paper":"/paper/2507.02120"},"observation_digest":"sha256:648622040c3b25765319e6aa29903f15cd5e05cfa914b99bf73f50305809b102","observation_id":"877d7312-d969-4d19-a7a9-8bfc752237ed","resolution":{"observed_at":"2026-08-06T20:45:44.342918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.02120","last_updated":"2025-07-02T20:05:27Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T12:05:53.266595Z","submitted_at":"2025-07-02T20:05:27Z","title":"A novel exact approach to polynomial optimization"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":24},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2507.02120."}