{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PF2FVKXYRLDRT5UP35ZATRF2HB","short_pith_number":"pith:PF2FVKXY","schema_version":"1.0","canonical_sha256":"79745aaaf88ac719f68fdf7209c4ba385bf67b879090d6cd090c56da47637280","source":{"kind":"arxiv","id":"1710.07861","version":2},"attestation_state":"computed","paper":{"title":"Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Byron Tasseff, Carleton Coffrin, Kaarthik Sundar, Russell Bent, Scott Backhaus","submitted_at":"2017-10-21T23:05:10Z","abstract_excerpt":"This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate thei"},"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":"1710.07861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T23:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"77172a7ca84b1d822604af743b336af6fcd263f1cf87dba382894cf1151cc511","abstract_canon_sha256":"52f9bfd53ca960deb14f33922d3a45022df044486b18e687e28e7cd8b523a6de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.904041Z","signature_b64":"6LazkpcaKZ/o3W2GVbjz+EqvimQ+Z3qmD7m8vYwn1ASyFF7nNsgRxqJZwt17Za4kkXxzn/kM/oqfljdPqpj5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79745aaaf88ac719f68fdf7209c4ba385bf67b879090d6cd090c56da47637280","last_reissued_at":"2026-05-18T00:03:24.903609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.903609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Byron Tasseff, Carleton Coffrin, Kaarthik Sundar, Russell Bent, Scott Backhaus","submitted_at":"2017-10-21T23:05:10Z","abstract_excerpt":"This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07861","kind":"arxiv","version":2},"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":"1710.07861","created_at":"2026-05-18T00:03:24.903680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07861v2","created_at":"2026-05-18T00:03:24.903680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07861","created_at":"2026-05-18T00:03:24.903680+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF2FVKXYRLDR","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF2FVKXYRLDRT5UP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF2FVKXY","created_at":"2026-05-18T12:31:37.085036+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/PF2FVKXYRLDRT5UP35ZATRF2HB","json":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB.json","graph_json":"https://pith.science/api/pith-number/PF2FVKXYRLDRT5UP35ZATRF2HB/graph.json","events_json":"https://pith.science/api/pith-number/PF2FVKXYRLDRT5UP35ZATRF2HB/events.json","paper":"https://pith.science/paper/PF2FVKXY"},"agent_actions":{"view_html":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB","download_json":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB.json","view_paper":"https://pith.science/paper/PF2FVKXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07861&json=true","fetch_graph":"https://pith.science/api/pith-number/PF2FVKXYRLDRT5UP35ZATRF2HB/graph.json","fetch_events":"https://pith.science/api/pith-number/PF2FVKXYRLDRT5UP35ZATRF2HB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB/action/storage_attestation","attest_author":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB/action/author_attestation","sign_citation":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB/action/citation_signature","submit_replication":"https://pith.science/pith/PF2FVKXYRLDRT5UP35ZATRF2HB/action/replication_record"}},"created_at":"2026-05-18T00:03:24.903680+00:00","updated_at":"2026-05-18T00:03:24.903680+00:00"}