{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PJMIYI6SH7FEECHXFENG6F2FBL","short_pith_number":"pith:PJMIYI6S","schema_version":"1.0","canonical_sha256":"7a588c23d23fca4208f7291a6f17450ae4228382153ece69cba15314c1231f5e","source":{"kind":"arxiv","id":"2112.01351","version":1},"attestation_state":"computed","paper":{"title":"Equivalent Circuit Programming for Power Flow Analysis and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Larry Pileggi, Marko Jereminov","submitted_at":"2021-12-02T15:50:56Z","abstract_excerpt":"The utility of domain-specific knowledge for modeling, simulation, and optimization has been demonstrated for various research problem domains, including power systems. The concept of Equivalent Circuit Programming was previously developed and facilitated for robust, efficient, and scalable solution of network simulation and optimization problems. This paper extends the theoretical foundation of Equivalent Circuit Programming to enable the fusion of optimization theory and algorithms with the numerical methods that utilize the domain-specific knowledge of power flow models. The generality, sca"},"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":"2112.01351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-12-02T15:50:56Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"95a5d7a7a4e0fceab1324e6aa4087d07d1da7a07b0d8799f19ed92c6e6abc37b","abstract_canon_sha256":"f0e0df4e3f69e9f09e5bdcbe02703e29eafc6c738059da9fc8bc44976793ee28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:08.453739Z","signature_b64":"UGmOKhR52VL6mh8RbusgG4kbAHN90E1PM0GTzl0HAND+Aw1/CblV/dupxNOjDkfn1wj7PXsT01/1SHbgxPhIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a588c23d23fca4208f7291a6f17450ae4228382153ece69cba15314c1231f5e","last_reissued_at":"2026-07-05T03:37:08.453340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:08.453340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalent Circuit Programming for Power Flow Analysis and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Larry Pileggi, Marko Jereminov","submitted_at":"2021-12-02T15:50:56Z","abstract_excerpt":"The utility of domain-specific knowledge for modeling, simulation, and optimization has been demonstrated for various research problem domains, including power systems. The concept of Equivalent Circuit Programming was previously developed and facilitated for robust, efficient, and scalable solution of network simulation and optimization problems. This paper extends the theoretical foundation of Equivalent Circuit Programming to enable the fusion of optimization theory and algorithms with the numerical methods that utilize the domain-specific knowledge of power flow models. The generality, sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01351","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.01351/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":"2112.01351","created_at":"2026-07-05T03:37:08.453415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.01351v1","created_at":"2026-07-05T03:37:08.453415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01351","created_at":"2026-07-05T03:37:08.453415+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJMIYI6SH7FE","created_at":"2026-07-05T03:37:08.453415+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJMIYI6SH7FEECHX","created_at":"2026-07-05T03:37:08.453415+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJMIYI6S","created_at":"2026-07-05T03:37:08.453415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04623","citing_title":"Large-scale Grid Optimization: The Workhorse of Future Grid Computations","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL","json":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL.json","graph_json":"https://pith.science/api/pith-number/PJMIYI6SH7FEECHXFENG6F2FBL/graph.json","events_json":"https://pith.science/api/pith-number/PJMIYI6SH7FEECHXFENG6F2FBL/events.json","paper":"https://pith.science/paper/PJMIYI6S"},"agent_actions":{"view_html":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL","download_json":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL.json","view_paper":"https://pith.science/paper/PJMIYI6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.01351&json=true","fetch_graph":"https://pith.science/api/pith-number/PJMIYI6SH7FEECHXFENG6F2FBL/graph.json","fetch_events":"https://pith.science/api/pith-number/PJMIYI6SH7FEECHXFENG6F2FBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL/action/storage_attestation","attest_author":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL/action/author_attestation","sign_citation":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL/action/citation_signature","submit_replication":"https://pith.science/pith/PJMIYI6SH7FEECHXFENG6F2FBL/action/replication_record"}},"created_at":"2026-07-05T03:37:08.453415+00:00","updated_at":"2026-07-05T03:37:08.453415+00:00"}