{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Z77NXZHEOJCK6ZTXGQ2GDMDY53","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":"aa1e7667a8f2b85572b8b800feba7792dfaedf4ff215774df9851224ccec80ef","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-22T13:06:07Z","title_canon_sha256":"4ad20ff54669964f09d1f7c68e2b697c6d02311404ec5c0173793d87af1f46b3"},"schema_version":"1.0","source":{"id":"1509.06584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06584","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06584v1","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06584","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"Z77NXZHEOJCK","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z77NXZHEOJCK6ZTX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z77NXZHE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d92f7a10baa02aaa63ed8b8f13a002e0aafa6c40a165bf6889764dcf7a6b49c9","target":"graph","created_at":"2026-05-18T01:32:19Z","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":"In this paper, we consider the problem of computing the smallest enclosing ball (SEB) of a set of $m$ balls in $\\mathbb{R}^n,$ where the product $mn$ is large. We first approximate the non-differentiable SEB problem by its log-exponential aggregation function and then propose a computationally efficient inexact Newton-CG algorithm for the smoothing approximation problem by exploiting its special (approximate) sparsity structure. The key difference between the proposed inexact Newton-CG algorithm and the classical Newton-CG algorithm is that the gradient and the Hessian-vector product are inexa","authors_text":"Feng Ye, Hongwei Liu, Rui Diao, Ya-Feng Liu","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-22T13:06:07Z","title":"An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06584","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:f84cf7b9d99464d7470667faf722a1d82b6daf1f031fe944a13d00f604b36990","target":"record","created_at":"2026-05-18T01:32:19Z","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":"aa1e7667a8f2b85572b8b800feba7792dfaedf4ff215774df9851224ccec80ef","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-22T13:06:07Z","title_canon_sha256":"4ad20ff54669964f09d1f7c68e2b697c6d02311404ec5c0173793d87af1f46b3"},"schema_version":"1.0","source":{"id":"1509.06584","kind":"arxiv","version":1}},"canonical_sha256":"cffedbe4e47244af6677343461b078eeefa64350876514690a07299e8af0e4bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cffedbe4e47244af6677343461b078eeefa64350876514690a07299e8af0e4bc","first_computed_at":"2026-05-18T01:32:19.841212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:19.841212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGsUI6vieS+7SBbbNQL9O3OvWv8liEnT+xGCx22F0J4xIYSWwM1Z8TlpiPG34/AhJiVRukzdUHdvBXHlYIyNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:19.841880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f84cf7b9d99464d7470667faf722a1d82b6daf1f031fe944a13d00f604b36990","sha256:d92f7a10baa02aaa63ed8b8f13a002e0aafa6c40a165bf6889764dcf7a6b49c9"],"state_sha256":"436b8f07323f6cf32f9d195d5012af25bb8cfb91901665e8face556547780429"}