{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:73R7WYHF5RSPTIXFTV3KTC6RL4","short_pith_number":"pith:73R7WYHF","canonical_record":{"source":{"id":"2302.08766","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58","abstract_canon_sha256":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337"},"schema_version":"1.0"},"canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","source":{"kind":"arxiv","id":"2302.08766","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08766v5","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"73R7WYHF5RSP","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_16","alias_value":"73R7WYHF5RSPTIXF","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_8","alias_value":"73R7WYHF","created_at":"2026-07-05T09:42:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:73R7WYHF5RSPTIXFTV3KTC6RL4","target":"record","payload":{"canonical_record":{"source":{"id":"2302.08766","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58","abstract_canon_sha256":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337"},"schema_version":"1.0"},"canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:18.352694Z","signature_b64":"iWDpvyeByQCXJO/MPtUZs+MxkdvRdVaU0yzqmRX9wZytbnl4awuUhpCPj2vt0l3yH0GAY+NDpa752da0D11hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","last_reissued_at":"2026-07-05T09:42:18.352252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:18.352252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.08766","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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nep3K7sjm5OTpKYAwqe03HBAx0vxuMBLvOEOYt5WjcAfIXReAGYWq+bpNeaBKmAAujyUngHKqeLDzAcbxmOXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:47:44.946240Z"},"content_sha256":"9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524","schema_version":"1.0","event_id":"sha256:9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:73R7WYHF5RSPTIXFTV3KTC6RL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Mathieu Dagr\\'eou, Pierre Ablin, Samuel Vaiter, Thomas Moreau","submitted_at":"2023-02-17T09:04:18Z","abstract_excerpt":"Bilevel optimization problems, which are problems where two optimization problems are nested, have more and more applications in machine learning. In many practical cases, the upper and the lower objectives correspond to empirical risk minimization problems and therefore have a sum structure. In this context, we propose a bilevel extension of the celebrated SARAH algorithm. We demonstrate that the algorithm requires $\\mathcal{O}((n+m)^{\\frac12}\\varepsilon^{-1})$ oracle calls to achieve $\\varepsilon$-stationarity with $n+m$ the total number of samples, which improves over all previous bilevel a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08766","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.08766/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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0epJOYZpjkQFBRbxNQJsE5x9H4eDC0ZGKZwlAcmP94P0Bgij9zBI8OyORI1+pdSeW9oUXJXP+QCvnS7bqEoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:47:44.946748Z"},"content_sha256":"af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11","schema_version":"1.0","event_id":"sha256:af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/bundle.json","state_url":"https://pith.science/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/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-14T14:47:44Z","links":{"resolver":"https://pith.science/pith/73R7WYHF5RSPTIXFTV3KTC6RL4","bundle":"https://pith.science/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/bundle.json","state":"https://pith.science/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73R7WYHF5RSPTIXFTV3KTC6RL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:73R7WYHF5RSPTIXFTV3KTC6RL4","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":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58"},"schema_version":"1.0","source":{"id":"2302.08766","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08766v5","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"73R7WYHF5RSP","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_16","alias_value":"73R7WYHF5RSPTIXF","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_8","alias_value":"73R7WYHF","created_at":"2026-07-05T09:42:18Z"}],"graph_snapshots":[{"event_id":"sha256:af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11","target":"graph","created_at":"2026-07-05T09:42:18Z","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.08766/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization problems, which are problems where two optimization problems are nested, have more and more applications in machine learning. In many practical cases, the upper and the lower objectives correspond to empirical risk minimization problems and therefore have a sum structure. In this context, we propose a bilevel extension of the celebrated SARAH algorithm. We demonstrate that the algorithm requires $\\mathcal{O}((n+m)^{\\frac12}\\varepsilon^{-1})$ oracle calls to achieve $\\varepsilon$-stationarity with $n+m$ the total number of samples, which improves over all previous bilevel a","authors_text":"Mathieu Dagr\\'eou, Pierre Ablin, Samuel Vaiter, Thomas Moreau","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08766","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:9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524","target":"record","created_at":"2026-07-05T09:42:18Z","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":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58"},"schema_version":"1.0","source":{"id":"2302.08766","kind":"arxiv","version":5}},"canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","first_computed_at":"2026-07-05T09:42:18.352252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:18.352252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iWDpvyeByQCXJO/MPtUZs+MxkdvRdVaU0yzqmRX9wZytbnl4awuUhpCPj2vt0l3yH0GAY+NDpa752da0D11hCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:18.352694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.08766","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524","sha256:af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11"],"state_sha256":"4b54f8566fc765c248a48b5873ca8911cae4485d8d5f35ad3fe8f6c853330af3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9NFfrkKmHQdujO3bKK9EfdLFjfeTME7BqseOdTIo4+fmY6zsv4Enq897GWba+eZKolR+ha22ona17CXIuDHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T14:47:44.952105Z","bundle_sha256":"0856402b42a9127653160ba26f205b4258f162e80a01394e5f56ef263ff81959"}}