{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NLZEVYVRDYONWBL2ZMM2Y3F7JQ","short_pith_number":"pith:NLZEVYVR","schema_version":"1.0","canonical_sha256":"6af24ae2b11e1cdb057acb19ac6cbf4c26b2176861ff0a7fd3df91ba91ebe263","source":{"kind":"arxiv","id":"2111.06824","version":3},"attestation_state":"computed","paper":{"title":"SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Elisabeth Gaar, Ivana Ljubi\\'c, Jon Lee, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","submitted_at":"2021-11-12T17:14:23Z","abstract_excerpt":"We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish a branch-and-cut algorithm for the problem class we study, and a cutting plane method for the problem variant with only binary "},"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":"2111.06824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-12T17:14:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7365d65daf1ff44b5cef5936492f2b923d44afda19381fed1a9717058b7138d5","abstract_canon_sha256":"e640e9fde5c297afe4a52d30bad790ffe23ccc10b1da6a56c9ce0f73bd671769"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:46.047061Z","signature_b64":"5AQRP1uLFTktq964sNZOGllXHjlbQlVjLz+S015I1Po8wvBSPIFVxNgMSR2Yob8q8kaJ1Q2zz+tRVHYVZa5CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6af24ae2b11e1cdb057acb19ac6cbf4c26b2176861ff0a7fd3df91ba91ebe263","last_reissued_at":"2026-07-05T04:38:46.046557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:46.046557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Elisabeth Gaar, Ivana Ljubi\\'c, Jon Lee, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","submitted_at":"2021-11-12T17:14:23Z","abstract_excerpt":"We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish a branch-and-cut algorithm for the problem class we study, and a cutting plane method for the problem variant with only binary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06824","kind":"arxiv","version":3},"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/2111.06824/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":"2111.06824","created_at":"2026-07-05T04:38:46.046615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06824v3","created_at":"2026-07-05T04:38:46.046615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06824","created_at":"2026-07-05T04:38:46.046615+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLZEVYVRDYON","created_at":"2026-07-05T04:38:46.046615+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLZEVYVRDYONWBL2","created_at":"2026-07-05T04:38:46.046615+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLZEVYVR","created_at":"2026-07-05T04:38:46.046615+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/NLZEVYVRDYONWBL2ZMM2Y3F7JQ","json":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ.json","graph_json":"https://pith.science/api/pith-number/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/graph.json","events_json":"https://pith.science/api/pith-number/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/events.json","paper":"https://pith.science/paper/NLZEVYVR"},"agent_actions":{"view_html":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ","download_json":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ.json","view_paper":"https://pith.science/paper/NLZEVYVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06824&json=true","fetch_graph":"https://pith.science/api/pith-number/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/action/storage_attestation","attest_author":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/action/author_attestation","sign_citation":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/action/citation_signature","submit_replication":"https://pith.science/pith/NLZEVYVRDYONWBL2ZMM2Y3F7JQ/action/replication_record"}},"created_at":"2026-07-05T04:38:46.046615+00:00","updated_at":"2026-07-05T04:38:46.046615+00:00"}