{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PCCABBIDFHUEOAD4QATCJ3QHFU","short_pith_number":"pith:PCCABBID","schema_version":"1.0","canonical_sha256":"788400850329e847007c802624ee072d3d06f47ab7791b31eaf1b4a620d518f4","source":{"kind":"arxiv","id":"2510.19608","version":3},"attestation_state":"computed","paper":{"title":"Optimal Kron-based Reduction of Networks (Opti-KRON) for Three-phase Distribution Feeders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mads Almassalkhi, Omid Mokhtari, Samuel Chevalier","submitted_at":"2025-10-22T14:01:42Z","abstract_excerpt":"This paper presents a novel structure-preserving, Kron-based reduction framework for unbalanced distribution feeders. The method aggregates electrically similar nodes within a mixed-integer optimization (MIP) problem to produce reduced networks that optimally reproduce the voltage profiles of the original full network. To overcome computational bottlenecks of MIP formulations, we propose an exhaustive-search formulation to identify optimal aggregation decisions while enforcing voltage margin limits. The proposed exhaustive network reduction algorithm is parallelizable on GPUs, which enables sc"},"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":"2510.19608","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-10-22T14:01:42Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b772b329dfbcd414f8a83f6c4927d36e2f95c1da400fd9d2210cc830b6547ed8","abstract_canon_sha256":"bfd9b34ddcd791ad4df76670901e987183f97b0622f34f8eaa97ab8db1328e23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:11.785829Z","signature_b64":"7jkvDNjqHkU+zcKISUqxa/Z0TR+6aDlkHozyp7sPMOyggJPXxlLqnuZXdDE2dorvXfh3M3iyfgHGA3L7vgsFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"788400850329e847007c802624ee072d3d06f47ab7791b31eaf1b4a620d518f4","last_reissued_at":"2026-06-09T02:07:11.785006Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:11.785006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Kron-based Reduction of Networks (Opti-KRON) for Three-phase Distribution Feeders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mads Almassalkhi, Omid Mokhtari, Samuel Chevalier","submitted_at":"2025-10-22T14:01:42Z","abstract_excerpt":"This paper presents a novel structure-preserving, Kron-based reduction framework for unbalanced distribution feeders. The method aggregates electrically similar nodes within a mixed-integer optimization (MIP) problem to produce reduced networks that optimally reproduce the voltage profiles of the original full network. To overcome computational bottlenecks of MIP formulations, we propose an exhaustive-search formulation to identify optimal aggregation decisions while enforcing voltage margin limits. The proposed exhaustive network reduction algorithm is parallelizable on GPUs, which enables sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.19608","kind":"arxiv","version":3},"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/2510.19608/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":"2510.19608","created_at":"2026-06-09T02:07:11.785107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.19608v3","created_at":"2026-06-09T02:07:11.785107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.19608","created_at":"2026-06-09T02:07:11.785107+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCCABBIDFHUE","created_at":"2026-06-09T02:07:11.785107+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCCABBIDFHUEOAD4","created_at":"2026-06-09T02:07:11.785107+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCCABBID","created_at":"2026-06-09T02:07:11.785107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.08403","citing_title":"Data-Driven Power Flow for Radial Distribution Networks with Sparse Real-Time Data","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU","json":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU.json","graph_json":"https://pith.science/api/pith-number/PCCABBIDFHUEOAD4QATCJ3QHFU/graph.json","events_json":"https://pith.science/api/pith-number/PCCABBIDFHUEOAD4QATCJ3QHFU/events.json","paper":"https://pith.science/paper/PCCABBID"},"agent_actions":{"view_html":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU","download_json":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU.json","view_paper":"https://pith.science/paper/PCCABBID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.19608&json=true","fetch_graph":"https://pith.science/api/pith-number/PCCABBIDFHUEOAD4QATCJ3QHFU/graph.json","fetch_events":"https://pith.science/api/pith-number/PCCABBIDFHUEOAD4QATCJ3QHFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU/action/storage_attestation","attest_author":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU/action/author_attestation","sign_citation":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU/action/citation_signature","submit_replication":"https://pith.science/pith/PCCABBIDFHUEOAD4QATCJ3QHFU/action/replication_record"}},"created_at":"2026-06-09T02:07:11.785107+00:00","updated_at":"2026-06-09T02:07:11.785107+00:00"}