{"as_of":"2026-08-15T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82fada436d692273366abdb820be7479010baaa9fb48c687b8b05f8f3cba6371","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:16:24.964768Z","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-14T05:16:25.035058Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.09483","last_updated":"2020-02-15T16:55:50Z","snapshot_observed_at":"2026-08-14T16:12:22.286803Z","submitted_at":"2019-06-22T18:58:21Z","title":"Feasible Path Identification in Optimal Power Flow with Sequential Convex Restriction","version":3},"cited_work":{"arxiv_id":"1906.09483","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.09483","snapshot_observed_at":"2026-08-14T05:16:25.035058Z","title":"Feasible Path Identification in Optimal Power Flow with Sequential Convex Restriction","venue":"math.OC","work_id":"1aad277f-3090-468a-810d-92616c106fdc","year":2019},"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":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:16:24.964768Z"},"links":{"cited_paper":"/paper/1906.09483","citing_paper":"/paper/1909.01778"},"observation_digest":"sha256:4b148f41927baf7874bd0c0e3958f79223a52764186d632002200ac8ce210eff","observation_id":"3d36c3ea-7132-4bcf-95dc-811399929968","resolution":{"observed_at":"2026-08-14T05:16:25.041730Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1906.09483/citation-record","integrity":"/paper/1906.09483/integrity","json":"/paper/1906.09483/citation-record.json","paper":"/paper/1906.09483"},"outbound":[],"paper":{"arxiv_id":"1906.09483","last_updated":"2020-02-15T16:55:50Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T16:12:22.286803Z","submitted_at":"2019-06-22T18:58:21Z","title":"Feasible Path Identification in Optimal Power Flow with Sequential Convex Restriction"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1906.09483."}