{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SDQKOTOFLD4H3OVL2OXAKEFYEL","short_pith_number":"pith:SDQKOTOF","canonical_record":{"source":{"id":"2302.05185","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T11:30:19Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"c4cca92c5d33ede15ccada254afaadb9fb12db9d5e9619cedafa2fcaa1637d13","abstract_canon_sha256":"f318a943068eb0f880622f7ed6b60f8f1b912873ebbd9e0b17930144bb102fcf"},"schema_version":"1.0"},"canonical_sha256":"90e0a74dc558f87dbaabd3ae0510b822e204a7d899e1b67cdb5e8efbc96bd459","source":{"kind":"arxiv","id":"2302.05185","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05185","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05185v5","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05185","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"SDQKOTOFLD4H","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_16","alias_value":"SDQKOTOFLD4H3OVL","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_8","alias_value":"SDQKOTOF","created_at":"2026-07-05T09:57:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SDQKOTOFLD4H3OVL2OXAKEFYEL","target":"record","payload":{"canonical_record":{"source":{"id":"2302.05185","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T11:30:19Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"c4cca92c5d33ede15ccada254afaadb9fb12db9d5e9619cedafa2fcaa1637d13","abstract_canon_sha256":"f318a943068eb0f880622f7ed6b60f8f1b912873ebbd9e0b17930144bb102fcf"},"schema_version":"1.0"},"canonical_sha256":"90e0a74dc558f87dbaabd3ae0510b822e204a7d899e1b67cdb5e8efbc96bd459","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:36.871195Z","signature_b64":"W/PwvOzlwcRR0AhD4/1CLhaTVjXAlp5sNNfPHUTv/gCBZkaAzLMz3SXp5hRiBveW3FyysJGbsky1ImIwGoBzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90e0a74dc558f87dbaabd3ae0510b822e204a7d899e1b67cdb5e8efbc96bd459","last_reissued_at":"2026-07-05T09:57:36.870715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:36.870715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.05185","source_version":5,"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:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAYcvxv+abhiJmkXKsCjU59n2LQ9AX8O2oDkQyGwzcH8uRxuqF2dLSt2U6G3a/B7UGu2clm5+y2fRPOtd1O2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:23:52.852129Z"},"content_sha256":"58696cb66bed55ec8a73fea19794b6614422e50383be6fd1d2dd570d6db80a5c","schema_version":"1.0","event_id":"sha256:58696cb66bed55ec8a73fea19794b6614422e50383be6fd1d2dd570d6db80a5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SDQKOTOFLD4H3OVL2OXAKEFYEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Penalty-based Bilevel Gradient Descent Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Shen, Quan Xiao, Tianyi Chen","submitted_at":"2023-02-10T11:30:19Z","abstract_excerpt":"Bilevel optimization enjoys a wide range of applications in emerging machine learning and signal processing problems such as hyper-parameter optimization, image reconstruction, meta-learning, adversarial training, and reinforcement learning. However, bilevel optimization problems are traditionally known to be difficult to solve. Recent progress on bilevel algorithms mainly focuses on bilevel optimization problems through the lens of the implicit-gradient method, where the lower-level objective is either strongly convex or unconstrained. In this work, we tackle a challenging class of bilevel pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05185","kind":"arxiv","version":5},"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/2302.05185/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:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LiNr6M+eLOWx0rs4rAldegX8k+xaUVX0UCdYR8lD0lkXDEUKEvDKP6B0P6WRoxshk2T3hyFhH/fPVdwve9kLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:23:52.852698Z"},"content_sha256":"6b6dad1b3d784fe8b1b76b5fda7e0d44a3afa9a52d74185362417544bec85f49","schema_version":"1.0","event_id":"sha256:6b6dad1b3d784fe8b1b76b5fda7e0d44a3afa9a52d74185362417544bec85f49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/bundle.json","state_url":"https://pith.science/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/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-07-31T15:23:52Z","links":{"resolver":"https://pith.science/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL","bundle":"https://pith.science/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/bundle.json","state":"https://pith.science/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDQKOTOFLD4H3OVL2OXAKEFYEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SDQKOTOFLD4H3OVL2OXAKEFYEL","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":"f318a943068eb0f880622f7ed6b60f8f1b912873ebbd9e0b17930144bb102fcf","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T11:30:19Z","title_canon_sha256":"c4cca92c5d33ede15ccada254afaadb9fb12db9d5e9619cedafa2fcaa1637d13"},"schema_version":"1.0","source":{"id":"2302.05185","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05185","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05185v5","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05185","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"SDQKOTOFLD4H","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_16","alias_value":"SDQKOTOFLD4H3OVL","created_at":"2026-07-05T09:57:36Z"},{"alias_kind":"pith_short_8","alias_value":"SDQKOTOF","created_at":"2026-07-05T09:57:36Z"}],"graph_snapshots":[{"event_id":"sha256:6b6dad1b3d784fe8b1b76b5fda7e0d44a3afa9a52d74185362417544bec85f49","target":"graph","created_at":"2026-07-05T09:57:36Z","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/2302.05185/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization enjoys a wide range of applications in emerging machine learning and signal processing problems such as hyper-parameter optimization, image reconstruction, meta-learning, adversarial training, and reinforcement learning. However, bilevel optimization problems are traditionally known to be difficult to solve. Recent progress on bilevel algorithms mainly focuses on bilevel optimization problems through the lens of the implicit-gradient method, where the lower-level objective is either strongly convex or unconstrained. In this work, we tackle a challenging class of bilevel pr","authors_text":"Han Shen, Quan Xiao, Tianyi Chen","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T11:30:19Z","title":"On Penalty-based Bilevel Gradient Descent Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05185","kind":"arxiv","version":5},"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:58696cb66bed55ec8a73fea19794b6614422e50383be6fd1d2dd570d6db80a5c","target":"record","created_at":"2026-07-05T09:57:36Z","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":"f318a943068eb0f880622f7ed6b60f8f1b912873ebbd9e0b17930144bb102fcf","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T11:30:19Z","title_canon_sha256":"c4cca92c5d33ede15ccada254afaadb9fb12db9d5e9619cedafa2fcaa1637d13"},"schema_version":"1.0","source":{"id":"2302.05185","kind":"arxiv","version":5}},"canonical_sha256":"90e0a74dc558f87dbaabd3ae0510b822e204a7d899e1b67cdb5e8efbc96bd459","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90e0a74dc558f87dbaabd3ae0510b822e204a7d899e1b67cdb5e8efbc96bd459","first_computed_at":"2026-07-05T09:57:36.870715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:36.870715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W/PwvOzlwcRR0AhD4/1CLhaTVjXAlp5sNNfPHUTv/gCBZkaAzLMz3SXp5hRiBveW3FyysJGbsky1ImIwGoBzCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:36.871195Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.05185","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58696cb66bed55ec8a73fea19794b6614422e50383be6fd1d2dd570d6db80a5c","sha256:6b6dad1b3d784fe8b1b76b5fda7e0d44a3afa9a52d74185362417544bec85f49"],"state_sha256":"65dcf3e98b941293920eb280a19818d34dca76311d2342530b4c53123065af95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfU2GHIkQ82fEVk8QrXBsVBElXtXGZrBc0c325ByKA/FszasU1I243CsXMlrHGQkLAxuZhnnMueHEVrmS3vCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T15:23:52.855918Z","bundle_sha256":"a73efc66f2a890961a2ed183a53fc982a84791ea8e0cca942b10b2d775106c00"}}