{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CCFZUGWTC7SFTS5CXC7CMC56JI","short_pith_number":"pith:CCFZUGWT","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"},"canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","source":{"kind":"arxiv","id":"2605.03753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03753","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03753v2","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03753","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"CCFZUGWTC7SF","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"CCFZUGWTC7SFTS5C","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"CCFZUGWT","created_at":"2026-06-05T01:15:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CCFZUGWTC7SFTS5CXC7CMC56JI","target":"record","payload":{"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"},"canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","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"},"source_kind":"arxiv","source_id":"2605.03753","source_version":2,"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-06-05T01:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXZBtAgn9FX6mKLqcQ2iBcgo3rCriSvkF2jPCjzCYzwyKy7MapHymsrBHHkFiCsy576FKbbDqQMCtyunYvN1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:55:40.264710Z"},"content_sha256":"9cced19424e2ef99ace6a52c2d51209cf8d314c870d0600f85c8b1d7348baa87","schema_version":"1.0","event_id":"sha256:9cced19424e2ef99ace6a52c2d51209cf8d314c870d0600f85c8b1d7348baa87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CCFZUGWTC7SFTS5CXC7CMC56JI","target":"graph","payload":{"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"},"verdict_id":"8084af81-4df6-41aa-9c92-6147097a7be1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-05T01:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17zxePuxA5qlYVgVfsc/ddAa9Ci99LnvYhW9NxVcjPNKh7rxPMMAPywScfV+tST/Ib+J5JdJ+1JJy7sq5+W2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:55:40.265203Z"},"content_sha256":"75bb575ae8e40111e394de9e97c15d55edc070d5f4f1150d689e702510e937ab","schema_version":"1.0","event_id":"sha256:75bb575ae8e40111e394de9e97c15d55edc070d5f4f1150d689e702510e937ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/bundle.json","state_url":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/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-06-09T09:55:40Z","links":{"resolver":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI","bundle":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/bundle.json","state":"https://pith.science/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCFZUGWTC7SFTS5CXC7CMC56JI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CCFZUGWTC7SFTS5CXC7CMC56JI","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":"2bcbe93920bd6792fc1c7377f2dadacbd935e954f47c5c5a10fac2bd0770fe47","cross_cats_sorted":["cs.NE","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T13:38:30Z","title_canon_sha256":"a16d0b3f995c62ef68d784c5905928ddca0688aead27efe1f2fe2c6f92721e8b"},"schema_version":"1.0","source":{"id":"2605.03753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03753","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03753v2","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03753","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"CCFZUGWTC7SF","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"CCFZUGWTC7SFTS5C","created_at":"2026-06-05T01:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"CCFZUGWT","created_at":"2026-06-05T01:15:25Z"}],"graph_snapshots":[{"event_id":"sha256:75bb575ae8e40111e394de9e97c15d55edc070d5f4f1150d689e702510e937ab","target":"graph","created_at":"2026-06-05T01:15:25Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data."}],"snapshot_sha256":"7fb8240693e4f7a680fdb8ff6d8f2e53cc47cb1a61d780a582584d678e8fa09a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.03753/integrity.json","findings":[],"snapshot_sha256":"cc6fe68dee48e2cd960184759fd70acaac7fb0a886e76f9ba1e2bda0a60160ff","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alessandro Zocca, Jan Viebahn, Job Groeneveld, Miguel Mu\\~noz","cross_cats":["cs.NE","cs.SY","eess.SY"],"headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T13:38:30Z","title":"Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03753","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T15:27:28.573934Z","id":"8084af81-4df6-41aa-9c92-6147097a7be1","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","strongest_claim":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes","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"}},"verdict_id":"8084af81-4df6-41aa-9c92-6147097a7be1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cced19424e2ef99ace6a52c2d51209cf8d314c870d0600f85c8b1d7348baa87","target":"record","created_at":"2026-06-05T01:15:25Z","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":"2bcbe93920bd6792fc1c7377f2dadacbd935e954f47c5c5a10fac2bd0770fe47","cross_cats_sorted":["cs.NE","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T13:38:30Z","title_canon_sha256":"a16d0b3f995c62ef68d784c5905928ddca0688aead27efe1f2fe2c6f92721e8b"},"schema_version":"1.0","source":{"id":"2605.03753","kind":"arxiv","version":2}},"canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"108b9a1ad317e459cba2b8be260bbe4a31aa5e1c0f1f0008fcf13d3deb0ae669","first_computed_at":"2026-06-05T01:15:25.131462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:25.131462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdGRuarHyw7xYkD1+7FixTPsOsQ3BDEEajsZXWzSTZ+wR/zzk5D7I9fJmAO9RR43CkxUT9nAgrBmC8Ipdh7OBA==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:25.131928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cced19424e2ef99ace6a52c2d51209cf8d314c870d0600f85c8b1d7348baa87","sha256:75bb575ae8e40111e394de9e97c15d55edc070d5f4f1150d689e702510e937ab"],"state_sha256":"9ebbbca9a6f99c39e6d373192ce7e0021b872d56c8f9de05b70cdfcfa7341329"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ru/xAmcvE1Y7J4MVqRagEM16Tx+iOJECTzsEqXzRpR+BdYvvGw1a4p3gw/AVoe6udi5DRUKM309E7y7bBf2cCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:55:40.267478Z","bundle_sha256":"842ea2ef4eff82e1d121e6504b158738ea4d19f0f0a451163535a5c7f9b98fda"}}