{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IB5W7NEZJF23UVLTLHLG7AD7WA","short_pith_number":"pith:IB5W7NEZ","schema_version":"1.0","canonical_sha256":"407b6fb4994975ba557359d66f807fb0106b8073b2118971145cafbbc6cffd07","source":{"kind":"arxiv","id":"1805.09779","version":1},"attestation_state":"computed","paper":{"title":"Tie-Line Characteristics based Partitioning for Distributed Optimization of Power Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali Mohammadi, Amin Kargarian, Mahdi Mehrtash, Masoud Barati","submitted_at":"2018-05-24T16:58:05Z","abstract_excerpt":"The convergence performance of distributed optimization algorithms is of significant importance to solve optimal power flow (OPF) in a distributed fashion. In this paper, we aim to provide some insights on how to partition a power system to achieve a high convergence rate of distributed algorithms for the solution of an OPF problem. We analyzed several features of the power network to find a set of suitable partitions with the aim of convergence performance improvement. We model the grid as a graph and decompose it based on the edge betweenness graph clustering. This technique provides several"},"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":"1805.09779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-24T16:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"d5830f9b7d1b8a0a3816f1fda1eb7e72db854f200d376863482bb3336e4935ca","abstract_canon_sha256":"d702b49892ae35ef9629ed92a8883221bee55d25df1791c58771a308a154f8c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:16.476176Z","signature_b64":"KmM2hJtr2n8FBmCEwUiOv7MqBN7oiXGw0WeP0hgTUpT8M8/lrR1SJNJmDq6t6KDZbElm1XkzISnlaZC7OmtyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"407b6fb4994975ba557359d66f807fb0106b8073b2118971145cafbbc6cffd07","last_reissued_at":"2026-05-17T23:54:16.475467Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:16.475467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tie-Line Characteristics based Partitioning for Distributed Optimization of Power Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali Mohammadi, Amin Kargarian, Mahdi Mehrtash, Masoud Barati","submitted_at":"2018-05-24T16:58:05Z","abstract_excerpt":"The convergence performance of distributed optimization algorithms is of significant importance to solve optimal power flow (OPF) in a distributed fashion. In this paper, we aim to provide some insights on how to partition a power system to achieve a high convergence rate of distributed algorithms for the solution of an OPF problem. We analyzed several features of the power network to find a set of suitable partitions with the aim of convergence performance improvement. We model the grid as a graph and decompose it based on the edge betweenness graph clustering. This technique provides several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09779","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":"1805.09779","created_at":"2026-05-17T23:54:16.475566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09779v1","created_at":"2026-05-17T23:54:16.475566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09779","created_at":"2026-05-17T23:54:16.475566+00:00"},{"alias_kind":"pith_short_12","alias_value":"IB5W7NEZJF23","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IB5W7NEZJF23UVLT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IB5W7NEZ","created_at":"2026-05-18T12:32:28.185984+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/IB5W7NEZJF23UVLTLHLG7AD7WA","json":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA.json","graph_json":"https://pith.science/api/pith-number/IB5W7NEZJF23UVLTLHLG7AD7WA/graph.json","events_json":"https://pith.science/api/pith-number/IB5W7NEZJF23UVLTLHLG7AD7WA/events.json","paper":"https://pith.science/paper/IB5W7NEZ"},"agent_actions":{"view_html":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA","download_json":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA.json","view_paper":"https://pith.science/paper/IB5W7NEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09779&json=true","fetch_graph":"https://pith.science/api/pith-number/IB5W7NEZJF23UVLTLHLG7AD7WA/graph.json","fetch_events":"https://pith.science/api/pith-number/IB5W7NEZJF23UVLTLHLG7AD7WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA/action/storage_attestation","attest_author":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA/action/author_attestation","sign_citation":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA/action/citation_signature","submit_replication":"https://pith.science/pith/IB5W7NEZJF23UVLTLHLG7AD7WA/action/replication_record"}},"created_at":"2026-05-17T23:54:16.475566+00:00","updated_at":"2026-05-17T23:54:16.475566+00:00"}