{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3KGMSCVPNIBTODUS7Q7UXVGDFW","short_pith_number":"pith:3KGMSCVP","canonical_record":{"source":{"id":"1904.03560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T00:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"08de8b00fe3e7d3977873ff763b8a0f874565cc2e7d99bcb8c0ed1624bbf483a","abstract_canon_sha256":"192afb6d2315964125b351fb1cfc40e8ec15e6e6fc4601c6d4da6c2bf1175371"},"schema_version":"1.0"},"canonical_sha256":"da8cc90aaf6a03370e92fc3f4bd4c32da66dd6f1c5bf188a3426fe7cc0ed3f56","source":{"kind":"arxiv","id":"1904.03560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03560","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03560v2","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03560","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"3KGMSCVPNIBT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KGMSCVPNIBTODUS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KGMSCVP","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3KGMSCVPNIBTODUS7Q7UXVGDFW","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T00:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"08de8b00fe3e7d3977873ff763b8a0f874565cc2e7d99bcb8c0ed1624bbf483a","abstract_canon_sha256":"192afb6d2315964125b351fb1cfc40e8ec15e6e6fc4601c6d4da6c2bf1175371"},"schema_version":"1.0"},"canonical_sha256":"da8cc90aaf6a03370e92fc3f4bd4c32da66dd6f1c5bf188a3426fe7cc0ed3f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:44.929991Z","signature_b64":"pR/GKtqR2WFahfF8F9YFCvbbzmfz/O4NGMELbbMIgD9aiCe3pyrEgr/Rpv5xnRmTnAQgL4Fb0bHhi1v/UIhzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da8cc90aaf6a03370e92fc3f4bd4c32da66dd6f1c5bf188a3426fe7cc0ed3f56","last_reissued_at":"2026-05-17T23:48:44.929476Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:44.929476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03560","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4EQC6ydGJVk+0vGakxVByAsgpFll2xVhyImq51RA36DQRH3FETj3MKf1asyGSPUlf9ucz2EJWvyI6tEPgYaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T02:33:14.543352Z"},"content_sha256":"0f049220f960449eb877fa4c30397d79d1784c3e141fab36e038139b278f492a","schema_version":"1.0","event_id":"sha256:0f049220f960449eb877fa4c30397d79d1784c3e141fab36e038139b278f492a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3KGMSCVPNIBTODUS7Q7UXVGDFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asynchronous, Decentralized Solution Framework for the Large Scale Unit Commitment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Edmond Chow, Murat Yildirim, Nagi Gebraeel, Paritosh Ramanan","submitted_at":"2019-04-07T00:54:26Z","abstract_excerpt":"With increased reliance on cyber infrastructure, large scale power networks face new challenges owing to computational scalability. In this paper we focus on developing an asynchronous decentralized solution framework for the Unit Commitment(UC) problem for large scale power networks. We exploit the inherent asynchrony in a region based decomposition arising out of imbalance in regional subproblems to boost computational efficiency. A two phase algorithm is proposed that relies on the convex relaxation and privacy preserving valid inequalities in order to deliver algorithmic improvements. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03560","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsczHKS8gcc+iNbNh+bvugFRgqnn3/ROY1Pxu4N4ZIDREy3UG7cYYvrzQWZ2zV/WRh7hio9aq7SNn+OKqsTOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T02:33:14.543716Z"},"content_sha256":"2beb9ea38b87bb1b69883b819f9514566d396431d3a47b2efdb8a25a29efb296","schema_version":"1.0","event_id":"sha256:2beb9ea38b87bb1b69883b819f9514566d396431d3a47b2efdb8a25a29efb296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/bundle.json","state_url":"https://pith.science/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/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-07-02T02:33:14Z","links":{"resolver":"https://pith.science/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW","bundle":"https://pith.science/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/bundle.json","state":"https://pith.science/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KGMSCVPNIBTODUS7Q7UXVGDFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3KGMSCVPNIBTODUS7Q7UXVGDFW","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":"192afb6d2315964125b351fb1cfc40e8ec15e6e6fc4601c6d4da6c2bf1175371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T00:54:26Z","title_canon_sha256":"08de8b00fe3e7d3977873ff763b8a0f874565cc2e7d99bcb8c0ed1624bbf483a"},"schema_version":"1.0","source":{"id":"1904.03560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03560","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03560v2","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03560","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"3KGMSCVPNIBT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KGMSCVPNIBTODUS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KGMSCVP","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:2beb9ea38b87bb1b69883b819f9514566d396431d3a47b2efdb8a25a29efb296","target":"graph","created_at":"2026-05-17T23:48:44Z","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 increased reliance on cyber infrastructure, large scale power networks face new challenges owing to computational scalability. In this paper we focus on developing an asynchronous decentralized solution framework for the Unit Commitment(UC) problem for large scale power networks. We exploit the inherent asynchrony in a region based decomposition arising out of imbalance in regional subproblems to boost computational efficiency. A two phase algorithm is proposed that relies on the convex relaxation and privacy preserving valid inequalities in order to deliver algorithmic improvements. Our ","authors_text":"Edmond Chow, Murat Yildirim, Nagi Gebraeel, Paritosh Ramanan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T00:54:26Z","title":"An Asynchronous, Decentralized Solution Framework for the Large Scale Unit Commitment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03560","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:0f049220f960449eb877fa4c30397d79d1784c3e141fab36e038139b278f492a","target":"record","created_at":"2026-05-17T23:48:44Z","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":"192afb6d2315964125b351fb1cfc40e8ec15e6e6fc4601c6d4da6c2bf1175371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T00:54:26Z","title_canon_sha256":"08de8b00fe3e7d3977873ff763b8a0f874565cc2e7d99bcb8c0ed1624bbf483a"},"schema_version":"1.0","source":{"id":"1904.03560","kind":"arxiv","version":2}},"canonical_sha256":"da8cc90aaf6a03370e92fc3f4bd4c32da66dd6f1c5bf188a3426fe7cc0ed3f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da8cc90aaf6a03370e92fc3f4bd4c32da66dd6f1c5bf188a3426fe7cc0ed3f56","first_computed_at":"2026-05-17T23:48:44.929476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:44.929476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pR/GKtqR2WFahfF8F9YFCvbbzmfz/O4NGMELbbMIgD9aiCe3pyrEgr/Rpv5xnRmTnAQgL4Fb0bHhi1v/UIhzDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:44.929991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f049220f960449eb877fa4c30397d79d1784c3e141fab36e038139b278f492a","sha256:2beb9ea38b87bb1b69883b819f9514566d396431d3a47b2efdb8a25a29efb296"],"state_sha256":"7ab3b776ea75362e1b3908f5f14d747f1a6e0240aac5f2b55d10b93b7bc17f25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2eH6I3htNcOjzoT1tiE34EevisKhNDcu6yY+oxSegvBw6OHVQARMplynffiAxBy4tkYtm55XMF8vNcsKAyzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T02:33:14.545911Z","bundle_sha256":"213cc9a7ffa920b0d87a46343b7772de8c3d6957b929f91aa1e19a1e1abd7650"}}