{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7EF6RYMEB74USAS4LZZLGXCCBW","short_pith_number":"pith:7EF6RYME","schema_version":"1.0","canonical_sha256":"f90be8e1840ff949025c5e72b35c420da3db999ad07d4905f15eb35eb8acf0de","source":{"kind":"arxiv","id":"1704.07025","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.07025","created_at":"2026-05-18T00:33:34.767577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07025v2","created_at":"2026-05-18T00:33:34.767577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07025","created_at":"2026-05-18T00:33:34.767577+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EF6RYMEB74U","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EF6RYMEB74USAS4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EF6RYME","created_at":"2026-05-18T12:31:05.417338+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/7EF6RYMEB74USAS4LZZLGXCCBW","json":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW.json","graph_json":"https://pith.science/api/pith-number/7EF6RYMEB74USAS4LZZLGXCCBW/graph.json","events_json":"https://pith.science/api/pith-number/7EF6RYMEB74USAS4LZZLGXCCBW/events.json","paper":"https://pith.science/paper/7EF6RYME"},"agent_actions":{"view_html":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW","download_json":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW.json","view_paper":"https://pith.science/paper/7EF6RYME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07025&json=true","fetch_graph":"https://pith.science/api/pith-number/7EF6RYMEB74USAS4LZZLGXCCBW/graph.json","fetch_events":"https://pith.science/api/pith-number/7EF6RYMEB74USAS4LZZLGXCCBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/action/storage_attestation","attest_author":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/action/author_attestation","sign_citation":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/action/citation_signature","submit_replication":"https://pith.science/pith/7EF6RYMEB74USAS4LZZLGXCCBW/action/replication_record"}},"created_at":"2026-05-18T00:33:34.767577+00:00","updated_at":"2026-05-18T00:33:34.767577+00:00"}