{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MF2MH74BINBWEE2W6KGGJQPN3A","short_pith_number":"pith:MF2MH74B","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"},"canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","source":{"kind":"arxiv","id":"1607.04552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04552","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04552v1","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04552","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"MF2MH74BINBW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MF2MH74BINBWEE2W","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MF2MH74B","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MF2MH74BINBWEE2W6KGGJQPN3A","target":"record","payload":{"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"},"canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","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"},"source_kind":"arxiv","source_id":"1607.04552","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-18T00:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUq8CKLmKL+f6sGKb/LrTrgSjOY2Efm0GaS3Wa9gxG7xAARbjteGKwz0ecGKnf+tAU1iFiXFCW4/b4gmNfZpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:41:23.461209Z"},"content_sha256":"8dadc8cf92a2775df891d61b8385d8deae9adb9007ffb77b7d38c0c3aa85427d","schema_version":"1.0","event_id":"sha256:8dadc8cf92a2775df891d61b8385d8deae9adb9007ffb77b7d38c0c3aa85427d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MF2MH74BINBWEE2W6KGGJQPN3A","target":"graph","payload":{"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"},"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-18T00:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axGSeqeUuvQJdz4KOT5QEhwLa3F4pa2aATfiY9DYOoTOmo5KX7s0kv6+Qd+w/3USwYHCecXJhDx4b2+YZa6GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:41:23.461617Z"},"content_sha256":"d9ac3b31f3a3032da94651041188a59e8c5fc6f088aadd51168f995eb82cf800","schema_version":"1.0","event_id":"sha256:d9ac3b31f3a3032da94651041188a59e8c5fc6f088aadd51168f995eb82cf800"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/bundle.json","state_url":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MF2MH74BINBWEE2W6KGGJQPN3A/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-05-31T05:41:23Z","links":{"resolver":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A","bundle":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/bundle.json","state":"https://pith.science/pith/MF2MH74BINBWEE2W6KGGJQPN3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MF2MH74BINBWEE2W6KGGJQPN3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MF2MH74BINBWEE2W6KGGJQPN3A","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":"3d6d6e9c960a39aea8ec8223cde2aa634440ab59c205013da7c59517fdae30dc","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-15T15:22:38Z","title_canon_sha256":"04133b153fabce868bde582f22af9b2f424f5595e939ce481508f113a768f808"},"schema_version":"1.0","source":{"id":"1607.04552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04552","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04552v1","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04552","created_at":"2026-05-18T00:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"MF2MH74BINBW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MF2MH74BINBWEE2W","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MF2MH74B","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d9ac3b31f3a3032da94651041188a59e8c5fc6f088aadd51168f995eb82cf800","target":"graph","created_at":"2026-05-18T00:44:16Z","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":"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","authors_text":"Carlos S\\'anchez-S\\'anchez, Dario Izzo, Joerg H. Mueller, Lu\\'is F. Sim\\~oes","cross_cats":["astro-ph.IM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-15T15:22:38Z","title":"Optimal Orderings of k-subsets for Star Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04552","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:8dadc8cf92a2775df891d61b8385d8deae9adb9007ffb77b7d38c0c3aa85427d","target":"record","created_at":"2026-05-18T00:44:16Z","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":"3d6d6e9c960a39aea8ec8223cde2aa634440ab59c205013da7c59517fdae30dc","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-15T15:22:38Z","title_canon_sha256":"04133b153fabce868bde582f22af9b2f424f5595e939ce481508f113a768f808"},"schema_version":"1.0","source":{"id":"1607.04552","kind":"arxiv","version":1}},"canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6174c3ff814343621356f28c64c1edd80d8036eb2c6d3636e856e950ff4eb7ac","first_computed_at":"2026-05-18T00:44:16.029690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:16.029690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELFv1ppX6Wg9kppPtHrNUcBIWZLnq7SZ/Oeg4SKuajoN3HWPuTjOuH+7JfHt5PUU0tqcqtJVuT9fes1RY6yWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:16.030386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dadc8cf92a2775df891d61b8385d8deae9adb9007ffb77b7d38c0c3aa85427d","sha256:d9ac3b31f3a3032da94651041188a59e8c5fc6f088aadd51168f995eb82cf800"],"state_sha256":"9f42577ef97aab8500e45078bd2f1f5f35a7a1f805bfd8589f5c77aee916aff4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpEqv3uD2jJfX+a+4VcV9NB7fm/6z1nWtXfOAad8qIigXr1Kmt4ibsiGdQ9b2gKeNryU8BNXor3vEG9XiWwVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:41:23.464260Z","bundle_sha256":"1b6dfe4d770f2ecdfac6c83844d8eb184fc03d5490a6c42dadc9cd13ab5e7891"}}