{"as_of":"2026-08-17T12:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a067a644d60622fa4568c232d9b4dba9ce9ea7cdd783d34569df7011a49a22d","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:48:26.491308Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"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/2505.09349/citation-record","integrity":"/paper/2505.09349/integrity","json":"/paper/2505.09349/citation-record.json","paper":"/paper/2505.09349"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.04450","last_updated":"2020-04-07T15:07:12Z","snapshot_observed_at":"2026-08-16T11:54:36.460710Z","submitted_at":"2016-02-14T13:30:43Z","title":"Bayesian Optimization with Safety Constraints: Safe and Automatic Parameter Tuning in Robotics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.04450","snapshot_observed_at":"2026-08-15T21:48:25.913059Z","title":"Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:25.913059Z"},"links":{"cited_paper":"/paper/1602.04450","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:84c590a7c92f56bd7cd18c306772aad756a430f27d21f0f7936d15a81cea9358","observation_id":"c852de5a-4162-4ce5-bc0a-841e0c07c247","resolution":{"observed_at":"2026-08-15T21:48:25.913059Z","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-15T21:48:25.925530Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:25.925530Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:149ebc279396bed14322777ef44e4457cba4e2ecc8042fbd93a7fa19a1fa2486","observation_id":"7be58a50-d392-4310-a60c-be12db90e18c","resolution":{"observed_at":"2026-08-15T21:48:25.925530Z","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-15T21:48:27.383179Z","title":"Sasbo: Self-adapting safe bayesian optimization","venue":null,"work_id":"8cd8a439-8bfa-4236-8c07-f9d8102f6cb0","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:25.956033Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:02f9f0c336a5c5517ec2b23cff53020031bac511e0c810739f3f3e660f36c747","observation_id":"c75479dc-b8e3-4cf3-ba1d-d0ee607d6341","resolution":{"observed_at":"2026-08-15T21:48:27.387649Z","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":"2022.10776","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:48:26.920610Z","title":"Reinforcement learning approach to autonomous pid tuning","venue":null,"work_id":"0cf6810f-fbd8-4723-af08-c657a25c16ca","year":2022},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:25.986773Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:30dcdfb492e4be154758b29b51a08a5d9a543f573bf2d31b3d61c128de1df9c4","observation_id":"ea9f4b86-fdb7-4211-a19c-79a3947f32cd","resolution":{"observed_at":"2026-08-15T21:48:26.964297Z","resolver_source":"raw_fallback","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":{"arxiv_id":"1103.4296","last_updated":"2012-04-07T08:06:49Z","snapshot_observed_at":"2026-08-15T04:51:37.473250Z","submitted_at":"2011-03-22T16:03:01Z","title":"Randomized Smoothing for Stochastic Optimization","version":2},"cited_work":{"arxiv_id":"1103.4296","doi":null,"metadata_source":"pith","pith_arxiv_id":"1103.4296","snapshot_observed_at":"2026-08-15T21:48:26.712869Z","title":"Randomized Smoothing for Stochastic Optimization","venue":"math.OC","work_id":"218b5128-4d42-44e6-88fb-48b1895d6da2","year":2011},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.043511Z"},"links":{"cited_paper":"/paper/1103.4296","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:467c6c23e26d4fe2ab90c56fb8fc43d777748b1832e776c2c9e734104096613b","observation_id":"09cae4ee-830f-4ed7-953a-f2870a9d6679","resolution":{"observed_at":"2026-08-15T21:48:26.777623Z","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":"2006.13326","last_updated":"2020-06-23T20:51:00Z","snapshot_observed_at":"2026-08-16T11:56:11.008938Z","submitted_at":"2020-06-23T20:51:00Z","title":"Safe Learning under Uncertain Objectives and Constraints","version":1},"cited_work":{"arxiv_id":"2006.13326","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.13326","snapshot_observed_at":"2026-08-15T21:48:26.695314Z","title":"Safe Learning under Uncertain Objectives and Constraints","venue":"cs.LG","work_id":"0e62f2f3-8ecd-42f6-af8f-ce2a30fe36cb","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.177795Z"},"links":{"cited_paper":"/paper/2006.13326","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:31d25fb930027378f2f184a10444afd4f4d065362c1d4c11b24feee613c89a8a","observation_id":"467f22fe-db62-4073-88a8-d242bae0734a","resolution":{"observed_at":"2026-08-15T21:48:26.699570Z","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-15T21:48:27.370309Z","title":"Safe zeroth-order optimization using quadratic local approximations, 2023","venue":null,"work_id":"f3c67249-6b35-4339-8870-f6c4ba72a9c5","year":2023},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.183373Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:59c270e9205fbe5d7aa8483474291f1b6083eb55d1beae9d9e8c9c6c77f772b3","observation_id":"3ea96b92-3c78-4f60-9e38-e72e130d4efd","resolution":{"observed_at":"2026-08-15T21:48:27.374735Z","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-15T21:48:27.356052Z","title":"Online convex optimization with hard constraints: Towards the best of two worlds and beyond","venue":null,"work_id":"a6e12561-249a-46e5-9998-16315210ec1a","year":2022},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.189002Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:e43a17d5093337a6d20ef5c8c0cc13afa61c912da7ebe14bc0edc987888cc87d","observation_id":"76a69533-628c-4837-be0a-427418bb40b9","resolution":{"observed_at":"2026-08-15T21:48:27.361138Z","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":"2012.13088","last_updated":"2020-12-24T03:56:44Z","snapshot_observed_at":"2026-08-16T18:56:14.978877Z","submitted_at":"2020-12-24T03:56:44Z","title":"High-Dimensional Bayesian Optimization via Tree-Structured Additive Models","version":1},"cited_work":{"arxiv_id":"2012.13088","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.13088","snapshot_observed_at":"2026-08-15T21:48:26.674126Z","title":"High-Dimensional Bayesian Optimization via Tree-Structured Additive Models","venue":"stat.ML","work_id":"5402e467-5dd4-433a-a5c4-b0412ee76de7","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.193491Z"},"links":{"cited_paper":"/paper/2012.13088","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:2b446b2dc42b8bdd565c41fd02873ee3be6c2fedf85f924e6ddcfa21742ad381","observation_id":"6411b1d0-a556-4a39-8e22-1d22d9b2af30","resolution":{"observed_at":"2026-08-15T21:48:26.680525Z","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":{"arxiv_id":"1902.03229","last_updated":"2019-05-28T15:15:51Z","snapshot_observed_at":"2026-08-16T15:03:22.637183Z","submitted_at":"2019-02-08T18:41:24Z","title":"Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03229","snapshot_observed_at":"2026-08-15T21:48:26.198084Z","title":"Adaptive and safe bayesian optimization in high dimensions via one-dimensional subspaces","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.198084Z"},"links":{"cited_paper":"/paper/1902.03229","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:09c865398e5378845e829c08b30fe23ef859db6bed89618ac0c6a19718156575","observation_id":"715fb5df-f872-48cb-a16c-589ec27a7574","resolution":{"observed_at":"2026-08-15T21:48:26.198084Z","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-15T21:48:27.302607Z","title":"Bayesian optimisation for fast and safe parameter tuning of swissfel","venue":null,"work_id":"f8887977-6025-47a5-a36d-e7043d0ca342","year":null},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.202646Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:7eafb1a528aaae1c7384fa36074394a0e8d922a5a622d2ee0b42eef89362b4a7","observation_id":"52415163-68e7-4465-ae97-964f73c3d4b0","resolution":{"observed_at":"2026-08-15T21:48:27.346698Z","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-15T21:48:27.193227Z","title":"Balta, Andreas Krause, and Alisa Rupenyan","venue":null,"work_id":"4e910f30-e5b1-4f7d-99f4-861230c3d762","year":2023},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.207085Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:c96c739ee6ef80e196f490b4008d8ad01871767a97d6fc0701cbfc5186ba5812","observation_id":"9612bc1e-4be3-46c1-bf59-6301539e431a","resolution":{"observed_at":"2026-08-15T21:48:27.242216Z","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-15T21:48:27.082484Z","title":"Safe risk-averse bayesian optimization for controller tuning","venue":null,"work_id":"e41115d6-149c-447e-bc27-8cfc83b8b29a","year":2023},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.211311Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:e587065f482a2afeb33efcc2a3faa3b20adf9239a5bf6da240f85d7e1d2b957c","observation_id":"a3cd1bf9-3997-4a56-96c3-108d357a31de","resolution":{"observed_at":"2026-08-15T21:48:27.136357Z","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-15T21:48:26.214957Z","title":"The fritz john necessary optimality conditions in the presence of equality and inequality constraints","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.214957Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:44176174d50e9c5d543209780e51aba853f7503485798c13b401f7a7f6ca3162","observation_id":"b5aeeb67-e437-4939-96a6-9ac0a7636977","resolution":{"observed_at":"2026-08-15T21:48:26.214957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01708","last_updated":"2019-10-03T20:15:55Z","snapshot_observed_at":"2026-08-14T05:35:42.838302Z","submitted_at":"2019-10-03T20:15:55Z","title":"Benchmarking Batch Deep Reinforcement Learning Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01708","snapshot_observed_at":"2026-08-15T21:48:26.219026Z","title":"Benchmarking safe exploration in deep reinforcement learning","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.219026Z"},"links":{"cited_paper":"/paper/1910.01708","citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:6b7d999d622171f717fb9bd03361cc9bbb9300575df1fe82eedbc5d93287825c","observation_id":"97d7b077-9df4-4c27-9054-1848b8900735","resolution":{"observed_at":"2026-08-15T21:48:26.219026Z","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-15T21:48:27.069069Z","title":"Safe exploration for optimization with gaussian processes","venue":null,"work_id":"382371ab-eadc-4638-ad7f-c67ba8cca800","year":2015},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.223722Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:792b237efdaf63a1a1133c6be44242164a8a5056340fdcb89b7b1fc7b404c759","observation_id":"6c8a5afc-6e1c-42a7-bcb6-732279a39563","resolution":{"observed_at":"2026-08-15T21:48:27.073453Z","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-15T21:48:27.054258Z","title":"Safe convex learning under uncertain constraints","venue":null,"work_id":"e5c7db4b-7a20-42c8-a025-fdf2c0b089c5","year":2019},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.227431Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:49a2ee32089ba1c645edec0d3333ff25009ecbbaffb310a7ece9436d14a98b45","observation_id":"967b1f90-9bae-4e25-9497-f96a57be03fa","resolution":{"observed_at":"2026-08-15T21:48:27.059981Z","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-15T21:48:27.041232Z","title":"Safe non-smooth black-box optimization with application to policy search","venue":null,"work_id":"0cb4fea1-4d6c-41b2-9f86-cde1c28f813f","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.232242Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:f9d5ace42f573abec51ce9e4fd7afad43f28b155c7d45357d93fd217e0db1a10","observation_id":"1e9ef741-3692-49cf-9e09-57c7f67bdfb0","resolution":{"observed_at":"2026-08-15T21:48:27.045430Z","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-15T21:48:27.026926Z","title":"Log barriers for safe black-box optimization with application to safe reinforcement learning, 2023","venue":null,"work_id":"8f86d7f0-a9f5-4d8e-b6f9-6d037cc6c89a","year":2023},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.343539Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:46b950e05ca760b374fe49228af044484efc23eba6d6297ddbf9575e65fc9265","observation_id":"33e17d5e-ab82-49de-add9-f9804711f452","resolution":{"observed_at":"2026-08-15T21:48:27.031768Z","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-15T21:48:27.013515Z","title":null,"venue":null,"work_id":"bd479a97-ec29-4c03-9b78-696d55a5309f","year":2015},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.482343Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:b6737561ca70f4646a91ea5a3dfbb886c1911b996bc91d7c15a5ba32c5e6e2bf","observation_id":"b112913a-b0c9-4663-a5c5-092e13c97143","resolution":{"observed_at":"2026-08-15T21:48:27.017842Z","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-15T21:48:27.000229Z","title":null,"venue":null,"work_id":"4a787f80-9ec2-4e33-8c8d-d09b37bbdb81","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.487042Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:aed67c6b9a513abc8935a0b7b715de1d0648bb839e732af6efbb5f23d1ad9ac9","observation_id":"a5a31056-78bb-4e19-9563-cd1a926494f4","resolution":{"observed_at":"2026-08-15T21:48:27.004529Z","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-15T21:48:26.987038Z","title":"A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems","venue":null,"work_id":"b39f5177-e5c6-423f-9598-08c5f5947b0c","year":2020},"citing_paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T21:48:26.491308Z"},"links":{"citing_paper":"/paper/2505.09349"},"observation_digest":"sha256:a62b409f1a0d5c1b758e54ae5c3a599e8500ab4b3ab5f243854a4d6f3a4eb01a","observation_id":"c7909fe3-16b1-4e48-87e5-ce2fee58117f","resolution":{"observed_at":"2026-08-15T21:48:26.991307Z","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"}}],"paper":{"arxiv_id":"2505.09349","last_updated":"2025-05-14T12:54:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T10:57:49.774047Z","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":22},"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 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2505.09349."}