{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QADIKLP4T5PGW7WFIRY6KELVPU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bb89120add04e0ec52e8b36111b50b81d7f4d99dcabc9b6ac727f2a14ebfb296","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-11-18T17:55:02Z","title_canon_sha256":"003a6a23ad7374c46928cbc642bf94c51d00a86695f573c6f6a12012e1c510a2"},"schema_version":"1.0","source":{"id":"2411.11778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11778","created_at":"2026-07-05T09:37:01Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11778v1","created_at":"2026-07-05T09:37:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11778","created_at":"2026-07-05T09:37:01Z"},{"alias_kind":"pith_short_12","alias_value":"QADIKLP4T5PG","created_at":"2026-07-05T09:37:01Z"},{"alias_kind":"pith_short_16","alias_value":"QADIKLP4T5PGW7WF","created_at":"2026-07-05T09:37:01Z"},{"alias_kind":"pith_short_8","alias_value":"QADIKLP4","created_at":"2026-07-05T09:37:01Z"}],"graph_snapshots":[{"event_id":"sha256:f86c7806fa833ed1aa3763368355a472c675f321fd340ad114e5a4510c2db538","target":"graph","created_at":"2026-07-05T09:37:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.11778/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing space vehicle routing is crucial for critical applications such as on-orbit servicing, constellation deployment, and space debris de-orbiting. Multi-target Rendezvous presents a significant challenge in this domain. This problem involves determining the optimal sequence in which to visit a set of targets, and the corresponding optimal trajectories: this results in a demanding NP-hard problem. We introduce a framework for the design and refinement of multi-rendezvous trajectories based on heuristic combinatorial optimization and Sequential Convex Programming. Our framework is both hi","authors_text":"Alex Cuenca, Antonio L\\'opez Rivera, David Bermejo, Jes\\'us Ram\\'irez, Lucrezia Marcovaldi","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11778","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e2c2f09f7cfedbe9ea646f7e9dd52e11efabf9ff47892e4e166afcfdd8635fa9","target":"record","created_at":"2026-07-05T09:37:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bb89120add04e0ec52e8b36111b50b81d7f4d99dcabc9b6ac727f2a14ebfb296","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-11-18T17:55:02Z","title_canon_sha256":"003a6a23ad7374c46928cbc642bf94c51d00a86695f573c6f6a12012e1c510a2"},"schema_version":"1.0","source":{"id":"2411.11778","kind":"arxiv","version":1}},"canonical_sha256":"8006852dfc9f5e6b7ec54471e511757d2970b2b1bd514e20633c6d9bd71b47fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8006852dfc9f5e6b7ec54471e511757d2970b2b1bd514e20633c6d9bd71b47fc","first_computed_at":"2026-07-05T09:37:01.355712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:01.355712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T+DvRC/6VlYYTb+QPswAJzTVZCiiXn1xXfMP3V5HH7yZxfI2GE3AcYUlduEZkf7Tb6Zr3hFC3Y2chtfVQ1vsBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:01.356234Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2c2f09f7cfedbe9ea646f7e9dd52e11efabf9ff47892e4e166afcfdd8635fa9","sha256:f86c7806fa833ed1aa3763368355a472c675f321fd340ad114e5a4510c2db538"],"state_sha256":"add0934ddd026b0eeb892e447424c8e8d39bb97ab18d405276b680af128d5188"}