{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:45VZR3EL3AC6IFPNC4Z3NQ5OF2","short_pith_number":"pith:45VZR3EL","canonical_record":{"source":{"id":"2412.20017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T04:40:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f9ee6bffa350d23ee2a54fc75555726ecae458679ee60d6b3c8d9f413552a828","abstract_canon_sha256":"f2cf6f49db7e3d70f380f4aa083e73dc84a69288df205b006849386ede25d622"},"schema_version":"1.0"},"canonical_sha256":"e76b98ec8bd805e415ed1733b6c3ae2eb3b96eb46a9b05106f671f94bd331822","source":{"kind":"arxiv","id":"2412.20017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20017","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20017v1","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20017","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"45VZR3EL3AC6","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"45VZR3EL3AC6IFPN","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"45VZR3EL","created_at":"2026-07-05T09:54:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:45VZR3EL3AC6IFPNC4Z3NQ5OF2","target":"record","payload":{"canonical_record":{"source":{"id":"2412.20017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T04:40:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f9ee6bffa350d23ee2a54fc75555726ecae458679ee60d6b3c8d9f413552a828","abstract_canon_sha256":"f2cf6f49db7e3d70f380f4aa083e73dc84a69288df205b006849386ede25d622"},"schema_version":"1.0"},"canonical_sha256":"e76b98ec8bd805e415ed1733b6c3ae2eb3b96eb46a9b05106f671f94bd331822","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:53.237922Z","signature_b64":"EUpiMIdmnOJdc0EqmhLpFOjkhoVxNrmyx8jxpG75V7STfTwtNVJ6f7gXGDdF1xYlk31jzSOk5m06eQKltIfuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e76b98ec8bd805e415ed1733b6c3ae2eb3b96eb46a9b05106f671f94bd331822","last_reissued_at":"2026-07-05T09:54:53.237473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:53.237473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.20017","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfyMwDNh5A2+0ySLDdt4qbx6CBAB/xaK1WhnBL21dCBTnoRMdmFltMYx4wV1cFOK+0i9uRphWSwbQbXfxGMqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:04:12.305719Z"},"content_sha256":"04c67dbb6f3f93e1e7f7ebab143250eb0fb37f461107838e256aab1ce9dfca44","schema_version":"1.0","event_id":"sha256:04c67dbb6f3f93e1e7f7ebab143250eb0fb37f461107838e256aab1ce9dfca44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:45VZR3EL3AC6IFPNC4Z3NQ5OF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jie Hao, Mingrui Liu, Xiaochuan Gong","submitted_at":"2024-12-28T04:40:27Z","abstract_excerpt":"This paper studies the problem of stochastic bilevel optimization where the upper-level function is nonconvex with potentially unbounded smoothness and the lower-level function is strongly convex. This problem is motivated by meta-learning applied to sequential data, such as text classification using recurrent neural networks, where the smoothness constant of the upper-level loss function scales linearly with the gradient norm and can be potentially unbounded. Existing algorithm crucially relies on the nested loop design, which requires significant tuning efforts and is not practical. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20017","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.20017/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEfD960/umWlj17kKF0eD2gB8VorSFNfpQQd2aYDhRexgqbcJotDmqYHbRufO6oKQWBsnekQv19cZhkf/9R4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:04:12.306299Z"},"content_sha256":"4f2ef7c906c686c7d8dc2c021da8a21415b7d312ef265444d56fea773a0f0063","schema_version":"1.0","event_id":"sha256:4f2ef7c906c686c7d8dc2c021da8a21415b7d312ef265444d56fea773a0f0063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/bundle.json","state_url":"https://pith.science/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T17:04:12Z","links":{"resolver":"https://pith.science/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2","bundle":"https://pith.science/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/bundle.json","state":"https://pith.science/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45VZR3EL3AC6IFPNC4Z3NQ5OF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:45VZR3EL3AC6IFPNC4Z3NQ5OF2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f2cf6f49db7e3d70f380f4aa083e73dc84a69288df205b006849386ede25d622","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T04:40:27Z","title_canon_sha256":"f9ee6bffa350d23ee2a54fc75555726ecae458679ee60d6b3c8d9f413552a828"},"schema_version":"1.0","source":{"id":"2412.20017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20017","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20017v1","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20017","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"45VZR3EL3AC6","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"45VZR3EL3AC6IFPN","created_at":"2026-07-05T09:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"45VZR3EL","created_at":"2026-07-05T09:54:53Z"}],"graph_snapshots":[{"event_id":"sha256:4f2ef7c906c686c7d8dc2c021da8a21415b7d312ef265444d56fea773a0f0063","target":"graph","created_at":"2026-07-05T09:54:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.20017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the problem of stochastic bilevel optimization where the upper-level function is nonconvex with potentially unbounded smoothness and the lower-level function is strongly convex. This problem is motivated by meta-learning applied to sequential data, such as text classification using recurrent neural networks, where the smoothness constant of the upper-level loss function scales linearly with the gradient norm and can be potentially unbounded. Existing algorithm crucially relies on the nested loop design, which requires significant tuning efforts and is not practical. In this ","authors_text":"Jie Hao, Mingrui Liu, Xiaochuan Gong","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20017","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04c67dbb6f3f93e1e7f7ebab143250eb0fb37f461107838e256aab1ce9dfca44","target":"record","created_at":"2026-07-05T09:54:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f2cf6f49db7e3d70f380f4aa083e73dc84a69288df205b006849386ede25d622","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T04:40:27Z","title_canon_sha256":"f9ee6bffa350d23ee2a54fc75555726ecae458679ee60d6b3c8d9f413552a828"},"schema_version":"1.0","source":{"id":"2412.20017","kind":"arxiv","version":1}},"canonical_sha256":"e76b98ec8bd805e415ed1733b6c3ae2eb3b96eb46a9b05106f671f94bd331822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e76b98ec8bd805e415ed1733b6c3ae2eb3b96eb46a9b05106f671f94bd331822","first_computed_at":"2026-07-05T09:54:53.237473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:53.237473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EUpiMIdmnOJdc0EqmhLpFOjkhoVxNrmyx8jxpG75V7STfTwtNVJ6f7gXGDdF1xYlk31jzSOk5m06eQKltIfuBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:53.237922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.20017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04c67dbb6f3f93e1e7f7ebab143250eb0fb37f461107838e256aab1ce9dfca44","sha256:4f2ef7c906c686c7d8dc2c021da8a21415b7d312ef265444d56fea773a0f0063"],"state_sha256":"b61224c5d8a738043f489e40b757d9ad12fee10d56e3ea3d059da4ca3501202f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgo5sEr/8a+zaI6KkgrIlczmXvXz96AUahfvWvd+LUtOVDaITEW4bQXPc3TIg0wmbXkVXuUGeRYsTDVLUbOwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:04:12.309825Z","bundle_sha256":"26061eb80c7274e2c74aa972f8a9fa7c525d52b46643d811df3fe544b4054532"}}