{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D4KPCZSLF2I2PSCWVL2RWRJOYX","short_pith_number":"pith:D4KPCZSL","canonical_record":{"source":{"id":"1303.3901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-15T20:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"37e3a8d153d62c14bac01826b98d37f01313d0fe7632b6d5cfc6e1bf87472ac9","abstract_canon_sha256":"af3acb29228aa84e74ea12bc4fdd0c78a002a2f0acb7a84d721ae6a4d51edc90"},"schema_version":"1.0"},"canonical_sha256":"1f14f1664b2e91a7c856aaf51b452ec5fb9619c56d01d97263896797949b0ede","source":{"kind":"arxiv","id":"1303.3901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3901","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3901v2","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3901","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"D4KPCZSLF2I2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D4KPCZSLF2I2PSCW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D4KPCZSL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D4KPCZSLF2I2PSCWVL2RWRJOYX","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-15T20:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"37e3a8d153d62c14bac01826b98d37f01313d0fe7632b6d5cfc6e1bf87472ac9","abstract_canon_sha256":"af3acb29228aa84e74ea12bc4fdd0c78a002a2f0acb7a84d721ae6a4d51edc90"},"schema_version":"1.0"},"canonical_sha256":"1f14f1664b2e91a7c856aaf51b452ec5fb9619c56d01d97263896797949b0ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:21.675723Z","signature_b64":"yq5VxHv4CbMuFemMptSq7oBuNYx9J6KkITO29HFUEWUh9nMnfMAtULz2SEh3NmVahWRL6pKx62F1zZG90kUuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f14f1664b2e91a7c856aaf51b452ec5fb9619c56d01d97263896797949b0ede","last_reissued_at":"2026-05-18T03:11:21.675153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:21.675153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3901","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-05-18T03:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vmgp4EoBBg4/iw1tGgzc3/aYQXJpbvGFyDRFW2nnuLjurshYFw7IcEPcFoebIKs3hhWmBu3Lu9OwlfvphoiiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:36:43.168060Z"},"content_sha256":"829d831ea7ecdbe77a6aa07fec4a0fc534afdaa93a8c4239644a2898be86c1fb","schema_version":"1.0","event_id":"sha256:829d831ea7ecdbe77a6aa07fec4a0fc534afdaa93a8c4239644a2898be86c1fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D4KPCZSLF2I2PSCWVL2RWRJOYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo","submitted_at":"2013-03-15T20:30:57Z","abstract_excerpt":"Bilevel optimization problems are a class of challenging optimization problems, which contain two levels of optimization tasks. In these problems, the optimal solutions to the lower level problem become possible feasible candidates to the upper level problem. Such a requirement makes the optimization problem difficult to solve, and has kept the researchers busy towards devising methodologies, which can efficiently handle the problem. Despite the efforts, there hardly exists any effective methodology, which is capable of handling a complex bilevel problem. In this paper, we introduce bilevel ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3901","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":""},"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-18T03:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+JY6aa7SxupooW70VI9KO+7njvwmrAPPk4ZGzEMGbHrOr0M64tHrRw242xJQivwEWlq27xeSXrK5W6ggcajCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:36:43.168710Z"},"content_sha256":"b1652cbb329bcf2ebdd01000b612491ce4893cc951376fa6f0988acef5069d9c","schema_version":"1.0","event_id":"sha256:b1652cbb329bcf2ebdd01000b612491ce4893cc951376fa6f0988acef5069d9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/bundle.json","state_url":"https://pith.science/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/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-07T10:36:43Z","links":{"resolver":"https://pith.science/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX","bundle":"https://pith.science/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/bundle.json","state":"https://pith.science/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4KPCZSLF2I2PSCWVL2RWRJOYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D4KPCZSLF2I2PSCWVL2RWRJOYX","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":"af3acb29228aa84e74ea12bc4fdd0c78a002a2f0acb7a84d721ae6a4d51edc90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-15T20:30:57Z","title_canon_sha256":"37e3a8d153d62c14bac01826b98d37f01313d0fe7632b6d5cfc6e1bf87472ac9"},"schema_version":"1.0","source":{"id":"1303.3901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3901","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3901v2","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3901","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"D4KPCZSLF2I2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D4KPCZSLF2I2PSCW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D4KPCZSL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:b1652cbb329bcf2ebdd01000b612491ce4893cc951376fa6f0988acef5069d9c","target":"graph","created_at":"2026-05-18T03:11:21Z","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":"Bilevel optimization problems are a class of challenging optimization problems, which contain two levels of optimization tasks. In these problems, the optimal solutions to the lower level problem become possible feasible candidates to the upper level problem. Such a requirement makes the optimization problem difficult to solve, and has kept the researchers busy towards devising methodologies, which can efficiently handle the problem. Despite the efforts, there hardly exists any effective methodology, which is capable of handling a complex bilevel problem. In this paper, we introduce bilevel ev","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-15T20:30:57Z","title":"Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3901","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:829d831ea7ecdbe77a6aa07fec4a0fc534afdaa93a8c4239644a2898be86c1fb","target":"record","created_at":"2026-05-18T03:11:21Z","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":"af3acb29228aa84e74ea12bc4fdd0c78a002a2f0acb7a84d721ae6a4d51edc90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-15T20:30:57Z","title_canon_sha256":"37e3a8d153d62c14bac01826b98d37f01313d0fe7632b6d5cfc6e1bf87472ac9"},"schema_version":"1.0","source":{"id":"1303.3901","kind":"arxiv","version":2}},"canonical_sha256":"1f14f1664b2e91a7c856aaf51b452ec5fb9619c56d01d97263896797949b0ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f14f1664b2e91a7c856aaf51b452ec5fb9619c56d01d97263896797949b0ede","first_computed_at":"2026-05-18T03:11:21.675153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:21.675153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yq5VxHv4CbMuFemMptSq7oBuNYx9J6KkITO29HFUEWUh9nMnfMAtULz2SEh3NmVahWRL6pKx62F1zZG90kUuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:21.675723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:829d831ea7ecdbe77a6aa07fec4a0fc534afdaa93a8c4239644a2898be86c1fb","sha256:b1652cbb329bcf2ebdd01000b612491ce4893cc951376fa6f0988acef5069d9c"],"state_sha256":"f384382cb9388a34302c15c7194afb1992c1e4d1d4210c97a76d8dff79932690"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtsdUf++2w1OW7N4jyVCPGkT+/4kBH2uS9SupuA4GbPHu+CzMRTaaLcs0353ismunufXVCFIIqiKIzBuhLb9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:36:43.171569Z","bundle_sha256":"c5a3dd6f8797c8bcf899d0bfc35c18e25dc9680c0528c43495a6c871e59e5633"}}