{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LSZMRW2Y7R5CREJUR5VW66NAVA","short_pith_number":"pith:LSZMRW2Y","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"},"canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","source":{"kind":"arxiv","id":"1705.06270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06270","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06270v2","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06270","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"LSZMRW2Y7R5C","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_16","alias_value":"LSZMRW2Y7R5CREJU","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_8","alias_value":"LSZMRW2Y","created_at":"2026-07-05T01:57:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LSZMRW2Y7R5CREJUR5VW66NAVA","target":"record","payload":{"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"},"canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","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"},"source_kind":"arxiv","source_id":"1705.06270","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-05T01:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EC93f73EMuAjBeyk9ABy5Ox7yvoDqo3qlOq3IkrGeHGyeNMlJzaHS2MHhQ0F5zU/1TGJiCeyh3KP1QWF0HIyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:16:40.575915Z"},"content_sha256":"60fcdcecf1ad1c8eb544238e286c80e9236fcb422f217bd68c1968de206d6e58","schema_version":"1.0","event_id":"sha256:60fcdcecf1ad1c8eb544238e286c80e9236fcb422f217bd68c1968de206d6e58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LSZMRW2Y7R5CREJUR5VW66NAVA","target":"graph","payload":{"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"},"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-05T01:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b90ZFJsNzf0oilb0bhMd8Th4VQq5Rg55brWFGGsYoVuP6i5mJIWjgfDJdcH0niiJoG8nFlrkwXyiT4LkQg4qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:16:40.576810Z"},"content_sha256":"dde352ee6c6b0e69d8d3a2b716272b7b069134ed15420af2dfedd4ccf72274e2","schema_version":"1.0","event_id":"sha256:dde352ee6c6b0e69d8d3a2b716272b7b069134ed15420af2dfedd4ccf72274e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/bundle.json","state_url":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/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-05T12:16:40Z","links":{"resolver":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA","bundle":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/bundle.json","state":"https://pith.science/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSZMRW2Y7R5CREJUR5VW66NAVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LSZMRW2Y7R5CREJUR5VW66NAVA","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":"944d1edfe0efa8e0328160150f34896bb61011e32362eaded5f737b52f69734f","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-17T17:43:13Z","title_canon_sha256":"cd2692d85dfda4d0489c0d84c3b298dc68a1f639eb1c0447388f1a90cb8f0332"},"schema_version":"1.0","source":{"id":"1705.06270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06270","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06270v2","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06270","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"LSZMRW2Y7R5C","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_16","alias_value":"LSZMRW2Y7R5CREJU","created_at":"2026-07-05T01:57:10Z"},{"alias_kind":"pith_short_8","alias_value":"LSZMRW2Y","created_at":"2026-07-05T01:57:10Z"}],"graph_snapshots":[{"event_id":"sha256:dde352ee6c6b0e69d8d3a2b716272b7b069134ed15420af2dfedd4ccf72274e2","target":"graph","created_at":"2026-07-05T01:57:10Z","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/1705.06270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-17T17:43:13Z","title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06270","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:60fcdcecf1ad1c8eb544238e286c80e9236fcb422f217bd68c1968de206d6e58","target":"record","created_at":"2026-07-05T01:57:10Z","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":"944d1edfe0efa8e0328160150f34896bb61011e32362eaded5f737b52f69734f","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-17T17:43:13Z","title_canon_sha256":"cd2692d85dfda4d0489c0d84c3b298dc68a1f639eb1c0447388f1a90cb8f0332"},"schema_version":"1.0","source":{"id":"1705.06270","kind":"arxiv","version":2}},"canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cb2c8db58fc7a2891348f6b6f79a0a82b18a3642c03457c07906883d69e799d","first_computed_at":"2026-07-05T01:57:10.545015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:57:10.545015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0iL+WDE8VbM5o7Qm+MSP/ZI3hKX2QMEg0czCxiSJlR4GQe3iBGZYQl6SeAtLw9UDPE0E8KZxA3ZwIn7OOY7BAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:57:10.545374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60fcdcecf1ad1c8eb544238e286c80e9236fcb422f217bd68c1968de206d6e58","sha256:dde352ee6c6b0e69d8d3a2b716272b7b069134ed15420af2dfedd4ccf72274e2"],"state_sha256":"0e0e5fff095f2d10ade8702073f2590264e6b1325d9297734b6197e11d3a839e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwglRiEORMt0tj5ApUHGzMf9gkdA1GF3g0PXOj4xJ8maLfLvbK1DxbOGq9pBvIifdeLG0lhXwR0QuDDPDNSSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:16:40.583386Z","bundle_sha256":"49d30abb9832437886fcdddd68ed5dca5e1571f70d8053d7663489d5646fccaa"}}