{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CCFZUGWTC7SFTS5CXC7CMC56JI","short_pith_number":"pith:CCFZUGWT","schema_version":"1.0","canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","source":{"kind":"arxiv","id":"2605.03753","version":2},"attestation_state":"computed","paper":{"title":"Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","cross_cats":["cs.NE","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Alessandro Zocca, Jan Viebahn, Job Groeneveld, Miguel Mu\\~noz","submitted_at":"2026-05-05T13:38:30Z","abstract_excerpt":"We study day-ahead transmission topology control for high-voltage grid operation under $N-1$ security constraints. The operational task is to select, over a 24-hour horizon, a sequence of substation topologies obtained via busbar-coupler switching to relieve line overloads while limiting switching effort and topological complexity. We formulate this task as a sequential multi-objective optimization problem with four objectives used in TSO decision making: worst-case $N-1$ line loading, maximum topological depth, number of topology changes, and time spent outside the reference topology. We prop"},"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":"2605.03753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T13:38:30Z","cross_cats_sorted":["cs.NE","cs.SY","eess.SY"],"title_canon_sha256":"a16d0b3f995c62ef68d784c5905928ddca0688aead27efe1f2fe2c6f92721e8b","abstract_canon_sha256":"2bcbe93920bd6792fc1c7377f2dadacbd935e954f47c5c5a10fac2bd0770fe47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:25.131928Z","signature_b64":"bdGRuarHyw7xYkD1+7FixTPsOsQ3BDEEajsZXWzSTZ+wR/zzk5D7I9fJmAO9RR43CkxUT9nAgrBmC8Ipdh7OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","last_reissued_at":"2026-06-05T01:15:25.131462Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:25.131462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","cross_cats":["cs.NE","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Alessandro Zocca, Jan Viebahn, Job Groeneveld, Miguel Mu\\~noz","submitted_at":"2026-05-05T13:38:30Z","abstract_excerpt":"We study day-ahead transmission topology control for high-voltage grid operation under $N-1$ security constraints. The operational task is to select, over a 24-hour horizon, a sequence of substation topologies obtained via busbar-coupler switching to relieve line overloads while limiting switching effort and topological complexity. We formulate this task as a sequential multi-objective optimization problem with four objectives used in TSO decision making: worst-case $N-1$ line loading, maximum topological depth, number of topology changes, and time spent outside the reference topology. We prop"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"that the four chosen operational objectives (N-1 worst-case loading, topological depth, switch count, time in non-reference topologies) sufficiently capture real TSO decision criteria and that the temporal block structure of feasible strategies remains exploitable under realistic operational bounds","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The block algorithm exactly enumerates the Pareto front for sequential multi-objective transmission topology planning in polynomial time for fixed bounds and outperforms a customized NSGA-III heuristic on real TenneT data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7fb8240693e4f7a680fdb8ff6d8f2e53cc47cb1a61d780a582584d678e8fa09a"},"source":{"id":"2605.03753","kind":"arxiv","version":2},"verdict":{"id":"8084af81-4df6-41aa-9c92-6147097a7be1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:27:28.573934Z","strongest_claim":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes","one_line_summary":"The block algorithm exactly enumerates the Pareto front for sequential multi-objective transmission topology planning in polynomial time for fixed bounds and outperforms a customized NSGA-III heuristic on real TenneT data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"that the four chosen operational objectives (N-1 worst-case loading, topological depth, switch count, time in non-reference topologies) sufficiently capture real TSO decision criteria and that the temporal block structure of feasible strategies remains exploitable under realistic operational bounds","pith_extraction_headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03753/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:34:57.568081Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.217214Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:03:33.764724Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"cc6fe68dee48e2cd960184759fd70acaac7fb0a886e76f9ba1e2bda0a60160ff"},"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":"2605.03753","created_at":"2026-06-05T01:15:25.131527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.03753v2","created_at":"2026-06-05T01:15:25.131527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03753","created_at":"2026-06-05T01:15:25.131527+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCFZUGWTC7SF","created_at":"2026-06-05T01:15:25.131527+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCFZUGWTC7SFTS5C","created_at":"2026-06-05T01:15:25.131527+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCFZUGWT","created_at":"2026-06-05T01:15:25.131527+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/CCFZUGWTC7SFTS5CXC7CMC56JI","json":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI.json","graph_json":"https://pith.science/api/pith-number/CCFZUGWTC7SFTS5CXC7CMC56JI/graph.json","events_json":"https://pith.science/api/pith-number/CCFZUGWTC7SFTS5CXC7CMC56JI/events.json","paper":"https://pith.science/paper/CCFZUGWT"},"agent_actions":{"view_html":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI","download_json":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI.json","view_paper":"https://pith.science/paper/CCFZUGWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.03753&json=true","fetch_graph":"https://pith.science/api/pith-number/CCFZUGWTC7SFTS5CXC7CMC56JI/graph.json","fetch_events":"https://pith.science/api/pith-number/CCFZUGWTC7SFTS5CXC7CMC56JI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/action/storage_attestation","attest_author":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/action/author_attestation","sign_citation":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/action/citation_signature","submit_replication":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/action/replication_record"}},"created_at":"2026-06-05T01:15:25.131527+00:00","updated_at":"2026-06-05T01:15:25.131527+00:00"}