{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LSZMRW2Y7R5CREJUR5VW66NAVA","short_pith_number":"pith:LSZMRW2Y","schema_version":"1.0","canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","source":{"kind":"arxiv","id":"1705.06270","version":2},"attestation_state":"computed","paper":{"title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo","submitted_at":"2017-05-17T17:43:13Z","abstract_excerpt":"Bilevel optimization is defined as a mathematical program, where an optimization problem contains another optimization problem as a constraint. These problems have received significant attention from the mathematical programming community. Only limited work exists on bilevel problems using evolutionary computation techniques; however, recently there has been an increasing interest due to the proliferation of practical applications and the potential of evolutionary algorithms in tackling these problems. This paper provides a comprehensive review on bilevel optimization from the basic principles"},"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":"1705.06270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-17T17:43:13Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"cd2692d85dfda4d0489c0d84c3b298dc68a1f639eb1c0447388f1a90cb8f0332","abstract_canon_sha256":"944d1edfe0efa8e0328160150f34896bb61011e32362eaded5f737b52f69734f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:10.545374Z","signature_b64":"0iL+WDE8VbM5o7Qm+MSP/ZI3hKX2QMEg0czCxiSJlR4GQe3iBGZYQl6SeAtLw9UDPE0E8KZxA3ZwIn7OOY7BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","last_reissued_at":"2026-07-05T01:57:10.545015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:10.545015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo","submitted_at":"2017-05-17T17:43:13Z","abstract_excerpt":"Bilevel optimization is defined as a mathematical program, where an optimization problem contains another optimization problem as a constraint. These problems have received significant attention from the mathematical programming community. Only limited work exists on bilevel problems using evolutionary computation techniques; however, recently there has been an increasing interest due to the proliferation of practical applications and the potential of evolutionary algorithms in tackling these problems. This paper provides a comprehensive review on bilevel optimization from the basic principles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06270","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/1705.06270/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":"1705.06270","created_at":"2026-07-05T01:57:10.545070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06270v2","created_at":"2026-07-05T01:57:10.545070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06270","created_at":"2026-07-05T01:57:10.545070+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSZMRW2Y7R5C","created_at":"2026-07-05T01:57:10.545070+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSZMRW2Y7R5CREJU","created_at":"2026-07-05T01:57:10.545070+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSZMRW2Y","created_at":"2026-07-05T01:57:10.545070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20141","citing_title":"DASH: A Dimensionality Reduction Method for Large-scale Convex MIQP with Applications in Subset Portfolio Selection","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA","json":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA.json","graph_json":"https://pith.science/api/pith-number/LSZMRW2Y7R5CREJUR5VW66NAVA/graph.json","events_json":"https://pith.science/api/pith-number/LSZMRW2Y7R5CREJUR5VW66NAVA/events.json","paper":"https://pith.science/paper/LSZMRW2Y"},"agent_actions":{"view_html":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA","download_json":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA.json","view_paper":"https://pith.science/paper/LSZMRW2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06270&json=true","fetch_graph":"https://pith.science/api/pith-number/LSZMRW2Y7R5CREJUR5VW66NAVA/graph.json","fetch_events":"https://pith.science/api/pith-number/LSZMRW2Y7R5CREJUR5VW66NAVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/action/storage_attestation","attest_author":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/action/author_attestation","sign_citation":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/action/citation_signature","submit_replication":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/action/replication_record"}},"created_at":"2026-07-05T01:57:10.545070+00:00","updated_at":"2026-07-05T01:57:10.545070+00:00"}