{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CKS7CL6EGPPL4XDQIR5XE7WS7Q","short_pith_number":"pith:CKS7CL6E","schema_version":"1.0","canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","source":{"kind":"arxiv","id":"2605.25100","version":1},"attestation_state":"computed","paper":{"title":"Price of Coupling in Multilevel Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Margarida Carvalho, Nagisa Sugishita","submitted_at":"2026-05-24T14:30:03Z","abstract_excerpt":"Multilevel programming is the standard framework for modeling hierarchical decision-making. In this paper, we characterize the computational complexity of deciding the existence of feasible and optimal solutions, as well as computing the optimal objective value in multilevel linear programming (LP). Our analysis considers various combinations of modeling assumptions, including the presence or absence of linking (coupling) constraints and whether all variables are bounded.\n  In particular, we show the feasibility problem of $k$-level LP is $\\Sigma^{p}_{k-1}$-complete for $k \\ge 2$. Without link"},"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":"2605.25100","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-24T14:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"bc0f8d768953df884c407b9bcc8f3343b87f765c1fa07ebabaf27981c73057ed","abstract_canon_sha256":"847576d62cbd688b50d25cc50887e3ba57c5b963d7ba8e66f6ed79d8087a1a2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:17.895233Z","signature_b64":"ELiui08TsHMkkdr3bs82ZtSzm1CzsnqYCXPOQRpsTDpvv8DIN1cRZTwteDNTvnRep7boExsjcoarIU/yNUn1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","last_reissued_at":"2026-05-26T02:04:17.894283Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:17.894283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Price of Coupling in Multilevel Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Margarida Carvalho, Nagisa Sugishita","submitted_at":"2026-05-24T14:30:03Z","abstract_excerpt":"Multilevel programming is the standard framework for modeling hierarchical decision-making. In this paper, we characterize the computational complexity of deciding the existence of feasible and optimal solutions, as well as computing the optimal objective value in multilevel linear programming (LP). Our analysis considers various combinations of modeling assumptions, including the presence or absence of linking (coupling) constraints and whether all variables are bounded.\n  In particular, we show the feasibility problem of $k$-level LP is $\\Sigma^{p}_{k-1}$-complete for $k \\ge 2$. Without link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25100","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/2605.25100/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":"2605.25100","created_at":"2026-05-26T02:04:17.894441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25100v1","created_at":"2026-05-26T02:04:17.894441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25100","created_at":"2026-05-26T02:04:17.894441+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKS7CL6EGPPL","created_at":"2026-05-26T02:04:17.894441+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKS7CL6EGPPL4XDQ","created_at":"2026-05-26T02:04:17.894441+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKS7CL6E","created_at":"2026-05-26T02:04:17.894441+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/CKS7CL6EGPPL4XDQIR5XE7WS7Q","json":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q.json","graph_json":"https://pith.science/api/pith-number/CKS7CL6EGPPL4XDQIR5XE7WS7Q/graph.json","events_json":"https://pith.science/api/pith-number/CKS7CL6EGPPL4XDQIR5XE7WS7Q/events.json","paper":"https://pith.science/paper/CKS7CL6E"},"agent_actions":{"view_html":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q","download_json":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q.json","view_paper":"https://pith.science/paper/CKS7CL6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25100&json=true","fetch_graph":"https://pith.science/api/pith-number/CKS7CL6EGPPL4XDQIR5XE7WS7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/CKS7CL6EGPPL4XDQIR5XE7WS7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/action/storage_attestation","attest_author":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/action/author_attestation","sign_citation":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/action/citation_signature","submit_replication":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/action/replication_record"}},"created_at":"2026-05-26T02:04:17.894441+00:00","updated_at":"2026-05-26T02:04:17.894441+00:00"}