Paper Citation Record · LEDGER

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2306.16761.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2306.16761 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T12:12:35.163024Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-23T07:25:28.383713Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 1fc4696e-3ac3-4b05-83fb-f3160059224e · inbound

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation cites this paper.

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

Reference 31

Resolution: verified exact; arxiv_id, observed 2026-05-23T07:25:28.385827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f5c8d39d-4277-40d8-9148-5f611aed5a7a · inbound

A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems cites this paper.

A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T12:12:35.163024Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f4d31e5-19b6-4c4b-abce-ba86d3a471a5 · inbound

Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets cites this paper.

Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

Reference 186

Resolution: metadata mismatch; arxiv_id, observed 2026-05-12T03:11:18.787646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b9047e26-5b17-49fa-9a3d-1778c3dcc3cf · inbound

Hypergradient-based Bilevel Reinforcement Learning with Improved Sample Complexity cites this paper.

Hypergradient-based Bilevel Reinforcement Learning with Improved Sample Complexity Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-03T01:38:11.581927Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.