{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2RKDHYWP6PL6OSA3FDQ5ONY7TS","short_pith_number":"pith:2RKDHYWP","canonical_record":{"source":{"id":"2402.04561","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"8e555ad2b2ff9a5fb3928247ac07abe24e2ee7df11b7716c4371103e1ed59bc4","abstract_canon_sha256":"afc03b0728e2893500199b227dc45f0625b6c84633734970b632f1fb68d447b3"},"schema_version":"1.0"},"canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","source":{"kind":"arxiv","id":"2402.04561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04561","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04561v1","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04561","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"2RKDHYWP6PL6","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_16","alias_value":"2RKDHYWP6PL6OSA3","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_8","alias_value":"2RKDHYWP","created_at":"2026-07-05T07:42:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2RKDHYWP6PL6OSA3FDQ5ONY7TS","target":"record","payload":{"canonical_record":{"source":{"id":"2402.04561","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"8e555ad2b2ff9a5fb3928247ac07abe24e2ee7df11b7716c4371103e1ed59bc4","abstract_canon_sha256":"afc03b0728e2893500199b227dc45f0625b6c84633734970b632f1fb68d447b3"},"schema_version":"1.0"},"canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:28.873574Z","signature_b64":"/3ODnbXzFKB3rniClTncUBsPKYOOfJ6iJ2JaIIDBmgF9rcxFwjY/BnMbYAD/+LLcHtpg3qvn/z4v2dw2H5m+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","last_reissued_at":"2026-07-05T07:42:28.873150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:28.873150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.04561","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dDj36yBBb7OsUZfCDoBsVburQmuyaqTRw1EipWEjB9EU/eHwPSUl0QJdqbqmSFC+xUlWKHKFHOQQsaHSlsSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:56:25.359771Z"},"content_sha256":"a1c937d29095411795957b6379bc15fc11b8eb20e8c1e767baf8a0565766f1c0","schema_version":"1.0","event_id":"sha256:a1c937d29095411795957b6379bc15fc11b8eb20e8c1e767baf8a0565766f1c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2RKDHYWP6PL6OSA3FDQ5ONY7TS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Govind M. Chari","submitted_at":"2024-02-07T03:42:09Z","abstract_excerpt":"We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibility of the converged trajectory and PIPG, a fast, first-order conic optimization algorithm as the subproblem solver. Although PIPG requires the tuning of a hyperparameter to achieve fastest convergence, we show that PIPG can be tuned to a nominal trajectory optimization problem and it is robust to variations in initial condition. We demonstrate thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04561","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.04561/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3ALPy8aQhbpgYC/dK3zgk7zRR9+TXiN1BQHpj3iJgRl0IenQzzA0vaPmSgDHtNQ8Kvag2IQHPX4t402ba6rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:56:25.360380Z"},"content_sha256":"5c4e09e8f5a7d05c5b3cbaf8583cb653ec86385bbedb4d30b598285ad131fb69","schema_version":"1.0","event_id":"sha256:5c4e09e8f5a7d05c5b3cbaf8583cb653ec86385bbedb4d30b598285ad131fb69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/bundle.json","state_url":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T15:56:25Z","links":{"resolver":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS","bundle":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/bundle.json","state":"https://pith.science/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RKDHYWP6PL6OSA3FDQ5ONY7TS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2RKDHYWP6PL6OSA3FDQ5ONY7TS","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":"afc03b0728e2893500199b227dc45f0625b6c84633734970b632f1fb68d447b3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","title_canon_sha256":"8e555ad2b2ff9a5fb3928247ac07abe24e2ee7df11b7716c4371103e1ed59bc4"},"schema_version":"1.0","source":{"id":"2402.04561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04561","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04561v1","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04561","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"2RKDHYWP6PL6","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_16","alias_value":"2RKDHYWP6PL6OSA3","created_at":"2026-07-05T07:42:28Z"},{"alias_kind":"pith_short_8","alias_value":"2RKDHYWP","created_at":"2026-07-05T07:42:28Z"}],"graph_snapshots":[{"event_id":"sha256:5c4e09e8f5a7d05c5b3cbaf8583cb653ec86385bbedb4d30b598285ad131fb69","target":"graph","created_at":"2026-07-05T07:42:28Z","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/2402.04561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibility of the converged trajectory and PIPG, a fast, first-order conic optimization algorithm as the subproblem solver. Although PIPG requires the tuning of a hyperparameter to achieve fastest convergence, we show that PIPG can be tuned to a nominal trajectory optimization problem and it is robust to variations in initial condition. We demonstrate thi","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Govind M. Chari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04561","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:a1c937d29095411795957b6379bc15fc11b8eb20e8c1e767baf8a0565766f1c0","target":"record","created_at":"2026-07-05T07:42:28Z","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":"afc03b0728e2893500199b227dc45f0625b6c84633734970b632f1fb68d447b3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-07T03:42:09Z","title_canon_sha256":"8e555ad2b2ff9a5fb3928247ac07abe24e2ee7df11b7716c4371103e1ed59bc4"},"schema_version":"1.0","source":{"id":"2402.04561","kind":"arxiv","version":1}},"canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d45433e2cff3d7e7481b28e1d7371f9cb032cc5ea9309ffd672ab131c7c2ccdc","first_computed_at":"2026-07-05T07:42:28.873150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:42:28.873150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3ODnbXzFKB3rniClTncUBsPKYOOfJ6iJ2JaIIDBmgF9rcxFwjY/BnMbYAD/+LLcHtpg3qvn/z4v2dw2H5m+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:42:28.873574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.04561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1c937d29095411795957b6379bc15fc11b8eb20e8c1e767baf8a0565766f1c0","sha256:5c4e09e8f5a7d05c5b3cbaf8583cb653ec86385bbedb4d30b598285ad131fb69"],"state_sha256":"18de88f775d1abdd719bba2b4d7fed8ff57f3115e5a13e75d39ff9db9809213b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ru8B/Zo2+ZfSURAyi0rbTwwuTpXDooPDI3TxpoZrzOmDK3gOqIsoMKK5buQV+JEXxnyZD/SEy1WfUbT2aAcbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:56:25.366894Z","bundle_sha256":"4148ec453a9e59cf3b9ee067d54e64885ccaa8644cdf702b039438b1fe063742"}}