{"as_of":"2026-08-18T02:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:634f364c63c234c420c6cd1f5571bc4960aeb734c83bb04905343f1bd52d8481","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:05:47.806428Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"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/2509.05811/citation-record","integrity":"/paper/2509.05811/integrity","json":"/paper/2509.05811/citation-record.json","paper":"/paper/2509.05811"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:05:47.678910Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.678910Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:a61ddb10e78459fcb8882823c35638634bd02c0e381bd65f8d1f39ddd2a4480e","observation_id":"5d4c4c69-5123-4c8c-a4b2-04f32051bf2c","resolution":{"observed_at":"2026-08-05T05:05:47.678910Z","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-05T05:05:47.682785Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.682785Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:b7042b944fafbf8384f364ff88a1953ed5473e8a55960149dcb411a34a22b61d","observation_id":"7a0ba77d-bdc3-4d61-b31b-c9b1d3871567","resolution":{"observed_at":"2026-08-05T05:05:47.682785Z","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-05T05:05:47.685729Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.685729Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:afb10375ef7b3eea762b58e3ca04bd74d60ad797e3088edcdeca6fe63cf88bbc","observation_id":"482f5d90-8968-4453-a2ef-09a933aeb8e2","resolution":{"observed_at":"2026-08-05T05:05:47.685729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04005","last_updated":"2024-05-13T07:33:27Z","snapshot_observed_at":"2026-08-16T14:21:00.310082Z","submitted_at":"2024-02-06T14:00:43Z","title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04005","snapshot_observed_at":"2026-08-05T05:05:47.689252Z","title":"Bayesian uncertainty for gradient aggregation in multi-task learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.689252Z"},"links":{"cited_paper":"/paper/2402.04005","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:f75657f889aa9113536af2c6e5966230fb815ec0bcfcd8f36c30bfb78aef0ee4","observation_id":"779f8dd3-6e84-4617-95d3-e2860c6eeeb2","resolution":{"observed_at":"2026-08-05T05:05:47.689252Z","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-05T05:05:48.259740Z","title":"Predicting with proxies: Transfer learning in high dimension","venue":null,"work_id":"433711c9-2d2c-4500-8962-69fae85027c5","year":2021},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.692172Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:38e1324e2a2b49aaaacb9a2a41936d59f966fd6441c5ce7dc63e85adb526db18","observation_id":"1fd540ea-a664-46cb-9210-9abc56b912fc","resolution":{"observed_at":"2026-08-05T05:05:48.262380Z","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-05T05:05:48.251920Z","title":"Robust optimization--methodology and applications","venue":null,"work_id":"fa58c784-4e1a-4a41-a005-42a84851f869","year":2002},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.694675Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:7df0e62ca55be9925a64f6e1ff4afeb39fd60cbf00e9e0da8df99ea7998aa741","observation_id":"a632d600-137c-45f1-8971-adec2c6275aa","resolution":{"observed_at":"2026-08-05T05:05:48.254626Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:05:47.697200Z","title":"Robust optimization","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.697200Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:49ad2d9797beacddf03f2d63150af7c4aa05edb9777b5d23048b2b7fa86331a7","observation_id":"ec058cce-3e5b-4e0b-a56e-d10c3b43ada8","resolution":{"observed_at":"2026-08-05T05:05:47.697200Z","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-05T05:05:47.700004Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.700004Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:c6dc67888ec7e77665d40941eb78849b286821a1efcdb63bc8d17e3dfb646276","observation_id":"002810de-9a0f-426e-a9be-4752d92f805d","resolution":{"observed_at":"2026-08-05T05:05:47.700004Z","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-05T05:05:47.702545Z","title":"Multitask learning","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.702545Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:2d4487ca2f1b074a7188330ceca2e7a7680908d3fec9e8a25737a6c21cc972e6","observation_id":"df290a41-f198-4caf-9fbe-e30c33809f96","resolution":{"observed_at":"2026-08-05T05:05:47.702545Z","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-05T05:05:47.705168Z","title":"Prediction, learning, and games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.705168Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:0185936cabfbbf8cb423e2de57e92f7e3de59e0a32361c10dd0bbbc7128a71ee","observation_id":"5d0f6e5d-f0ec-44fd-af1f-630111095662","resolution":{"observed_at":"2026-08-05T05:05:47.705168Z","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-05T05:05:48.224064Z","title":"Entropy-sgd: Biasing gradient descent into wide valleys","venue":null,"work_id":"1651efa0-0873-45a2-b961-1b75ca387adc","year":2019},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.707828Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:9d07d2e116ef28057e99c8adbc82acce50f3e1d63e11fe14b7f16bd7f7b1cb32","observation_id":"759cce91-1f53-4612-a430-c9b8c171c07f","resolution":{"observed_at":"2026-08-05T05:05:48.226883Z","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-05T05:05:48.216145Z","title":"Robust optimization for non-convex objectives","venue":null,"work_id":"6284ea50-2ef3-4256-bcea-4451fb097d15","year":2017},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.710353Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:017bf890802f706befc93c92cc618418809b13ba3653bdf7e7d37265f10d5fc4","observation_id":"a9b415cf-b50f-4669-9293-ebc866b54adb","resolution":{"observed_at":"2026-08-05T05:05:48.219040Z","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-05T05:05:48.208164Z","title":"Reinforcement learning can be more efficient with multiple rewards","venue":null,"work_id":"3c1293c3-cd11-4fb8-baca-d9c639f847cd","year":2023},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.712813Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:74a0f195fc1e06d2cbe1b451c77c44909e1a5d9962bde3ad5b640addc996467d","observation_id":"c268fde1-a0dd-4a54-8ba8-bd81e54be34d","resolution":{"observed_at":"2026-08-05T05:05:48.210947Z","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-05T05:05:48.200284Z","title":"The road less scheduled","venue":null,"work_id":"74599c60-8d2d-4f51-a77c-0a29ae2aee14","year":2024},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.715171Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:4e8023edd1eae80be61cfce97dcc75e1a8f43285d6a98b060185b8783b57c7a9","observation_id":"efb6e9eb-2f88-441f-a3f6-1ff5a5f3a702","resolution":{"observed_at":"2026-08-05T05:05:48.202991Z","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":"2401.09561","last_updated":"2024-01-17T19:31:21Z","snapshot_observed_at":"2026-08-16T14:26:40.104363Z","submitted_at":"2024-01-17T19:31:21Z","title":"Sharing Knowledge in Multi-Task Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09561","snapshot_observed_at":"2026-08-05T05:05:47.717567Z","title":"Sharing knowledge in multi-task deep reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.717567Z"},"links":{"cited_paper":"/paper/2401.09561","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:86620879ad76878d1308da9a6ff3a2ae9aec3b3f223a691c30b7a3f3a1b34190","observation_id":"8ba952df-173c-40fe-b674-9c1bd1cd6a21","resolution":{"observed_at":"2026-08-05T05:05:47.717567Z","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-05T05:05:47.720349Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.720349Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:b1319333078e08d5cf2d3a0acd23c59a7b8142e2510736c37854bb341771ea65","observation_id":"8cc2f367-92ca-420d-9c8b-8610dd83718a","resolution":{"observed_at":"2026-08-05T05:05:47.720349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14096","last_updated":"2025-03-04T04:23:17Z","snapshot_observed_at":"2026-08-16T12:56:52.004622Z","submitted_at":"2025-02-19T20:50:03Z","title":"Aligned Multi Objective Optimization","version":2},"cited_work":{"arxiv_id":"2502.14096","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.14096","snapshot_observed_at":"2026-08-05T05:05:47.941784Z","title":"Aligned Multi Objective Optimization","venue":"cs.LG","work_id":"641927bb-2349-4c9d-9cdb-39aaf6014b75","year":2025},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.722871Z"},"links":{"cited_paper":"/paper/2502.14096","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:a2f889e97cbeeff0a1a60bab77dea1ebac42155342b5a474aecc189ad9dac27d","observation_id":"5f1cbe14-6a9c-4fba-8cf1-a4f97fd5a8b8","resolution":{"observed_at":"2026-08-05T05:05:47.944681Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2010.01412","last_updated":"2021-04-29T16:44:25Z","snapshot_observed_at":"2026-08-15T12:34:14.131778Z","submitted_at":"2020-10-03T19:02:10Z","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01412","snapshot_observed_at":"2026-08-05T05:05:47.725455Z","title":"Sharpness-aware minimization for efficiently improving generalization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.725455Z"},"links":{"cited_paper":"/paper/2010.01412","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:325a6b0344762551d015d7f885e61c7c04c476db8ad7e99304c83e9ef4ca34a7","observation_id":"d91a4b53-d59c-4438-a424-6ac9cff72136","resolution":{"observed_at":"2026-08-05T05:05:47.725455Z","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-05T05:05:48.187364Z","title":"A review of multi-objective optimization: Methods and its applications","venue":null,"work_id":"4147bf16-d418-47a9-b995-54e43648e4a1","year":2018},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.728316Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:ff4a666b93c7f0d26595136ec04035605879d47acbc9fd81e46e34756eeedcf2","observation_id":"bbb9af5a-2fcd-4497-889a-f59b8b55a04c","resolution":{"observed_at":"2026-08-05T05:05:48.190313Z","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":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T05:05:47.730598Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.730598Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:8f09bbdbfc34dd10722e4df07498460ac7ade098f75fb5d9003eaf2615dccd1f","observation_id":"42169af6-ea40-4b29-930b-6a562da0e558","resolution":{"observed_at":"2026-08-05T05:05:47.730598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-08-17T15:09:11.267528Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-05T05:05:47.733519Z","title":"Revisiting the polyak step size","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.733519Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:60378646486835e0952a3551e3b380d7b1dacdee37936802338a08ae6b35019b","observation_id":"e607a1ba-7829-44b6-bd5f-047daea1bc44","resolution":{"observed_at":"2026-08-05T05:05:47.733519Z","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-05T05:05:47.736487Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.736487Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:276ad11f08c34b514a6fbcd072f2cd9b0e1f874b9282cc64fb1b4faa1351d4f6","observation_id":"7c74445a-5d5d-4212-a26f-83cc539a41a6","resolution":{"observed_at":"2026-08-05T05:05:47.736487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.05397","last_updated":"2016-11-16T18:21:29Z","snapshot_observed_at":"2026-08-17T16:01:56.839157Z","submitted_at":"2016-11-16T18:21:29Z","title":"Reinforcement Learning with Unsupervised Auxiliary Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.05397","snapshot_observed_at":"2026-08-05T05:05:47.738809Z","title":"Reinforcement learning with unsupervised auxiliary tasks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.738809Z"},"links":{"cited_paper":"/paper/1611.05397","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:d42619ccb5086c068c0d5d4709eaa318dcbd842ee93d72b91fe3427156fc26e6","observation_id":"0e4a40a9-46b1-4c06-afdc-1a5238452b05","resolution":{"observed_at":"2026-08-05T05:05:47.738809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T05:05:47.741588Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.741588Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:8bf2ed234942477803e763b755ba9a7a8cb26bc1f9222e0b75ef065d6db3de6c","observation_id":"dd6b618f-8d61-4e36-b66c-48d593e9f63c","resolution":{"observed_at":"2026-08-05T05:05:47.741588Z","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-05T05:05:47.744351Z","title":"Visualizing the loss landscape of neural nets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.744351Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:afbebb9827472de2e8394303c3870c0b08d70d95889c269331fc7a44370bc61d","observation_id":"08b365fb-2bee-41a9-a0a6-d488ce7a6612","resolution":{"observed_at":"2026-08-05T05:05:47.744351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-17T09:42:34.746112Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-05T05:05:47.746902Z","title":"Let's verify step by step","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.746902Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:fbb558d0b1e68bfb3904162f78ba897ed4852bd60ee477a61ebb26d6600d69c5","observation_id":"019ccfb8-d411-47bb-9ca5-a92e2816ccf0","resolution":{"observed_at":"2026-08-05T05:05:47.746902Z","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-05T05:05:47.751186Z","title":"Conflict-averse gradient descent for multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.751186Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:97e38ba6876492056c0753635d19c096560bc76287f71c258fc3d6077475bb63","observation_id":"ee725920-ff1c-4638-9fc0-16a5d081868c","resolution":{"observed_at":"2026-08-05T05:05:47.751186Z","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-05T05:05:48.164368Z","title":"End-to-end multi-task learning with attention","venue":null,"work_id":"50400096-bd3f-4b9d-b10f-6bef1af6ca00","year":2019},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.753819Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:96ab99d048a288eb060efa6b678c554310d22d8736fae4d6fae18e37fa7453fa","observation_id":"377173e5-5a37-4e90-9140-bf77cef787f9","resolution":{"observed_at":"2026-08-05T05:05:48.167136Z","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":"2202.01017","last_updated":"2022-07-08T12:00:51Z","snapshot_observed_at":"2026-08-17T08:29:38.851089Z","submitted_at":"2022-02-02T13:21:53Z","title":"Multi-Task Learning as a Bargaining Game","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01017","snapshot_observed_at":"2026-08-05T05:05:47.756478Z","title":"Multi-task learning as a bargaining game","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.756478Z"},"links":{"cited_paper":"/paper/2202.01017","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:1a31e35a94199dd27a6aa75ae2f82bb55503d26b3ff359f542aaa7b2d4587f57","observation_id":"0bd565d1-b27f-49aa-bf7f-c56b1d80d968","resolution":{"observed_at":"2026-08-05T05:05:47.756478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-05T05:05:47.759364Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.759364Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:1a0767c316ae206ea5204922b5863380cb6c1906737c38fbd8cfa46f73b92466","observation_id":"82268159-1f08-45cd-8023-f129e81bc20a","resolution":{"observed_at":"2026-08-05T05:05:47.759364Z","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-05T05:05:48.156119Z","title":"Relative flatness and generalization","venue":null,"work_id":"8c098e5e-fdfb-4c89-9f18-91f2797b56b2","year":2021},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.762448Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:5f0d31b00a977f8d5738d12af70ee1541b06e902b2b9cca2018764332638da2e","observation_id":"d4a125e3-0293-46d5-b7ac-270bd44a275d","resolution":{"observed_at":"2026-08-05T05:05:48.158866Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:05:47.765110Z","title":"Introduction to optimization","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.765110Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:4c9b220a796d3a353e427fc6b9f59edfc9a911a1cd58da035eb5422289520214","observation_id":"ced2c016-8ed1-4b18-a548-31e6686e89af","resolution":{"observed_at":"2026-08-05T05:05:47.765110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.05499","last_updated":"2019-03-13T14:05:31Z","snapshot_observed_at":"2026-08-15T22:07:05.447940Z","submitted_at":"2019-03-13T14:05:31Z","title":"DeepOBS: A Deep Learning Optimizer Benchmark Suite","version":1},"cited_work":{"arxiv_id":"1903.05499","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.05499","snapshot_observed_at":"2026-08-05T05:05:47.870640Z","title":"DeepOBS: A Deep Learning Optimizer Benchmark Suite","venue":"cs.LG","work_id":"c5770c2f-3b89-4b0f-932a-815608442fa2","year":2019},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.767721Z"},"links":{"cited_paper":"/paper/1903.05499","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:0d0a452c745ecfab0e7a223bf05b21274046d7370921a78aad74bb7322bbb58d","observation_id":"f22c1377-fd84-423c-8cb1-70d6ff92b1a3","resolution":{"observed_at":"2026-08-05T05:05:47.873727Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-05T05:05:48.142779Z","title":"Multi-task learning as multi-objective optimization","venue":null,"work_id":"b06b177b-475c-400c-a0bf-e5590226a33c","year":2018},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.770564Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:35f68e168fcfe064cdbc351e7464c653c6ba0431bc0ac338eddb2d651ebda477","observation_id":"77990a53-bad0-420f-a25e-91e192c9979f","resolution":{"observed_at":"2026-08-05T05:05:48.145779Z","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-05T05:05:48.133441Z","title":"Proxybo: Accelerating neural architecture search via bayesian optimization with zero-cost proxies","venue":null,"work_id":"c4e10670-2356-4fe8-93f0-6fdcc4e18d18","year":2023},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.773346Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:e56e97f541c4813190ea3ea52980b60e939a0f210be63478e7d3899485279dcc","observation_id":"7ad4716c-7216-467c-b649-ef9bd066a287","resolution":{"observed_at":"2026-08-05T05:05:48.136768Z","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":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-08-15T22:38:53.825110Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-05T05:05:47.775950Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.775950Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:93f8f878e0ec49d7f500bef4c301c6ed2e81355b3acf34feff14c326a452377b","observation_id":"7720a5da-35fa-42ec-a85d-c08ed7d75ba1","resolution":{"observed_at":"2026-08-05T05:05:47.775950Z","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-05T05:05:48.125081Z","title":"Distral: Robust multitask reinforcement learning","venue":null,"work_id":"c7791763-b257-4cfe-a4cb-e0d5b6ff4e3b","year":2017},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.778810Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:b569b6434e1a72f4166000c7bbf1525624ffc095045795585bbca3fb9192d2f0","observation_id":"45453a89-a1c4-4414-956a-4dd080680efc","resolution":{"observed_at":"2026-08-05T05:05:48.127965Z","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.14275","last_updated":"2022-11-25T18:19:44Z","snapshot_observed_at":"2026-08-01T02:16:43.109337Z","submitted_at":"2022-11-25T18:19:44Z","title":"Solving math word problems with process- and outcome-based feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14275","snapshot_observed_at":"2026-08-05T05:05:47.781473Z","title":"Solving math word problems with process-and outcome-based feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.781473Z"},"links":{"cited_paper":"/paper/2211.14275","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:c45276dc12dfb56d92528249280e37290bed0ee1cc22555a197a4311c1c56916","observation_id":"be10c388-6559-4303-941e-423a4d55ee44","resolution":{"observed_at":"2026-08-05T05:05:47.781473Z","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-05T05:05:48.115630Z","title":"Discovery of useful questions as auxiliary tasks","venue":null,"work_id":"5ad96237-2fea-457d-9c94-cf9c68cb5a54","year":2019},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.784330Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:adc2244258031d46cb946cd917b6fc29990c3dc2eb48a4923bad2c942021418e","observation_id":"9b7b5684-a286-4793-8079-07b185aa20da","resolution":{"observed_at":"2026-08-05T05:05:48.118820Z","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":"2407.15762","last_updated":"2024-10-23T17:42:39Z","snapshot_observed_at":"2026-08-16T13:32:05.007100Z","submitted_at":"2024-07-22T16:13:38Z","title":"Conditional Language Policy: A General Framework for Steerable Multi-Objective Finetuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15762","snapshot_observed_at":"2026-08-05T05:05:47.786868Z","title":"Conditional language policy: A general framework for steerable multi-objective finetuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.786868Z"},"links":{"cited_paper":"/paper/2407.15762","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:b6b58701ef571edb5d9102373ee08a463cc84e0b859578fee74e9017c924d991","observation_id":"7ea01283-52c7-40bd-90b1-7bb4b817d335","resolution":{"observed_at":"2026-08-05T05:05:47.786868Z","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-05T05:05:47.789482Z","title":"Robust markov decision processes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.789482Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:70586630fbf648428777553ebe67ffdb7f9f00c47ce93546663ef1c302627d75","observation_id":"44cdc482-e30e-4333-9737-dbb930216f06","resolution":{"observed_at":"2026-08-05T05:05:47.789482Z","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-05T05:05:48.100869Z","title":"Two losses are better than one: Faster optimization using a cheaper proxy","venue":null,"work_id":"d73a3249-c08c-4480-b07d-33ecb016583b","year":2023},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.791845Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:05e3e929ff71d3eda7783a64ed34f47a0c957a246d6c0d8fbc733a1de3f53674","observation_id":"9260cbf7-7720-46cc-b93f-71992c4ea0aa","resolution":{"observed_at":"2026-08-05T05:05:48.103835Z","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":"2403.17141","last_updated":"2024-10-07T03:19:16Z","snapshot_observed_at":"2026-08-16T14:06:31.649167Z","submitted_at":"2024-03-25T19:28:10Z","title":"MetaAligner: Towards Generalizable Multi-Objective Alignment of Language Models","version":3},"cited_work":{"arxiv_id":"2403.17141","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.17141","snapshot_observed_at":"2026-08-05T05:05:47.832941Z","title":"MetaAligner: Towards Generalizable Multi-Objective Alignment of Language Models","venue":"cs.CL","work_id":"a462fbd7-a535-48ca-b767-c43bfcc81cbb","year":2024},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.794345Z"},"links":{"cited_paper":"/paper/2403.17141","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:797c98a97471fdfe9ccb11b168612acac4ff0ffe0e3319ee4ec5a2b353880b51","observation_id":"3a7b4a45-a4fd-419f-927f-ee26a590ef4d","resolution":{"observed_at":"2026-08-05T05:05:47.837973Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-05T05:05:48.091032Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"d404a020-5952-490a-8403-c7b7aeed231d","year":2020},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.796968Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:c2205b3a5b53f1446c48002f2f37eacd05810f5cc5ceb7601fe68c5ad2f6797f","observation_id":"216a11bc-c564-4a44-a80d-d0caa81a382f","resolution":{"observed_at":"2026-08-05T05:05:48.094320Z","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-05T05:05:48.081568Z","title":"Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning","venue":null,"work_id":"3e7c65c4-c2fc-427a-b810-56d9ff5c6938","year":2020},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.799354Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:a2bf92484cbaa5d4d529e0ed3595e024dade28947fcfaaa11efec06c538636e4","observation_id":"47165959-8999-4b30-9b94-f629881a964a","resolution":{"observed_at":"2026-08-05T05:05:48.085110Z","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-05T05:05:48.072581Z","title":"Visual classification with multitask joint sparse representation","venue":null,"work_id":"cb084dda-a6a3-4d54-b437-ee1d9e2c3c62","year":2012},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.801718Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:d1f080653bf7906559543802dd52de91b6ac7aab48c410bee8924bf9f9d83c51","observation_id":"61a90f3c-4a01-44c5-894f-45765ddd24fe","resolution":{"observed_at":"2026-08-05T05:05:48.076120Z","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-05T05:05:48.063960Z","title":"Facial landmark detection by deep multi-task learning","venue":null,"work_id":"1ccb6476-69a1-4354-a1c4-bc60d5bf49d2","year":2014},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.804150Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:4c1c11375fc468f7cb267db827670e335df64f3949af4dd6b7995d9b720a9d31","observation_id":"a7336221-1dc2-49a0-9ec8-b6219b6e60b5","resolution":{"observed_at":"2026-08-05T05:05:48.067041Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:05:47.806428Z","title":"Online convex programming and generalized infinitesimal gradient ascent","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.806428Z"},"links":{"citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:91c149fd5ea0a9ea8ab4f980fe1458082fe3c890fd4aa8e73321c43c2bda1aea","observation_id":"2416c1ff-6400-4ea0-9916-b2d5d01c7fb3","resolution":{"observed_at":"2026-08-05T05:05:47.806428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T15:56:13.802863Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":18},"total_outbound_references":48},"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 18 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2509.05811."}