{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MTX7JRYG5GPCF7IQN27YADE3SH","short_pith_number":"pith:MTX7JRYG","canonical_record":{"source":{"id":"1404.1446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-05T08:29:42Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"e3383ddd33df97d8045fe9c43e00257c53648fded0ef9ebf26ce3009e401198e","abstract_canon_sha256":"9acbbc1669afaddced122b2d9932710c75342d34f456209b97aa6c3352b3f74d"},"schema_version":"1.0"},"canonical_sha256":"64eff4c706e99e22fd106ebf800c9b91f4522d37e268a4be7523c88b899e41bf","source":{"kind":"arxiv","id":"1404.1446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1446","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1446v1","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1446","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"MTX7JRYG5GPC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MTX7JRYG5GPCF7IQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MTX7JRYG","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MTX7JRYG5GPCF7IQN27YADE3SH","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-05T08:29:42Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"e3383ddd33df97d8045fe9c43e00257c53648fded0ef9ebf26ce3009e401198e","abstract_canon_sha256":"9acbbc1669afaddced122b2d9932710c75342d34f456209b97aa6c3352b3f74d"},"schema_version":"1.0"},"canonical_sha256":"64eff4c706e99e22fd106ebf800c9b91f4522d37e268a4be7523c88b899e41bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:46.244009Z","signature_b64":"5yLNEQUnym/XitDb9EA29MXbqh75/IV79C/WQC4LOzjxr+tXU7KVKnQR57MM+4CLkVWrZoNzCxXUB8WkHkyABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64eff4c706e99e22fd106ebf800c9b91f4522d37e268a4be7523c88b899e41bf","last_reissued_at":"2026-05-18T02:54:46.243654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:46.243654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1446","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-05-18T02:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReFNJFA0OKBRmf2ONMUx0RtgmbyWYo6BvCgxZPbVwQxhZQXwGgp5z5o4IFKrwwAxHgVBwV5NJ7BX8U/jbzPeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:11:20.739065Z"},"content_sha256":"646604e9b886bfc8d066f01cb808248d2c573cb3329db0f1149c61c6c3491d1b","schema_version":"1.0","event_id":"sha256:646604e9b886bfc8d066f01cb808248d2c573cb3329db0f1149c61c6c3491d1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MTX7JRYG5GPCF7IQN27YADE3SH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Space Debris Collecting Mission -- Optimal Mission Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"math.OC","authors_text":"Max Cerf","submitted_at":"2014-04-05T08:29:42Z","abstract_excerpt":"This paper addresses the problem of planning successive Space Debris Collecting missions so that they can be achieved at minimal cost by a generic vehicle. The problem mixes combinatorial optimization to select and order the debris among a list of candidates, and continuous optimization to fix the rendezvous dates and to define the minimum fuel orbital maneuvers. The solution method proposed consists in three stages. Firstly the orbital transfer problem is simplified by considering a generic transfer strategy suited either to a high thrust or a low thrust vehicle. A response surface modelling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1446","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":""},"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-05-18T02:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxScDxhJqd4MQIbq3n4+gTEcxVLySsdC4RDvynRRCxHpkLzbMEjmDKIr+gv7uqgPqA2+rtsRJR4zlH+PhXJdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:11:20.739423Z"},"content_sha256":"1419250bb18eedde4185d4e9de13c6dd2876012393e790a1417ce9af11dac034","schema_version":"1.0","event_id":"sha256:1419250bb18eedde4185d4e9de13c6dd2876012393e790a1417ce9af11dac034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTX7JRYG5GPCF7IQN27YADE3SH/bundle.json","state_url":"https://pith.science/pith/MTX7JRYG5GPCF7IQN27YADE3SH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTX7JRYG5GPCF7IQN27YADE3SH/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-06-27T12:11:20Z","links":{"resolver":"https://pith.science/pith/MTX7JRYG5GPCF7IQN27YADE3SH","bundle":"https://pith.science/pith/MTX7JRYG5GPCF7IQN27YADE3SH/bundle.json","state":"https://pith.science/pith/MTX7JRYG5GPCF7IQN27YADE3SH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTX7JRYG5GPCF7IQN27YADE3SH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MTX7JRYG5GPCF7IQN27YADE3SH","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":"9acbbc1669afaddced122b2d9932710c75342d34f456209b97aa6c3352b3f74d","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-05T08:29:42Z","title_canon_sha256":"e3383ddd33df97d8045fe9c43e00257c53648fded0ef9ebf26ce3009e401198e"},"schema_version":"1.0","source":{"id":"1404.1446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1446","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1446v1","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1446","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"MTX7JRYG5GPC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MTX7JRYG5GPCF7IQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MTX7JRYG","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:1419250bb18eedde4185d4e9de13c6dd2876012393e790a1417ce9af11dac034","target":"graph","created_at":"2026-05-18T02:54:46Z","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"},"paper":{"abstract_excerpt":"This paper addresses the problem of planning successive Space Debris Collecting missions so that they can be achieved at minimal cost by a generic vehicle. The problem mixes combinatorial optimization to select and order the debris among a list of candidates, and continuous optimization to fix the rendezvous dates and to define the minimum fuel orbital maneuvers. The solution method proposed consists in three stages. Firstly the orbital transfer problem is simplified by considering a generic transfer strategy suited either to a high thrust or a low thrust vehicle. A response surface modelling ","authors_text":"Max Cerf","cross_cats":["astro-ph.IM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-05T08:29:42Z","title":"Multiple Space Debris Collecting Mission -- Optimal Mission Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1446","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:646604e9b886bfc8d066f01cb808248d2c573cb3329db0f1149c61c6c3491d1b","target":"record","created_at":"2026-05-18T02:54:46Z","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":"9acbbc1669afaddced122b2d9932710c75342d34f456209b97aa6c3352b3f74d","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-05T08:29:42Z","title_canon_sha256":"e3383ddd33df97d8045fe9c43e00257c53648fded0ef9ebf26ce3009e401198e"},"schema_version":"1.0","source":{"id":"1404.1446","kind":"arxiv","version":1}},"canonical_sha256":"64eff4c706e99e22fd106ebf800c9b91f4522d37e268a4be7523c88b899e41bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64eff4c706e99e22fd106ebf800c9b91f4522d37e268a4be7523c88b899e41bf","first_computed_at":"2026-05-18T02:54:46.243654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:46.243654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5yLNEQUnym/XitDb9EA29MXbqh75/IV79C/WQC4LOzjxr+tXU7KVKnQR57MM+4CLkVWrZoNzCxXUB8WkHkyABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:46.244009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:646604e9b886bfc8d066f01cb808248d2c573cb3329db0f1149c61c6c3491d1b","sha256:1419250bb18eedde4185d4e9de13c6dd2876012393e790a1417ce9af11dac034"],"state_sha256":"23cd6e72c8e4377a475270b8606c89f7caaa5a1e5d305f8e90314723a320e618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JP+df2zJXs2eWOl9bdK1HWgcQxRtv2oVS2Yk7lenOYuaz4CF2Gl0K4FI6k9dMeIw1u5Px6GhyhNn0mrBBG6nBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:11:20.741249Z","bundle_sha256":"66264d1441522819c655e916574169f0f611d3938d4bcf1e99cf4e3dc7a72da9"}}