{"as_of":"2026-08-11T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24c92624a1827d04c2db666d26f76c94230c838c85a7611aea9f843d07dbb4cd","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T00:44:59.235803Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2607.05183/citation-record","integrity":"/paper/2607.05183/integrity","json":"/paper/2607.05183/citation-record.json","paper":"/paper/2607.05183"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/080716980","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Abramson, C","venue":"SIAM Journal on Optimization","work_id":"b6bd6277-38f7-4df4-9d85-d8e2177b573b","year":2009},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:204c0308b8a635b2303ed9bf51ce201aac9754b1d28c29ff854ff1a3242fcf67","observation_id":"6707b2ba-cf5d-433e-9c8b-65bc7af55b67","resolution":{"observed_at":"2026-07-08T00:54:21.135882Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:10.399662+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:10.399662+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.100011","doi":"10.1016/j.ejco.2021.100011","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alarie, C","venue":"EURO Journal on Computational Optimization","work_id":"1cc124db-4407-4624-b8f7-9abb1661278c","year":2021},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:f8a6e8906de7d9fc3e7ac41b9f96b25f5fa8f595e9399c8a3e7e9c86457a5c2a","observation_id":"27888cbe-45f1-4060-add5-d22ece4078c4","resolution":{"observed_at":"2026-07-08T00:54:21.118866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:10.767134+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:10.767134+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11081-024-09952-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Andr ´es-Thi´o, C","venue":"Optimization and Engineering","work_id":"27bb3547-9b83-411d-b31b-6ead60ad65a0","year":2025},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:1d03c977c93d57c1f17c33a5163c78e12b806abc610eba0298bbe551a1e55de1","observation_id":"0094d8a6-767e-4141-b7aa-8e5fd641e882","resolution":{"observed_at":"2026-07-08T00:54:21.137705Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:11.086427+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:11.086427+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10898-007-9234-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet, V","venue":"Journal of Global Optimization","work_id":"e6f0a8ea-12a8-482e-a070-01bba20d193b","year":2008},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:8063368f8b941bf79dea1404105f1e564fad408c4be78324518713da4cc85401","observation_id":"29762793-a681-4f52-9195-a4abe4282534","resolution":{"observed_at":"2026-07-08T00:54:21.127420Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:11.414155+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:11.414155+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.20811","doi":"10.48550/arxiv.2601.20811","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet, A","venue":"Open MIND","work_id":"13baecbb-e42f-41e1-ab2e-8f63ffe3e537","year":2026},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:78a2dababcd6c2bbd1df5874848b6584722c070f28a5ffeb0723dd4c79cdc743","observation_id":"5fba2975-b9cd-4da7-b6c8-cf0267ffbfec","resolution":{"observed_at":"2026-07-08T00:54:21.140733Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:11.653633+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:11.653633+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-018-0020-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet, A.R","venue":"Computational Optimization and Applications","work_id":"8d7ff3aa-06ca-4aac-968a-af6f5eb7b61e","year":2018},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:1cb64a1dc92ab8c29b74e72ebab62a45467395e0025dd2ea16bf8f9478b1b36d","observation_id":"44dbbad1-8e11-4c2f-9cd9-1271121aaf76","resolution":{"observed_at":"2026-07-08T00:54:21.133841Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:11.961733+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:11.961733+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s1052623400378742","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet and J.E","venue":"SIAM Journal on Optimization","work_id":"fa1ec05d-6d70-4c1f-9f8b-6070f9c57711","year":2003},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:dbea9ce7e6a51c59e6818b9ecaa89c9eac12435b16a05d9254d1b83399e27f72","observation_id":"b6cf859c-4728-4744-8b5c-3fc9b8c38907","resolution":{"observed_at":"2026-07-08T00:54:21.114652Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:12.20344+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:12.20344+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/040603371","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet and J.E","venue":"SIAM Journal on Optimization","work_id":"8b48bd95-7369-4e7f-8ef6-cc79f39e2a85","year":2006},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:46df0752cd45088760ca1172f89669d3f4f78ed335fba0266f1eb959b70f69ba","observation_id":"f574da90-58a9-463c-8c2c-c9d09eb8d98b","resolution":{"observed_at":"2026-07-08T00:54:21.115997Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:12.454718+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:12.454718+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070692662","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet and J.E","venue":"SIAM Journal on Optimization","work_id":"5b5445a2-7270-49af-93ec-2c06e8255b4f","year":2009},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:66494a79877d90f45ed912680343284efc204adcd5d540fd45575ccb4252716c","observation_id":"4034e076-8bcb-4039-9f5c-ae886cc3d0b7","resolution":{"observed_at":"2026-07-08T00:54:21.129574Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:12.708019+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:12.708019+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23054","last_updated":"2025-07-30T19:29:51Z","snapshot_observed_at":"2026-08-07T00:00:31.195591Z","submitted_at":"2025-07-30T19:29:51Z","title":"Adaptive direct search algorithms for constrained optimization","version":1},"cited_work":{"arxiv_id":"2507.23054","doi":"10.48550/arxiv.2507.23054","metadata_source":"pith","pith_arxiv_id":"2507.23054","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Adaptive direct search algorithms for constrained optimization","venue":"math.OC","work_id":"47ce12f6-afd5-40bb-9ade-0c43678cf611","year":2025},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"cited_paper":"/paper/2507.23054","citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:edbf2abef9df517b264c057b469a6c20c574f0fb9e0bf5dbda95261e2d5c2325","observation_id":"454ff320-fe86-46c9-bd12-ec8d994899fb","resolution":{"observed_at":"2026-07-08T00:54:21.143757Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:12.933645+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:12.933645+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-032-00906-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet and W","venue":"Springer series in operations research/Springer series in operations research and financial engineering","work_id":"ba7e18c2-f7b1-4588-a1f8-25a5156d4a4a","year":2026},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:e691d79543295bff68dd35b42fa4ae823d288a125b350f8812fe1d89d4412a62","observation_id":"db229797-c851-4be7-a21f-cd9fd3450f42","resolution":{"observed_at":"2026-07-08T00:54:21.125100Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:13.16982+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:13.16982+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.407791Z","title":"Audet, W","venue":null,"work_id":"8dd59576-bbea-4ae6-a856-20dc4803e693","year":2026},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:5cd3e915fc6153774774d54607881df5c2fb822df1d5a0e4eb4ef9da3723ee84","observation_id":"81ca37f5-7f49-4b87-9246-7ddc2636e253","resolution":{"observed_at":"2026-07-08T00:54:21.408950Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/120895056","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet, A","venue":"SIAM Journal on Optimization","work_id":"bab10e78-4ded-4102-97e2-f66cf1864f8f","year":2014},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:4fc9b626a2fc1fc19b6a1d82c90696bba1f24fa9f1648a04843c3749c837f4d3","observation_id":"7d4e094b-4cdf-4721-b113-1153c2a3a8cf","resolution":{"observed_at":"2026-07-08T00:54:21.131987Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:53.674791+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:53.674791+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3544489","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Audet, S","venue":"ACM Transactions on Mathematical Software","work_id":"658491c3-88a5-4221-9853-0df096f71847","year":2022},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:7329974300a3f03ed52a44f04624c382650ecc287996099f07aba20439292802","observation_id":"d74d6650-c072-452f-bd8d-71e33fa9e0e2","resolution":{"observed_at":"2026-07-08T00:54:21.121821Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:13.708323+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:13.708323+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.404205Z","title":"Audet and C","venue":null,"work_id":"bf417b3b-4ec3-43af-8909-e00fb9e8aebb","year":2018},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:8d32f308b3f1e6c3aabad92af69b54e561c8d2c06849175923c7f5f1ca4aa199","observation_id":"492a25d8-4062-450e-8976-568013ad0e13","resolution":{"observed_at":"2026-07-08T00:54:21.405283Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/10556788","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T00:54:21.121657Z","title":"Yıldırım","venue":null,"work_id":"894820e6-2434-4b47-8f94-825b3952c7d2","year":2023},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:4bc36dca63ea544f7a429bbd54d824e7731d70c2cb8129e431ef5e3065c1bca6","observation_id":"e3eedd5b-730d-442d-82c4-e764e0426e10","resolution":{"observed_at":"2026-07-08T00:54:21.123022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:13.940364+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:13.940364+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.406020Z","title":"Brilli, A.L","venue":null,"work_id":"d106340e-1c62-4225-b0ec-2d15b1168ef9","year":2026},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:e2f42366055532649afe85ae07eafbb914d6d2551560ab2434d3c70bfaec6c79","observation_id":"147d9490-840d-4960-82fe-f07d22b4fa2e","resolution":{"observed_at":"2026-07-08T00:54:21.407210Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6788.2025","doi":"10.1080/10556788.2025.2517174","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pischke , On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces, Optim","venue":"Optimization methods & software","work_id":"b4a7611e-ae61-46f2-996e-239a65a6d499","year":2026},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:15440258b2da5e1883657eb6304c6d24d241daf79f8a9a05223f8d2430da4531","observation_id":"8f2fa85e-b971-475d-a06b-8b75f17ad69d","resolution":{"observed_at":"2026-07-08T00:54:21.181292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.390862Z","title":"Clarke.Optimization and Nonsmooth Analysis","venue":null,"work_id":"c5dc9b26-da18-4084-b824-8a336affd5e1","year":1983},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:d36fa726a99cb935ab95b1a3b5d063e3735e65597eaf1830b1da2e1a89cff973","observation_id":"036a7920-9002-473b-9c2f-816d7a9f758a","resolution":{"observed_at":"2026-07-08T00:54:21.392353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6788.2011","doi":"10.1080/10556788.2011.610458","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conn and S","venue":"Optimization methods & software","work_id":"713fa6c3-c8d0-45be-8174-f52afe816595","year":2013},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:1a861759153f638fa2bb950dee1f79559fcd51f7cbfd22aeaa3b44c3c1a5ceb1","observation_id":"390182b7-db06-4e6f-b902-2fef4d1512e2","resolution":{"observed_at":"2026-07-08T00:54:21.154024Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9780898718768","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Scheinberg, Katya and Vicente, Luis N","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"3b78fcaa-7e67-4380-8339-1c449a49c4a7","year":2009},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:a7698508e1d83724e975905389c0b94cf0f578900bfe166e03926cd07dca86cb","observation_id":"ce30e227-381c-4ae3-a683-9096d39e217f","resolution":{"observed_at":"2026-07-08T00:54:21.157503Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:14.421241+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:14.421241+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.397412Z","title":"Cust ´odio, K","venue":null,"work_id":"30051556-965d-46f5-bc5e-d2d122731554","year":null},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:8b007f82061389e75bab1e1ef6978453f6e1f0dc55e762a6d2590357aa88384c","observation_id":"7c7d0428-a7a7-44ef-9879-cb8cf27cc86b","resolution":{"observed_at":"2026-07-08T00:54:21.398610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.401319Z","title":null,"venue":null,"work_id":"bf674bc4-d02c-4fd1-b723-cc9ff9032bd3","year":null},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:48a9072f695701f13ea33f3a3c9047ff4f990f055b7e3842ebf4b035031031cf","observation_id":"f5c795aa-ca31-4d6f-a8e3-400afd4a322b","resolution":{"observed_at":"2026-07-08T00:54:21.403553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.389062Z","title":null,"venue":null,"work_id":"467085b4-58fa-4ec5-86be-fe014fc11cb4","year":1954},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:d52dfbebe89c3a66b1c1993a152c55fcd446e2581bc4ca245bc0c48e582ab727","observation_id":"103ddc5a-e802-475c-938f-46fc50c9f282","resolution":{"observed_at":"2026-07-08T00:54:21.390232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45356-3_","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T00:54:21.147429Z","title":null,"venue":null,"work_id":"1396a75b-c3d1-4b23-b302-eba9295fa223","year":2000},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:410785ca564ce4e52ca181d7d4b24d94ebb60de7220d3de1063191268c1a4daf","observation_id":"f1fff7c6-e63c-4ff7-9bbe-472c6526a60b","resolution":{"observed_at":"2026-07-08T00:54:21.148608Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:14.66804+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:14.66804+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.100001","doi":"10.1016/j.adapen.2020.100001","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Assessment of the regionalised demand response potential in Germany using an open source tool and dataset","venue":"Advances in Applied Energy","work_id":"11bb0142-3ca0-4682-b141-90ef16f66ab5","year":2021},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:097461ef5ed6d77397ea6acc495c7f31884506f53ffc28937bfcb36a3735af10","observation_id":"7ff2c696-5b57-4c0a-a245-b7d689639eca","resolution":{"observed_at":"2026-07-08T00:54:21.146921Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.386754Z","title":"Diouane, V","venue":null,"work_id":"afff015c-b63a-46eb-a2a4-84f4e7510f14","year":2022},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:56bc831a18dfca3359bf7f2b4cafa2ddb9e1f0748e3aa730424c6d38deee3b79","observation_id":"85980bc5-4b46-4964-b58d-cec7f98cb088","resolution":{"observed_at":"2026-07-08T00:54:21.388181Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.100110","doi":"10.1016/j.ejco.2025.100110","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dzahini, F","venue":"EURO Journal on Computational Optimization","work_id":"b6d778c0-46e8-4ecc-ba43-7400de9246ff","year":2025},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:ae290c40db785a53302923a525c2df13ae8c317c4821f927ea17654c88ecaf95","observation_id":"2068ade7-105d-4f1a-bdc9-aef364705e6a","resolution":{"observed_at":"2026-07-08T00:54:21.151390Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:15.222426+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:15.222426+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130917661","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gratton and L.N","venue":"SIAM Journal on Optimization","work_id":"934bb74d-2aa7-4ea3-9d8b-d65d85dd7179","year":1980},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:2ad61bcdc190dc014dbf3dbf75cf67a68a5a4d4f5d253ae00521790aec785547","observation_id":"4fe30562-dc75-455c-ad58-de838871238a","resolution":{"observed_at":"2026-07-08T00:54:21.170002Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:15.453853+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:15.453853+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/aic.18338","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta and Q","venue":"AIChE Journal","work_id":"a5612f30-9664-4563-a025-8b1f43e39f7d","year":2024},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:d325f3e423b9ff048027e252447756f6dc205e2797a11df260a12621231fbd3d","observation_id":"6b1d1d15-11c1-4352-b758-54ed5619372b","resolution":{"observed_at":"2026-07-08T00:54:21.168482Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:15.683437+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:15.683437+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1162/106365601750190398","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"u ger, Robert and Hellstr \\","venue":"Evolutionary Computation","work_id":"b769bb56-e982-4c14-bb7a-8cd0f81fb599","year":2001},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:4ec28bf9cd1abcd7604b33732376ace4a827e8068fb5c549f3139f1c9eab25fe","observation_id":"98b5b1ce-6ba8-455f-9bc3-33f2c95f9396","resolution":{"observed_at":"2026-07-08T00:54:21.155759Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:15.908948+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:15.908948+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-42760-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jahn.Introduction to the Theory of Nonlinear Optimization","venue":null,"work_id":"233ea069-dd7e-4303-ac59-81c164a81ad5","year":2020},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:e8108bf67eb8e91e96f8a053b49665f872bce6623cdb3a1cfb0eb68c1b7292de","observation_id":"f8d29a5a-2597-4566-9d2f-924c4d87db45","resolution":{"observed_at":"2026-07-08T00:54:21.161212Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:16.163685+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:16.163685+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T01:07:42.960769Z","title":"Masset, R","venue":null,"work_id":"238df2e4-a3e5-46f3-860e-3ae2b0094b97","year":2019},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:8f991eb1742187c44f2d2a56b97b92a4169a452d6bd832764c0bf4cb810bd3aa","observation_id":"cbff2446-9d37-4d9f-8a41-f50b1a60aaec","resolution":{"observed_at":"2026-07-08T00:54:21.166726Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.399227Z","title":"Kolda, R.M","venue":null,"work_id":"3b30c7a8-2802-492b-8f78-50367c8caf77","year":2003},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:11eb40337ad4ff7a17957568afcde4cbb4bf4c606529d5151236fac3e765189e","observation_id":"c2cb4748-55d8-4bd6-ad45-80656332b3d5","resolution":{"observed_at":"2026-07-08T00:54:21.400665Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0962492919000060","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Derivative -free optimization methods","venue":"Acta Numerica","work_id":"cc227ea8-10cc-48ba-b302-a2631fe94335","year":2019},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:6d95c811b9b3ca38b710482fe08c1ad2c908d0f1470b8ea4b56069e92f415fc9","observation_id":"ed56b677-f180-4f9a-81af-3d99fcad5bc2","resolution":{"observed_at":"2026-07-08T00:54:21.163234Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:16.54343+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:16.54343+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.395288Z","title":"Le Digabel and S.M","venue":null,"work_id":"594a559f-f723-4285-9e9f-21ce022645ef","year":2024},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:5e74549d4d6e89553c3d0960ae585fc8944646bf72fe05b231fa06f5b8932a48","observation_id":"e0121486-a5c6-43ed-98ca-2ddab2ed58fd","resolution":{"observed_at":"2026-07-08T00:54:21.396812Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21948","last_updated":"2025-08-13T02:39:47Z","snapshot_observed_at":"2026-08-08T10:40:27.689894Z","submitted_at":"2025-06-27T06:42:37Z","title":"A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems","version":2},"cited_work":{"arxiv_id":"2506.21948","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.21948","snapshot_observed_at":"2026-07-08T00:54:21.176816Z","title":"A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems","venue":"math.OC","work_id":"d976f9b1-285d-4618-b2b2-4dd126c308b7","year":2025},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"cited_paper":"/paper/2506.21948","citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:b1bf54a46e1623c3c6358cb416484e628fed5aef4d6697d52f098d0c832d2693","observation_id":"88f8df7f-c9c8-42b3-a75a-99fd0b3a5585","resolution":{"observed_at":"2026-07-08T00:54:21.178365Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-025-00686-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Optimization and Applications","work_id":"f0d66ccc-116c-4da2-9ccf-d855d72db1a7","year":2025},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:4543092ba890e2d0ebb8314c9c978b0d750a0a159e08c8c1acefcd803d3466e1","observation_id":"5865a484-fff7-4be8-a39f-2fec75f5cbbd","resolution":{"observed_at":"2026-07-08T00:54:21.159304Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:16.829994+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:16.829994+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/080724083","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mor ´e and S.M","venue":"SIAM Journal on Optimization","work_id":"f2a5b391-c261-44f7-be51-a504ba01c352","year":2009},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:51b466871db76260f9c9147560f56afd488b4b52dc64b6571005e0e5b6294620","observation_id":"2827fed5-c4ac-4d4b-ae23-3891a17d496b","resolution":{"observed_at":"2026-07-08T00:54:21.164969Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:20:17.065094+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:20:17.065094+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-08T00:54:21.392982Z","title":"Rockafellar","venue":null,"work_id":"f93c2db0-9278-4c3d-a763-28eebf47ee7b","year":1980},"citing_paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-08T00:44:59.235803Z"},"links":{"citing_paper":"/paper/2607.05183"},"observation_digest":"sha256:26eaff424b52cce9c8281fa6d5e48a04f43b4e21c50d73b7eb5f23bf5be3ed9e","observation_id":"1817fcab-2caa-47ae-b095-30337e721167","resolution":{"observed_at":"2026-07-08T00:54:21.394428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05183","last_updated":"2026-07-06T15:00:40Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T18:37:24.649444Z","submitted_at":"2026-07-06T15:00:40Z","title":"Adaptive direct search algorithms with relaxable and quantifiable constraints"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":8,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":25,"verified_fuzzy":3},"total_outbound_references":40},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.05183."}