{"as_of":"2026-08-23T00:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d29d8a6eacc0ea7c214e4435c80f24cd4227586590f8c6c186aed8db18247f46","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-22T06:32:14.747728+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-06T18:14:07.958314Z","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-06T18:14:08.268984Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.00483","last_updated":"2022-12-01T13:19:00Z","snapshot_observed_at":"2026-08-22T16:08:06.227561Z","submitted_at":"2022-12-01T13:19:00Z","title":"Enabling Fast Unit Commitment Constraint Screening via Learning Cost Model","version":1},"cited_work":{"arxiv_id":"2212.00483","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.00483","snapshot_observed_at":"2026-08-06T18:14:08.268984Z","title":"Enabling Fast Unit Commitment Constraint Screening via Learning Cost Model","venue":"math.OC","work_id":"8730eab7-f296-4c10-9142-98a5359e131c","year":2022},"citing_paper":{"arxiv_id":"2507.09280","last_updated":"2025-07-12T13:33:33Z","snapshot_observed_at":"2026-08-14T00:30:24.360132Z","submitted_at":"2025-07-12T13:33:33Z","title":"Vertex-Guided Redundant Constraints Identification for Unit Commitment","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:14:07.958314Z"},"links":{"cited_paper":"/paper/2212.00483","citing_paper":"/paper/2507.09280"},"observation_digest":"sha256:6504c5b85ddfff345a986d9fb4ced828b0c0eef9ba1636596dbddf165d67c589","observation_id":"f8f6be9a-8ccd-419e-aa52-f40a7f9f3af4","resolution":{"observed_at":"2026-08-06T18:14:08.282180Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.00483/citation-record","integrity":"/paper/2212.00483/integrity","json":"/paper/2212.00483/citation-record.json","paper":"/paper/2212.00483"},"outbound":[],"paper":{"arxiv_id":"2212.00483","last_updated":"2022-12-01T13:19:00Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-22T16:08:06.227561Z","submitted_at":"2022-12-01T13:19:00Z","title":"Enabling Fast Unit Commitment Constraint Screening via Learning Cost Model"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2212.00483."}