{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S7MUVR3TW7SDSYHCPVW6QKIKIT","short_pith_number":"pith:S7MUVR3T","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"},"canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","source":{"kind":"arxiv","id":"1507.04820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04820","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04820v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04820","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"S7MUVR3TW7SD","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S7MUVR3TW7SDSYHC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S7MUVR3T","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S7MUVR3TW7SDSYHCPVW6QKIKIT","target":"record","payload":{"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"},"canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","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"},"source_kind":"arxiv","source_id":"1507.04820","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkOBatsiAnNoqeOifMB7fxXvNAA1y0EOYJnd26rqZHhvWRl2//9bFzDmfZqo0Z03lU5+Nw9I+lxuBDsHZ3ZpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:19:41.689040Z"},"content_sha256":"3485d24b6b0600252ecf695a2ab94b7c7d2390aab9672fb24ab90cec86509bcb","schema_version":"1.0","event_id":"sha256:3485d24b6b0600252ecf695a2ab94b7c7d2390aab9672fb24ab90cec86509bcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S7MUVR3TW7SDSYHCPVW6QKIKIT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCkPScNn9WM4whFajhB+t3QolAtYOabeRvBPm4FGdxAslBY5Yv/g2gZiAOFP/i9mR+IDTjug/TUZb72394iYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:19:41.689634Z"},"content_sha256":"47eaec69252ae8590c2d31d891d27309b75b51dc4f41144ce0281305c587e780","schema_version":"1.0","event_id":"sha256:47eaec69252ae8590c2d31d891d27309b75b51dc4f41144ce0281305c587e780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/bundle.json","state_url":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T03:19:41Z","links":{"resolver":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT","bundle":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/bundle.json","state":"https://pith.science/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7MUVR3TW7SDSYHCPVW6QKIKIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S7MUVR3TW7SDSYHCPVW6QKIKIT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44426455abeb20b252b03b1db34ca42caf7a3b28b5f9757234e5235bde98668e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-17T02:37:58Z","title_canon_sha256":"d33428f2ba30405981ca7af5b01de26426d6c0860a133bda6db6b5818ca67ddc"},"schema_version":"1.0","source":{"id":"1507.04820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04820","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04820v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04820","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"S7MUVR3TW7SD","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S7MUVR3TW7SDSYHC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S7MUVR3T","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:47eaec69252ae8590c2d31d891d27309b75b51dc4f41144ce0281305c587e780","target":"graph","created_at":"2026-05-18T01:36:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alban Grastien, Karsten Lehmann, Pascal Van Hentenryck","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-17T02:37:58Z","title":"The Complexity of Switching and FACTS Maximum-Potential-Flow Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04820","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3485d24b6b0600252ecf695a2ab94b7c7d2390aab9672fb24ab90cec86509bcb","target":"record","created_at":"2026-05-18T01:36:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44426455abeb20b252b03b1db34ca42caf7a3b28b5f9757234e5235bde98668e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-17T02:37:58Z","title_canon_sha256":"d33428f2ba30405981ca7af5b01de26426d6c0860a133bda6db6b5818ca67ddc"},"schema_version":"1.0","source":{"id":"1507.04820","kind":"arxiv","version":1}},"canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97d94ac773b7e43960e27d6de8290a44d7b808e52237b7cb4ffbcf6172ddd6df","first_computed_at":"2026-05-18T01:36:42.708089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:42.708089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R3JnInj2qaKxZSCo64M6RmU+za2rAaptHQ+6t2j4EGNxOqlOe0U61mCAKdCKmxXki0gWcWI/UBp28vdmuFJgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:42.708882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3485d24b6b0600252ecf695a2ab94b7c7d2390aab9672fb24ab90cec86509bcb","sha256:47eaec69252ae8590c2d31d891d27309b75b51dc4f41144ce0281305c587e780"],"state_sha256":"88b9ecd82ed9681b13824da60466ef4e99ee5c5fc7217b1f9e26c5ca437bb9c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdAX/aaTtxo3AZdIbPFdfTG//yAfCEmJ/tnsSrKRd5ylvbwXeAJSH8lEywa3Dq7YCE/6AYJ31ppCrQtzDZlzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:19:41.692800Z","bundle_sha256":"c58fca62a9f45690ca4df5c29e874c926c1a2601a740bdfe62bf7235eafeafce"}}