{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SVGKOGZUQXRNGK7ED6M3RDT43A","short_pith_number":"pith:SVGKOGZU","schema_version":"1.0","canonical_sha256":"954ca71b3485e2d32be41f99b88e7cd82e4d38db97900373e71150b7c5196e07","source":{"kind":"arxiv","id":"2306.02429","version":2},"attestation_state":"computed","paper":{"title":"An Inexact Conditional Gradient Method for Constrained Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Erfan Yazdandoost Hamedani, Nazanin Abolfazli, Ruichen Jiang","submitted_at":"2023-06-04T18:21:53Z","abstract_excerpt":"Bilevel optimization is an important class of optimization problems where one optimization problem is nested within another. While various methods have emerged to address unconstrained general bilevel optimization problems, there has been a noticeable gap in research when it comes to methods tailored for the constrained scenario. The few methods that do accommodate constrained problems, often exhibit slow convergence rates or demand a high computational cost per iteration. To tackle this issue, our paper introduces a novel single-loop projection-free method employing a nested approximation tec"},"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":"2306.02429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-04T18:21:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bfd25944b3cb12f194d2cb7d389e5460be907451f788db832426652b668c3a4","abstract_canon_sha256":"e7bbad42fc72382430e44245e1aca99e67ec07d6f8196f1186e96234fda75c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:44.660068Z","signature_b64":"/7vD09pCE1Ey98ziWueU3uBqeRV0AuGS+Hh/4SM296Dt2+LaAckXVZIundNllyiHyK0mBYqXREEPfCLpHCHvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954ca71b3485e2d32be41f99b88e7cd82e4d38db97900373e71150b7c5196e07","last_reissued_at":"2026-07-05T07:55:44.659671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:44.659671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Inexact Conditional Gradient Method for Constrained Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Erfan Yazdandoost Hamedani, Nazanin Abolfazli, Ruichen Jiang","submitted_at":"2023-06-04T18:21:53Z","abstract_excerpt":"Bilevel optimization is an important class of optimization problems where one optimization problem is nested within another. While various methods have emerged to address unconstrained general bilevel optimization problems, there has been a noticeable gap in research when it comes to methods tailored for the constrained scenario. The few methods that do accommodate constrained problems, often exhibit slow convergence rates or demand a high computational cost per iteration. To tackle this issue, our paper introduces a novel single-loop projection-free method employing a nested approximation tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02429","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/2306.02429/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":"2306.02429","created_at":"2026-07-05T07:55:44.659726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.02429v2","created_at":"2026-07-05T07:55:44.659726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02429","created_at":"2026-07-05T07:55:44.659726+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVGKOGZUQXRN","created_at":"2026-07-05T07:55:44.659726+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVGKOGZUQXRNGK7E","created_at":"2026-07-05T07:55:44.659726+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVGKOGZU","created_at":"2026-07-05T07:55:44.659726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16520","citing_title":"Safe Gradient Flow for Bilevel Optimization","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A","json":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A.json","graph_json":"https://pith.science/api/pith-number/SVGKOGZUQXRNGK7ED6M3RDT43A/graph.json","events_json":"https://pith.science/api/pith-number/SVGKOGZUQXRNGK7ED6M3RDT43A/events.json","paper":"https://pith.science/paper/SVGKOGZU"},"agent_actions":{"view_html":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A","download_json":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A.json","view_paper":"https://pith.science/paper/SVGKOGZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.02429&json=true","fetch_graph":"https://pith.science/api/pith-number/SVGKOGZUQXRNGK7ED6M3RDT43A/graph.json","fetch_events":"https://pith.science/api/pith-number/SVGKOGZUQXRNGK7ED6M3RDT43A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A/action/storage_attestation","attest_author":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A/action/author_attestation","sign_citation":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A/action/citation_signature","submit_replication":"https://pith.science/pith/SVGKOGZUQXRNGK7ED6M3RDT43A/action/replication_record"}},"created_at":"2026-07-05T07:55:44.659726+00:00","updated_at":"2026-07-05T07:55:44.659726+00:00"}