{"as_of":"2026-08-08T09:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1f9a9f58fc20c11d8ba0e38c815a16281f9a531f5efbc8b3fb41ea940c80f90","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:05:49.728294Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2508.06002/citation-record","integrity":"/paper/2508.06002/integrity","json":"/paper/2508.06002/citation-record.json","paper":"/paper/2508.06002"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:05:49.634616Z","title":"Barzilai and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.634616Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:efcb2490f27e478aa9821f8e1ea519f33bfd2343fff65f523a88ba41e3a1a2d3","observation_id":"8caaf3d1-6257-4a38-b50c-a1fee22f14b1","resolution":{"observed_at":"2026-08-05T23:05:49.634616Z","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-05T23:05:50.063613Z","title":"Burdakov, Y","venue":null,"work_id":"bc3d3af8-dbfc-4cc7-a075-31d0eb829484","year":2019},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.641138Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:576a55f80a8c9d65cd67c52a995818339246976dee5cbe886093315489f18eb5","observation_id":"e7fb0169-56cb-49d5-b57e-e152ea79b96c","resolution":{"observed_at":"2026-08-05T23:05:50.068294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:50.046005Z","title":null,"venue":null,"work_id":"eeed42e8-8fbb-422e-a458-f7d6941e943b","year":2005},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.646434Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:1e8d2fc09c4d4d53ec834cc85cfbdcff6388d680ded5f7e5720805164a8eeb2b","observation_id":"eb733bcd-76f0-44f8-8c8d-7b9e17eed02e","resolution":{"observed_at":"2026-08-05T23:05:50.050921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:50.025216Z","title":null,"venue":null,"work_id":"d00868cc-8686-4eb2-bb43-1c77a810c171","year":2006},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.651292Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:755bac703c91c9fd8d359558130caafbec94c789164ac68fc50c678462c5914b","observation_id":"80ab5279-8480-4ea5-8720-3333183fbb9a","resolution":{"observed_at":"2026-08-05T23:05:50.032725Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:50.009336Z","title":null,"venue":null,"work_id":"99651f7a-148f-46c3-a103-778eeec358a7","year":2002},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.656470Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:f5abe73e6c39848d88ef59878072e4e54b3b89a9c0fb4645e12ad6e5ba927039","observation_id":"62dbee64-0701-4f8c-8c5c-dd19b789c21c","resolution":{"observed_at":"2026-08-05T23:05:50.014232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.993199Z","title":null,"venue":null,"work_id":"72b066de-d2a6-43cf-9800-cb3e8a0f3249","year":2002},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.664700Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:980698a6332072d8c208247d72fce0a268dd142df4742cb7e3a56f815516f344","observation_id":"19206c4c-bc89-4950-863d-04a2e0ab3eeb","resolution":{"observed_at":"2026-08-05T23:05:49.998216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.975305Z","title":"Fletcher, Optimization and control with applications, Springer, Boston, MA, 2005, chapter On the Barzilai-Borwein method, 235--256","venue":null,"work_id":"4f88e843-b6ae-4547-a7d8-8aa61bf2dc3a","year":2005},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.670612Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:47e6f67be12643fa12930917b60e111b48ac09470c758fdbf3f098f58cc6ab9b","observation_id":"13efbb7b-341c-44dd-979d-67362adbd3d4","resolution":{"observed_at":"2026-08-05T23:05:49.979923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.957618Z","title":null,"venue":null,"work_id":"34db47e0-6b3e-41e6-919a-ce575251478d","year":2015},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.675655Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:467bfd6fae29c8a0994f2ee51bcb72cea31c2e54ae1eeef5244e9f40dfe8681b","observation_id":"691df568-e7fb-4de5-b417-b0ee92abe871","resolution":{"observed_at":"2026-08-05T23:05:49.962738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.943119Z","title":"Grippo, F","venue":null,"work_id":"ab372532-2a0b-4a3b-8819-e6fc78f6b194","year":1986},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.681527Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:b31f811896d8386cc7ae84183595319e3733783bb7654e32b23e6a7353e14841","observation_id":"36ca0439-b19c-4d54-815e-0e1ce83fee2e","resolution":{"observed_at":"2026-08-05T23:05:49.947170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.927129Z","title":null,"venue":null,"work_id":"18317387-41c9-4374-8762-3f80d94a86b5","year":2025},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.687105Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:631b71a255b019a59f5e5558c53903bda9617db38a4b8a4b489906f355c5e949","observation_id":"a7d402ca-f80e-4d9f-a8a8-1b776b6422b9","resolution":{"observed_at":"2026-08-05T23:05:49.931714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.907506Z","title":"Kahan, Automatic Step-Size Control for Minimization Iterations, Technical report, University of California, Berkeley CA, USA, 2019, ://people.eecs.berkeley.edu/ wkahan/26Sept19.pdf","venue":null,"work_id":"d7c32785-d09f-4905-a38f-9669175cf860","year":2019},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.693036Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:e20ada353ebd72a562c335eea1a8ce38d1cb14630e6ff6a64372020604608b1a","observation_id":"8fae27d4-988c-4c7f-8e18-aab678097eca","resolution":{"observed_at":"2026-08-05T23:05:49.914143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.885748Z","title":null,"venue":null,"work_id":"3ef32e44-4fe3-49da-a7bd-6a54c55c06a9","year":2019},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.698162Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:a8752257745b3920f2db7975c43de7346e4dbe9ffa47ffcb2f2d525ef7fd17d2","observation_id":"bd54e337-9a8c-46b7-bac6-9f2e28494e23","resolution":{"observed_at":"2026-08-05T23:05:49.892657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-08T07:54:01.712529Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-08-05T23:05:49.702787Z","title":"Latafat, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.702787Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:b5d6c20b63693f309a99a59830342d420604a65c740b78fc41ddb45dd89d0964","observation_id":"c176c4d3-9315-4cbc-989e-0e2ed18df4b5","resolution":{"observed_at":"2026-08-05T23:05:49.702787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00205","last_updated":"2021-01-22T09:31:58Z","snapshot_observed_at":"2026-07-06T10:29:18.734092Z","submitted_at":"2021-01-01T09:49:47Z","title":"On a Faster $R$-Linear Convergence Rate of the Barzilai-Borwein Method","version":2},"cited_work":{"arxiv_id":"2101.00205","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.00205","snapshot_observed_at":"2026-08-05T23:05:49.782693Z","title":"On a Faster $R$-Linear Convergence Rate of the Barzilai-Borwein Method","venue":"math.OC","work_id":"7649fa4d-f76a-48e4-9588-10e3a6e59e6b","year":2021},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.707791Z"},"links":{"cited_paper":"/paper/2101.00205","citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:b977323fb96e02a0f2c79380ebffd5b8c1c1b645baf30bb91f27d2ff47266902","observation_id":"d95ee07a-8597-4938-8fa8-b231a0388f72","resolution":{"observed_at":"2026-08-05T23:05:49.790359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.869432Z","title":"Malitsky and K","venue":null,"work_id":"3894cc0f-9919-45e9-82b8-1ddd4e1fcc3b","year":2020},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.712502Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:f8dca7c150acd38a89a7725ee7af96a4ee48d21b7cde56513240e568ad90136d","observation_id":"60e7a1f0-2f9a-486c-8004-f87f5c685439","resolution":{"observed_at":"2026-08-05T23:05:49.873898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.854090Z","title":"Nocedal and S","venue":null,"work_id":"cd6a279c-6c14-455f-bc16-0d49d383b7f4","year":2006},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.717859Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:1db4e9e2c09f1e11b12ba31308aa607aac8d1621eef92a4792c122760f9cea4e","observation_id":"0586b53d-f864-4171-be07-688d1b84e47d","resolution":{"observed_at":"2026-08-05T23:05:49.858502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.838626Z","title":"Raydan, On the Barzilai and Borwein choice of steplength for the gradient method, IMA J","venue":null,"work_id":"f85be195-b521-4bd4-a59a-c6a35dba0385","year":1993},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.722684Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:865824629cc77fb62be5c757c6107e63846b28aabc759e5439ffa71af74e7448","observation_id":"b8edd7eb-8eb2-4079-9721-7226adaa8154","resolution":{"observed_at":"2026-08-05T23:05:49.843167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:49.822953Z","title":"Raydan, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM J","venue":null,"work_id":"14b3f53c-57d5-430a-8e40-ce9fdceabf9e","year":1997},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.728294Z"},"links":{"citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:92b14afadc0225fa53e60539323a387142f93d7e1af632aae645a71bf2eba899","observation_id":"3a0ac622-7352-4f0a-94db-be6b8231e02d","resolution":{"observed_at":"2026-08-05T23:05:49.828363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":18},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2508.06002."}