{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VH4J2ENU6CNWGXBJQI5FXF2SYC","short_pith_number":"pith:VH4J2ENU","canonical_record":{"source":{"id":"2207.05014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-11T17:02:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4e0a38e784aca72155216215e3a57cdd2a2ab0279b6d3d67d2b5a4060e097ffa","abstract_canon_sha256":"fa79e3eec89e16d885b1c6ec6713281ad5238cc4e3f6438ff342e02f41e7c0d8"},"schema_version":"1.0"},"canonical_sha256":"a9f89d11b4f09b635c29823a5b9752c0af74532c2fecaaffba73e5b3f0584598","source":{"kind":"arxiv","id":"2207.05014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05014","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05014v2","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05014","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"VH4J2ENU6CNW","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"VH4J2ENU6CNWGXBJ","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"VH4J2ENU","created_at":"2026-07-05T06:17:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VH4J2ENU6CNWGXBJQI5FXF2SYC","target":"record","payload":{"canonical_record":{"source":{"id":"2207.05014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-11T17:02:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4e0a38e784aca72155216215e3a57cdd2a2ab0279b6d3d67d2b5a4060e097ffa","abstract_canon_sha256":"fa79e3eec89e16d885b1c6ec6713281ad5238cc4e3f6438ff342e02f41e7c0d8"},"schema_version":"1.0"},"canonical_sha256":"a9f89d11b4f09b635c29823a5b9752c0af74532c2fecaaffba73e5b3f0584598","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:25.996979Z","signature_b64":"+gn0rqW9CDwkHpUs0fTHQQsvmf6QKwpzxzrtiGly0M2RHq5+ffrJD1i97Ux2bxEi/ahjI7DszMdW6g1npof6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f89d11b4f09b635c29823a5b9752c0af74532c2fecaaffba73e5b3f0584598","last_reissued_at":"2026-07-05T06:17:25.996425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:25.996425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.05014","source_version":2,"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-07-05T06:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlHaJhR2ZRq0t+IGeFmEQ9H9zbw8tc6s/mRzbYa3hBUPmvelAxbyTNVWVT5X5MiXO7RPhxUP7J0yRbMMaINpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:24:41.087938Z"},"content_sha256":"2414013859581d1ebc897ebf9866a68cc14611aff7cfd6914dc8ce5970081a71","schema_version":"1.0","event_id":"sha256:2414013859581d1ebc897ebf9866a68cc14611aff7cfd6914dc8ce5970081a71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VH4J2ENU6CNWGXBJQI5FXF2SYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear 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":"2022-07-11T17:02:34Z","abstract_excerpt":"We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05014","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/2207.05014/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-07-05T06:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PXgTIl42YZeqpKzqQf4hERck+g/Wvsoswm3aE/CHz54iU+gQ5Wc3d6wXrv0sv/nqpgUL8qFdL/5V1stuc0ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:24:41.088821Z"},"content_sha256":"27b15c5b9ecbb1b9c3c7bc43cf9bc01053c88648ddf4cc9758297eb189b31ba7","schema_version":"1.0","event_id":"sha256:27b15c5b9ecbb1b9c3c7bc43cf9bc01053c88648ddf4cc9758297eb189b31ba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/bundle.json","state_url":"https://pith.science/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/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-08-21T05:24:41Z","links":{"resolver":"https://pith.science/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC","bundle":"https://pith.science/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/bundle.json","state":"https://pith.science/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH4J2ENU6CNWGXBJQI5FXF2SYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VH4J2ENU6CNWGXBJQI5FXF2SYC","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":"fa79e3eec89e16d885b1c6ec6713281ad5238cc4e3f6438ff342e02f41e7c0d8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-11T17:02:34Z","title_canon_sha256":"4e0a38e784aca72155216215e3a57cdd2a2ab0279b6d3d67d2b5a4060e097ffa"},"schema_version":"1.0","source":{"id":"2207.05014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05014","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05014v2","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05014","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"VH4J2ENU6CNW","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"VH4J2ENU6CNWGXBJ","created_at":"2026-07-05T06:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"VH4J2ENU","created_at":"2026-07-05T06:17:25Z"}],"graph_snapshots":[{"event_id":"sha256:27b15c5b9ecbb1b9c3c7bc43cf9bc01053c88648ddf4cc9758297eb189b31ba7","target":"graph","created_at":"2026-07-05T06:17:25Z","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/2207.05014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary varia","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":"2022-07-11T17:02:34Z","title":"On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05014","kind":"arxiv","version":2},"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:2414013859581d1ebc897ebf9866a68cc14611aff7cfd6914dc8ce5970081a71","target":"record","created_at":"2026-07-05T06:17:25Z","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":"fa79e3eec89e16d885b1c6ec6713281ad5238cc4e3f6438ff342e02f41e7c0d8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-11T17:02:34Z","title_canon_sha256":"4e0a38e784aca72155216215e3a57cdd2a2ab0279b6d3d67d2b5a4060e097ffa"},"schema_version":"1.0","source":{"id":"2207.05014","kind":"arxiv","version":2}},"canonical_sha256":"a9f89d11b4f09b635c29823a5b9752c0af74532c2fecaaffba73e5b3f0584598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f89d11b4f09b635c29823a5b9752c0af74532c2fecaaffba73e5b3f0584598","first_computed_at":"2026-07-05T06:17:25.996425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:17:25.996425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gn0rqW9CDwkHpUs0fTHQQsvmf6QKwpzxzrtiGly0M2RHq5+ffrJD1i97Ux2bxEi/ahjI7DszMdW6g1npof6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:17:25.996979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.05014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2414013859581d1ebc897ebf9866a68cc14611aff7cfd6914dc8ce5970081a71","sha256:27b15c5b9ecbb1b9c3c7bc43cf9bc01053c88648ddf4cc9758297eb189b31ba7"],"state_sha256":"f814f5fab05d1d4843f6949053b8b68eedf7fdba06fa3462f3f9051638abf9b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwPGVIjVyHOCqQEE+WsxQRf0ZfMzPsN7Ekn/pLMyeyMArsOHerEptQU6C6rBJPydb65cxs4SEHP9RrqsFaAgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:24:41.098312Z","bundle_sha256":"f321d674a3462e2b4ce0b2218b96832935c919f40cfd7f4b8d8949d09a4d2c66"}}