{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S7MUVR3TW7SDSYHCPVW6QKIKIT","short_pith_number":"pith:S7MUVR3T","schema_version":"1.0","canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","source":{"kind":"arxiv","id":"1507.04820","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Switching and FACTS Maximum-Potential-Flow Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alban Grastien, Karsten Lehmann, Pascal Van Hentenryck","submitted_at":"2015-07-17T02:37:58Z","abstract_excerpt":"This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configuration options: switching lines and using FACTS devices. We present the first comprehensive complexity study of this optimization problem. Our results show hat the problem is NP-complete and that there is no fully polynomial-time approximation scheme. For switching, these results extend to planar networks with a aximum-node degree of 3. Additionally, we demonstrate that the optimization problems are still NP-hard if we"},"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":"1507.04820","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-17T02:37:58Z","cross_cats_sorted":[],"title_canon_sha256":"d33428f2ba30405981ca7af5b01de26426d6c0860a133bda6db6b5818ca67ddc","abstract_canon_sha256":"44426455abeb20b252b03b1db34ca42caf7a3b28b5f9757234e5235bde98668e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:42.708882Z","signature_b64":"R3JnInj2qaKxZSCo64M6RmU+za2rAaptHQ+6t2j4EGNxOqlOe0U61mCAKdCKmxXki0gWcWI/UBp28vdmuFJgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","last_reissued_at":"2026-05-18T01:36:42.708089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:42.708089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Switching and FACTS Maximum-Potential-Flow Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alban Grastien, Karsten Lehmann, Pascal Van Hentenryck","submitted_at":"2015-07-17T02:37:58Z","abstract_excerpt":"This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configuration options: switching lines and using FACTS devices. We present the first comprehensive complexity study of this optimization problem. Our results show hat the problem is NP-complete and that there is no fully polynomial-time approximation scheme. For switching, these results extend to planar networks with a aximum-node degree of 3. Additionally, we demonstrate that the optimization problems are still NP-hard if we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04820","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":"1507.04820","created_at":"2026-05-18T01:36:42.708213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04820v1","created_at":"2026-05-18T01:36:42.708213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04820","created_at":"2026-05-18T01:36:42.708213+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7MUVR3TW7SD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7MUVR3TW7SDSYHC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7MUVR3T","created_at":"2026-05-18T12:29:39.896362+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/S7MUVR3TW7SDSYHCPVW6QKIKIT","json":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT.json","graph_json":"https://pith.science/api/pith-number/S7MUVR3TW7SDSYHCPVW6QKIKIT/graph.json","events_json":"https://pith.science/api/pith-number/S7MUVR3TW7SDSYHCPVW6QKIKIT/events.json","paper":"https://pith.science/paper/S7MUVR3T"},"agent_actions":{"view_html":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT","download_json":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT.json","view_paper":"https://pith.science/paper/S7MUVR3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04820&json=true","fetch_graph":"https://pith.science/api/pith-number/S7MUVR3TW7SDSYHCPVW6QKIKIT/graph.json","fetch_events":"https://pith.science/api/pith-number/S7MUVR3TW7SDSYHCPVW6QKIKIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/action/storage_attestation","attest_author":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/action/author_attestation","sign_citation":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/action/citation_signature","submit_replication":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/action/replication_record"}},"created_at":"2026-05-18T01:36:42.708213+00:00","updated_at":"2026-05-18T01:36:42.708213+00:00"}