{"as_of":"2026-08-23T00:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5dab8ad1fa882de2091bbb6129362b0959526203a82ce6ab01b51e7dcb77629f","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.945154Z","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.325939Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.05746","last_updated":"2022-03-14T16:19:55Z","snapshot_observed_at":"2026-08-16T18:32:08.384551Z","submitted_at":"2021-04-12T18:14:27Z","title":"Cost-driven Screening of Network Constraints for the Unit Commitment Problem","version":3},"cited_work":{"arxiv_id":"2104.05746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.05746","snapshot_observed_at":"2026-08-06T18:14:08.325939Z","title":"Cost-driven Screening of Network Constraints for the Unit Commitment Problem","venue":"math.OC","work_id":"c66af95c-c992-4dc4-8537-676350265883","year":2021},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:14:07.945154Z"},"links":{"cited_paper":"/paper/2104.05746","citing_paper":"/paper/2507.09280"},"observation_digest":"sha256:2ee52144a9295a9a7dc8a6b82a95f3dab56212efd2ce9f42b11afa344a783b7f","observation_id":"64b33680-7cfb-480e-90de-714be9342315","resolution":{"observed_at":"2026-08-06T18:14:08.335581Z","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/2104.05746/citation-record","integrity":"/paper/2104.05746/integrity","json":"/paper/2104.05746/citation-record.json","paper":"/paper/2104.05746"},"outbound":[],"paper":{"arxiv_id":"2104.05746","last_updated":"2022-03-14T16:19:55Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T18:32:08.384551Z","submitted_at":"2021-04-12T18:14:27Z","title":"Cost-driven Screening of Network Constraints for the Unit Commitment Problem"},"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:2104.05746."}