{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JXZASM7ZFFZ2ED5H34TPPDU2ZV","short_pith_number":"pith:JXZASM7Z","canonical_record":{"source":{"id":"2507.20465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T01:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"a483d32fef81fad4cb9442acc260bf0a9a49d380f77b3578a82065aae16e73a0","abstract_canon_sha256":"bf31365a4a1e32bad2a8110700d542a285083d97f1d741833b85d0ceeb9ead54"},"schema_version":"1.0"},"canonical_sha256":"4df20933f92973a20fa7df26f78e9acd49ca59daa6c0827252f39ea5dafe54c7","source":{"kind":"arxiv","id":"2507.20465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20465","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20465v1","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20465","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"JXZASM7ZFFZ2","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_16","alias_value":"JXZASM7ZFFZ2ED5H","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_8","alias_value":"JXZASM7Z","created_at":"2026-07-05T11:44:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JXZASM7ZFFZ2ED5H34TPPDU2ZV","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T01:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"a483d32fef81fad4cb9442acc260bf0a9a49d380f77b3578a82065aae16e73a0","abstract_canon_sha256":"bf31365a4a1e32bad2a8110700d542a285083d97f1d741833b85d0ceeb9ead54"},"schema_version":"1.0"},"canonical_sha256":"4df20933f92973a20fa7df26f78e9acd49ca59daa6c0827252f39ea5dafe54c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:19.795895Z","signature_b64":"rbwu3tsxpjwc3JyIMHRgvVAuNPhjTQV2JoSxArgVaFWIWEk5vWZFwI+TaODG67VC0rENWVz7RVXLEgwnPQ+OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df20933f92973a20fa7df26f78e9acd49ca59daa6c0827252f39ea5dafe54c7","last_reissued_at":"2026-07-05T11:44:19.795400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:19.795400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20465","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-07-05T11:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaJY4auka4Tv1ZKkLPveLhoAN4PHG5r6eN+NB8kg6BrPGhUCam5WU2QBHZIPqLSTAmJJJt99kh16Qo5zqGIfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:18:35.377819Z"},"content_sha256":"c9a75e8c0d3445583ed8905881f9dce5c248c41a7ed9f92a45057e8ff73a73d0","schema_version":"1.0","event_id":"sha256:c9a75e8c0d3445583ed8905881f9dce5c248c41a7ed9f92a45057e8ff73a73d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JXZASM7ZFFZ2ED5H34TPPDU2ZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relax-and-Cut for Temporal SCUC Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Jianghua Wu, Jinxin Xiong, Linxin Yang, Shunbo Lei, Yanting Huang, Yingxiao Wang","submitted_at":"2025-07-28T01:56:29Z","abstract_excerpt":"The Security-Constrained Unit Commitment (SCUC) problem presents formidable computational challenges due to its combinatorial complexity, large-scale network dimensions, and numerous security constraints. While conventional temporal decomposition methods achieve computational tractability through fixed short-term time windows, this limited look-ahead capability often results in suboptimal, myopic solutions. We propose an innovative relax-and-cut framework that alleviates these limitations through two key innovations. First, our enhanced temporal decomposition strategy maintains integer variabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.20465/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7qNC62fokFk3z9iClLS4pC6IQvgEZofEYoRu1WGDfbvpa9OwuV0ebgclVFPkUvvwsABKHwwOV2R0bnTBYXUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:18:35.378212Z"},"content_sha256":"785b1b17b169646c3782dfaf3062b94f32eca76fc8463f4dce47b4d17823950b","schema_version":"1.0","event_id":"sha256:785b1b17b169646c3782dfaf3062b94f32eca76fc8463f4dce47b4d17823950b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/bundle.json","state_url":"https://pith.science/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/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-08-14T02:18:35Z","links":{"resolver":"https://pith.science/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV","bundle":"https://pith.science/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/bundle.json","state":"https://pith.science/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXZASM7ZFFZ2ED5H34TPPDU2ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JXZASM7ZFFZ2ED5H34TPPDU2ZV","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":"bf31365a4a1e32bad2a8110700d542a285083d97f1d741833b85d0ceeb9ead54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T01:56:29Z","title_canon_sha256":"a483d32fef81fad4cb9442acc260bf0a9a49d380f77b3578a82065aae16e73a0"},"schema_version":"1.0","source":{"id":"2507.20465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20465","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20465v1","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20465","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"JXZASM7ZFFZ2","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_16","alias_value":"JXZASM7ZFFZ2ED5H","created_at":"2026-07-05T11:44:19Z"},{"alias_kind":"pith_short_8","alias_value":"JXZASM7Z","created_at":"2026-07-05T11:44:19Z"}],"graph_snapshots":[{"event_id":"sha256:785b1b17b169646c3782dfaf3062b94f32eca76fc8463f4dce47b4d17823950b","target":"graph","created_at":"2026-07-05T11:44:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.20465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Security-Constrained Unit Commitment (SCUC) problem presents formidable computational challenges due to its combinatorial complexity, large-scale network dimensions, and numerous security constraints. While conventional temporal decomposition methods achieve computational tractability through fixed short-term time windows, this limited look-ahead capability often results in suboptimal, myopic solutions. We propose an innovative relax-and-cut framework that alleviates these limitations through two key innovations. First, our enhanced temporal decomposition strategy maintains integer variabl","authors_text":"Akang Wang, Jianghua Wu, Jinxin Xiong, Linxin Yang, Shunbo Lei, Yanting Huang, Yingxiao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T01:56:29Z","title":"Relax-and-Cut for Temporal SCUC Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20465","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:c9a75e8c0d3445583ed8905881f9dce5c248c41a7ed9f92a45057e8ff73a73d0","target":"record","created_at":"2026-07-05T11:44:19Z","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":"bf31365a4a1e32bad2a8110700d542a285083d97f1d741833b85d0ceeb9ead54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T01:56:29Z","title_canon_sha256":"a483d32fef81fad4cb9442acc260bf0a9a49d380f77b3578a82065aae16e73a0"},"schema_version":"1.0","source":{"id":"2507.20465","kind":"arxiv","version":1}},"canonical_sha256":"4df20933f92973a20fa7df26f78e9acd49ca59daa6c0827252f39ea5dafe54c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4df20933f92973a20fa7df26f78e9acd49ca59daa6c0827252f39ea5dafe54c7","first_computed_at":"2026-07-05T11:44:19.795400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:19.795400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rbwu3tsxpjwc3JyIMHRgvVAuNPhjTQV2JoSxArgVaFWIWEk5vWZFwI+TaODG67VC0rENWVz7RVXLEgwnPQ+OCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:19.795895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a75e8c0d3445583ed8905881f9dce5c248c41a7ed9f92a45057e8ff73a73d0","sha256:785b1b17b169646c3782dfaf3062b94f32eca76fc8463f4dce47b4d17823950b"],"state_sha256":"ca53d2b83840caee4a1f91494fbb82e8d6cd87ee3d7bf5263e595aa3da8f67cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yErSKh+68Fjdx/nL1maUQr8YUk14/xa16tMnZ+23rJYoEcwUb6yANDMG9AYOMmuGJGno76r5A5MOFUJy6F+WBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:18:35.381151Z","bundle_sha256":"d8cf5fd5b8d34f5dd8317eba0124ed81b6b53c224409ccf93a8d20d68e75e97c"}}