{"as_of":"2026-08-11T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18d3663975cf34586b491313b4f1e0e61731335605091a055c1a29b78a8fc50b","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T04:44:25.874613Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"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.22467/citation-record","integrity":"/paper/2607.22467/integrity","json":"/paper/2607.22467/citation-record.json","paper":"/paper/2607.22467"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.841638Z","title":"Foun- dations and Trends in Machine Learning16(4), 494–591 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.841638Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:274698a576bd575c669a5c765141501d3eda60d64298dcb03f209724c06aecd8","observation_id":"7ec3c776-9ce9-4874-9a4e-6b0f76568d58","resolution":{"observed_at":"2026-08-01T04:44:25.841638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20023","last_updated":"2024-12-28T04:57:12Z","snapshot_observed_at":"2026-08-11T05:41:54.761022Z","submitted_at":"2024-12-28T04:57:12Z","title":"Global Search of Optimal Spacecraft Trajectories using Amortization and Deep Generative Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20023","snapshot_observed_at":"2026-08-01T04:44:25.845165Z","title":"arXiv preprint arXiv:2412.20023 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.845165Z"},"links":{"cited_paper":"/paper/2412.20023","citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:b5fd8b91056e76f038dc574f86209590b1e66d2f1ddfc331a64b3468e5094f0d","observation_id":"7404a5a1-b165-43a1-8b74-b1d5f1d0bbce","resolution":{"observed_at":"2026-08-01T04:44:25.845165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.848510Z","title":"The Journal of the Astronautical Sciences72(6), 62 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.848510Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:1cb709a9ea8abf9660ad6d46b2fc0e3b0d38bc8b4bed246b09306b5b3f8eb847","observation_id":"c6eb707d-8f41-41a1-bfca-09d91de6d160","resolution":{"observed_at":"2026-08-01T04:44:25.848510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.09125","last_updated":"2026-05-09T19:15:54Z","snapshot_observed_at":"2026-08-02T07:13:54.804082Z","submitted_at":"2026-05-09T19:15:54Z","title":"Transfer Learning of Multiobjective Indirect Low-Thrust Trajectories Using Diffusion Models and Markov Chain Monte Carlo","version":1},"cited_work":{"arxiv_id":"2605.09125","doi":"10.48550/arxiv.2605.09125","metadata_source":"pith","pith_arxiv_id":"2605.09125","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Transfer Learning of Multiobjective Indirect Low-Thrust Trajectories Using Diffusion Models and Markov Chain Monte Carlo","venue":"eess.SY","work_id":"297d8cf9-e8e8-433f-9bbc-c241a55b73f4","year":2026},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.851264Z"},"links":{"cited_paper":"/paper/2605.09125","citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:57901ff292842bf00013b8fde8f5c82305546194d2aa2e00322b3797b12364f9","observation_id":"c8463fcc-c748-47b6-806a-7246ac4affb0","resolution":{"observed_at":"2026-08-01T04:49:39.623851Z","resolver_source":"local_arxiv","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-03T18:38:28.137684+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T18:38:28.137684+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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.854215Z","title":"Advances in neural information processing systems33, 6840–6851 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.854215Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:82f7833dfa25b391e939c597a1131f3185f4134b04ed8b80814129fb2216c756","observation_id":"9726a62b-c6d4-4524-8ebd-5cc0516d732b","resolution":{"observed_at":"2026-08-01T04:44:25.854215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00342","last_updated":"2025-04-01T01:46:05Z","snapshot_observed_at":"2026-08-10T02:08:59.280704Z","submitted_at":"2025-04-01T01:46:05Z","title":"Aligning Diffusion Model with Problem Constraints for Trajectory Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00342","snapshot_observed_at":"2026-08-01T04:44:25.856933Z","title":"In: Blasch, E., Darema, F., Metaxas, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.856933Z"},"links":{"cited_paper":"/paper/2504.00342","citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:9f2b4629e8542d303e252c790fa77140083aba75e754b1b57a03af8a559eb266","observation_id":"b20353e4-e61b-4326-a2c4-3afa6b7d3e8f","resolution":{"observed_at":"2026-08-01T04:44:25.856933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.859879Z","title":"In: Ozay, N., Balzano, L., Panagou, D., Abate, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.859879Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:3b0b299c27e2a680fcf27cdc041d781e6a3f9696ae0e838ec0fd4a4a4320fc93","observation_id":"3c3f3d05-e9cd-465c-83c7-9eb519df70f6","resolution":{"observed_at":"2026-08-01T04:44:25.859879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.862239Z","title":"In: Blasch, E., Darema, F., Metaxas, D","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.862239Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:d1f132e9b9902281d21594c37dc7ad05055ddebb4a585bb8f2492adf9376950d","observation_id":"2c6255b6-963d-49f3-8796-7f92bd87f9cf","resolution":{"observed_at":"2026-08-01T04:44:25.862239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.864536Z","title":"In: AAS/AIAA Astrodynamics Specialist Conference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.864536Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:d041e1dbbd7f0cc839a3725b1c7b2c2fcf3511cbff3fe2f014d690891007b6e0","observation_id":"735c63a1-ac70-4ed1-beee-9e1871cfccde","resolution":{"observed_at":"2026-08-01T04:44:25.864536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.00366","last_updated":"2026-05-29T21:09:56Z","snapshot_observed_at":"2026-08-10T22:22:48.546976Z","submitted_at":"2026-05-29T21:09:56Z","title":"GLENS: Global Search via Learning from Solver Iterates with Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.00366","snapshot_observed_at":"2026-08-01T04:44:25.866904Z","title":"arXiv preprint arXiv:2606.00366 (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.866904Z"},"links":{"cited_paper":"/paper/2606.00366","citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:3c35313c8327322c684c8b08ef5bfe423125e6b3e432f7c22e0a1abfd16797f7","observation_id":"a05cd2db-5811-4afb-bdf5-e9ed1aeffe98","resolution":{"observed_at":"2026-08-01T04:44:25.866904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.869564Z","title":"In: Inter- national Conference on Algorithmic Learning Theory","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.869564Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:79be0253af8400cb23e2870b436c44f2f9848aef71c6b13252670ca059a234b2","observation_id":"f6c883d6-5e65-478e-afc6-4b3545ebda69","resolution":{"observed_at":"2026-08-01T04:44:25.869564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.872223Z","title":"In: Proceedings of the eleventh annual conference on Computational learning theory","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.872223Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:d1f9c0cab8a6c127c7954a513fa3c7dc27d44b41720c283f82362b08ad091aba","observation_id":"043f8494-9e75-4fd6-a240-78be70a987d0","resolution":{"observed_at":"2026-08-01T04:44:25.872223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:44:25.874613Z","title":"MIT Press, Cambridge, MA, 2 edn","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T04:44:25.874613Z"},"links":{"citing_paper":"/paper/2607.22467"},"observation_digest":"sha256:63921b4dc4ca44d42cb975da9d78d12e19afc10c77b52e0814bbfb8842bc9eb8","observation_id":"b4f184a6-aa50-4895-9cd3-d249933c5eb6","resolution":{"observed_at":"2026-08-01T04:44:25.874613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22467","last_updated":"2026-07-24T16:31:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T18:20:54.955955Z","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.22467."}