{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MF2MH74BINBWEE2W6KGGJQPN3A","short_pith_number":"pith:MF2MH74B","schema_version":"1.0","canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","source":{"kind":"arxiv","id":"1607.04552","version":1},"attestation_state":"computed","paper":{"title":"Optimal Orderings of k-subsets for Star Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"math.OC","authors_text":"Carlos S\\'anchez-S\\'anchez, Dario Izzo, Joerg H. Mueller, Lu\\'is F. Sim\\~oes","submitted_at":"2016-07-15T15:22:38Z","abstract_excerpt":"Finding the optimal ordering of k-subsets with respect to an objective function is known to be an extremely challenging problem. In this paper we introduce a new objective for this task, rooted in the problem of star identification on spacecrafts: subsets of detected spikes are to be generated in an ordering that minimizes time to detection of a valid star constellation. We carry out an extensive analysis of the combinatorial optimization problem, and propose multiple algorithmic solutions, offering different quality-complexity trade-offs. Three main approaches are investigated: exhaustive sea"},"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":"1607.04552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-15T15:22:38Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"04133b153fabce868bde582f22af9b2f424f5595e939ce481508f113a768f808","abstract_canon_sha256":"3d6d6e9c960a39aea8ec8223cde2aa634440ab59c205013da7c59517fdae30dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:16.030386Z","signature_b64":"ELFv1ppX6Wg9kppPtHrNUcBIWZLnq7SZ/Oeg4SKuajoN3HWPuTjOuH+7JfHt5PUU0tqcqtJVuT9fes1RY6yWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","last_reissued_at":"2026-05-18T00:44:16.029690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:16.029690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Orderings of k-subsets for Star Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"math.OC","authors_text":"Carlos S\\'anchez-S\\'anchez, Dario Izzo, Joerg H. Mueller, Lu\\'is F. Sim\\~oes","submitted_at":"2016-07-15T15:22:38Z","abstract_excerpt":"Finding the optimal ordering of k-subsets with respect to an objective function is known to be an extremely challenging problem. In this paper we introduce a new objective for this task, rooted in the problem of star identification on spacecrafts: subsets of detected spikes are to be generated in an ordering that minimizes time to detection of a valid star constellation. We carry out an extensive analysis of the combinatorial optimization problem, and propose multiple algorithmic solutions, offering different quality-complexity trade-offs. Three main approaches are investigated: exhaustive sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04552","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":"1607.04552","created_at":"2026-05-18T00:44:16.029808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04552v1","created_at":"2026-05-18T00:44:16.029808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04552","created_at":"2026-05-18T00:44:16.029808+00:00"},{"alias_kind":"pith_short_12","alias_value":"MF2MH74BINBW","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MF2MH74BINBWEE2W","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MF2MH74B","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A","json":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A.json","graph_json":"https://pith.science/api/pith-number/MF2MH74BINBWEE2W6KGGJQPN3A/graph.json","events_json":"https://pith.science/api/pith-number/MF2MH74BINBWEE2W6KGGJQPN3A/events.json","paper":"https://pith.science/paper/MF2MH74B"},"agent_actions":{"view_html":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A","download_json":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A.json","view_paper":"https://pith.science/paper/MF2MH74B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04552&json=true","fetch_graph":"https://pith.science/api/pith-number/MF2MH74BINBWEE2W6KGGJQPN3A/graph.json","fetch_events":"https://pith.science/api/pith-number/MF2MH74BINBWEE2W6KGGJQPN3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/action/storage_attestation","attest_author":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/action/author_attestation","sign_citation":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/action/citation_signature","submit_replication":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/action/replication_record"}},"created_at":"2026-05-18T00:44:16.029808+00:00","updated_at":"2026-05-18T00:44:16.029808+00:00"}