{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NLZEVYVRDYONWBL2ZMM2Y3F7JQ","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":"e640e9fde5c297afe4a52d30bad790ffe23ccc10b1da6a56c9ce0f73bd671769","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-12T17:14:23Z","title_canon_sha256":"7365d65daf1ff44b5cef5936492f2b923d44afda19381fed1a9717058b7138d5"},"schema_version":"1.0","source":{"id":"2111.06824","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06824","created_at":"2026-07-05T04:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06824v3","created_at":"2026-07-05T04:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06824","created_at":"2026-07-05T04:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"NLZEVYVRDYON","created_at":"2026-07-05T04:38:46Z"},{"alias_kind":"pith_short_16","alias_value":"NLZEVYVRDYONWBL2","created_at":"2026-07-05T04:38:46Z"},{"alias_kind":"pith_short_8","alias_value":"NLZEVYVR","created_at":"2026-07-05T04:38:46Z"}],"graph_snapshots":[{"event_id":"sha256:d4e4a301d7d5f87bc0421125518435750974b83221ef0f0aa499c2fdff20c224","target":"graph","created_at":"2026-07-05T04:38:46Z","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/2111.06824/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Elisabeth Gaar, Ivana Ljubi\\'c, Jon Lee, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-12T17:14:23Z","title":"SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06824","kind":"arxiv","version":3},"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:f33b4e5ff83c68202890bff9aa24ec99f5d0fbcff58a27d114a5f83b835cf58a","target":"record","created_at":"2026-07-05T04:38:46Z","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":"e640e9fde5c297afe4a52d30bad790ffe23ccc10b1da6a56c9ce0f73bd671769","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-12T17:14:23Z","title_canon_sha256":"7365d65daf1ff44b5cef5936492f2b923d44afda19381fed1a9717058b7138d5"},"schema_version":"1.0","source":{"id":"2111.06824","kind":"arxiv","version":3}},"canonical_sha256":"6af24ae2b11e1cdb057acb19ac6cbf4c26b2176861ff0a7fd3df91ba91ebe263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6af24ae2b11e1cdb057acb19ac6cbf4c26b2176861ff0a7fd3df91ba91ebe263","first_computed_at":"2026-07-05T04:38:46.046557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:46.046557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5AQRP1uLFTktq964sNZOGllXHjlbQlVjLz+S015I1Po8wvBSPIFVxNgMSR2Yob8q8kaJ1Q2zz+tRVHYVZa5CAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:46.047061Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.06824","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f33b4e5ff83c68202890bff9aa24ec99f5d0fbcff58a27d114a5f83b835cf58a","sha256:d4e4a301d7d5f87bc0421125518435750974b83221ef0f0aa499c2fdff20c224"],"state_sha256":"37c9f149da4184fe32ca430a478e8b8deee33095f2d38c74a14468a819124aa4"}