{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z7NDPR6HSHG6I7M3LT5H5MUDW5","short_pith_number":"pith:Z7NDPR6H","canonical_record":{"source":{"id":"1801.07218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-22T17:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"42badfa96a4beea5171b6508b90946e507f121f5336102079e409f65aa41c898","abstract_canon_sha256":"3058a1a1a5866872d7c34fae9fc91dcb6b818b4c088bc435c3b61bb78a2bdd99"},"schema_version":"1.0"},"canonical_sha256":"cfda37c7c791cde47d9b5cfa7eb283b77b5daba76c248342aaeb38add5e45b9e","source":{"kind":"arxiv","id":"1801.07218","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07218","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07218v2","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07218","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z7NDPR6HSHG6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z7NDPR6HSHG6I7M3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z7NDPR6H","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z7NDPR6HSHG6I7M3LT5H5MUDW5","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-22T17:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"42badfa96a4beea5171b6508b90946e507f121f5336102079e409f65aa41c898","abstract_canon_sha256":"3058a1a1a5866872d7c34fae9fc91dcb6b818b4c088bc435c3b61bb78a2bdd99"},"schema_version":"1.0"},"canonical_sha256":"cfda37c7c791cde47d9b5cfa7eb283b77b5daba76c248342aaeb38add5e45b9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:58.153619Z","signature_b64":"fymLt5Du1H7AFyW8hkxmRTEQiy/cV+oej9aj+qEGCKYrKABkCPoi7m2yB0pGhmI5j+d7EMADjwkWFhatmHiJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfda37c7c791cde47d9b5cfa7eb283b77b5daba76c248342aaeb38add5e45b9e","last_reissued_at":"2026-05-17T23:59:58.152966Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:58.152966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07218","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMmb/9DaULfbz09F7+4Ah5VDfrK1iZ7VkzDKD202NyjKImxp3gYtWsdaADHC5DNiBn1Nt2RvQqLV7mTrL0wPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:28:54.013966Z"},"content_sha256":"54bb90aebf44ccd0af0760929dbfdae6b86a32e89340f9b0965a60d5acd4fcda","schema_version":"1.0","event_id":"sha256:54bb90aebf44ccd0af0760929dbfdae6b86a32e89340f9b0965a60d5acd4fcda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z7NDPR6HSHG6I7M3LT5H5MUDW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anya Castillo, Carl D. Laird, Jean-Paul Watson, Jianfeng Liu","submitted_at":"2018-01-22T17:48:17Z","abstract_excerpt":"We propose a novel global solution algorithm for the network-constrained unit commitment problem incorporating a nonlinear alternating current model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints (UC-AC) and leverage optimization-based bounds tightening, second-order "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07218","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pQSmz/GVVCYnqZ2WwibRApSIld6tHhs+N4HKgvKr9Qj40/NwlMl49oAZo7QafuKKxBe+rLdP/pv7Ufw0Ut8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:28:54.014336Z"},"content_sha256":"4030e15f63eedec71d7ec0103209923c525c5ae0d98286b8624059445f477d38","schema_version":"1.0","event_id":"sha256:4030e15f63eedec71d7ec0103209923c525c5ae0d98286b8624059445f477d38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/bundle.json","state_url":"https://pith.science/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:28:54Z","links":{"resolver":"https://pith.science/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5","bundle":"https://pith.science/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/bundle.json","state":"https://pith.science/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7NDPR6HSHG6I7M3LT5H5MUDW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z7NDPR6HSHG6I7M3LT5H5MUDW5","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":"3058a1a1a5866872d7c34fae9fc91dcb6b818b4c088bc435c3b61bb78a2bdd99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-22T17:48:17Z","title_canon_sha256":"42badfa96a4beea5171b6508b90946e507f121f5336102079e409f65aa41c898"},"schema_version":"1.0","source":{"id":"1801.07218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07218","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07218v2","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07218","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z7NDPR6HSHG6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z7NDPR6HSHG6I7M3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z7NDPR6H","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:4030e15f63eedec71d7ec0103209923c525c5ae0d98286b8624059445f477d38","target":"graph","created_at":"2026-05-17T23:59:58Z","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"},"paper":{"abstract_excerpt":"We propose a novel global solution algorithm for the network-constrained unit commitment problem incorporating a nonlinear alternating current model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints (UC-AC) and leverage optimization-based bounds tightening, second-order ","authors_text":"Anya Castillo, Carl D. Laird, Jean-Paul Watson, Jianfeng Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-22T17:48:17Z","title":"Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07218","kind":"arxiv","version":2},"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:54bb90aebf44ccd0af0760929dbfdae6b86a32e89340f9b0965a60d5acd4fcda","target":"record","created_at":"2026-05-17T23:59:58Z","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":"3058a1a1a5866872d7c34fae9fc91dcb6b818b4c088bc435c3b61bb78a2bdd99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-22T17:48:17Z","title_canon_sha256":"42badfa96a4beea5171b6508b90946e507f121f5336102079e409f65aa41c898"},"schema_version":"1.0","source":{"id":"1801.07218","kind":"arxiv","version":2}},"canonical_sha256":"cfda37c7c791cde47d9b5cfa7eb283b77b5daba76c248342aaeb38add5e45b9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfda37c7c791cde47d9b5cfa7eb283b77b5daba76c248342aaeb38add5e45b9e","first_computed_at":"2026-05-17T23:59:58.152966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:58.152966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fymLt5Du1H7AFyW8hkxmRTEQiy/cV+oej9aj+qEGCKYrKABkCPoi7m2yB0pGhmI5j+d7EMADjwkWFhatmHiJAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:58.153619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54bb90aebf44ccd0af0760929dbfdae6b86a32e89340f9b0965a60d5acd4fcda","sha256:4030e15f63eedec71d7ec0103209923c525c5ae0d98286b8624059445f477d38"],"state_sha256":"5e508a691df22f8e02ba54763388686778fecbe7895ca5211c5f495011512d44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lEkI/FwMURfFQ8yBdbZArzdfI37KQ7uO/UfaLWO0Xn61iXCqon8GEEDDJtPars2PEC0OVUmPtzg2KI6uTG5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:28:54.017437Z","bundle_sha256":"670f583f16568c939a3c239687162d9ea1791718a587f2ccacac41d4c8f530c2"}}