{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IXJRAX7GEUJETA5FAD6B4CJD35","short_pith_number":"pith:IXJRAX7G","schema_version":"1.0","canonical_sha256":"45d3105fe625124983a500fc1e0923df41aa576f7b925b65ef241715ecb638fc","source":{"kind":"arxiv","id":"2102.04671","version":4},"attestation_state":"computed","paper":{"title":"A Single-Timescale Method for Stochastic Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Quan Xiao, Tianyi Chen, Wotao Yin, Yuejiao Sun","submitted_at":"2021-02-09T06:35:30Z","abstract_excerpt":"Stochastic bilevel optimization generalizes the classic stochastic optimization from the minimization of a single objective to the minimization of an objective function that depends the solution of another optimization problem. Recently, stochastic bilevel optimization is regaining popularity in emerging machine learning applications such as hyper-parameter optimization and model-agnostic meta learning. To solve this class of stochastic optimization problems, existing methods require either double-loop or two-timescale updates, which are sometimes less efficient. This paper develops a new opti"},"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.04671","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-09T06:35:30Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"319301e238226f619c1a490cc9eabae5b72e06cf456323fa398caaa2ec656ce0","abstract_canon_sha256":"576a31ca32638fa69b9ad38f2d343cf4e49307a59dc34e46fde033bff31d0d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:11.755750Z","signature_b64":"/g7oFcsZk2B1UGiVd96qTgzEFFWSr/gMV0tp14RAVPn1LxYR9r8LjVJKuW2AiEbjzDcggtbKJW5kALJWgFknCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d3105fe625124983a500fc1e0923df41aa576f7b925b65ef241715ecb638fc","last_reissued_at":"2026-07-05T04:10:11.755158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:11.755158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-Timescale Method for Stochastic Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Quan Xiao, Tianyi Chen, Wotao Yin, Yuejiao Sun","submitted_at":"2021-02-09T06:35:30Z","abstract_excerpt":"Stochastic bilevel optimization generalizes the classic stochastic optimization from the minimization of a single objective to the minimization of an objective function that depends the solution of another optimization problem. Recently, stochastic bilevel optimization is regaining popularity in emerging machine learning applications such as hyper-parameter optimization and model-agnostic meta learning. To solve this class of stochastic optimization problems, existing methods require either double-loop or two-timescale updates, which are sometimes less efficient. This paper develops a new opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04671","kind":"arxiv","version":4},"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.04671/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.04671","created_at":"2026-07-05T04:10:11.755225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04671v4","created_at":"2026-07-05T04:10:11.755225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04671","created_at":"2026-07-05T04:10:11.755225+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXJRAX7GEUJE","created_at":"2026-07-05T04:10:11.755225+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXJRAX7GEUJETA5F","created_at":"2026-07-05T04:10:11.755225+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXJRAX7G","created_at":"2026-07-05T04:10:11.755225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19143","citing_title":"Single-loop approaches to nonsmooth bilevel optimisation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01621","citing_title":"Bilevel learning","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35","json":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35.json","graph_json":"https://pith.science/api/pith-number/IXJRAX7GEUJETA5FAD6B4CJD35/graph.json","events_json":"https://pith.science/api/pith-number/IXJRAX7GEUJETA5FAD6B4CJD35/events.json","paper":"https://pith.science/paper/IXJRAX7G"},"agent_actions":{"view_html":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35","download_json":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35.json","view_paper":"https://pith.science/paper/IXJRAX7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04671&json=true","fetch_graph":"https://pith.science/api/pith-number/IXJRAX7GEUJETA5FAD6B4CJD35/graph.json","fetch_events":"https://pith.science/api/pith-number/IXJRAX7GEUJETA5FAD6B4CJD35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35/action/storage_attestation","attest_author":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35/action/author_attestation","sign_citation":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35/action/citation_signature","submit_replication":"https://pith.science/pith/IXJRAX7GEUJETA5FAD6B4CJD35/action/replication_record"}},"created_at":"2026-07-05T04:10:11.755225+00:00","updated_at":"2026-07-05T04:10:11.755225+00:00"}