{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EDNJHIA5GSAMJ7JYAQ63JJ3GCE","short_pith_number":"pith:EDNJHIA5","schema_version":"1.0","canonical_sha256":"20da93a01d3480c4fd38043db4a7661115c3dcfb0c12254ca4c5fb5c65728d20","source":{"kind":"arxiv","id":"1604.02184","version":1},"attestation_state":"computed","paper":{"title":"A Polyhedral Study of the Integrated Minimum-Up/-Down Time and Ramping Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Pan, Yongpei Guan","submitted_at":"2016-04-07T21:52:04Z","abstract_excerpt":"In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation ramp-up/-down rate, logical, and generation upper/lower bound constraints. By exploring its specialized structures, we derive strong valid inequalities and explore a new proof technique to prove these inequalities are sufficient to provide convex hull descriptions for variant two-period and three-period polytopes, under different parameter settings. For multi-period ca"},"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":"1604.02184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T21:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"b7acf8c0d6aa44d3d2a2610c6cdc4d5cf60778ebe4dfacad288330c7f35d8e0b","abstract_canon_sha256":"582aff0c2bfdd3fd2f8a4abc883fd40d2bd59c2dc9937865352c3fe85124de90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:28.270295Z","signature_b64":"ZhKS2Tk+yGdrn1Eu17feF9yiIsIKHu25uffoFDcQIawpxlaIiz5sqRWnqCWWGOfO/Q4xh89tfRNnZrPVzPzADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20da93a01d3480c4fd38043db4a7661115c3dcfb0c12254ca4c5fb5c65728d20","last_reissued_at":"2026-05-18T01:17:28.269835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:28.269835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polyhedral Study of the Integrated Minimum-Up/-Down Time and Ramping Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Pan, Yongpei Guan","submitted_at":"2016-04-07T21:52:04Z","abstract_excerpt":"In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation ramp-up/-down rate, logical, and generation upper/lower bound constraints. By exploring its specialized structures, we derive strong valid inequalities and explore a new proof technique to prove these inequalities are sufficient to provide convex hull descriptions for variant two-period and three-period polytopes, under different parameter settings. For multi-period ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02184","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":""},"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":"1604.02184","created_at":"2026-05-18T01:17:28.269897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02184v1","created_at":"2026-05-18T01:17:28.269897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02184","created_at":"2026-05-18T01:17:28.269897+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDNJHIA5GSAM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDNJHIA5GSAMJ7JY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDNJHIA5","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03374","citing_title":"Event-Based Dynamic Programming for Pumped-Storage Hydropower Scheduling","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE","json":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE.json","graph_json":"https://pith.science/api/pith-number/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/graph.json","events_json":"https://pith.science/api/pith-number/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/events.json","paper":"https://pith.science/paper/EDNJHIA5"},"agent_actions":{"view_html":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE","download_json":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE.json","view_paper":"https://pith.science/paper/EDNJHIA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02184&json=true","fetch_graph":"https://pith.science/api/pith-number/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/graph.json","fetch_events":"https://pith.science/api/pith-number/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/action/storage_attestation","attest_author":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/action/author_attestation","sign_citation":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/action/citation_signature","submit_replication":"https://pith.science/pith/EDNJHIA5GSAMJ7JYAQ63JJ3GCE/action/replication_record"}},"created_at":"2026-05-18T01:17:28.269897+00:00","updated_at":"2026-05-18T01:17:28.269897+00:00"}