{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J5I2ONZHCWRNVKGLHWLRPTNKIO","short_pith_number":"pith:J5I2ONZH","schema_version":"1.0","canonical_sha256":"4f51a7372715a2daa8cb3d9717cdaa43a7be7a81515c51d496131b8f7cf18a43","source":{"kind":"arxiv","id":"1707.03387","version":1},"attestation_state":"computed","paper":{"title":"A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Farid Alizadeh, Marta Cavaleiro","submitted_at":"2017-07-11T17:51:23Z","abstract_excerpt":"The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of~$k$ points to solve this problem. The nodes on the tree are ordered in a suitable way, which, complemented with a last-in-first-out search strategy, allows for only a small fraction of nodes to be explored. Additionally, an efficient dual algorithm to solve the subproblems at each node is employed."},"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":"1707.03387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-11T17:51:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ec03e08230a62d559d8ae73174cd91fd2f81af75cdeba770294ac5215ca8c7a","abstract_canon_sha256":"ab68ad1cb48d77734709269213608e441b5ee68b2270cb27cdc6237bcc5026a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:29.182950Z","signature_b64":"6tGFGDvNywFc43iA4mFo1ioN2LpffbGYSZYD24Jfi1vLAsy8Fo5w2Z4VSu7MiQxG3idsW9Miw3efbRKHiHgbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f51a7372715a2daa8cb3d9717cdaa43a7be7a81515c51d496131b8f7cf18a43","last_reissued_at":"2026-05-18T00:40:29.182285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:29.182285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Farid Alizadeh, Marta Cavaleiro","submitted_at":"2017-07-11T17:51:23Z","abstract_excerpt":"The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of~$k$ points to solve this problem. The nodes on the tree are ordered in a suitable way, which, complemented with a last-in-first-out search strategy, allows for only a small fraction of nodes to be explored. Additionally, an efficient dual algorithm to solve the subproblems at each node is employed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03387","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":"1707.03387","created_at":"2026-05-18T00:40:29.182412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03387v1","created_at":"2026-05-18T00:40:29.182412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03387","created_at":"2026-05-18T00:40:29.182412+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5I2ONZHCWRN","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5I2ONZHCWRNVKGL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5I2ONZH","created_at":"2026-05-18T12:31:21.493067+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/J5I2ONZHCWRNVKGLHWLRPTNKIO","json":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO.json","graph_json":"https://pith.science/api/pith-number/J5I2ONZHCWRNVKGLHWLRPTNKIO/graph.json","events_json":"https://pith.science/api/pith-number/J5I2ONZHCWRNVKGLHWLRPTNKIO/events.json","paper":"https://pith.science/paper/J5I2ONZH"},"agent_actions":{"view_html":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO","download_json":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO.json","view_paper":"https://pith.science/paper/J5I2ONZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03387&json=true","fetch_graph":"https://pith.science/api/pith-number/J5I2ONZHCWRNVKGLHWLRPTNKIO/graph.json","fetch_events":"https://pith.science/api/pith-number/J5I2ONZHCWRNVKGLHWLRPTNKIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO/action/storage_attestation","attest_author":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO/action/author_attestation","sign_citation":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO/action/citation_signature","submit_replication":"https://pith.science/pith/J5I2ONZHCWRNVKGLHWLRPTNKIO/action/replication_record"}},"created_at":"2026-05-18T00:40:29.182412+00:00","updated_at":"2026-05-18T00:40:29.182412+00:00"}