{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7VX7LKT2WIEH7CW7PIZTIQZTYO","short_pith_number":"pith:7VX7LKT2","schema_version":"1.0","canonical_sha256":"fd6ff5aa7ab2087f8adf7a33344333c3ad45e69eb7b2af17e2a3bd080fc7ff5a","source":{"kind":"arxiv","id":"1702.03394","version":2},"attestation_state":"computed","paper":{"title":"Bilevel Optimization based on Iterative Approximation of Multiple Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo, Zhichao Lu","submitted_at":"2017-02-11T08:07:31Z","abstract_excerpt":"A large number of application problems involve two levels of optimization, where one optimization task is nested inside the other. These problems are known as bilevel optimization problems and have been studied by both classical optimization community and evolutionary optimization community. Most of the solution procedures proposed until now are either computationally very expensive or applicable to only small classes of bilevel optimization problems adhering to mathematically simplifying assumptions. In this paper, we propose an evolutionary optimization method that tries to reduce the comput"},"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":"1702.03394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-11T08:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"5831c76476eeba01ade1f90fd2e18ca9d2d35e52e0d65196dd9b18dcb0ce9e5b","abstract_canon_sha256":"e152963d54d86d6e50b77f8f8ab7fd906ce1795c9e382766e030ce2cfb6d1990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.351600Z","signature_b64":"2JRUe8/n9PvJL0rZ+ij0Xo++dnIYattSkFBoa0M35RFmeUkUNH195GbSwvsnLF6i+GhxOquz2z5jaIYmtaEqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6ff5aa7ab2087f8adf7a33344333c3ad45e69eb7b2af17e2a3bd080fc7ff5a","last_reissued_at":"2026-05-18T00:44:57.350878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.350878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilevel Optimization based on Iterative Approximation of Multiple Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ankur Sinha, Kalyanmoy Deb, Pekka Malo, Zhichao Lu","submitted_at":"2017-02-11T08:07:31Z","abstract_excerpt":"A large number of application problems involve two levels of optimization, where one optimization task is nested inside the other. These problems are known as bilevel optimization problems and have been studied by both classical optimization community and evolutionary optimization community. Most of the solution procedures proposed until now are either computationally very expensive or applicable to only small classes of bilevel optimization problems adhering to mathematically simplifying assumptions. In this paper, we propose an evolutionary optimization method that tries to reduce the comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03394","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03394","created_at":"2026-05-18T00:44:57.350972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03394v2","created_at":"2026-05-18T00:44:57.350972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03394","created_at":"2026-05-18T00:44:57.350972+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VX7LKT2WIEH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VX7LKT2WIEH7CW7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VX7LKT2","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO","json":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO.json","graph_json":"https://pith.science/api/pith-number/7VX7LKT2WIEH7CW7PIZTIQZTYO/graph.json","events_json":"https://pith.science/api/pith-number/7VX7LKT2WIEH7CW7PIZTIQZTYO/events.json","paper":"https://pith.science/paper/7VX7LKT2"},"agent_actions":{"view_html":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO","download_json":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO.json","view_paper":"https://pith.science/paper/7VX7LKT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03394&json=true","fetch_graph":"https://pith.science/api/pith-number/7VX7LKT2WIEH7CW7PIZTIQZTYO/graph.json","fetch_events":"https://pith.science/api/pith-number/7VX7LKT2WIEH7CW7PIZTIQZTYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO/action/storage_attestation","attest_author":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO/action/author_attestation","sign_citation":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO/action/citation_signature","submit_replication":"https://pith.science/pith/7VX7LKT2WIEH7CW7PIZTIQZTYO/action/replication_record"}},"created_at":"2026-05-18T00:44:57.350972+00:00","updated_at":"2026-05-18T00:44:57.350972+00:00"}