{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2QLCX6AIVEA4GB4B3NXFBLV4ET","short_pith_number":"pith:2QLCX6AI","schema_version":"1.0","canonical_sha256":"d4162bf808a901c30781db6e50aebc24ece74b197a6683cb2482027564891080","source":{"kind":"arxiv","id":"2207.02849","version":2},"attestation_state":"computed","paper":{"title":"Betty: An Automatic Differentiation Library for Multilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Eric Xing, Pengtao Xie, Sang Keun Choe, Willie Neiswanger","submitted_at":"2022-07-05T14:01:15Z","abstract_excerpt":"Gradient-based multilevel optimization (MLO) has gained attention as a framework for studying numerous problems, ranging from hyperparameter optimization and meta-learning to neural architecture search and reinforcement learning. However, gradients in MLO, which are obtained by composing best-response Jacobians via the chain rule, are notoriously difficult to implement and memory/compute intensive. We take an initial step towards closing this gap by introducing Betty, a software library for large-scale MLO. At its core, we devise a novel dataflow graph for MLO, which allows us to (1) develop e"},"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":"2207.02849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-05T14:01:15Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"3d40c66c225d94805abbfa6d0a98e7345f9a0c1a6266d63499e8b9ef026db14c","abstract_canon_sha256":"66196f8bc738150670da58a0e2e067bfb63dccf38f637163ce90f8ac348a771a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:26.202089Z","signature_b64":"IwgEbWJJvX4cbmBCxUFUmUirX5vbniKT254Ds2O0j9ZdkpI4zHP+dLCicK/K9DNg5rynDmrzLSNCtzj2c7pVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4162bf808a901c30781db6e50aebc24ece74b197a6683cb2482027564891080","last_reissued_at":"2026-07-05T05:51:26.201584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:26.201584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Betty: An Automatic Differentiation Library for Multilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Eric Xing, Pengtao Xie, Sang Keun Choe, Willie Neiswanger","submitted_at":"2022-07-05T14:01:15Z","abstract_excerpt":"Gradient-based multilevel optimization (MLO) has gained attention as a framework for studying numerous problems, ranging from hyperparameter optimization and meta-learning to neural architecture search and reinforcement learning. However, gradients in MLO, which are obtained by composing best-response Jacobians via the chain rule, are notoriously difficult to implement and memory/compute intensive. We take an initial step towards closing this gap by introducing Betty, a software library for large-scale MLO. At its core, we devise a novel dataflow graph for MLO, which allows us to (1) develop e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02849","kind":"arxiv","version":2},"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/2207.02849/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":"2207.02849","created_at":"2026-07-05T05:51:26.201648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.02849v2","created_at":"2026-07-05T05:51:26.201648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02849","created_at":"2026-07-05T05:51:26.201648+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QLCX6AIVEA4","created_at":"2026-07-05T05:51:26.201648+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QLCX6AIVEA4GB4B","created_at":"2026-07-05T05:51:26.201648+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QLCX6AI","created_at":"2026-07-05T05:51:26.201648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12718","citing_title":"CHAL: Council of Hierarchical Agentic Language","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET","json":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET.json","graph_json":"https://pith.science/api/pith-number/2QLCX6AIVEA4GB4B3NXFBLV4ET/graph.json","events_json":"https://pith.science/api/pith-number/2QLCX6AIVEA4GB4B3NXFBLV4ET/events.json","paper":"https://pith.science/paper/2QLCX6AI"},"agent_actions":{"view_html":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET","download_json":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET.json","view_paper":"https://pith.science/paper/2QLCX6AI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.02849&json=true","fetch_graph":"https://pith.science/api/pith-number/2QLCX6AIVEA4GB4B3NXFBLV4ET/graph.json","fetch_events":"https://pith.science/api/pith-number/2QLCX6AIVEA4GB4B3NXFBLV4ET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET/action/storage_attestation","attest_author":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET/action/author_attestation","sign_citation":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET/action/citation_signature","submit_replication":"https://pith.science/pith/2QLCX6AIVEA4GB4B3NXFBLV4ET/action/replication_record"}},"created_at":"2026-07-05T05:51:26.201648+00:00","updated_at":"2026-07-05T05:51:26.201648+00:00"}