{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3GE7IH2CFFGVUG5D4VGPFUI3EI","short_pith_number":"pith:3GE7IH2C","schema_version":"1.0","canonical_sha256":"d989f41f42294d5a1ba3e54cf2d11b2239a4810866f571bb88ed1768fa2d940a","source":{"kind":"arxiv","id":"2102.07976","version":3},"attestation_state":"computed","paper":{"title":"A General Descent Aggregation Framework for Gradient-based Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","math.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Jin Zhang, Pan Mu, Risheng Liu, Shangzhi Zeng, Xiaoming Yuan","submitted_at":"2021-02-16T06:58:12Z","abstract_excerpt":"In recent years, a variety of gradient-based methods have been developed to solve Bi-Level Optimization (BLO) problems in machine learning and computer vision areas. However, the theoretical correctness and practical effectiveness of these existing approaches always rely on some restrictive conditions (e.g., Lower-Level Singleton, LLS), which could hardly be satisfied in real-world applications. Moreover, previous literature only proves theoretical results based on their specific iteration strategies, thus lack a general recipe to uniformly analyze the convergence behaviors of different gradie"},"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":"2102.07976","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-16T06:58:12Z","cross_cats_sorted":["cs.CV","math.DS","math.OC"],"title_canon_sha256":"cc75b71799afbe609e68f9367bdf5568d48e6d53358916949b815c92a7117e08","abstract_canon_sha256":"53ae63a60ffb33fcec136b3918f2de6932d943e19ded39ec159b0e8774481b26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:51.878348Z","signature_b64":"3QLo2/acsJcLx9bECgD8gjNy+lTDm81i9Fm6rVfc2vOyKdbYkzCTucAuZG93FhNtdDlgr7aYIGpgwskK/4TSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d989f41f42294d5a1ba3e54cf2d11b2239a4810866f571bb88ed1768fa2d940a","last_reissued_at":"2026-07-05T03:44:51.877925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:51.877925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Descent Aggregation Framework for Gradient-based Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","math.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Jin Zhang, Pan Mu, Risheng Liu, Shangzhi Zeng, Xiaoming Yuan","submitted_at":"2021-02-16T06:58:12Z","abstract_excerpt":"In recent years, a variety of gradient-based methods have been developed to solve Bi-Level Optimization (BLO) problems in machine learning and computer vision areas. However, the theoretical correctness and practical effectiveness of these existing approaches always rely on some restrictive conditions (e.g., Lower-Level Singleton, LLS), which could hardly be satisfied in real-world applications. Moreover, previous literature only proves theoretical results based on their specific iteration strategies, thus lack a general recipe to uniformly analyze the convergence behaviors of different gradie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07976","kind":"arxiv","version":3},"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/2102.07976/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":"2102.07976","created_at":"2026-07-05T03:44:51.877978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07976v3","created_at":"2026-07-05T03:44:51.877978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07976","created_at":"2026-07-05T03:44:51.877978+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GE7IH2CFFGV","created_at":"2026-07-05T03:44:51.877978+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GE7IH2CFFGVUG5D","created_at":"2026-07-05T03:44:51.877978+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GE7IH2C","created_at":"2026-07-05T03:44:51.877978+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/3GE7IH2CFFGVUG5D4VGPFUI3EI","json":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI.json","graph_json":"https://pith.science/api/pith-number/3GE7IH2CFFGVUG5D4VGPFUI3EI/graph.json","events_json":"https://pith.science/api/pith-number/3GE7IH2CFFGVUG5D4VGPFUI3EI/events.json","paper":"https://pith.science/paper/3GE7IH2C"},"agent_actions":{"view_html":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI","download_json":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI.json","view_paper":"https://pith.science/paper/3GE7IH2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07976&json=true","fetch_graph":"https://pith.science/api/pith-number/3GE7IH2CFFGVUG5D4VGPFUI3EI/graph.json","fetch_events":"https://pith.science/api/pith-number/3GE7IH2CFFGVUG5D4VGPFUI3EI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI/action/storage_attestation","attest_author":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI/action/author_attestation","sign_citation":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI/action/citation_signature","submit_replication":"https://pith.science/pith/3GE7IH2CFFGVUG5D4VGPFUI3EI/action/replication_record"}},"created_at":"2026-07-05T03:44:51.877978+00:00","updated_at":"2026-07-05T03:44:51.877978+00:00"}