{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:KBVG7CJ7OAZG5H4PKB4QMI4MRX","short_pith_number":"pith:KBVG7CJ7","schema_version":"1.0","canonical_sha256":"506a6f893f70326e9f8f507906238c8def87c8c3a532fcef6f097fe23a445ca4","source":{"kind":"arxiv","id":"math/0603741","version":1},"attestation_state":"computed","paper":{"title":"A regularization method for ill-posed bilevel optimization problems","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ma\\\"itine Bergounioux (MAPMO), Mounir Haddou (MAPMO)","submitted_at":"2006-03-31T11:37:37Z","abstract_excerpt":"We present a regularization method to approach a solution of the pessimistic formulation of ill -posed bilevel problems . This allows to overcome the difficulty arising from the non uniqueness of the lower level problems solutions and responses. We prove existence of approximated solutions, give convergence result using Hoffman-like assumptions. We end with objective value error estimates."},"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":"math/0603741","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-03-31T11:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"5954fa5ca3953b86924b2c903df93ac1c99c16ddfc5db73a2ebda5882ace0696","abstract_canon_sha256":"9de1b3aa74de9ecbc7afe83d3db3fcf251fd0a1d68248ddd5ce8e6916070c70d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:50.391881Z","signature_b64":"uAHX8WDF4cHUrDiu2RkNoQbU5LrXjcwaoOFwvS54YChK8eJjVKN3A7Ufj9oawgogvyN5ZwjZTB131Q2h6hxZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506a6f893f70326e9f8f507906238c8def87c8c3a532fcef6f097fe23a445ca4","last_reissued_at":"2026-05-18T01:08:50.391207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:50.391207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A regularization method for ill-posed bilevel optimization problems","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ma\\\"itine Bergounioux (MAPMO), Mounir Haddou (MAPMO)","submitted_at":"2006-03-31T11:37:37Z","abstract_excerpt":"We present a regularization method to approach a solution of the pessimistic formulation of ill -posed bilevel problems . This allows to overcome the difficulty arising from the non uniqueness of the lower level problems solutions and responses. We prove existence of approximated solutions, give convergence result using Hoffman-like assumptions. We end with objective value error estimates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0603741","kind":"arxiv","version":1},"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":"math/0603741","created_at":"2026-05-18T01:08:50.391328+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0603741v1","created_at":"2026-05-18T01:08:50.391328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603741","created_at":"2026-05-18T01:08:50.391328+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBVG7CJ7OAZG","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBVG7CJ7OAZG5H4P","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBVG7CJ7","created_at":"2026-05-18T12:25:54.717736+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/KBVG7CJ7OAZG5H4PKB4QMI4MRX","json":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX.json","graph_json":"https://pith.science/api/pith-number/KBVG7CJ7OAZG5H4PKB4QMI4MRX/graph.json","events_json":"https://pith.science/api/pith-number/KBVG7CJ7OAZG5H4PKB4QMI4MRX/events.json","paper":"https://pith.science/paper/KBVG7CJ7"},"agent_actions":{"view_html":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX","download_json":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX.json","view_paper":"https://pith.science/paper/KBVG7CJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0603741&json=true","fetch_graph":"https://pith.science/api/pith-number/KBVG7CJ7OAZG5H4PKB4QMI4MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/KBVG7CJ7OAZG5H4PKB4QMI4MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX/action/storage_attestation","attest_author":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX/action/author_attestation","sign_citation":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX/action/citation_signature","submit_replication":"https://pith.science/pith/KBVG7CJ7OAZG5H4PKB4QMI4MRX/action/replication_record"}},"created_at":"2026-05-18T01:08:50.391328+00:00","updated_at":"2026-05-18T01:08:50.391328+00:00"}