{"as_of":"2026-08-19T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c85f9c2d989b61ccc6317f5bfe14a319dfb0f2676bb70f0455010c55fe34db4","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-19T06:32:44.657259+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-02T05:57:56.782694Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.06961","last_updated":"2021-11-12T22:08:10Z","snapshot_observed_at":"2026-08-16T17:42:10.626102Z","submitted_at":"2021-11-12T22:08:10Z","title":"Adversarially Robust Learning for Security-Constrained Optimal Power Flow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.06961","snapshot_observed_at":"2026-08-02T05:57:56.782694Z","title":"Adversarially robust learning for security-constrained optimal power flow,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13221","last_updated":"2026-07-14T19:29:59Z","snapshot_observed_at":"2026-08-17T23:11:09.108555Z","submitted_at":"2026-07-14T19:29:59Z","title":"Audited Selective Verification for Risk-Controlled N-1 Thermal Contingency Screening under Deployment Shift","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T05:57:56.782694Z"},"links":{"cited_paper":"/paper/2111.06961","citing_paper":"/paper/2607.13221"},"observation_digest":"sha256:c3fa8f4ceaef506440b13635652e4f567466971a91f5c1ebdb8ab3c6df3ea84b","observation_id":"3a020f94-58e9-4470-a768-7bb1ff1c5052","resolution":{"observed_at":"2026-08-02T05:57:56.782694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.06961/citation-record","integrity":"/paper/2111.06961/integrity","json":"/paper/2111.06961/citation-record.json","paper":"/paper/2111.06961"},"outbound":[],"paper":{"arxiv_id":"2111.06961","last_updated":"2021-11-12T22:08:10Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T17:42:10.626102Z","submitted_at":"2021-11-12T22:08:10Z","title":"Adversarially Robust Learning for Security-Constrained Optimal Power Flow"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.06961."}