{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WM4D4QNY6UG33VKFOB6JI3IRBG","short_pith_number":"pith:WM4D4QNY","schema_version":"1.0","canonical_sha256":"b3383e41b8f50dbdd545707c946d11098df8bcca321bb12e9c44f26733bc39b6","source":{"kind":"arxiv","id":"2106.13240","version":1},"attestation_state":"computed","paper":{"title":"Iterative LP-based Methods for the Multiperiod Optimal Electricity and Gas Flow Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Isam Saedi, Pierluigi Mancarella, Sleiman Mhanna","submitted_at":"2021-06-24T11:43:52Z","abstract_excerpt":"In light of the increasing coupling between electricity and gas networks, this paper introduces two novel iterative methods for efficiently solving the multiperiod optimal electricity and gas flow (MOEGF) problem. The first is an iterative MILP-based method and the second is an iterative LP-based method with an elaborate procedure for ensuring an integral solution. The convergence of the two approaches is founded on two key features. The first is a penalty term with a single, automatically tuned, parameter for controlling the step size of the gas network iterates. The second is a sequence of s"},"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":"2106.13240","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-24T11:43:52Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"808df939019038b692944293e11fd276abba737ab85fab13fce17968c94d9590","abstract_canon_sha256":"c0dc26556a3e0f356222e042b1c487606656be81168a581729fcfeaa10b1c435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:17.399045Z","signature_b64":"MOXaC9+HEBKKLOc8E4SHcErPKPhVtlF/TuRNYrXIF553aJdztzoOgtIfC9JfYnf0zOVjImpxd5SvVxcGH2IaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3383e41b8f50dbdd545707c946d11098df8bcca321bb12e9c44f26733bc39b6","last_reissued_at":"2026-07-05T02:52:17.398600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:17.398600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative LP-based Methods for the Multiperiod Optimal Electricity and Gas Flow Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Isam Saedi, Pierluigi Mancarella, Sleiman Mhanna","submitted_at":"2021-06-24T11:43:52Z","abstract_excerpt":"In light of the increasing coupling between electricity and gas networks, this paper introduces two novel iterative methods for efficiently solving the multiperiod optimal electricity and gas flow (MOEGF) problem. The first is an iterative MILP-based method and the second is an iterative LP-based method with an elaborate procedure for ensuring an integral solution. The convergence of the two approaches is founded on two key features. The first is a penalty term with a single, automatically tuned, parameter for controlling the step size of the gas network iterates. The second is a sequence of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13240","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/2106.13240/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.13240","created_at":"2026-07-05T02:52:17.398657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13240v1","created_at":"2026-07-05T02:52:17.398657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13240","created_at":"2026-07-05T02:52:17.398657+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM4D4QNY6UG3","created_at":"2026-07-05T02:52:17.398657+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM4D4QNY6UG33VKF","created_at":"2026-07-05T02:52:17.398657+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM4D4QNY","created_at":"2026-07-05T02:52:17.398657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24037","citing_title":"Mode-as-Sequence: Translating Multimodal Motion Prediction into Unified Sequential Mode Modeling","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG","json":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG.json","graph_json":"https://pith.science/api/pith-number/WM4D4QNY6UG33VKFOB6JI3IRBG/graph.json","events_json":"https://pith.science/api/pith-number/WM4D4QNY6UG33VKFOB6JI3IRBG/events.json","paper":"https://pith.science/paper/WM4D4QNY"},"agent_actions":{"view_html":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG","download_json":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG.json","view_paper":"https://pith.science/paper/WM4D4QNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13240&json=true","fetch_graph":"https://pith.science/api/pith-number/WM4D4QNY6UG33VKFOB6JI3IRBG/graph.json","fetch_events":"https://pith.science/api/pith-number/WM4D4QNY6UG33VKFOB6JI3IRBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG/action/storage_attestation","attest_author":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG/action/author_attestation","sign_citation":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG/action/citation_signature","submit_replication":"https://pith.science/pith/WM4D4QNY6UG33VKFOB6JI3IRBG/action/replication_record"}},"created_at":"2026-07-05T02:52:17.398657+00:00","updated_at":"2026-07-05T02:52:17.398657+00:00"}