{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CKS7CL6EGPPL4XDQIR5XE7WS7Q","short_pith_number":"pith:CKS7CL6E","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"},"canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","source":{"kind":"arxiv","id":"2605.25100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25100","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25100v1","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25100","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"CKS7CL6EGPPL","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKS7CL6EGPPL4XDQ","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKS7CL6E","created_at":"2026-05-26T02:04:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CKS7CL6EGPPL4XDQIR5XE7WS7Q","target":"record","payload":{"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"},"canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","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"},"source_kind":"arxiv","source_id":"2605.25100","source_version":1,"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-26T02:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N38NELGhYO7RS3oRY3Ac4npanVNKw50Wu5g3y0Zseum2I1ZEawRM7VLS0EGMrMHl7jxuZ4QjWJpLiGeOkxv8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:44:45.648084Z"},"content_sha256":"3a5cfd79cc0bdda000357c8e47b5489de08b163e6be7b96e842a1594342b0178","schema_version":"1.0","event_id":"sha256:3a5cfd79cc0bdda000357c8e47b5489de08b163e6be7b96e842a1594342b0178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CKS7CL6EGPPL4XDQIR5XE7WS7Q","target":"graph","payload":{"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"},"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-26T02:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M89Z6oAuO6U+MQXz1bSRqOo6gOhC8S9hvBLcasmtzHATWkZ1jqyf5ohzHJq/UCOJ6tAVo1R4UPqfwUERVBILBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:44:45.648486Z"},"content_sha256":"21798678d8b101978b131e9d77e30ff8f9ecf44f944c8bace86b8ac7dbc16aba","schema_version":"1.0","event_id":"sha256:21798678d8b101978b131e9d77e30ff8f9ecf44f944c8bace86b8ac7dbc16aba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/bundle.json","state_url":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/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-25T19:44:45Z","links":{"resolver":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q","bundle":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/bundle.json","state":"https://pith.science/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKS7CL6EGPPL4XDQIR5XE7WS7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CKS7CL6EGPPL4XDQIR5XE7WS7Q","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":"847576d62cbd688b50d25cc50887e3ba57c5b963d7ba8e66f6ed79d8087a1a2a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-24T14:30:03Z","title_canon_sha256":"bc0f8d768953df884c407b9bcc8f3343b87f765c1fa07ebabaf27981c73057ed"},"schema_version":"1.0","source":{"id":"2605.25100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25100","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25100v1","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25100","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"CKS7CL6EGPPL","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKS7CL6EGPPL4XDQ","created_at":"2026-05-26T02:04:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKS7CL6E","created_at":"2026-05-26T02:04:17Z"}],"graph_snapshots":[{"event_id":"sha256:21798678d8b101978b131e9d77e30ff8f9ecf44f944c8bace86b8ac7dbc16aba","target":"graph","created_at":"2026-05-26T02:04:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.25100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Margarida Carvalho, Nagisa Sugishita","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-24T14:30:03Z","title":"Price of Coupling in Multilevel Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25100","kind":"arxiv","version":1},"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:3a5cfd79cc0bdda000357c8e47b5489de08b163e6be7b96e842a1594342b0178","target":"record","created_at":"2026-05-26T02:04:17Z","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":"847576d62cbd688b50d25cc50887e3ba57c5b963d7ba8e66f6ed79d8087a1a2a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-24T14:30:03Z","title_canon_sha256":"bc0f8d768953df884c407b9bcc8f3343b87f765c1fa07ebabaf27981c73057ed"},"schema_version":"1.0","source":{"id":"2605.25100","kind":"arxiv","version":1}},"canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12a5f12fc433debe5c70447b727ed2fc26530df488e468732808e2c610343323","first_computed_at":"2026-05-26T02:04:17.894283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:17.894283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELiui08TsHMkkdr3bs82ZtSzm1CzsnqYCXPOQRpsTDpvv8DIN1cRZTwteDNTvnRep7boExsjcoarIU/yNUn1CQ==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:17.895233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a5cfd79cc0bdda000357c8e47b5489de08b163e6be7b96e842a1594342b0178","sha256:21798678d8b101978b131e9d77e30ff8f9ecf44f944c8bace86b8ac7dbc16aba"],"state_sha256":"ed0d5d800ff05754ce4004618440861d4a5f09c6a6b79e114bfa02a584b68243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EwrgeB0Oww1zIjR4yiLbdMbmdt7VTETmKgqfpePiuwwAfd96aPyYF5XgdW30eH8VHk2lUvuFB11RPNj8cxfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:44:45.650533Z","bundle_sha256":"eb645eca73bc51c2f7abc877735fa03e57f0190afb6fb508333b79b8e2f99359"}}