{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5K4VVOQ4CBWGQXUXZEHS7SURHB","short_pith_number":"pith:5K4VVOQ4","schema_version":"1.0","canonical_sha256":"eab95aba1c106c685e97c90f2fca91385a38eb5d989b0b8ec2fbf502f7dc0204","source":{"kind":"arxiv","id":"1503.07170","version":1},"attestation_state":"computed","paper":{"title":"An Integer Linear Programming Solution to the Telescope Network Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"astro-ph.IM","authors_text":"Eric Saunders, Jason Eastman, Sotiria Lampoudi","submitted_at":"2015-03-24T20:00:24Z","abstract_excerpt":"Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification of the Reservation formalism, through the use of which astronomers can express their complex observation needs and preferences. In this paper we build on that work. We present a solution to the discretize"},"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":"1503.07170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2015-03-24T20:00:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cd6b1199116a138241473a91a9c05c36ea4a834e92310f3ced2de951b7de8ae5","abstract_canon_sha256":"0dd9008676bef81cae8ba366d5a72e3acf09e8715bcd42fe8346511451ac3015"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.140056Z","signature_b64":"qDiVsNkZwH8Vjgtzsvfg6yn9Z+FxXvrmxXEcusvQzh3qqxWTjTJzf+82fGSuuGEk/lY/bG10sYvtPbExr4UcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab95aba1c106c685e97c90f2fca91385a38eb5d989b0b8ec2fbf502f7dc0204","last_reissued_at":"2026-05-18T02:20:28.139403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.139403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Integer Linear Programming Solution to the Telescope Network Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"astro-ph.IM","authors_text":"Eric Saunders, Jason Eastman, Sotiria Lampoudi","submitted_at":"2015-03-24T20:00:24Z","abstract_excerpt":"Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification of the Reservation formalism, through the use of which astronomers can express their complex observation needs and preferences. In this paper we build on that work. We present a solution to the discretize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07170","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.07170","created_at":"2026-05-18T02:20:28.139492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07170v1","created_at":"2026-05-18T02:20:28.139492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07170","created_at":"2026-05-18T02:20:28.139492+00:00"},{"alias_kind":"pith_short_12","alias_value":"5K4VVOQ4CBWG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5K4VVOQ4CBWGQXUX","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5K4VVOQ4","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07817","citing_title":"Scheduling Discovery in the 2020s","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB","json":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB.json","graph_json":"https://pith.science/api/pith-number/5K4VVOQ4CBWGQXUXZEHS7SURHB/graph.json","events_json":"https://pith.science/api/pith-number/5K4VVOQ4CBWGQXUXZEHS7SURHB/events.json","paper":"https://pith.science/paper/5K4VVOQ4"},"agent_actions":{"view_html":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB","download_json":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB.json","view_paper":"https://pith.science/paper/5K4VVOQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07170&json=true","fetch_graph":"https://pith.science/api/pith-number/5K4VVOQ4CBWGQXUXZEHS7SURHB/graph.json","fetch_events":"https://pith.science/api/pith-number/5K4VVOQ4CBWGQXUXZEHS7SURHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB/action/storage_attestation","attest_author":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB/action/author_attestation","sign_citation":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB/action/citation_signature","submit_replication":"https://pith.science/pith/5K4VVOQ4CBWGQXUXZEHS7SURHB/action/replication_record"}},"created_at":"2026-05-18T02:20:28.139492+00:00","updated_at":"2026-05-18T02:20:28.139492+00:00"}