{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IQSXWLNJLMIWES7F6JTT5DEWXD","short_pith_number":"pith:IQSXWLNJ","schema_version":"1.0","canonical_sha256":"44257b2da95b11624be5f2673e8c96b8d22c5871f7c4a509a206a9364e4be6e9","source":{"kind":"arxiv","id":"1511.02548","version":1},"attestation_state":"computed","paper":{"title":"Distributed Security Constrained Economic Dispatch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.SY","authors_text":"M. Hadi Amini, O. Karabasoglu, R. Jaddivada, S. Mishra","submitted_at":"2015-11-09T01:28:55Z","abstract_excerpt":"In this paper, we investigate two decomposition methods for their convergence rate which are used to solve security constrained economic dispatch (SCED): 1) Lagrangian Relaxation (LR), and 2) Augmented Lagrangian Relaxation (ALR). First, the centralized SCED problem is posed for a 6-bus test network and then it is decomposed into subproblems using both of the methods. In order to model the tie-line between decomposed areas of the test network, a novel method is proposed. The advantages and drawbacks of each method are discussed in terms of accuracy and information privacy. We show that there i"},"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":"1511.02548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-09T01:28:55Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"77bede76af38b94764060163163b28d27e5813caad8991f05448030b2387ed0d","abstract_canon_sha256":"b8133c62820718354f52f1f3c00aaa92e3dd5a6dc6cb263b0ecc97f7c666b435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.105273Z","signature_b64":"qTzXS9fGPQvmgTfqGRABzw17tY7qdL+6YuQyREaRbRAc/ZPZGyXyxDwYk7ODcse66I0rNmdRabfP9WTX86+sAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44257b2da95b11624be5f2673e8c96b8d22c5871f7c4a509a206a9364e4be6e9","last_reissued_at":"2026-05-18T00:58:10.104839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.104839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Security Constrained Economic Dispatch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.SY","authors_text":"M. Hadi Amini, O. Karabasoglu, R. Jaddivada, S. Mishra","submitted_at":"2015-11-09T01:28:55Z","abstract_excerpt":"In this paper, we investigate two decomposition methods for their convergence rate which are used to solve security constrained economic dispatch (SCED): 1) Lagrangian Relaxation (LR), and 2) Augmented Lagrangian Relaxation (ALR). First, the centralized SCED problem is posed for a 6-bus test network and then it is decomposed into subproblems using both of the methods. In order to model the tie-line between decomposed areas of the test network, a novel method is proposed. The advantages and drawbacks of each method are discussed in terms of accuracy and information privacy. We show that there i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02548","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":"1511.02548","created_at":"2026-05-18T00:58:10.104905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02548v1","created_at":"2026-05-18T00:58:10.104905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02548","created_at":"2026-05-18T00:58:10.104905+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQSXWLNJLMIW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQSXWLNJLMIWES7F","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQSXWLNJ","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/IQSXWLNJLMIWES7F6JTT5DEWXD","json":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD.json","graph_json":"https://pith.science/api/pith-number/IQSXWLNJLMIWES7F6JTT5DEWXD/graph.json","events_json":"https://pith.science/api/pith-number/IQSXWLNJLMIWES7F6JTT5DEWXD/events.json","paper":"https://pith.science/paper/IQSXWLNJ"},"agent_actions":{"view_html":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD","download_json":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD.json","view_paper":"https://pith.science/paper/IQSXWLNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02548&json=true","fetch_graph":"https://pith.science/api/pith-number/IQSXWLNJLMIWES7F6JTT5DEWXD/graph.json","fetch_events":"https://pith.science/api/pith-number/IQSXWLNJLMIWES7F6JTT5DEWXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD/action/storage_attestation","attest_author":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD/action/author_attestation","sign_citation":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD/action/citation_signature","submit_replication":"https://pith.science/pith/IQSXWLNJLMIWES7F6JTT5DEWXD/action/replication_record"}},"created_at":"2026-05-18T00:58:10.104905+00:00","updated_at":"2026-05-18T00:58:10.104905+00:00"}