{"as_of":"2026-08-17T08:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ccb21a8382a67d3461da4a27cb9b75cbec283509b7b329bf9c886b8c3a23011","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:18:57.102684Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.12704/citation-record","integrity":"/paper/2608.12704/integrity","json":"/paper/2608.12704/citation-record.json","paper":"/paper/2608.12704"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.735463Z","title":"Pareto low-rank adapters: Efficient multi-task learning with preferences","venue":null,"work_id":"ca5dd17d-d253-4c5b-854e-ca2713382ae2","year":2025},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.974760Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:43acc1c48b8d66de6c96713b5da5dea4461be78b7db5810644f411301f802fc2","observation_id":"1946e822-6913-463e-b10c-e0239f3472b6","resolution":{"observed_at":"2026-08-16T04:18:57.741866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.10603","last_updated":"2022-07-27T15:44:33Z","snapshot_observed_at":"2026-08-16T17:40:30.157191Z","submitted_at":"2021-11-20T14:28:32Z","title":"Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.10603","snapshot_observed_at":"2026-08-16T04:18:57.016813Z","title":"Reasonable effectiveness of random weighting: A litmus test for multi-task learning.arXiv preprint arXiv:2111.10603,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.016813Z"},"links":{"cited_paper":"/paper/2111.10603","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:5da7df0fa4a89d8a3abd3455a08e8cbe27deec7607160c9cc19dee695cf06c56","observation_id":"776c5db8-bd00-4a08-92f2-54dd46faaa44","resolution":{"observed_at":"2026-08-16T04:18:57.016813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19078","last_updated":"2024-07-23T10:46:28Z","snapshot_observed_at":"2026-08-16T14:14:11.699135Z","submitted_at":"2024-02-29T12:03:05Z","title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19078","snapshot_observed_at":"2026-08-16T04:18:57.027033Z","title":"Smooth tchebycheff scalarization for multi-objective optimization.arXiv preprint arXiv:2402.19078,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.027033Z"},"links":{"cited_paper":"/paper/2402.19078","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:757a686a03eff6137c48c0c824ae7cc07b54c323ac199c702d39c9227e5ef0a6","observation_id":"9a83df71-0443-410f-838b-95d48a65b948","resolution":{"observed_at":"2026-08-16T04:18:57.027033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09055","last_updated":"2019-04-23T06:29:32Z","snapshot_observed_at":"2026-08-15T06:40:14.261008Z","submitted_at":"2018-06-24T00:06:13Z","title":"DARTS: Differentiable Architecture Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09055","snapshot_observed_at":"2026-08-16T04:18:57.033729Z","title":"Darts: Differentiable architecture search.arXiv preprint arXiv:1806.09055,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.033729Z"},"links":{"cited_paper":"/paper/1806.09055","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:f66dcd025238501aff247e176dee4f68867ae7fe899177d6293d77179dc46dd2","observation_id":"cf47b379-0c4c-4e3e-84c6-38c1419a1254","resolution":{"observed_at":"2026-08-16T04:18:57.033729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09927","last_updated":"2024-05-16T09:33:28Z","snapshot_observed_at":"2026-08-16T13:52:14.736784Z","submitted_at":"2024-05-16T09:33:28Z","title":"Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-loop and Hessian-free Solution Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09927","snapshot_observed_at":"2026-08-16T04:18:57.041787Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.041787Z"},"links":{"cited_paper":"/paper/2405.09927","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:8daf72999ef65bded4e644c56366f6dd900ad72b35f67f02dbabdb1a189132ad","observation_id":"1c1695f4-3b54-45d2-8dcb-281d4f4a0da8","resolution":{"observed_at":"2026-08-16T04:18:57.041787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.00597","snapshot_observed_at":"2026-08-16T04:18:57.047937Z","title":"Exact pareto optimal search for multi-task learning and multi- criteria decision-making.arXiv preprint arXiv:2108.00597,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.047937Z"},"links":{"cited_paper":"/paper/2108.00597","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:0d3568502436882e6e5da1e1f8ee5b85f48b66cace806f1e02f07d654d64c035","observation_id":"ee50e2be-7956-41dd-9404-7decb088294d","resolution":{"observed_at":"2026-08-16T04:18:57.047937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18213","last_updated":"2025-02-04T21:42:13Z","snapshot_observed_at":"2026-08-16T14:14:35.645251Z","submitted_at":"2024-02-28T10:09:04Z","title":"Multi-objective Differentiable Neural Architecture Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18213","snapshot_observed_at":"2026-08-16T04:18:57.060945Z","title":"Multi-objective differentiable neural architecture search.arXiv preprint arXiv:2402.18213,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.060945Z"},"links":{"cited_paper":"/paper/2402.18213","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:d49a1c4db039e1e13c9f6d3721fcb0341e28621bdba8ba3ed9afc81f7c2e3ce7","observation_id":"2c693177-2274-4ced-8e42-4d510ea3a1f0","resolution":{"observed_at":"2026-08-16T04:18:57.060945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.676776Z","title":"A first-order multi-gradient algo- rithm for multi-objective bi-level optimization","venue":null,"work_id":"5507098f-9373-4dc9-a9aa-2abd19ef98fb","year":2024},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.074520Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:46f7893db87f7f2931640bef545116245038f84b184dd06994cf98c0124fd0d6","observation_id":"22d3d183-87ad-4c95-969b-70fd7a11fece","resolution":{"observed_at":"2026-08-16T04:18:57.681984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.09094","last_updated":"2026-05-14T14:59:48Z","snapshot_observed_at":"2026-07-06T23:21:16.454273Z","submitted_at":"2026-05-09T17:59:33Z","title":"A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimization","version":2},"cited_work":{"arxiv_id":"2605.09094","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.09094","snapshot_observed_at":"2026-08-16T04:18:57.145396Z","title":"A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimization","venue":"cs.LG","work_id":"5acd1bff-aa14-4004-9d7e-c69b17995b7d","year":2026},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.080678Z"},"links":{"cited_paper":"/paper/2605.09094","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:a7e9160dbb4fcb15f8c5d7fb2801486bbdd4ef63d1536a49ce28a174ad609654","observation_id":"3b520069-67fd-4e57-9006-d970269d1b89","resolution":{"observed_at":"2026-08-16T04:18:57.154155Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.658164Z","title":null,"venue":null,"work_id":"83f8eb3c-57d4-4d60-9fab-8026c8566a09","year":2018},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.085819Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:e80eb4bd19f5971092bb56cd186e173f5686f72c593d32351dc70b7429ee21d8","observation_id":"7b4991ff-78d3-4204-9f89-96373973835d","resolution":{"observed_at":"2026-08-16T04:18:57.664736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.614390Z","title":"Within each episode of meta-learning, the data are deterministic","venue":null,"work_id":"8c54d431-95a8-4f9e-8aa9-1900583cdac4","year":2018},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.097186Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:479406f2cf5e668a66670ce873cd601c4f886182e6ce84111ece286914c24b38","observation_id":"49a22f7e-cf17-4eb9-a315-46bdf3f42ced","resolution":{"observed_at":"2026-08-16T04:18:57.621671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.592955Z","title":null,"venue":null,"work_id":"6a08f061-e955-4879-a1ed-0248388ce99c","year":2009},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.102684Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:0aa1c9b963fa2746e6f85b039ee9b2cf2640db09c7f64aca2c69b800780c2059","observation_id":"8315d704-224c-4653-a24b-d00b0521c8c0","resolution":{"observed_at":"2026-08-16T04:18:57.601176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.638057Z","title":"[2017], Cheng et al","venue":null,"work_id":"cc51b665-85d1-4353-8416-5b5f49b7bb20","year":2017},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.091870Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:ddbf6daa9cd6539bfd01fed872eeacbf83f319391b6d658dcdf520aadb70ae65","observation_id":"f21e8029-e32e-4964-b231-0f0e38b3e220","resolution":{"observed_at":"2026-08-16T04:18:57.643630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.696512Z","title":"Diamond: Taming sample and communication complexities in decentralized bilevel optimization","venue":null,"work_id":"d3b07802-5418-4d27-8c46-b485430f9490","year":2023},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":1964,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.053698Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:5517c8b4ed202d3491b72c1254190a570c7ae791a98c28f523251b02f610ca02","observation_id":"56ae16cb-b5e3-4466-bceb-23d95ef8c709","resolution":{"observed_at":"2026-08-16T04:18:57.704763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07096","last_updated":"2023-02-13T03:53:44Z","snapshot_observed_at":"2026-08-17T07:37:44.094170Z","submitted_at":"2022-11-14T03:47:43Z","title":"Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07096","snapshot_observed_at":"2026-08-16T04:18:57.068865Z","title":"Alternating implicit projected sgd and its efficient variants for equality-constrained bilevel optimization.arXiv preprint arXiv:2211.07096,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.068865Z"},"links":{"cited_paper":"/paper/2211.07096","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:af3048f790e84073b5bf96d54f469de8f8de344df7c7ace8c5294e9017296a35","observation_id":"df49be78-cb9a-4875-80a0-d2a35e6baeb8","resolution":{"observed_at":"2026-08-16T04:18:57.068865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.755480Z","title":"Parl: A unified framework for policy alignment in reinforcement learning from human feedback","venue":null,"work_id":"2e976353-4fde-4710-b026-3f5c4a5a024c","year":2024},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.949759Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:b0792e49e2f4ec40b8f34a295cb0215b85f9dd9361010b8be98a1f0163c31899","observation_id":"81084dcb-4b5f-4c58-97d0-de323782ba49","resolution":{"observed_at":"2026-08-16T04:18:57.761390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16761","last_updated":"2024-01-20T16:41:48Z","snapshot_observed_at":"2026-08-16T15:20:08.891389Z","submitted_at":"2023-06-29T07:57:47Z","title":"Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16761","snapshot_observed_at":"2026-08-16T04:18:56.989552Z","title":"Moreau envelope based difference- of-weakly-convex reformulation and algorithm for bilevel programs.arXiv preprint arXiv:2306.16761,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.989552Z"},"links":{"cited_paper":"/paper/2306.16761","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:fecbc7400e704e0befb8cc28406e2023cb861112a254e5aa1b25efb1f259c5a8","observation_id":"f29c415c-ce22-41e5-b245-78db9665e042","resolution":{"observed_at":"2026-08-16T04:18:56.989552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.717921Z","title":"Federated learning meets multi-objective optimization.IEEE Transactions on Network Science and Engineering, 9(4):2039–2051,","venue":null,"work_id":"888202f2-c2a7-47fb-b779-c21c535dc651","year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.003735Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:d278b1f8e0a95bed59c9adbb497915fa8446ba7d167160f6c9272a0f7acd696f","observation_id":"94f81387-b66e-4a4a-a9db-ec1a72f92cb3","resolution":{"observed_at":"2026-08-16T04:18:57.723138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04523","last_updated":"2021-10-19T17:50:29Z","snapshot_observed_at":"2026-08-16T18:46:55.659007Z","submitted_at":"2021-02-08T20:41:21Z","title":"Multi-Objective Learning to Predict Pareto Fronts Using Hypervolume Maximization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04523","snapshot_observed_at":"2026-08-16T04:18:56.967029Z","title":"Multi-objective learning to predict pareto fronts using hypervolume maximization.arXiv preprint arXiv:2102.04523,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.967029Z"},"links":{"cited_paper":"/paper/2102.04523","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:2c1a4c2c3bfe5b14c123710a9e14b93b474f1497b31f1e6bde47151e801367dc","observation_id":"c4717f22-5755-49b9-9096-24a2e87aeb97","resolution":{"observed_at":"2026-08-16T04:18:56.967029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:18:57.010135Z","title":"Kaiyi Ji, Junjie Yang, and Yingbin Liang","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.010135Z"},"links":{"citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:31f39ba9b4a8721d279c12f0bf63105cecc51c1eae1d0148633185425219e585","observation_id":"a5151dfb-b661-4c4f-a22f-a41fc4698f1a","resolution":{"observed_at":"2026-08-16T04:18:57.010135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05170","last_updated":"2022-06-08T05:49:52Z","snapshot_observed_at":"2026-08-14T16:12:50.514842Z","submitted_at":"2020-07-10T05:20:02Z","title":"A Two-Timescale Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.05170","snapshot_observed_at":"2026-08-16T04:18:56.996362Z","title":"A two-timescale framework for bilevel opti- mization: Complexity analysis and application to actor-critic, dec","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.996362Z"},"links":{"cited_paper":"/paper/2007.05170","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:d6ce7558ce6e9e2e2c8f138aee90599525a3ee0b249b3642d0152883eb1b5626","observation_id":"5d333730-a2f3-4860-afea-1b671d269ea9","resolution":{"observed_at":"2026-08-16T04:18:56.996362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10945","last_updated":"2025-08-06T06:47:04Z","snapshot_observed_at":"2026-08-15T00:46:03.529876Z","submitted_at":"2025-01-19T04:56:55Z","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10945","snapshot_observed_at":"2026-08-16T04:18:56.959023Z","title":"Gradient- based multi-objective deep learning: Algorithms, theories, applications, and beyond.arXiv preprint arXiv:2501.10945,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.959023Z"},"links":{"cited_paper":"/paper/2501.10945","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:050f70205792a076430bd080e7b76a04ca10a010967ff08ca2685622e285113a","observation_id":"d24180c3-6259-4ec6-8806-dfdcd91425a6","resolution":{"observed_at":"2026-08-16T04:18:56.959023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12624","last_updated":"2024-03-19T15:47:43Z","snapshot_observed_at":"2026-08-16T16:21:55.577227Z","submitted_at":"2022-10-23T05:54:26Z","title":"Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12624","snapshot_observed_at":"2026-08-16T04:18:56.981749Z","title":"Mitigating gradient bias in multi-objective learning: A provably convergent stochastic approach.arXiv preprint arXiv:2210.12624,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:56.981749Z"},"links":{"cited_paper":"/paper/2210.12624","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:c35cc6ef0bff429fc6a05b5a0a40e42037435615b2a3eb2e16d5d1fb50a14a19","observation_id":"0a41a207-3824-4022-bc7d-98a32ce01593","resolution":{"observed_at":"2026-08-16T04:18:56.981749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2608.12704."}