{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R7VOFMSIN7D3IHQVJI4SWZXKSZ","short_pith_number":"pith:R7VOFMSI","schema_version":"1.0","canonical_sha256":"8feae2b2486fc7b41e154a392b66ea965d897da7b09d53539d345335d17fcb33","source":{"kind":"arxiv","id":"2606.21153","version":1},"attestation_state":"computed","paper":{"title":"DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jia Liu, Songtao Lu, Yingbin Liang, Zhen Qin, Zhuqing Liu","submitted_at":"2026-06-19T06:45:13Z","abstract_excerpt":"Decentralized bilevel optimization (DBO) provides a powerful framework for multi-agent systems to solve local bilevel tasks in a decentralized fashion without the need for a central server. However, most existing DBO methods rely on lower-level strong convexity (LLSC) to guarantee unique solutions and a well-defined hypergradient for stationarity measure, hindering their applicability in many practical scenarios not satisfying LLSC. To overcome this limitation, we introduce a new single-loop DBO algorithm called diminishing quadratically-regularized bilevel decentralized optimization (DUET), w"},"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":"2606.21153","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-19T06:45:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"39fe7b8b256ea832a4b844067404033f1d66de916a136a93e5409b0b4bd8fd53","abstract_canon_sha256":"8e09609a27c47dc21e82e4e70a27b2ce8c02518ce8166ab1d40fc01e5069c660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:31.734977Z","signature_b64":"/rCJWrNGoQqfK3igVnDlynNa4yTX6k+3PCn2zYMTVYLK2+iJQJqhQopc9PG2AXEogS0zU1MK2A0HirX+ct/gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8feae2b2486fc7b41e154a392b66ea965d897da7b09d53539d345335d17fcb33","last_reissued_at":"2026-06-23T01:12:31.734444Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:31.734444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jia Liu, Songtao Lu, Yingbin Liang, Zhen Qin, Zhuqing Liu","submitted_at":"2026-06-19T06:45:13Z","abstract_excerpt":"Decentralized bilevel optimization (DBO) provides a powerful framework for multi-agent systems to solve local bilevel tasks in a decentralized fashion without the need for a central server. However, most existing DBO methods rely on lower-level strong convexity (LLSC) to guarantee unique solutions and a well-defined hypergradient for stationarity measure, hindering their applicability in many practical scenarios not satisfying LLSC. To overcome this limitation, we introduce a new single-loop DBO algorithm called diminishing quadratically-regularized bilevel decentralized optimization (DUET), w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21153","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/2606.21153/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":"2606.21153","created_at":"2026-06-23T01:12:31.734517+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21153v1","created_at":"2026-06-23T01:12:31.734517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21153","created_at":"2026-06-23T01:12:31.734517+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7VOFMSIN7D3","created_at":"2026-06-23T01:12:31.734517+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7VOFMSIN7D3IHQV","created_at":"2026-06-23T01:12:31.734517+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7VOFMSI","created_at":"2026-06-23T01:12:31.734517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ","json":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ.json","graph_json":"https://pith.science/api/pith-number/R7VOFMSIN7D3IHQVJI4SWZXKSZ/graph.json","events_json":"https://pith.science/api/pith-number/R7VOFMSIN7D3IHQVJI4SWZXKSZ/events.json","paper":"https://pith.science/paper/R7VOFMSI"},"agent_actions":{"view_html":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ","download_json":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ.json","view_paper":"https://pith.science/paper/R7VOFMSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21153&json=true","fetch_graph":"https://pith.science/api/pith-number/R7VOFMSIN7D3IHQVJI4SWZXKSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/R7VOFMSIN7D3IHQVJI4SWZXKSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ/action/storage_attestation","attest_author":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ/action/author_attestation","sign_citation":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ/action/citation_signature","submit_replication":"https://pith.science/pith/R7VOFMSIN7D3IHQVJI4SWZXKSZ/action/replication_record"}},"created_at":"2026-06-23T01:12:31.734517+00:00","updated_at":"2026-06-23T01:12:31.734517+00:00"}