{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PZCGFTM4HU3GVTREHKVMUMF6H4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e67cd8d482660e072cf917acbda42645685eb94fae8a2a9fd70dfd3465cdd01a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T18:14:27Z","title_canon_sha256":"5e051bd08d98b5ae53ebd75fba4a44939ce4a226251b7ad25615cc14baac804f"},"schema_version":"1.0","source":{"id":"2104.05746","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.05746","created_at":"2026-07-05T04:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"2104.05746v3","created_at":"2026-07-05T04:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05746","created_at":"2026-07-05T04:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"PZCGFTM4HU3G","created_at":"2026-07-05T04:04:38Z"},{"alias_kind":"pith_short_16","alias_value":"PZCGFTM4HU3GVTRE","created_at":"2026-07-05T04:04:38Z"},{"alias_kind":"pith_short_8","alias_value":"PZCGFTM4","created_at":"2026-07-05T04:04:38Z"}],"graph_snapshots":[{"event_id":"sha256:a0bb9a28a2b5454f84f08403a34526f6c0d52e3a291a2e92cbe5fcd4b613a764","target":"graph","created_at":"2026-07-05T04:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.05746/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In an attempt to speed up the solution of the unit commitment (UC) problem, both machine-learning and optimization-based methods have been proposed to lighten the full UC formulation by removing as many superfluous line-flow constraints as possible. While the elimination strategies based on machine learning are fast and typically delete more constraints, they may be over-optimistic and result in infeasible UC solutions. For their part, optimization-based methods seek to identify redundant constraints in the full UC formulation by exploring the feasibility region of an LP-relaxation. In doing s","authors_text":"\\'Alvaro Porras, Asunci\\'on Jim\\'enez-Cordero, Juan M. Morales, Salvador Pineda","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T18:14:27Z","title":"Cost-driven Screening of Network Constraints for the Unit Commitment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05746","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7996643552e0881f8f8589e16b66e9c204a783f186766c3886d1da3aafea62fa","target":"record","created_at":"2026-07-05T04:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e67cd8d482660e072cf917acbda42645685eb94fae8a2a9fd70dfd3465cdd01a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T18:14:27Z","title_canon_sha256":"5e051bd08d98b5ae53ebd75fba4a44939ce4a226251b7ad25615cc14baac804f"},"schema_version":"1.0","source":{"id":"2104.05746","kind":"arxiv","version":3}},"canonical_sha256":"7e4462cd9c3d366ace243aaaca30be3f3b17747b43ec198223ed48db6c09768e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e4462cd9c3d366ace243aaaca30be3f3b17747b43ec198223ed48db6c09768e","first_computed_at":"2026-07-05T04:04:38.577589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:04:38.577589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOG7xLboY7gZJQSEHikbUPtXpExzraAluTSDKbDLHwjjASWo5INIBMirpRytXLezL59MERnBulnp4CTBUJNLCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:04:38.578267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.05746","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7996643552e0881f8f8589e16b66e9c204a783f186766c3886d1da3aafea62fa","sha256:a0bb9a28a2b5454f84f08403a34526f6c0d52e3a291a2e92cbe5fcd4b613a764"],"state_sha256":"61ce3d086f20280d03196ae7402c087867f25cd179ad39289d6e3c2d90e2fb5a"}