{"as_of":"2026-08-15T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4498dc75876238de5c8e2516c65f55021250d2ca089314b9eb35262b1df25d1a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:39:39.378912Z","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-07-02T21:27:24.323122Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-14T15:39:39.378912Z","title":"General heuristics for n onconvex quadratically con- strained quadratic programming","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.00735","last_updated":"2020-01-27T09:47:49Z","snapshot_observed_at":"2026-08-15T07:31:48.536459Z","submitted_at":"2019-08-02T07:51:37Z","title":"Efficient computation of counterfactual explanations of LVQ models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:39:39.378912Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/1908.00735"},"observation_digest":"sha256:9b5c1d54bf83ef618c6d40122c9561e8045631a9a17a9c692c447e8feda1e8a7","observation_id":"21875b29-118a-4219-8e50-a88325e9b046","resolution":{"observed_at":"2026-08-14T15:39:39.378912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-14T05:16:51.624885Z","title":"and Boyd, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1909.01675","last_updated":"2020-06-08T15:21:09Z","snapshot_observed_at":"2026-08-14T05:08:07.607182Z","submitted_at":"2019-09-04T10:13:14Z","title":"Testing nonparametric shape restrictions","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T05:16:51.624885Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/1909.01675"},"observation_digest":"sha256:88a499b6c08e61c29db0dee6c80b44e7bcbb829a5ef42ae81eae2937ee82366c","observation_id":"e37d3661-3b45-44aa-80fb-f01ec09751a3","resolution":{"observed_at":"2026-08-14T05:16:51.624885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-14T05:16:24.979387Z","title":"Park and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1909.01778","last_updated":"2019-09-04T13:16:52Z","snapshot_observed_at":"2026-08-14T23:20:43.661213Z","submitted_at":"2019-09-04T13:16:52Z","title":"Sequential Convex Restriction and its Applications in Robust Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T05:16:24.979387Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/1909.01778"},"observation_digest":"sha256:0f869a536944da8b93da47beea0e7c6bd0e21e5f233e8e68c1216c7317f79585","observation_id":"75fabf0b-e1c3-4af1-8c35-741063d3f43b","resolution":{"observed_at":"2026-08-14T05:16:24.979387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-07T11:04:14.481306Z","title":"General heuristics for nonconvex quadrat- ically constrained quadratic programming,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-09T21:46:18.932110Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.481306Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:7a2f20992eaefa1f511efe63232d7fc2addf63fa4cd69a897f2100dbf6e9be9b","observation_id":"02e3b2e0-f380-4673-a89c-819c043bf999","resolution":{"observed_at":"2026-08-07T11:04:14.481306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-06T16:11:33.783603Z","title":"Park and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.14489","last_updated":"2025-07-19T05:13:59Z","snapshot_observed_at":"2026-08-09T19:25:02.114099Z","submitted_at":"2025-07-19T05:13:59Z","title":"Coherent Ising Machines: The Good, The Bad, The Ugly","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T16:11:33.783603Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2507.14489"},"observation_digest":"sha256:86a7efd6e334633e93a3edb9419b80d8b133e9e6891ae1bd96ce05208d3379a5","observation_id":"8d26b03c-3ebc-4771-9883-1060a60507a5","resolution":{"observed_at":"2026-08-06T16:11:33.783603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-04T13:23:24.413402Z","title":"General heuristics for nonconvex quadratically constrained quadratic program- ming.arXiv:1703.07870, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.01128","last_updated":"2026-07-05T16:59:44Z","snapshot_observed_at":"2026-08-13T09:25:02.579209Z","submitted_at":"2025-10-01T17:17:37Z","title":"Indexed singular value bounds on scattering operators: How many channels can a photonic device support?","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T13:23:24.413402Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2510.01128"},"observation_digest":"sha256:b93bbc4e1971b7094126ad991799880eda29bb5a026f3a25a48c56d9e78c91dc","observation_id":"b7567899-6883-4fad-8675-9a8fa1ce1d56","resolution":{"observed_at":"2026-08-04T13:23:24.413402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":"1703.07870","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-07-02T21:27:24.323122Z","title":"General heuristics for nonconvex quadratically con- strained quadratic programming","venue":"math.OC","work_id":"a618b926-3cf6-478a-9b2e-cc38bdda2eee","year":2017},"citing_paper":{"arxiv_id":"2605.04736","last_updated":"2026-05-06T10:34:52Z","snapshot_observed_at":"2026-08-11T02:16:52.794741Z","submitted_at":"2026-05-06T10:34:52Z","title":"Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T17:30:54.314708Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2605.04736"},"observation_digest":"sha256:30960d8aed33270dd3c6d1c97db3c467bba45db041875295ec77a26e9af1b545","observation_id":"d9412658-2548-4f5c-87cc-5781206796dd","resolution":{"observed_at":"2026-05-11T17:31:06.854101Z","resolver_source":"arxiv_id","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":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":"1703.07870","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-07-02T21:27:24.323122Z","title":"General heuristics for nonconvex quadratically con- strained quadratic programming","venue":"math.OC","work_id":"a618b926-3cf6-478a-9b2e-cc38bdda2eee","year":2017},"citing_paper":{"arxiv_id":"2606.07912","last_updated":"2026-06-06T00:22:59Z","snapshot_observed_at":"2026-08-06T23:36:40.095823Z","submitted_at":"2026-06-06T00:22:59Z","title":"On Improved Statistical Accuracy of Low-Order Polynomial Chaos Approximations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T19:46:44.753264Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2606.07912"},"observation_digest":"sha256:edd0640408842837c346359534f6e17a45554f2d6d3c1d8a8dc4ddddead56894","observation_id":"455922fc-c768-4ed2-9bc0-1a29fea9db02","resolution":{"observed_at":"2026-07-02T21:27:24.325181Z","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":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-07T20:08:01.383678Z","title":"General heuristics for nonconvex quadratically constrained quadratic programming,","venue":null,"work_id":null,"year":2017},"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":18,"source":"pdf_text","source_observed_at":"2026-08-07T20:08:01.383678Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2608.05978"},"observation_digest":"sha256:497b0bfc2be759d04b05348515ebd9fad7af5fc2633f9217f690855a6dd64ec7","observation_id":"d7fbebf6-e91c-4408-89e5-81d1d3d0974a","resolution":{"observed_at":"2026-08-07T20:08:01.383678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-11T04:21:59.017348Z","title":"General heuristics for nonconvex quadratically constrained quadratic programming,","venue":null,"work_id":null,"year":2017},"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":18,"source":"pdf_text","source_observed_at":"2026-08-11T04:21:59.017348Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2608.05978"},"observation_digest":"sha256:fd86cb72291eb709df34e564e8ed29a4b62735714351ca1c432437d40abb1711","observation_id":"a40c98ea-19c3-47cb-8801-7f63dfff6693","resolution":{"observed_at":"2026-08-11T04:21:59.017348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1703.07870/citation-record","integrity":"/paper/1703.07870/integrity","json":"/paper/1703.07870/citation-record.json","paper":"/paper/1703.07870"},"outbound":[],"paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T21:10:28.204503Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:1703.07870."}