{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WURT7DO5XALSGH2G7HCV4ATOZ4","short_pith_number":"pith:WURT7DO5","schema_version":"1.0","canonical_sha256":"b5233f8dddb817231f46f9c55e026ecf13fa479880677dfb9da45ec70c765bdd","source":{"kind":"arxiv","id":"2507.09280","version":1},"attestation_state":"computed","paper":{"title":"Vertex-Guided Redundant Constraints Identification for Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Danny H.K. Tsang, Xuan He, Yize Chen, Yuxin Pan","submitted_at":"2025-07-12T13:33:33Z","abstract_excerpt":"Power systems Unit Commitment (UC) problem determines the generator commitment schedule and dispatch decisions to realize the reliable and economic operation of power networks. The growing penetration of stochastic renewables and demand behaviors makes it necessary to solve the UC problem timely. It is possible to derive lightweight, faster-to-solve UC models via constraint screening to eliminate redundant constraints. However, the screening process remains computationally cumbersome due to the need of solving numerous linear programming (LP) problems. To reduce the number of LPs to solve, we "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.09280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-07-12T13:33:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"adcd80b2b60542607224726b4c654de2ba1c2745c66c9e44156c81b299bbdea8","abstract_canon_sha256":"ef3b10f7d9ff6de6db29602713f98f9d702e1fb65667ca29b97dda2ee31616c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:06.693261Z","signature_b64":"yPVyL1IEpJbFpUWXWaVMvga44jBs7eRBwqj/W/ifwyFyqgzO2CeUFSgbdSCp6e0jLBY0ORjT+RkTdBVPzMdiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5233f8dddb817231f46f9c55e026ecf13fa479880677dfb9da45ec70c765bdd","last_reissued_at":"2026-07-05T11:36:06.692882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:06.692882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-Guided Redundant Constraints Identification for Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Danny H.K. Tsang, Xuan He, Yize Chen, Yuxin Pan","submitted_at":"2025-07-12T13:33:33Z","abstract_excerpt":"Power systems Unit Commitment (UC) problem determines the generator commitment schedule and dispatch decisions to realize the reliable and economic operation of power networks. The growing penetration of stochastic renewables and demand behaviors makes it necessary to solve the UC problem timely. It is possible to derive lightweight, faster-to-solve UC models via constraint screening to eliminate redundant constraints. However, the screening process remains computationally cumbersome due to the need of solving numerous linear programming (LP) problems. To reduce the number of LPs to solve, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09280","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.09280/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.09280","created_at":"2026-07-05T11:36:06.692936+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.09280v1","created_at":"2026-07-05T11:36:06.692936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09280","created_at":"2026-07-05T11:36:06.692936+00:00"},{"alias_kind":"pith_short_12","alias_value":"WURT7DO5XALS","created_at":"2026-07-05T11:36:06.692936+00:00"},{"alias_kind":"pith_short_16","alias_value":"WURT7DO5XALSGH2G","created_at":"2026-07-05T11:36:06.692936+00:00"},{"alias_kind":"pith_short_8","alias_value":"WURT7DO5","created_at":"2026-07-05T11:36:06.692936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4","json":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4.json","graph_json":"https://pith.science/api/pith-number/WURT7DO5XALSGH2G7HCV4ATOZ4/graph.json","events_json":"https://pith.science/api/pith-number/WURT7DO5XALSGH2G7HCV4ATOZ4/events.json","paper":"https://pith.science/paper/WURT7DO5"},"agent_actions":{"view_html":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4","download_json":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4.json","view_paper":"https://pith.science/paper/WURT7DO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.09280&json=true","fetch_graph":"https://pith.science/api/pith-number/WURT7DO5XALSGH2G7HCV4ATOZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/WURT7DO5XALSGH2G7HCV4ATOZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4/action/storage_attestation","attest_author":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4/action/author_attestation","sign_citation":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4/action/citation_signature","submit_replication":"https://pith.science/pith/WURT7DO5XALSGH2G7HCV4ATOZ4/action/replication_record"}},"created_at":"2026-07-05T11:36:06.692936+00:00","updated_at":"2026-07-05T11:36:06.692936+00:00"}