{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N6PZ2UF66AJNEFEQOS4HUCCNKF","short_pith_number":"pith:N6PZ2UF6","schema_version":"1.0","canonical_sha256":"6f9f9d50bef012d2149074b87a084d5142b88c1141a49c3b2c9bd15f5d4b324e","source":{"kind":"arxiv","id":"2410.16282","version":2},"attestation_state":"computed","paper":{"title":"Optimal Ground Station Selection for Low-Earth Orbiting Satellites","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Duncan Eddy, Michelle Ho, Mykel J. Kochenderfer","submitted_at":"2024-10-04T22:48:50Z","abstract_excerpt":"This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions that enables mission operators to precisely design their ground segment performance and costs. Space mission operators are increasingly turning to Ground-Station-as-a-Service (GSaaS) providers to supply the terrestrial communications segment to reduce costs and increase network size. However, this approach leads to a new challenge of selecting the optimal service providers and station locations for a given mission. We consider the problem of ground station selection as "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2410.16282","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-10-04T22:48:50Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"948294621b97048a0508a6c61691c3494c97403f4add029d34b47f3e17f9c123","abstract_canon_sha256":"bc91bb913ca394407baa6ef23f10150dd3f750c827998b37ab41c4dc624b735b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:08.366666Z","signature_b64":"bKGGAtGvfw2A85OCEskUV2oZujCfMCsSIb67fDix6sAoAucVdac6E8hQLI3YzheHeqe+1ZnFruudtXj4qYhNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9f9d50bef012d2149074b87a084d5142b88c1141a49c3b2c9bd15f5d4b324e","last_reissued_at":"2026-07-05T10:22:08.366158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:08.366158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Ground Station Selection for Low-Earth Orbiting Satellites","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Duncan Eddy, Michelle Ho, Mykel J. Kochenderfer","submitted_at":"2024-10-04T22:48:50Z","abstract_excerpt":"This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions that enables mission operators to precisely design their ground segment performance and costs. Space mission operators are increasingly turning to Ground-Station-as-a-Service (GSaaS) providers to supply the terrestrial communications segment to reduce costs and increase network size. However, this approach leads to a new challenge of selecting the optimal service providers and station locations for a given mission. We consider the problem of ground station selection as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16282","kind":"arxiv","version":2},"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/2410.16282/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.16282","created_at":"2026-07-05T10:22:08.366220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16282v2","created_at":"2026-07-05T10:22:08.366220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16282","created_at":"2026-07-05T10:22:08.366220+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6PZ2UF66AJN","created_at":"2026-07-05T10:22:08.366220+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6PZ2UF66AJNEFEQ","created_at":"2026-07-05T10:22:08.366220+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6PZ2UF6","created_at":"2026-07-05T10:22:08.366220+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09158","citing_title":"Fault-Aware MPC for Robotic Fleet Communications Scheduling","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02164","citing_title":"Designing a Satellite Serviced Quantum Network Backbone for Concurrent Global Connectivity","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF","json":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF.json","graph_json":"https://pith.science/api/pith-number/N6PZ2UF66AJNEFEQOS4HUCCNKF/graph.json","events_json":"https://pith.science/api/pith-number/N6PZ2UF66AJNEFEQOS4HUCCNKF/events.json","paper":"https://pith.science/paper/N6PZ2UF6"},"agent_actions":{"view_html":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF","download_json":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF.json","view_paper":"https://pith.science/paper/N6PZ2UF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16282&json=true","fetch_graph":"https://pith.science/api/pith-number/N6PZ2UF66AJNEFEQOS4HUCCNKF/graph.json","fetch_events":"https://pith.science/api/pith-number/N6PZ2UF66AJNEFEQOS4HUCCNKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF/action/storage_attestation","attest_author":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF/action/author_attestation","sign_citation":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF/action/citation_signature","submit_replication":"https://pith.science/pith/N6PZ2UF66AJNEFEQOS4HUCCNKF/action/replication_record"}},"created_at":"2026-07-05T10:22:08.366220+00:00","updated_at":"2026-07-05T10:22:08.366220+00:00"}