{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4QH4RUVGUYVQMMIDDF2ZEGHSIX","short_pith_number":"pith:4QH4RUVG","schema_version":"1.0","canonical_sha256":"e40fc8d2a6a62b06310319759218f245d0df33acf5cc099edd9c4951c08f7dbb","source":{"kind":"arxiv","id":"2208.12139","version":1},"attestation_state":"computed","paper":{"title":"Influence of Stochastic Dependence on Network Constraints Screening for Unit Commitment","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Fran\\c{c}ois Bouffard, Mohamed Awadalla","submitted_at":"2022-08-25T14:56:15Z","abstract_excerpt":"The deepening penetration of renewable energy is challenging how power system operators cope with the associated variability and uncertainty in the unit commitment problem. Given its computational complexity, several optimization-based methods have been proposed to lighten the full unit commitment formulation by removing redundant line flow constraints. These approaches often ignore the spatial couplings of multi-side renewable generation and demand. To address this pitfall, we rule out redundant constraints over a tightened linear programming relaxation of the original unit commitment feasibi"},"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":"2208.12139","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SY","submitted_at":"2022-08-25T14:56:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"af197b42778cf9a261ac72d5a13ab5a03da554ca5f0d5d604d3df9d667630773","abstract_canon_sha256":"ff20307587b832c6fe953f5efa465f0069e79e69ce702146ac09309e1b39698d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:35.449852Z","signature_b64":"n7YhJ+dFBtazEhoZVQC3mcQOQ3OP0s2Dyj6eLwUrgcKA6Ek5IEqHDcHfLzxTERgglMw7DuT1gOpr0wJrS1+eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40fc8d2a6a62b06310319759218f245d0df33acf5cc099edd9c4951c08f7dbb","last_reissued_at":"2026-07-05T04:51:35.449325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:35.449325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence of Stochastic Dependence on Network Constraints Screening for Unit Commitment","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Fran\\c{c}ois Bouffard, Mohamed Awadalla","submitted_at":"2022-08-25T14:56:15Z","abstract_excerpt":"The deepening penetration of renewable energy is challenging how power system operators cope with the associated variability and uncertainty in the unit commitment problem. Given its computational complexity, several optimization-based methods have been proposed to lighten the full unit commitment formulation by removing redundant line flow constraints. These approaches often ignore the spatial couplings of multi-side renewable generation and demand. To address this pitfall, we rule out redundant constraints over a tightened linear programming relaxation of the original unit commitment feasibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.12139","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/2208.12139/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":"2208.12139","created_at":"2026-07-05T04:51:35.449389+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.12139v1","created_at":"2026-07-05T04:51:35.449389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.12139","created_at":"2026-07-05T04:51:35.449389+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QH4RUVGUYVQ","created_at":"2026-07-05T04:51:35.449389+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QH4RUVGUYVQMMID","created_at":"2026-07-05T04:51:35.449389+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QH4RUVG","created_at":"2026-07-05T04:51:35.449389+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09280","citing_title":"Vertex-Guided Redundant Constraints Identification for Unit Commitment","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX","json":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX.json","graph_json":"https://pith.science/api/pith-number/4QH4RUVGUYVQMMIDDF2ZEGHSIX/graph.json","events_json":"https://pith.science/api/pith-number/4QH4RUVGUYVQMMIDDF2ZEGHSIX/events.json","paper":"https://pith.science/paper/4QH4RUVG"},"agent_actions":{"view_html":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX","download_json":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX.json","view_paper":"https://pith.science/paper/4QH4RUVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.12139&json=true","fetch_graph":"https://pith.science/api/pith-number/4QH4RUVGUYVQMMIDDF2ZEGHSIX/graph.json","fetch_events":"https://pith.science/api/pith-number/4QH4RUVGUYVQMMIDDF2ZEGHSIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX/action/storage_attestation","attest_author":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX/action/author_attestation","sign_citation":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX/action/citation_signature","submit_replication":"https://pith.science/pith/4QH4RUVGUYVQMMIDDF2ZEGHSIX/action/replication_record"}},"created_at":"2026-07-05T04:51:35.449389+00:00","updated_at":"2026-07-05T04:51:35.449389+00:00"}