{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QNBFBGQIN7VQLX2ZYZ4NYCLTM4","short_pith_number":"pith:QNBFBGQI","canonical_record":{"source":{"id":"1810.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-15T08:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"fe62d5759e9211ef480b75752d95aebac15a4d811c3a45de5ef6b40c8cb0804b","abstract_canon_sha256":"855c3e4ba67750913de9924929910d0c7bb8c48341878eb4130b5b9c11672476"},"schema_version":"1.0"},"canonical_sha256":"8342509a086feb05df59c678dc0973673ba78a369b46ad05ba149d76ef285aff","source":{"kind":"arxiv","id":"1810.06215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06215","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06215v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06215","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"QNBFBGQIN7VQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNBFBGQIN7VQLX2Z","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNBFBGQI","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QNBFBGQIN7VQLX2ZYZ4NYCLTM4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-15T08:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"fe62d5759e9211ef480b75752d95aebac15a4d811c3a45de5ef6b40c8cb0804b","abstract_canon_sha256":"855c3e4ba67750913de9924929910d0c7bb8c48341878eb4130b5b9c11672476"},"schema_version":"1.0"},"canonical_sha256":"8342509a086feb05df59c678dc0973673ba78a369b46ad05ba149d76ef285aff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:21.109592Z","signature_b64":"1FhxIdPXnjeGDxNEHN1qtD1oYYP8YO5RQUGfzEv7iSfGc2LUUiBkpu+LFw2ZfHr27qraU1rl8X8sv4hz/ZI9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8342509a086feb05df59c678dc0973673ba78a369b46ad05ba149d76ef285aff","last_reissued_at":"2026-05-18T00:03:21.109041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:21.109041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06215","source_version":1,"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-18T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg9QwgE1w0Z9IxDA4kvrsxNh8FqbWOMmfuk3kW/w7ftfTXWriCOEdLg3hhMGVTsz52AiZpzBTCpggUMIJ/s9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:45:56.719283Z"},"content_sha256":"d574b0c9359cb6e826892f172c3172e21f509060a1857d694a65cf2d68ecb436","schema_version":"1.0","event_id":"sha256:d574b0c9359cb6e826892f172c3172e21f509060a1857d694a65cf2d68ecb436"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QNBFBGQIN7VQLX2ZYZ4NYCLTM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Transmission Constrained Unit Commitment:A Column Merging Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Qiaozhu Zhai, Xiaohong Guan, Xuan Li","submitted_at":"2018-10-15T08:06:19Z","abstract_excerpt":"With rapid integration of power sources with uncertainty, robustness must be carefully considered in the transmission constrained unit commitment (TCUC) problem. The overall computational complexity of the robust TCUC methods is closely related to the vertex number of the uncertainty set. The vertex number is further associated with 1) the period number in the scheduling horizon as well as 2) the number of nodes with uncertain injections. In this paper, a column merging method (CMM) is proposed to reduce the computation burden by merging the uncertain nodes, while still guar-anteeing the robus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06215","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"},"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-18T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPegEoz7fILmmHzat6zmuq+napb1iUxH+YVV/CQfTyohpnuTq/elQwJ75aksFPxnWduabVaAdGOrAXNOpf/tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:45:56.719796Z"},"content_sha256":"b5dc62c9d375ba742e46c916ddbc111c729d3e48aa5c4622141ed43213f7fe50","schema_version":"1.0","event_id":"sha256:b5dc62c9d375ba742e46c916ddbc111c729d3e48aa5c4622141ed43213f7fe50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/bundle.json","state_url":"https://pith.science/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/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-27T19:45:56Z","links":{"resolver":"https://pith.science/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4","bundle":"https://pith.science/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/bundle.json","state":"https://pith.science/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNBFBGQIN7VQLX2ZYZ4NYCLTM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QNBFBGQIN7VQLX2ZYZ4NYCLTM4","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":"855c3e4ba67750913de9924929910d0c7bb8c48341878eb4130b5b9c11672476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-15T08:06:19Z","title_canon_sha256":"fe62d5759e9211ef480b75752d95aebac15a4d811c3a45de5ef6b40c8cb0804b"},"schema_version":"1.0","source":{"id":"1810.06215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06215","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06215v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06215","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"QNBFBGQIN7VQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNBFBGQIN7VQLX2Z","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNBFBGQI","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b5dc62c9d375ba742e46c916ddbc111c729d3e48aa5c4622141ed43213f7fe50","target":"graph","created_at":"2026-05-18T00:03:21Z","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":"With rapid integration of power sources with uncertainty, robustness must be carefully considered in the transmission constrained unit commitment (TCUC) problem. The overall computational complexity of the robust TCUC methods is closely related to the vertex number of the uncertainty set. The vertex number is further associated with 1) the period number in the scheduling horizon as well as 2) the number of nodes with uncertain injections. In this paper, a column merging method (CMM) is proposed to reduce the computation burden by merging the uncertain nodes, while still guar-anteeing the robus","authors_text":"Qiaozhu Zhai, Xiaohong Guan, Xuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-15T08:06:19Z","title":"Robust Transmission Constrained Unit Commitment:A Column Merging Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06215","kind":"arxiv","version":1},"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:d574b0c9359cb6e826892f172c3172e21f509060a1857d694a65cf2d68ecb436","target":"record","created_at":"2026-05-18T00:03:21Z","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":"855c3e4ba67750913de9924929910d0c7bb8c48341878eb4130b5b9c11672476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-15T08:06:19Z","title_canon_sha256":"fe62d5759e9211ef480b75752d95aebac15a4d811c3a45de5ef6b40c8cb0804b"},"schema_version":"1.0","source":{"id":"1810.06215","kind":"arxiv","version":1}},"canonical_sha256":"8342509a086feb05df59c678dc0973673ba78a369b46ad05ba149d76ef285aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8342509a086feb05df59c678dc0973673ba78a369b46ad05ba149d76ef285aff","first_computed_at":"2026-05-18T00:03:21.109041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:21.109041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FhxIdPXnjeGDxNEHN1qtD1oYYP8YO5RQUGfzEv7iSfGc2LUUiBkpu+LFw2ZfHr27qraU1rl8X8sv4hz/ZI9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:21.109592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d574b0c9359cb6e826892f172c3172e21f509060a1857d694a65cf2d68ecb436","sha256:b5dc62c9d375ba742e46c916ddbc111c729d3e48aa5c4622141ed43213f7fe50"],"state_sha256":"c1a27f05468964908c453c6fe24ba899858225cff9979a1f7bb64c6ef0c357ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMu242qtCq1Gzc6AAMtfT/qcUl4PiHW9IEAiFV+RgIZ4VTnPBo1Nu+xaRc1tp0O9fvfttvIwzCtlkistVb9vAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:45:56.723026Z","bundle_sha256":"8fa7a2e98b63b0eb41f7fbced500af31452cd25eae411c3c3bbf4d636d752b39"}}