{"as_of":"2026-08-19T05:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6c224a9922c43a279638746cd8e58ecc344a0c77a3d616a876effc64e13a279","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:36:21.879216Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.01092/citation-record","integrity":"/paper/2505.01092/integrity","json":"/paper/2505.01092/citation-record.json","paper":"/paper/2505.01092"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:21.735663Z","title":"First-order methods in optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.735663Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:25fb1166680c2a5463f5bbdf380563a3ca98c677a72658a155fa507a4549515d","observation_id":"d7112bd6-49fe-44cc-8d2d-bb1e81d64cb2","resolution":{"observed_at":"2026-08-16T04:36:21.735663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.431092Z","title":"Nonlinear Programming","venue":null,"work_id":"90420ecf-5e58-4e7d-918f-f0b1a59bae6b","year":1999},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.741124Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:a9a0d8893fec7f795d56ef0ed604bf3dbc9ba7a2e7705d7f949a9d0fb49e4c1d","observation_id":"cd8ae986-d6c2-45c4-a21f-8d49f2507b87","resolution":{"observed_at":"2026-08-16T04:36:22.435395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08810","last_updated":"2020-07-17T08:12:31Z","snapshot_observed_at":"2026-08-18T21:52:06.478773Z","submitted_at":"2020-07-17T08:12:31Z","title":"A H\\\"olderian backtracking method for min-max and min-min problems","version":1},"cited_work":{"arxiv_id":"2007.08810","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.08810","snapshot_observed_at":"2026-08-16T04:36:22.009528Z","title":"A H\\\"olderian backtracking method for min-max and min-min problems","venue":"cs.LG","work_id":"1acc72e5-1ca6-433a-88bf-9a1654bdf8ef","year":2020},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.746227Z"},"links":{"cited_paper":"/paper/2007.08810","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:eda9fdbfa219625b3de23f1c0bf00b1d09fd6a479a8e72c58d2055476a3423ba","observation_id":"bd2d22fb-e5f6-4441-8a0d-0c0d326336b5","resolution":{"observed_at":"2026-08-16T04:36:22.015986Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.416970Z","title":"The iterates of the frank–wolfe algorithm may not converge","venue":null,"work_id":"12804f34-22d3-4547-886f-7b505935a668","year":2024},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.752479Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:d57f52bad4d4802904c2d61de44f581d20eb8b150babe119a624af7ad7a18d6e","observation_id":"70f6b5ce-306a-4fc3-98f4-2a04e1817860","resolution":{"observed_at":"2026-08-16T04:36:22.421729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14103","last_updated":"2025-08-01T13:28:50Z","snapshot_observed_at":"2026-08-16T16:13:21.170715Z","submitted_at":"2022-11-25T13:36:11Z","title":"Conditional Gradient Methods","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14103","snapshot_observed_at":"2026-08-16T04:36:21.757917Z","title":"Conditional gradient methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.757917Z"},"links":{"cited_paper":"/paper/2211.14103","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:7eb222474cc8220c2fe9638896f4b6cb0e2c714e064f675c584e210e5c9c9df0","observation_id":"b250fbcd-ab53-4bb4-af24-32a0e42bf4c3","resolution":{"observed_at":"2026-08-16T04:36:21.757917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.398293Z","title":"A generalized c onditional gradient method and its connection to an iterative shrinkage method","venue":null,"work_id":"f2aad133-a702-42e0-b733-0156fe1bcffd","year":2009},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.762783Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:d34ade7a6b7c76499b25970346c0e560fec8c335368203d0c8b882737a5887a8","observation_id":"f29ab3a0-99db-4898-b3b5-0a2b2c89db64","resolution":{"observed_at":"2026-08-16T04:36:22.403964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.381604Z","title":"Coresets, sparse greedy approximation, and the frank-wolfe algorithm","venue":null,"work_id":"6ac51580-a838-4d3c-95f3-85938151731f","year":2010},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.767444Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:bf2e00609ac73a09f2e3ce0adc65deb396f424ef10bccbe92239604dcfc8492c","observation_id":"48b0591f-6b56-434d-a14d-ae8072cd1543","resolution":{"observed_at":"2026-08-16T04:36:22.386909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.363973Z","title":"Complexity of linear min imization and projection on some sets","venue":null,"work_id":"bf2d8a24-82f3-4d75-8d77-f4c33d6c9ca8","year":2021},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.771688Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:f371cf2bf59e598e791713e86a2dd2961df7b04e8f995274f7428aea3c1bfd06","observation_id":"1a587b11-4a5a-4384-af97-ef8cee600378","resolution":{"observed_at":"2026-08-16T04:36:22.370107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.337002Z","title":"Proximal gradient methods beyond monotony","venue":null,"work_id":"6691b341-bf9e-4b45-942a-54ca5a6f4c70","year":2023},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.775976Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:58d5acf14699ffccae9ae7d3adc2d669edb334187f79e3801f23325cd5a1db3a","observation_id":"fc4b24b9-b660-45ad-a5e8-689ca985e53a","resolution":{"observed_at":"2026-08-16T04:36:22.343180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.315517Z","title":"Proximal gradient algo rithms under local lipschitz gradi- ent continuity: A convergence and robustness analysis of panoc","venue":null,"work_id":"65242775-7e7a-43de-8ac5-5b684f4c1ec0","year":2022},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.780638Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:d5dd6107c610a4eacdc68b7442e85a430c6e7be6c15916a7f46be189b7618b01","observation_id":"639828c6-0bc4-402f-8aa8-8608df836a1a","resolution":{"observed_at":"2026-08-16T04:36:22.322026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.295916Z","title":"Rates of convergence for conditional gradien t algorithms near singular and nonsingular extremals","venue":null,"work_id":"bea4567f-e533-4e78-ac31-0c4f6f3b0012","year":1979},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.784643Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:182edf7cf77867d450df73fc7a0f20ddae5039d0dd4d4693c925f3c43937a4c9","observation_id":"a0c3eff7-252a-4054-a604-9cdffa3ec345","resolution":{"observed_at":"2026-08-16T04:36:22.302086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.274115Z","title":"Conditional gradient algorit hms with open loop step size rules","venue":null,"work_id":"43c7c1a4-7f42-4dda-b0aa-3ea3715213fc","year":1978},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.789041Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:3af6eaf590a82df70ccd0524b841c75b89fa24fabba6c6890690a796b49be043","observation_id":"251bc72c-c608-4e1e-9fee-405537b17728","resolution":{"observed_at":"2026-08-16T04:36:22.282437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.257143Z","title":"An algorithm for quadratic pro gramming","venue":null,"work_id":"ed689e1e-8fa2-47a6-a39c-40ee7d4b6c35","year":1956},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.792958Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:61d2f22d4ac4cf7fb2b85918d33109a8f942591e4fa575db28afb13a750e3250","observation_id":"5111a5b9-1397-4ba4-b5d4-5a979055e72f","resolution":{"observed_at":"2026-08-16T04:36:22.261733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.242293Z","title":"A generalized proximal point a lgorithm for certain non-convex minimization problems","venue":null,"work_id":"57a38ef2-5556-4443-bd5e-5c700c32c161","year":1981},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.796913Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:0d7757cc985cef48ac9142458f8e96f7fc4b4911e89d1baa02ac6b0519ab2d9a","observation_id":"09626068-0010-46ef-ac6c-a4b28ad98135","resolution":{"observed_at":"2026-08-16T04:36:22.247357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.225956Z","title":"Conditional gradient type methods for composit e nonlinear and stochastic optimization","venue":null,"work_id":"0332cf4e-7afe-4b81-b7d0-d7d641efdff1","year":2019},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.801038Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:2be0e94cb49434f9f6d0bc722233eb07ceecfab37e2aaf1b55771822afac2024","observation_id":"839a3cdf-a230-4bc0-8aff-ef0bdc85cfb5","resolution":{"observed_at":"2026-08-16T04:36:22.231128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.207027Z","title":"A parameter-free c onditional gradient method for composite minimization under h¨ older condition.Journal of Machine Learning Research , 24(166):1–34, 2023","venue":null,"work_id":"670320fb-3b4d-42a8-a14a-0adb901be4b9","year":2023},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.805275Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:8dd260a8be6533ec03fc0dff819e5323552e9e2cb6701688e0f0b39516f78031","observation_id":"b523dcda-016e-4344-b0a7-dfd80d116c69","resolution":{"observed_at":"2026-08-16T04:36:22.213534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:36:21.809326Z","title":"Revisiting frank-wolfe: Projection-free sparse convex optimization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.809326Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:f4e15b81ec22d0732c6b53fc8953a8d7d25c692d79bfd684e24e179e27e961cb","observation_id":"256d65a3-523a-404f-9291-bf8302bd4ffe","resolution":{"observed_at":"2026-08-16T04:36:21.809326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.161892Z","title":"Convergence analysis of the proximal gradient method in the presence of the kurdyka–/suppress lojasiewicz property without global lipschitz assumptions","venue":null,"work_id":"2dcd8a91-f813-4624-9e1b-e948e6bc62fd","year":2023},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.813419Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:e5d6bb951a16fbe1bac95d649aa949b20b7747f97025146b4e3df028dde4802a","observation_id":"31a3243f-9524-4f30-a9de-c58789b6aade","resolution":{"observed_at":"2026-08-16T04:36:22.169092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.145548Z","title":"Structur ed nonconvex and nonsmooth opti- mization: algorithms and iteration complexity analysis","venue":null,"work_id":"757d2742-a4c5-41a8-8323-a8752ef489ab","year":2019},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.817667Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:9b664aeda0faa8723e3f97947e8873733c206772f0edd0f9e2bb1e76fd2b862a","observation_id":"194d4dc9-cfc2-4cdb-ad04-1f42c14d9052","resolution":{"observed_at":"2026-08-16T04:36:22.150168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12376","last_updated":"2024-11-19T09:52:17Z","snapshot_observed_at":"2026-08-12T17:33:51.747054Z","submitted_at":"2024-11-19T09:52:17Z","title":"Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12376","snapshot_observed_at":"2026-08-16T04:36:21.822079Z","title":"Convergence of nonmonotone proximal gradient methods under the kurdyka-lojasiewicz property without a global lipschitz assumption","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.822079Z"},"links":{"cited_paper":"/paper/2411.12376","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:22c4c39e144d299e7e08600803c7793fad36b6db8fa19a2778c62147b67131c3","observation_id":"1ba310c9-0b81-4558-8938-d89b2f177e36","resolution":{"observed_at":"2026-08-16T04:36:21.822079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.128627Z","title":"Convergence properties of monotone and nonmonotone proximal gradient methods revisited","venue":null,"work_id":"66d2faba-4323-4572-88ac-766e96a672be","year":2022},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.826847Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:d51272dec45be41ce0cb0e54bf7dfa7d585da2fd0e7a39f6317164174172b90c","observation_id":"fa8a98b7-d3be-443c-ba6f-46881ab8953e","resolution":{"observed_at":"2026-08-16T04:36:22.133868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.112514Z","title":"On fast convergence rates for generalized conditional gradient methods with backtracking stepsize","venue":null,"work_id":"7bc04d65-52d4-4f4b-95e5-b0ebc3a79a3b","year":2024},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.831451Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:e8db433df758f65b1b90bb9aabe86158a6759e52525d883182f9a6ccc54654de","observation_id":"d12f4588-936b-47e7-a1fd-0f534cd4f493","resolution":{"observed_at":"2026-08-16T04:36:22.118227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.00345","last_updated":"2016-07-01T18:37:33Z","snapshot_observed_at":"2026-08-14T21:50:11.201365Z","submitted_at":"2016-07-01T18:37:33Z","title":"Convergence Rate of Frank-Wolfe for Non-Convex Objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.00345","snapshot_observed_at":"2026-08-16T04:36:21.838730Z","title":"Convergence rate of frank-wolfe for n on-convex objectives","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.838730Z"},"links":{"cited_paper":"/paper/1607.00345","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:a4a56c3d28c24922e9f8340aa65747611e519c86714a6ec286b0c197626923eb","observation_id":"bade5d21-c52b-4273-9383-763f7ab44239","resolution":{"observed_at":"2026-08-16T04:36:21.838730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.093259Z","title":"Constrained minimization meth ods","venue":null,"work_id":"4c7201f5-3880-4448-87bb-4166eefebedc","year":1966},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.844065Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:337d3fe4aa6ae137c9cc6a75552cca1f58075c011504c4d73a1dca19b5cc3561","observation_id":"f16333d3-2a24-4ef6-9701-c9984e886463","resolution":{"observed_at":"2026-08-16T04:36:22.099851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.070135Z","title":"A minimization method for the s um of a convex function and a continuously differentiable function","venue":null,"work_id":"b97b2124-01b4-4020-90aa-3a46687c0c0a","year":1981},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.849365Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:af8e060170690818e948fbd62b175c908c9189a0845005d075f8edd7d985273c","observation_id":"fa7c1731-0787-4f46-9a2a-7646a44b79cf","resolution":{"observed_at":"2026-08-16T04:36:22.076147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:36:21.855393Z","title":"Complexity bounds for primal-dual methods minimiz ing the model of objective function","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.855393Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:e1ced2b808c219ba41e54e58bdfa3d81d2d4b1d2f2f063d42fd89aa61277bebc","observation_id":"9c0ba493-aa93-4002-b694-668dce21e184","resolution":{"observed_at":"2026-08-16T04:36:21.855393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04330","last_updated":"2026-02-18T09:31:17Z","snapshot_observed_at":"2026-08-18T06:55:27.036707Z","submitted_at":"2025-04-06T02:54:05Z","title":"Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04330","snapshot_observed_at":"2026-08-16T04:36:21.860248Z","title":"Acce lerated convergence of frank–wolfe algo- rithms with adaptive bregman step-size strategy","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.860248Z"},"links":{"cited_paper":"/paper/2504.04330","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:ad026162b8e1e8b1cd8fd58793dcc5d709604325178e876c388ba11dd9a31b99","observation_id":"042e6104-1cb9-400d-be90-662e561bb9bc","resolution":{"observed_at":"2026-08-16T04:36:21.860248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.042187Z","title":"A nonmonotone con- ditional gradient method for multiobjective optimization problems","venue":null,"work_id":"b6626443-be02-4274-bddd-eaa52505b4bc","year":2024},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.866122Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:9a647acc1df61a2548c51c8d583dc8d0f7db85fe4ae9a89d224fd3ba87f6117c","observation_id":"967815da-d7f0-4e67-9ef1-9dbbcdab248f","resolution":{"observed_at":"2026-08-16T04:36:22.048389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00381","last_updated":"2026-04-08T07:35:50Z","snapshot_observed_at":"2026-08-15T16:09:16.294197Z","submitted_at":"2025-05-01T08:15:51Z","title":"Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.00381","snapshot_observed_at":"2026-08-16T04:36:21.870692Z","title":"Proximal gradient-type me thod with generalized distance and con- vergence analysis without global descent lemma","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.870692Z"},"links":{"cited_paper":"/paper/2505.00381","citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:3844bbe01a5dc5de49b7a4da4f66e968eb9cba5f9a41654b5fb1f553c846abd9","observation_id":"b943bb35-c171-48cb-838f-e84e9668a9bc","resolution":{"observed_at":"2026-08-16T04:36:21.870692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:36:22.026781Z","title":"A nonmonotone line search te chnique and its application to unconstrained optimization","venue":null,"work_id":"7b051f72-8973-4fb7-ac74-ab4e4f0127be","year":2004},"citing_paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T04:36:21.879216Z"},"links":{"citing_paper":"/paper/2505.01092"},"observation_digest":"sha256:f0eb77cc59968e43c2cfd6d48c7732096efe15cb3642a1f05dc7e485539a9a9a","observation_id":"fc20468a-26ec-40b6-a2c1-1c9b6de3555e","resolution":{"observed_at":"2026-08-16T04:36:22.031362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.01092","last_updated":"2025-05-02T08:07:35Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T17:41:56.033087Z","submitted_at":"2025-05-02T08:07:35Z","title":"Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2505.01092."}