{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7EF6RYMEB74USAS4LZZLGXCCBW","short_pith_number":"pith:7EF6RYME","canonical_record":{"source":{"id":"1704.07025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-24T03:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"634481a7abfb4ec610d2accf2f07f5e1c5f3ac347663d064d42882fd47861cba","abstract_canon_sha256":"4633a1a5e43d231439bb6a660d80235526e72d96ecd011e98bf71f80548ed6c3"},"schema_version":"1.0"},"canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","source":{"kind":"arxiv","id":"1704.07025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07025","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07025v2","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07025","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"7EF6RYMEB74U","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7EF6RYMEB74USAS4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7EF6RYME","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7EF6RYMEB74USAS4LZZLGXCCBW","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-24T03:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"634481a7abfb4ec610d2accf2f07f5e1c5f3ac347663d064d42882fd47861cba","abstract_canon_sha256":"4633a1a5e43d231439bb6a660d80235526e72d96ecd011e98bf71f80548ed6c3"},"schema_version":"1.0"},"canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.768011Z","signature_b64":"H08YDZJ2dB7Fvoa4n76YJnL31pdBSUMj4Gwrk2GP19xygZH3mqdbbDXYDWmoNpDPf/+k1GazhgbZW86zvmlZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","last_reissued_at":"2026-05-18T00:33:34.767494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.767494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07025","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-05-18T00:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhE+CL8Ctk2c2L0UyTqRTxhOqWGvw50DDgxj7H56xKmc0lykUQFYX/+EFa36NUL6xurAWRr08Dk9v34TuybbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:55:28.731298Z"},"content_sha256":"37d4eb0d10f4addd1576b6998a074b32769e64296c8b7da455e6770454098a32","schema_version":"1.0","event_id":"sha256:37d4eb0d10f4addd1576b6998a074b32769e64296c8b7da455e6770454098a32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7EF6RYMEB74USAS4LZZLGXCCBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Robust Tie-line Scheduling in Multi-Area Power Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lang Tong, Subhonmesh Bose, Ye Guo","submitted_at":"2017-04-24T03:22:17Z","abstract_excerpt":"The tie-line scheduling problem in a multi-area power system seeks to optimize tie-line power flows across areas that are independently operated by different system operators (SOs). In this paper, we leverage the theory of multi-parametric linear programming to propose algorithms for optimal tie-line scheduling within a deterministic and a robust optimization framework. Through a coordinator, the proposed algorithms are proved to converge to the optimal schedule within a finite number of iterations. A key feature of the proposed algorithms, besides their finite step convergence, is the privacy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07025","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"},"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-18T00:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvjbuQqkRos43uYlYl7whdTeQsDMwzfPRcFvz5ETZGcG4xh0sycf3qOrus5kYvdfjF+/5MiF0uRUYSgAWcqOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:55:28.731648Z"},"content_sha256":"1bbb1b79e7819fb172c9cbdb239970cc0e23bb82c212dbd58e1a3199b75affcb","schema_version":"1.0","event_id":"sha256:1bbb1b79e7819fb172c9cbdb239970cc0e23bb82c212dbd58e1a3199b75affcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/bundle.json","state_url":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EF6RYMEB74USAS4LZZLGXCCBW/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-29T11:55:28Z","links":{"resolver":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW","bundle":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/bundle.json","state":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EF6RYMEB74USAS4LZZLGXCCBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7EF6RYMEB74USAS4LZZLGXCCBW","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":"4633a1a5e43d231439bb6a660d80235526e72d96ecd011e98bf71f80548ed6c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-24T03:22:17Z","title_canon_sha256":"634481a7abfb4ec610d2accf2f07f5e1c5f3ac347663d064d42882fd47861cba"},"schema_version":"1.0","source":{"id":"1704.07025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07025","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07025v2","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07025","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"7EF6RYMEB74U","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7EF6RYMEB74USAS4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7EF6RYME","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:1bbb1b79e7819fb172c9cbdb239970cc0e23bb82c212dbd58e1a3199b75affcb","target":"graph","created_at":"2026-05-18T00:33:34Z","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":"The tie-line scheduling problem in a multi-area power system seeks to optimize tie-line power flows across areas that are independently operated by different system operators (SOs). In this paper, we leverage the theory of multi-parametric linear programming to propose algorithms for optimal tie-line scheduling within a deterministic and a robust optimization framework. Through a coordinator, the proposed algorithms are proved to converge to the optimal schedule within a finite number of iterations. A key feature of the proposed algorithms, besides their finite step convergence, is the privacy","authors_text":"Lang Tong, Subhonmesh Bose, Ye Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-24T03:22:17Z","title":"On Robust Tie-line Scheduling in Multi-Area Power Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07025","kind":"arxiv","version":2},"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:37d4eb0d10f4addd1576b6998a074b32769e64296c8b7da455e6770454098a32","target":"record","created_at":"2026-05-18T00:33:34Z","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":"4633a1a5e43d231439bb6a660d80235526e72d96ecd011e98bf71f80548ed6c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-24T03:22:17Z","title_canon_sha256":"634481a7abfb4ec610d2accf2f07f5e1c5f3ac347663d064d42882fd47861cba"},"schema_version":"1.0","source":{"id":"1704.07025","kind":"arxiv","version":2}},"canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","first_computed_at":"2026-05-18T00:33:34.767494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:34.767494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H08YDZJ2dB7Fvoa4n76YJnL31pdBSUMj4Gwrk2GP19xygZH3mqdbbDXYDWmoNpDPf/+k1GazhgbZW86zvmlZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:34.768011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37d4eb0d10f4addd1576b6998a074b32769e64296c8b7da455e6770454098a32","sha256:1bbb1b79e7819fb172c9cbdb239970cc0e23bb82c212dbd58e1a3199b75affcb"],"state_sha256":"946350b3d4345de987383e392f967cba5ce8729a72fce311b3ef667b91323b20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sX/eADUf4t8kz+fWHqmit+nqQphJ51UHJ9bsDzc0lNR2I+mLgimAEPSWaKkSlR8z9JG7ul7Y0gyvNdM9KshPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:55:28.733481Z","bundle_sha256":"2c84127adaab0778cbadd03167685c33069d45135ec5856a39df0ff74815fcb5"}}