{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3DHJB4XZP7DNRTZNDEM3JAYNVV","short_pith_number":"pith:3DHJB4XZ","schema_version":"1.0","canonical_sha256":"d8ce90f2f97fc6d8cf2d1919b4830dad77bd64dde784bf4883c5a7e87885f1ec","source":{"kind":"arxiv","id":"2310.18497","version":1},"attestation_state":"computed","paper":{"title":"Solving the Traveling Telescope Problem with Mixed Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.IM","authors_text":"Erik A. Petigura, Luke B. Handley, Velibor V. Misic","submitted_at":"2023-10-27T21:22:52Z","abstract_excerpt":"The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an opportunity to save human effort and increase scientific productivity. A common scheduling challenge involves determining the optimal ordering of a set of targets over a night subject to timing constraints and time-dependent slew overheads. We present a solution to the `Traveling Telescope Problem' (TTP) that uses Mixed-Integer Linear Programming (MILP). This algo"},"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":"2310.18497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"astro-ph.IM","submitted_at":"2023-10-27T21:22:52Z","cross_cats_sorted":[],"title_canon_sha256":"1882c8012c656d25a90e0a00c6433f2cc467b4ae78475a3f485e47dca4efb4b3","abstract_canon_sha256":"49a289d3d2efa416a3d6fc10b064673bb90300eb3e0dfd86654b1d3d9010417b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:09.412924Z","signature_b64":"XgpDXVOgyip0NxIXKp9njzp0GaS18WCO+9OYF/9FF6gESKKOw2CX85I/XurZP80l4kPPcdLAeo0eLTSZJwgJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8ce90f2f97fc6d8cf2d1919b4830dad77bd64dde784bf4883c5a7e87885f1ec","last_reissued_at":"2026-07-05T07:06:09.412412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:09.412412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Traveling Telescope Problem with Mixed Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.IM","authors_text":"Erik A. Petigura, Luke B. Handley, Velibor V. Misic","submitted_at":"2023-10-27T21:22:52Z","abstract_excerpt":"The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an opportunity to save human effort and increase scientific productivity. A common scheduling challenge involves determining the optimal ordering of a set of targets over a night subject to timing constraints and time-dependent slew overheads. We present a solution to the `Traveling Telescope Problem' (TTP) that uses Mixed-Integer Linear Programming (MILP). This algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18497","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/2310.18497/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":"2310.18497","created_at":"2026-07-05T07:06:09.412482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18497v1","created_at":"2026-07-05T07:06:09.412482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18497","created_at":"2026-07-05T07:06:09.412482+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DHJB4XZP7DN","created_at":"2026-07-05T07:06:09.412482+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DHJB4XZP7DNRTZN","created_at":"2026-07-05T07:06:09.412482+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DHJB4XZ","created_at":"2026-07-05T07:06:09.412482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06037","citing_title":"A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV","json":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV.json","graph_json":"https://pith.science/api/pith-number/3DHJB4XZP7DNRTZNDEM3JAYNVV/graph.json","events_json":"https://pith.science/api/pith-number/3DHJB4XZP7DNRTZNDEM3JAYNVV/events.json","paper":"https://pith.science/paper/3DHJB4XZ"},"agent_actions":{"view_html":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV","download_json":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV.json","view_paper":"https://pith.science/paper/3DHJB4XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18497&json=true","fetch_graph":"https://pith.science/api/pith-number/3DHJB4XZP7DNRTZNDEM3JAYNVV/graph.json","fetch_events":"https://pith.science/api/pith-number/3DHJB4XZP7DNRTZNDEM3JAYNVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV/action/storage_attestation","attest_author":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV/action/author_attestation","sign_citation":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV/action/citation_signature","submit_replication":"https://pith.science/pith/3DHJB4XZP7DNRTZNDEM3JAYNVV/action/replication_record"}},"created_at":"2026-07-05T07:06:09.412482+00:00","updated_at":"2026-07-05T07:06:09.412482+00:00"}