{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IEHLUSKVYADFGAB7VVBEYBTRFM","short_pith_number":"pith:IEHLUSKV","schema_version":"1.0","canonical_sha256":"410eba4955c00653003fad424c06712b2156004a5a9bd52ad45388a556871050","source":{"kind":"arxiv","id":"1503.01281","version":1},"attestation_state":"computed","paper":{"title":"The Summed Start-up Costs in a Unit Commitment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matthias Huber, Matthias Silbernagl, Ren\\'e Brandenberg","submitted_at":"2015-03-04T11:14:59Z","abstract_excerpt":"We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if CU is strictly concave. We derive an exponential H-representation of this epigraph, and provide an exact linear separation algorithm. These results significantly reduce the integrality gap of the Mixed Integer formulation of a Unit Commitment Problem compared to current literature."},"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":"1503.01281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-04T11:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"fd5fda6fd66c01ca6906e574d30ef0490fa06dc77e2cd4ff393986896eb5ca39","abstract_canon_sha256":"47e80f051baddc531c2e8067bdd753d5e9f7d016936aea1399cf25dab2b5b9c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.505842Z","signature_b64":"3yX3lYq5ujQh7X6dcbYbG3F6uKHcZ5DGybmkN68hp+uiKf2vrkvcgFwaSQVldsQOX89xGjPW9OkIJO69AGqvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410eba4955c00653003fad424c06712b2156004a5a9bd52ad45388a556871050","last_reissued_at":"2026-05-18T02:25:39.505275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.505275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Summed Start-up Costs in a Unit Commitment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matthias Huber, Matthias Silbernagl, Ren\\'e Brandenberg","submitted_at":"2015-03-04T11:14:59Z","abstract_excerpt":"We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if CU is strictly concave. We derive an exponential H-representation of this epigraph, and provide an exact linear separation algorithm. These results significantly reduce the integrality gap of the Mixed Integer formulation of a Unit Commitment Problem compared to current literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01281","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":"1503.01281","created_at":"2026-05-18T02:25:39.505368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01281v1","created_at":"2026-05-18T02:25:39.505368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01281","created_at":"2026-05-18T02:25:39.505368+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEHLUSKVYADF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEHLUSKVYADFGAB7","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEHLUSKV","created_at":"2026-05-18T12:29:25.134429+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/IEHLUSKVYADFGAB7VVBEYBTRFM","json":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM.json","graph_json":"https://pith.science/api/pith-number/IEHLUSKVYADFGAB7VVBEYBTRFM/graph.json","events_json":"https://pith.science/api/pith-number/IEHLUSKVYADFGAB7VVBEYBTRFM/events.json","paper":"https://pith.science/paper/IEHLUSKV"},"agent_actions":{"view_html":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM","download_json":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM.json","view_paper":"https://pith.science/paper/IEHLUSKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01281&json=true","fetch_graph":"https://pith.science/api/pith-number/IEHLUSKVYADFGAB7VVBEYBTRFM/graph.json","fetch_events":"https://pith.science/api/pith-number/IEHLUSKVYADFGAB7VVBEYBTRFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM/action/storage_attestation","attest_author":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM/action/author_attestation","sign_citation":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM/action/citation_signature","submit_replication":"https://pith.science/pith/IEHLUSKVYADFGAB7VVBEYBTRFM/action/replication_record"}},"created_at":"2026-05-18T02:25:39.505368+00:00","updated_at":"2026-05-18T02:25:39.505368+00:00"}