{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FFARSIKBN5HXRFEI2CC7KLW267","short_pith_number":"pith:FFARSIKB","schema_version":"1.0","canonical_sha256":"29411921416f4f789488d085f52edaf7ffcb4138abf904548ed31106cd4f7c80","source":{"kind":"arxiv","id":"1904.11559","version":4},"attestation_state":"computed","paper":{"title":"Distributed Optimal Power Flow Algorithms Over Time-Varying Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Alejandro D. Dominguez-Garcia, Madi Zholbaryssov","submitted_at":"2019-04-25T19:57:23Z","abstract_excerpt":"In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) in distribution systems by solving the so-called optimal power flow (OPF) problem. The OPF problem is concerned with determining an optimal operating point, at which some cost function, e.g., generation cost or power losses, is minimized, and operational constraints are satisfied. To solve the OPF problem, we propose distributed algorithms that are able to operate over time-varying communication networks and have geometric convergence rate. We solve the second-order c"},"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":"1904.11559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-04-25T19:57:23Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"3001b97bb15f7579b02b67a49b23a603520f24eff6069adc02daad8f04d3157d","abstract_canon_sha256":"fa0789d10fb03e9e75d5b59c303150c268cdc30c7722b21cdb04bcca2ec7d316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:27.453439Z","signature_b64":"X7yYR9MxFfYgz9+yBV4ypwVvn0qqJ8rJ2OLLZTYttcK/aqRMbUTWdBuuZl0UNhTjERji+XZLRAOSvaJ7EpmzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29411921416f4f789488d085f52edaf7ffcb4138abf904548ed31106cd4f7c80","last_reissued_at":"2026-06-04T20:14:27.452926Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:27.452926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Optimal Power Flow Algorithms Over Time-Varying Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Alejandro D. Dominguez-Garcia, Madi Zholbaryssov","submitted_at":"2019-04-25T19:57:23Z","abstract_excerpt":"In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) in distribution systems by solving the so-called optimal power flow (OPF) problem. The OPF problem is concerned with determining an optimal operating point, at which some cost function, e.g., generation cost or power losses, is minimized, and operational constraints are satisfied. To solve the OPF problem, we propose distributed algorithms that are able to operate over time-varying communication networks and have geometric convergence rate. We solve the second-order c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11559","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.11559/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.11559","created_at":"2026-06-04T20:14:27.452984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11559v4","created_at":"2026-06-04T20:14:27.452984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11559","created_at":"2026-06-04T20:14:27.452984+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFARSIKBN5HX","created_at":"2026-06-04T20:14:27.452984+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFARSIKBN5HXRFEI","created_at":"2026-06-04T20:14:27.452984+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFARSIKB","created_at":"2026-06-04T20:14:27.452984+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/FFARSIKBN5HXRFEI2CC7KLW267","json":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267.json","graph_json":"https://pith.science/api/pith-number/FFARSIKBN5HXRFEI2CC7KLW267/graph.json","events_json":"https://pith.science/api/pith-number/FFARSIKBN5HXRFEI2CC7KLW267/events.json","paper":"https://pith.science/paper/FFARSIKB"},"agent_actions":{"view_html":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267","download_json":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267.json","view_paper":"https://pith.science/paper/FFARSIKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11559&json=true","fetch_graph":"https://pith.science/api/pith-number/FFARSIKBN5HXRFEI2CC7KLW267/graph.json","fetch_events":"https://pith.science/api/pith-number/FFARSIKBN5HXRFEI2CC7KLW267/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267/action/storage_attestation","attest_author":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267/action/author_attestation","sign_citation":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267/action/citation_signature","submit_replication":"https://pith.science/pith/FFARSIKBN5HXRFEI2CC7KLW267/action/replication_record"}},"created_at":"2026-06-04T20:14:27.452984+00:00","updated_at":"2026-06-04T20:14:27.452984+00:00"}