{"as_of":"2026-08-17T17:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cb83dfcf2f6f835aaac27896dcbfa3f37eec4f6dfc1bfbd2983ada9f59204d6","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:13:49.413253Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.11778/citation-record","integrity":"/paper/2411.11778/integrity","json":"/paper/2411.11778/citation-record.json","paper":"/paper/2411.11778"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.124202Z","title":"Evolving Solutions to TSP Variants for Ac- tive Space Debris Removal: Genetic and Evo- lutionary Computation Conference (GECCO),","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.124202Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:1369e3a9601fe80e4cbc456af73a42850baeb5114dae6c8aeb0e4cb61c69e1f1","observation_id":"8d3fce98-56f7-4c8e-ab72-5fb6a003e7d7","resolution":{"observed_at":"2026-08-12T18:13:49.124202Z","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-12T18:13:50.848508Z","title":"Evo- lutionary Optimization of Multirendezvous Im- pulsive Trajectories,","venue":null,"work_id":"cf5628b7-4248-4cd5-9852-98be25d4c871","year":2021},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.135623Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:d426ef4014df0f188a711a7232b6d3bb88b2dbb4628fe4fb00fb6ad0692b4097","observation_id":"170e92af-0719-4545-8e4e-bb6b359e8b91","resolution":{"observed_at":"2026-08-12T18:13:50.853694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.asr.2022.12.013","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.735924Z","title":"Trajectory optimization for multi-target Active Debris Removal missions,","venue":null,"work_id":"5764ccc3-521f-4e17-a966-c036bfe1032d","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.146390Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:d61022f56305e72c77d49d9b28d820812522bbf8496b2b70f5e0677ef411f2ac","observation_id":"21e92e16-3aa9-4139-a9df-8b728c809d11","resolution":{"observed_at":"2026-08-12T18:13:49.741922Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.829581Z","title":"Large- scale object selection and trajectory planning for multi-target space debris removal missions,","venue":null,"work_id":"8a3f5a5f-4331-43c7-8fd3-36ff2bd389a1","year":2020},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.151932Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:047107a0b676c105216d25162e4700efc04977142f88558a75133939a2368e32","observation_id":"ba6249e4-86cc-4470-a5b3-b27e083ed60d","resolution":{"observed_at":"2026-08-12T18:13:50.835082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.811333Z","title":"Low-thrust rendezvous trajectory generation for multi-target active space debris removal using the RQ-Law,","venue":null,"work_id":"d736d689-4864-4114-b9b7-c759e4493293","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.157740Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:16ecd2ff87843ff35a599e515a42020c92916e931fdfd9a6df4b153007de7124","observation_id":"e7b2f6c3-8c23-438e-af76-43e4d09f5c01","resolution":{"observed_at":"2026-08-12T18:13:50.818042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.spacepol.2018","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.719051Z","title":"Review of Ac- tive Space Debris Removal Methods,","venue":null,"work_id":"4492e3d0-3b4b-464c-bbdc-afe1faaebb55","year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.162748Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:ee5c12257644c574805fee7ef3cad3c7bfd2da3e0768307f4c7efe5294632379","observation_id":"26a970bc-0bda-494e-bc87-1ba3784ff106","resolution":{"observed_at":"2026-08-12T18:13:49.724240Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.168649Z","title":"Active debris removal: Recent progress and cur- rent trends,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.168649Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:e1bc8e6e05bb4ffcd8d4a43223331d3053e4854c7c31f9ca40555c6364108909","observation_id":"1ccc8aa4-e8ec-4abc-86f1-93c1649d14ca","resolution":{"observed_at":"2026-08-12T18:13:49.168649Z","resolver_source":null,"status":"malformed_identifier"},"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-12T18:13:49.174064Z","title":"On-Orbit Servicing Missions: Challenges and Solutions for Space- craft Operations,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.174064Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:053dbd6b6c9b500f79fa1bfff18fb5280f1cd49c0cc347d635656c9b9d6b1d59","observation_id":"33e2384a-6e2a-4ca2-8ff2-85276e8a13dc","resolution":{"observed_at":"2026-08-12T18:13:49.174064Z","resolver_source":null,"status":"malformed_identifier"},"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-12T18:13:49.190913Z","title":"Multi- orbit routing and scheduling of refuellable on- orbit servicing space robots,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.190913Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:d058b1944104129a49a1982849acf5bb8b6bd413e285a29728f229d96d4baa72","observation_id":"9f0996c6-f9f0-4316-98f4-5a7a386a27ad","resolution":{"observed_at":"2026-08-12T18:13:49.190913Z","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-12T18:13:49.196145Z","title":"A Survey on Low-Thrust Trajectory Optimization Approaches,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.196145Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:cc8f178a6cbd1186baa682209f88fa6c47eee6a1cd1095f40b2bd4c97b0f6a40","observation_id":"3d4abd69-55c8-4728-bd35-89b0f7f4799a","resolution":{"observed_at":"2026-08-12T18:13:49.196145Z","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-12T18:13:50.793323Z","title":"Petropouloset al., GTOC9: Methods and Re- sults from the Jet Propulsion Laboratory Team , May 2017","venue":null,"work_id":"e843fe17-821e-4da5-8d04-25ef1f842d9e","year":2017},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.201111Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:2a062b18cc5fb22ca3dca73690810dc0c32f7439c7c69995ef6e819114258d31","observation_id":"55f05128-02e9-48f3-9463-9f0efcfed385","resolution":{"observed_at":"2026-08-12T18:13:50.798812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.actaastro.2022.07.039","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.652691Z","title":"GTOC 11: Results found at Beijing Institute of Technology and China Academy of Space Technology,","venue":null,"work_id":"5c511a4c-194c-4a4b-85a6-2c3873432df9","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.206005Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:67ecf9fb26a7f20958bfc09c644fab361599bb9c0f42e97daff0264d282d73cc","observation_id":"718f4347-56fb-40ec-a81a-8a539e336588","resolution":{"observed_at":"2026-08-12T18:13:49.659249Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.actaastro.2019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.631913Z","title":"Deep networks as approximators of optimal low-thrust and multi-impulse cost in multitarget missions,","venue":null,"work_id":"fd249b58-8b2e-4a97-bc2d-afddc499e4a4","year":2020},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.211790Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:5bab51c04294ee122b6ae26286b20f0ae8042a24fe35469ad679ffba706ed5bf","observation_id":"f2a539ee-a0fc-4cca-90fd-da9d14d05ad2","resolution":{"observed_at":"2026-08-12T18:13:49.640304Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.13121","last_updated":"2019-09-28T16:35:38Z","snapshot_observed_at":"2026-08-17T15:37:48.091901Z","submitted_at":"2019-09-28T16:35:38Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","version":1},"cited_work":{"arxiv_id":"1909.13121","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.13121","snapshot_observed_at":"2026-08-12T18:13:50.107362Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","venue":"cs.AI","work_id":"cadfb14a-aa74-46b8-840b-bbe707d2fba3","year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.216598Z"},"links":{"cited_paper":"/paper/1909.13121","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:9a4e7b1a6b4666babe0ebc9af56f5185dd9ab0ce67f0d64949e6d96188838494","observation_id":"76dd1d52-3cf1-4fbb-85a9-aa26e2e7964a","resolution":{"observed_at":"2026-08-12T18:13:50.114672Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.775376Z","title":"GTOC 9, Multiple Space Debris Rendezvous Trajectory Design in the J2 environment,","venue":null,"work_id":"eed81b26-a198-4040-a598-c04a4f1ed2e7","year":2017},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.222272Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:fc78d88bfcd661fdeadb14e43e19d686ddafbf1d852c4844c0ca8614138c2f58","observation_id":"1a0e7100-b66c-4f06-be46-95119a0dcf23","resolution":{"observed_at":"2026-08-12T18:13:50.780599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.757186Z","title":"A parallel global multi- objective framework for optimization: Pagmo,","venue":null,"work_id":"c5bfb183-d396-4787-b46b-95215743f404","year":2020},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.227599Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:1033efd411ebe2710b7651aa5808db1914955436551fc07b79c09c0ea43ee127","observation_id":"cfaef8a9-fc50-4a3e-9ee4-6c12d1569622","resolution":{"observed_at":"2026-08-12T18:13:50.762696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.740005Z","title":"Pymoo: Multi-Objective Optimization in Python,","venue":null,"work_id":"40275cc1-2bf1-4e7b-bd6e-898890f1e77f","year":2020},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.233874Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:32f2e7ffbf7fb4342744ac048e3da8f52effee47d713da3ca00eb928dc9f0897","observation_id":"8500ed22-fe1b-446a-ae72-cb29500ebb30","resolution":{"observed_at":"2026-08-12T18:13:50.745543Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.722857Z","title":"Solving non-convex optimal con- trol problems by convex optimization,","venue":null,"work_id":"399f9535-0dac-4984-af44-225ab1bb05e5","year":2014},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.239193Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:8cf03446bd2b750f73c30abd4e4c2f80d88b0dce2cc3b578f7c941a1aebb44e8","observation_id":"98fc51a2-4663-4087-99fe-8ce38c543727","resolution":{"observed_at":"2026-08-12T18:13:50.728860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.704595Z","title":"Ecos: An socp solver for embedded systems,","venue":null,"work_id":"10fbd941-a2df-4454-acd0-8910e5a88b52","year":2013},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.244577Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:21e8b2621c9e180905dba71d6f148d17dd97597d80a18d01c50160f7e9598fc8","observation_id":"ac5941d8-52be-4597-8f6f-d8132d5eb598","resolution":{"observed_at":"2026-08-12T18:13:50.711726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.686441Z","title":"Optimal guid- ance and control with nonlinear dynamics us- ing sequential convex programming,","venue":null,"work_id":"2afe3202-ef02-454f-91da-5df0ef04b92b","year":2020},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.249981Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:fec7ed82a4b5470b0ffdbdac9441b118aacc4215a01b2a9b69b5169023bc2cb9","observation_id":"61d1c37d-ee38-4bdc-b5fd-1052bd632324","resolution":{"observed_at":"2026-08-12T18:13:50.692325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.666846Z","title":"Sequential convex program- ming for optimal line of sight steering in agile missions,","venue":null,"work_id":"13650021-af84-4bea-99d7-a918ba979aef","year":2022},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.255323Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:588ab22e34991bad690a8a75e4543626cae54cb6a4aed75b09a6806980b69a66","observation_id":"f08de29d-3b32-4a54-a865-a4df40a85bb5","resolution":{"observed_at":"2026-08-12T18:13:50.674556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.648500Z","title":"Rapid low-thrust trajectory optimization in deep space based on convex programming,","venue":null,"work_id":"99cd0747-a92f-446e-bf65-59f99af27cd0","year":2021},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.260559Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:c42c04c7f6fa21b2c61f6ef45a1887c27e6278c9b6f0ae5388e99f45d29a420c","observation_id":"8aa9a230-2415-4797-a6f9-0ba33eb522b5","resolution":{"observed_at":"2026-08-12T18:13:50.653965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.630421Z","title":null,"venue":null,"work_id":"e39d4bcd-ead6-4d27-9ed5-f476d158070e","year":2006},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.265639Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:a9718b5a9e098df8124781862f0d2f78decd4a1892107284e634059449672d9f","observation_id":"eebcafcf-f403-444d-93b8-7803026f2f55","resolution":{"observed_at":"2026-08-12T18:13:50.636330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.613939Z","title":null,"venue":null,"work_id":"88285f6c-fcd7-4205-b395-26f03d280770","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.270887Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:a5720f7124d542fc24376223a56da92542847d205b31389617144f6d74171e19","observation_id":"44f8805f-d708-4351-ba0b-fefc152ef9d2","resolution":{"observed_at":"2026-08-12T18:13:50.619064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.32237","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.613417Z","title":"Survey of Orbit Element Sets,","venue":null,"work_id":"8425e622-68b3-4776-8f25-0a7f7fe6dbf2","year":2008},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.276596Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:4b87db81e488f730d3162b7780381eef4812126164ab0bc358a8d29c30ccec95","observation_id":"46a3cf42-97b9-43c0-9259-d7e82024c01b","resolution":{"observed_at":"2026-08-12T18:13:49.619004Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.282051Z","title":"Chapter 2 - Fundamen- tal Astrodynamics,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.282051Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:24f14435045f13a481514835035889df90a24524052b8f337904f17891e3bfae","observation_id":"650e84d2-d59c-4574-a620-2ae52bd76d43","resolution":{"observed_at":"2026-08-12T18:13:49.282051Z","resolver_source":null,"status":"malformed_identifier"},"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-12T18:13:50.594563Z","title":"2015,isbn: 978-94-6186-419-","venue":null,"work_id":"2a52af3c-6b12-42c6-ad1c-cbe006f39555","year":2015},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.288162Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:8e3bb2f55991d9552ac00726aba3404c9f607c6aebe15ce2c8ad61ff2889ad97","observation_id":"3736456f-6651-41d5-9c31-9e2f85520f51","resolution":{"observed_at":"2026-08-12T18:13:50.601061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.547278Z","title":"Sampling Permutations for Shapley Value Esti- mation,","venue":null,"work_id":"fa1a71da-3254-42f8-b2b6-9239714bb9bc","year":2022},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.298609Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:249145e7bfe687dc09a997e9442df0dc1aad2adca10ead0c958c6a137cd18ab2","observation_id":"43a2302c-0f97-4381-985c-3abcd4a984a4","resolution":{"observed_at":"2026-08-12T18:13:50.553731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.529445Z","title":"Fisher-Yates shuffle,","venue":null,"work_id":"a0354353-6d6a-4c74-9702-1cee299c45b1","year":2016},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.303361Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:7044a9c25b8c2e00027971b993c494a19f18f4afce8b88d07fc9542a79b6a36e","observation_id":"8cb98ad2-c6b5-4670-b0b6-67c1f090298a","resolution":{"observed_at":"2026-08-12T18:13:50.535182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.573853Z","title":"Available: https : / / repository","venue":null,"work_id":"2b834be0-4a31-4877-8929-df04a55ffd6a","year":null},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.293673Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:279a1d310d867c639df082331f18501dd47f3c7cad90ed4f73a1a85b80c21f35","observation_id":"cf9f3dad-b152-4d3c-8ea7-f56d994743b1","resolution":{"observed_at":"2026-08-12T18:13:50.580160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/2333244","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.990184Z","title":"Non-Null Ranking Models. I,","venue":null,"work_id":"0b25537c-267e-43be-b602-c67a0e5c2847","year":1957},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.314307Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:eb89d4930a770aae445add51418c34baf7a6e8834b6364d23d8d159bacb950c8","observation_id":"b270e6f9-dca4-468c-aabf-a5e9ca92539c","resolution":{"observed_at":"2026-08-12T18:13:50.004437Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.509243Z","title":"Sampling and learning distance- based probability models for permutation spaces,","venue":null,"work_id":"1893fbd7-dba5-443b-a462-0fd284cc8540","year":null},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.319262Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:4ec95df36804c852bbdc1eebdaec2247503b14c248c3adbd156a9c0382a2c6bc","observation_id":"7a4c7c41-94d0-4ef5-aa22-7a6b2d4af7e8","resolution":{"observed_at":"2026-08-12T18:13:50.515447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.308432Z","title":"Group Representations in Proba- bility and Statistics,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.308432Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:bcae9d2c98d7042be4aa167b9d8a09d1e881c27743985d5c2f07c32ec21ddb9e","observation_id":"ea86f1dd-e5b6-4182-acef-6063775aaa17","resolution":{"observed_at":"2026-08-12T18:13:49.308432Z","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-12T18:13:49.335047Z","title":"Novel Random Key Encoding Schemes for the Dif- ferential Evolution of Permutation Problems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.335047Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:2a761fc630714035ddabb018fcdc43d70aae74d2a9c57a452f14812cfceb835d","observation_id":"804d56f2-1eb8-4324-a4cc-157d46e1a29d","resolution":{"observed_at":"2026-08-12T18:13:49.335047Z","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":"10.1016/j.ejor.2024.03.030","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.563012Z","title":"Biased random-key genetic algorithms: A review,","venue":null,"work_id":"2316dfc4-5b6e-4247-99dc-311e72a1243e","year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.339837Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:1ce023e46f0c571e78c1cd0d405ad63eed61eb4e6b75a596b4370197bc3b471e","observation_id":"0ee4d12b-8ee9-470c-86c5-7e454bd33f92","resolution":{"observed_at":"2026-08-12T18:13:49.568715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5194/epsc2022-253","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.543028Z","title":"The open-source astrodynamics Tudatpy software - overview for planetary mis- sion design and science analysis,","venue":null,"work_id":"4b84c4e8-3381-4180-9751-41c8e95d8e59","year":2022},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.344949Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:365e2172819634ced6649e27bc298a5e5b1a250b9efcc4d21942f2c699eb4531","observation_id":"35cefc49-bc9c-4f88-93f1-c9ebb00655d4","resolution":{"observed_at":"2026-08-12T18:13:49.550623Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/ijoc.6.2.154","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.582545Z","title":"Genetic Algorithms and Random Keys for Sequencing and Optimization,","venue":null,"work_id":"65bd491b-2fa2-4213-a655-67e9978db147","year":1994},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.329657Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:4e6c20159bcc9084e76f417b9d023efbf86942440bfd9abf72300bfd950aee0c","observation_id":"e8e19195-db98-4dc9-80c4-fe158e899637","resolution":{"observed_at":"2026-08-12T18:13:49.587877Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.361270Z","title":"Inter- planetary transfers via deep representations of the optimal policy and/or of the value func- tion,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.361270Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:5de7336c31bd039906b914b6912089a38fa70ddf1b9294be88213a1d9ca4b928","observation_id":"ee15de8b-ceb2-4120-a7b8-5da412be2f87","resolution":{"observed_at":"2026-08-12T18:13:49.361270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-08-16T15:19:58.999725Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-12T18:13:49.366109Z","title":"Bertoet al., RL4CO: An Extensive Reinforce- ment Learning for Combinatorial Optimization Benchmark, arXiv:2306.17100 [cs], Jun","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.366109Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:5184b9993603725d6b4284f3fc10ebb269fe783476e521b4bc21a3a0add818a9","observation_id":"88b25c24-2535-4cd6-9a8d-531a080178c0","resolution":{"observed_at":"2026-08-12T18:13:49.366109Z","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-12T18:13:50.442042Z","title":"Atten- tion, Learn to Solve Routing Problems!","venue":null,"work_id":"40a3e9c6-2ad4-4440-9b07-4f4b352d4172","year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.372479Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:4e7c9078521152ca0343ff89158a33ca1e5eb514909e44165b3cd7cc21d524c6","observation_id":"4da60d61-7950-4718-8c1b-2eaf69cae001","resolution":{"observed_at":"2026-08-12T18:13:50.447829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.460624Z","title":"A survey on artificial intelligence trends in spacecraft guid- ance dynamics and control,","venue":null,"work_id":"2ede6494-4f46-4ac5-a8db-3b1e1dec9f13","year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.350009Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:6653185da2619ad6f1d01c090d30dc7eb4ca9b8a7784affb5d1a749e15915dd7","observation_id":"ab64cc5b-a742-4f84-8ac1-d6e986380385","resolution":{"observed_at":"2026-08-12T18:13:50.466169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:50.419174Z","title":"Actor-Critic Algorithms,","venue":null,"work_id":"7e3dbd17-7a52-437b-ba68-077434c514f0","year":1999},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.383785Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:1d2074a8998eda9de2b7f3f06ea564dd13abf00ddf0d87a5b073c63b48cd92eb","observation_id":"7bb2a7e1-90c3-4a0c-94c7-236854f72c38","resolution":{"observed_at":"2026-08-12T18:13:50.425243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.01783","last_updated":"2016-06-16T16:38:45Z","snapshot_observed_at":"2026-08-17T11:02:06.117758Z","submitted_at":"2016-02-04T18:38:41Z","title":"Asynchronous Methods for Deep Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.01783","snapshot_observed_at":"2026-08-12T18:13:49.389644Z","title":"Mnih et al., Asynchronous Methods for Deep Reinforcement Learning, arXiv:1602.01783 [cs], Jun","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.389644Z"},"links":{"cited_paper":"/paper/1602.01783","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:2341c029ea306b28c9ed78e696dc16f8668a26337653f54e6e7c2d825cb6353b","observation_id":"68f71c4d-2e5c-4d02-90fd-9d64c7443265","resolution":{"observed_at":"2026-08-12T18:13:49.389644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-12T18:13:49.395249Z","title":"Schulman, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.395249Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:1a32f3e9c194ddbbc9aca091ad7356c3ed464b8946fbc6f34f67feda5f95caa6","observation_id":"61156fb9-161e-4ae7-8e82-619eb6969955","resolution":{"observed_at":"2026-08-12T18:13:49.395249Z","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-12T18:13:50.391362Z","title":null,"venue":null,"work_id":"42e16c9f-682a-4537-9e13-9691c56e6a0f","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.407337Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:91f608f4a1f5c8e048710f91ffb10a562a4c7ae05d74c1932440149583a92c53","observation_id":"b2971d63-dcba-4cd6-9ad2-56faeadf5fdc","resolution":{"observed_at":"2026-08-12T18:13:50.399106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.377998Z","title":"Simple statistical gradient- following algorithms for connectionist reinforce- ment learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.377998Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:f4dcbde75f5a336ef36b578d3e49efc5a706bd611f7ddeb37c2578772a46807e","observation_id":"fdf7263d-975b-4c34-bc3d-4daf97aba79d","resolution":{"observed_at":"2026-08-12T18:13:49.377998Z","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-12T18:13:50.369788Z","title":null,"venue":null,"work_id":"471a4f98-54ad-420b-91b7-0cf70d433788","year":2023},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.413253Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:f86c10f761b74f6bf2100854654fbd45a966383447d7128c914d91730bed6daf","observation_id":"b58ff984-7426-402f-b58a-13eb70533bda","resolution":{"observed_at":"2026-08-12T18:13:50.376234Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.355925Z","title":"[On- line]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.355925Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:3520347f9622dd318b43f46b5e6b90d4b4d1a6cfcd73f0ea32506cc6bb0a47ec","observation_id":"5c6ee12f-e5d4-4548-8074-f5a17d3ca8d2","resolution":{"observed_at":"2026-08-12T18:13:49.355925Z","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-12T18:13:50.480599Z","title":"Available: https : / / dialnet","venue":null,"work_id":"8870eaf1-1d26-4ded-b8d8-3421c395378a","year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.324421Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:33288b13af4ec8c8a10d7c95f87aca60fbd52aab90b28db8a9d4caea9abf0b57","observation_id":"4e17e14c-8493-4574-8faf-8fb7539b4dcd","resolution":{"observed_at":"2026-08-12T18:13:50.494302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-12T18:13:49.401142Z","title":"[On- line]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.401142Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:d74d75b1c4ff2b5d9c89d0b4a3d277d48567ab39f03c8dbfd0ced77fbcedb1e7","observation_id":"ccf943c8-3670-4cb5-a5d4-8427f9b1c89f","resolution":{"observed_at":"2026-08-12T18:13:49.401142Z","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":"10.1155/2021/9921555","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.754395Z","title":null,"venue":null,"work_id":"920e184d-01a3-4adc-bb67-16bbcd0f3957","year":2021},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.140995Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:6556359e4fa408414a50675ac07d480960fadf7e6023eab476f8d25ce26e8e01","observation_id":"1acff9d1-d708-419c-ac9c-2c068745957d","resolution":{"observed_at":"2026-08-12T18:13:49.759483Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:13:49.185353Z","title":"[Online]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":4650,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.185353Z"},"links":{"citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:0736d4bbc5541bf1cd3f3e0eab625b8399897fcdfae60811a00e7d11e333be3f","observation_id":"f5862361-e324-47ca-b507-0fab805e6116","resolution":{"observed_at":"2026-08-12T18:13:49.185353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":11,"verified_fuzzy":20},"total_outbound_references":52},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2411.11778."}