{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JIY2Z2FCCKUTVMHOWHMQX2K2PR","short_pith_number":"pith:JIY2Z2FC","canonical_record":{"source":{"id":"1707.06196","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-19T17:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"926607926b196c87823b42ed0718c85d507935e40cc9fb8be8e212c75f151e77","abstract_canon_sha256":"b8978108345ff12914371541d17bd9aabc9ae6d7ca47a84c396b9041e04c2c68"},"schema_version":"1.0"},"canonical_sha256":"4a31ace8a212a93ab0eeb1d90be95a7c4b739c6d2d03c023f0d3fd44df9cc545","source":{"kind":"arxiv","id":"1707.06196","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06196","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06196v4","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06196","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"JIY2Z2FCCKUT","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JIY2Z2FCCKUTVMHO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JIY2Z2FC","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JIY2Z2FCCKUTVMHOWHMQX2K2PR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06196","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-19T17:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"926607926b196c87823b42ed0718c85d507935e40cc9fb8be8e212c75f151e77","abstract_canon_sha256":"b8978108345ff12914371541d17bd9aabc9ae6d7ca47a84c396b9041e04c2c68"},"schema_version":"1.0"},"canonical_sha256":"4a31ace8a212a93ab0eeb1d90be95a7c4b739c6d2d03c023f0d3fd44df9cc545","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:58.082655Z","signature_b64":"EOsbqrZmcwT+PwARsrqCGZg6TxCmPVzU6kUY10ZO7tzHJQXX3MDEJEzzg5Ntm2UnzM6KwvXflwAR4WrrqzRFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a31ace8a212a93ab0eeb1d90be95a7c4b739c6d2d03c023f0d3fd44df9cc545","last_reissued_at":"2026-05-18T00:11:58.082060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:58.082060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06196","source_version":4,"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-18T00:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1avMqtCfaQMqWDOqOlFgRdz6Jpnsf+ADiNSBeMhkUsaoBtGXgGYoSlDL+IxvX3utZo5PpuDERCe2LCWVuk7kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:57:33.687377Z"},"content_sha256":"4e5b2d5a89aede4ed551a2ec4d4334a5b93efda5e1778215164eaa0c24d8299d","schema_version":"1.0","event_id":"sha256:4e5b2d5a89aede4ed551a2ec4d4334a5b93efda5e1778215164eaa0c24d8299d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JIY2Z2FCCKUTVMHOWHMQX2K2PR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Projection-Based Reformulation and Decomposition Algorithm for Global Optimization of a Class of Mixed Integer Bilevel Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Zeng, Dajun Yue, Fengqi You, Jiyao Gao","submitted_at":"2017-07-19T17:06:08Z","abstract_excerpt":"We propose an extended variant of the reformulation and decomposition algorithm for solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous and integer variables are involved in both upper- and lower-level problems. In particular, we consider MIBLPs with upper-level constraints that involve lower-level variables. We assume that the inducible region is nonempty and all variables are bounded. By using the reformulation and decomposition scheme, an MIBLP is first converted into its equivalent single-level formulation, then computed by a column-and-constraint gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06196","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WL5GijNjVLJKNolzSQP9YtSH76HM1jH+ydG3hl8D3mV2Efrh8uMPXkA/+dehBFAkEH7BUX2OUg0/ltPFfpuBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:57:33.687728Z"},"content_sha256":"92da243d9cf8d38959145637f2504215e125cd0ba3c6bb21de981f475fcfdabd","schema_version":"1.0","event_id":"sha256:92da243d9cf8d38959145637f2504215e125cd0ba3c6bb21de981f475fcfdabd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/bundle.json","state_url":"https://pith.science/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/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-19T23:57:33Z","links":{"resolver":"https://pith.science/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR","bundle":"https://pith.science/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/bundle.json","state":"https://pith.science/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIY2Z2FCCKUTVMHOWHMQX2K2PR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JIY2Z2FCCKUTVMHOWHMQX2K2PR","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":"b8978108345ff12914371541d17bd9aabc9ae6d7ca47a84c396b9041e04c2c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-19T17:06:08Z","title_canon_sha256":"926607926b196c87823b42ed0718c85d507935e40cc9fb8be8e212c75f151e77"},"schema_version":"1.0","source":{"id":"1707.06196","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06196","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06196v4","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06196","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"JIY2Z2FCCKUT","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JIY2Z2FCCKUTVMHO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JIY2Z2FC","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:92da243d9cf8d38959145637f2504215e125cd0ba3c6bb21de981f475fcfdabd","target":"graph","created_at":"2026-05-18T00:11:58Z","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"},"paper":{"abstract_excerpt":"We propose an extended variant of the reformulation and decomposition algorithm for solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous and integer variables are involved in both upper- and lower-level problems. In particular, we consider MIBLPs with upper-level constraints that involve lower-level variables. We assume that the inducible region is nonempty and all variables are bounded. By using the reformulation and decomposition scheme, an MIBLP is first converted into its equivalent single-level formulation, then computed by a column-and-constraint gen","authors_text":"Bo Zeng, Dajun Yue, Fengqi You, Jiyao Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-19T17:06:08Z","title":"A Projection-Based Reformulation and Decomposition Algorithm for Global Optimization of a Class of Mixed Integer Bilevel Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06196","kind":"arxiv","version":4},"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:4e5b2d5a89aede4ed551a2ec4d4334a5b93efda5e1778215164eaa0c24d8299d","target":"record","created_at":"2026-05-18T00:11:58Z","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":"b8978108345ff12914371541d17bd9aabc9ae6d7ca47a84c396b9041e04c2c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-19T17:06:08Z","title_canon_sha256":"926607926b196c87823b42ed0718c85d507935e40cc9fb8be8e212c75f151e77"},"schema_version":"1.0","source":{"id":"1707.06196","kind":"arxiv","version":4}},"canonical_sha256":"4a31ace8a212a93ab0eeb1d90be95a7c4b739c6d2d03c023f0d3fd44df9cc545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a31ace8a212a93ab0eeb1d90be95a7c4b739c6d2d03c023f0d3fd44df9cc545","first_computed_at":"2026-05-18T00:11:58.082060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:58.082060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOsbqrZmcwT+PwARsrqCGZg6TxCmPVzU6kUY10ZO7tzHJQXX3MDEJEzzg5Ntm2UnzM6KwvXflwAR4WrrqzRFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:58.082655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06196","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e5b2d5a89aede4ed551a2ec4d4334a5b93efda5e1778215164eaa0c24d8299d","sha256:92da243d9cf8d38959145637f2504215e125cd0ba3c6bb21de981f475fcfdabd"],"state_sha256":"75fb6c1d0090797765dc8b1cb05d68d950d8a899509bd0efe41b055136a22190"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6e9Dt/ycRq2K7T85+59TJgq7qTklpVTRpNxyr66bIa25KtQXHBqZskYQCL1Ye8pNmVbhonwWUL9CYa9TRW5GDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:57:33.689966Z","bundle_sha256":"67f48cc17789c00afa301b0f308606aa77b4df8603d8ccd2d2c6239acfd1226d"}}