{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WISKVOQMCNO46PC4UEFA2SI2WM","short_pith_number":"pith:WISKVOQM","schema_version":"1.0","canonical_sha256":"b224aaba0c135dcf3c5ca10a0d491ab313f845d9f86b684d0a79c80e57a538d9","source":{"kind":"arxiv","id":"2302.10037","version":2},"attestation_state":"computed","paper":{"title":"A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anna Jacobson, Filippo Pecci, Jesse Jenkins, Nestor Sepulveda, Qingyu Xu","submitted_at":"2023-02-20T15:42:29Z","abstract_excerpt":"Energy systems planning models identify least-cost strategies for expansion and operation of energy systems and provide decision support for investment, planning, regulation, and policy. Most are formulated as linear programming (LP) or mixed integer linear programming (MILP) problems. Despite the relative efficiency and maturity of LP and MILP solvers, large scale problems are often intractable without abstractions that impact quality of results and generalizability of findings. We consider a macro-energy systems planning problem with detailed operations and policy constraints and formulate a"},"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":"2302.10037","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-20T15:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"51c9d74ba0eea8ebf1fdb77f171ef0347f012128f291042ed60fe51658255b20","abstract_canon_sha256":"753f5b32786cfb7bc0713401d0bb4ffe1fd108951a1a3a95e27da1758f5cc275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:36.910739Z","signature_b64":"GfYmfYBm69SLL8D4yLOByHw+VA3tcX+AcrUfU1zJwagSOV96v2BfKfjXwEr0HWzngLZZ/3jT3dHDptVJFEgoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b224aaba0c135dcf3c5ca10a0d491ab313f845d9f86b684d0a79c80e57a538d9","last_reissued_at":"2026-07-05T09:57:36.910125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:36.910125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anna Jacobson, Filippo Pecci, Jesse Jenkins, Nestor Sepulveda, Qingyu Xu","submitted_at":"2023-02-20T15:42:29Z","abstract_excerpt":"Energy systems planning models identify least-cost strategies for expansion and operation of energy systems and provide decision support for investment, planning, regulation, and policy. Most are formulated as linear programming (LP) or mixed integer linear programming (MILP) problems. Despite the relative efficiency and maturity of LP and MILP solvers, large scale problems are often intractable without abstractions that impact quality of results and generalizability of findings. We consider a macro-energy systems planning problem with detailed operations and policy constraints and formulate a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10037","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.10037/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":"2302.10037","created_at":"2026-07-05T09:57:36.910197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10037v2","created_at":"2026-07-05T09:57:36.910197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10037","created_at":"2026-07-05T09:57:36.910197+00:00"},{"alias_kind":"pith_short_12","alias_value":"WISKVOQMCNO4","created_at":"2026-07-05T09:57:36.910197+00:00"},{"alias_kind":"pith_short_16","alias_value":"WISKVOQMCNO46PC4","created_at":"2026-07-05T09:57:36.910197+00:00"},{"alias_kind":"pith_short_8","alias_value":"WISKVOQM","created_at":"2026-07-05T09:57:36.910197+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07329","citing_title":"Sampling and Optimization meet Enhanced Flows","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM","json":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM.json","graph_json":"https://pith.science/api/pith-number/WISKVOQMCNO46PC4UEFA2SI2WM/graph.json","events_json":"https://pith.science/api/pith-number/WISKVOQMCNO46PC4UEFA2SI2WM/events.json","paper":"https://pith.science/paper/WISKVOQM"},"agent_actions":{"view_html":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM","download_json":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM.json","view_paper":"https://pith.science/paper/WISKVOQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10037&json=true","fetch_graph":"https://pith.science/api/pith-number/WISKVOQMCNO46PC4UEFA2SI2WM/graph.json","fetch_events":"https://pith.science/api/pith-number/WISKVOQMCNO46PC4UEFA2SI2WM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM/action/storage_attestation","attest_author":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM/action/author_attestation","sign_citation":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM/action/citation_signature","submit_replication":"https://pith.science/pith/WISKVOQMCNO46PC4UEFA2SI2WM/action/replication_record"}},"created_at":"2026-07-05T09:57:36.910197+00:00","updated_at":"2026-07-05T09:57:36.910197+00:00"}