{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Z77NXZHEOJCK6ZTXGQ2GDMDY53","short_pith_number":"pith:Z77NXZHE","canonical_record":{"source":{"id":"1509.06584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-22T13:06:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4ad20ff54669964f09d1f7c68e2b697c6d02311404ec5c0173793d87af1f46b3","abstract_canon_sha256":"aa1e7667a8f2b85572b8b800feba7792dfaedf4ff215774df9851224ccec80ef"},"schema_version":"1.0"},"canonical_sha256":"cffedbe4e47244af6677343461b078eeefa64350876514690a07299e8af0e4bc","source":{"kind":"arxiv","id":"1509.06584","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Z77NXZHEOJCK6ZTXGQ2GDMDY53","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-22T13:06:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4ad20ff54669964f09d1f7c68e2b697c6d02311404ec5c0173793d87af1f46b3","abstract_canon_sha256":"aa1e7667a8f2b85572b8b800feba7792dfaedf4ff215774df9851224ccec80ef"},"schema_version":"1.0"},"canonical_sha256":"cffedbe4e47244af6677343461b078eeefa64350876514690a07299e8af0e4bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:19.841880Z","signature_b64":"IGsUI6vieS+7SBbbNQL9O3OvWv8liEnT+xGCx22F0J4xIYSWwM1Z8TlpiPG34/AhJiVRukzdUHdvBXHlYIyNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cffedbe4e47244af6677343461b078eeefa64350876514690a07299e8af0e4bc","last_reissued_at":"2026-05-18T01:32:19.841212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:19.841212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06584","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-18T01:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3j+d0xlOUDFAHtbF3P/6QBQaMoJiQtVDN0gYYmSw13EJB3zzoBAG/A9PYusOvNI+NuQ2BIfQzda8sTi2tg+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:36.515548Z"},"content_sha256":"f84cf7b9d99464d7470667faf722a1d82b6daf1f031fe944a13d00f604b36990","schema_version":"1.0","event_id":"sha256:f84cf7b9d99464d7470667faf722a1d82b6daf1f031fe944a13d00f604b36990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Z77NXZHEOJCK6ZTXGQ2GDMDY53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"Feng Ye, Hongwei Liu, Rui Diao, Ya-Feng Liu","submitted_at":"2015-09-22T13:06:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06584","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-18T01:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73f2FeOF7v0wcKSx9Qs52MtrHdokwxm4xqJW7Zqyh0mhdA7SVlINobInbdHpLt7Pq84AXx0T6rEQKeKOo/A+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:36.516236Z"},"content_sha256":"d92f7a10baa02aaa63ed8b8f13a002e0aafa6c40a165bf6889764dcf7a6b49c9","schema_version":"1.0","event_id":"sha256:d92f7a10baa02aaa63ed8b8f13a002e0aafa6c40a165bf6889764dcf7a6b49c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/bundle.json","state_url":"https://pith.science/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/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-26T01:10:36Z","links":{"resolver":"https://pith.science/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53","bundle":"https://pith.science/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/bundle.json","state":"https://pith.science/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z77NXZHEOJCK6ZTXGQ2GDMDY53/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hV4cqeeT0S3xl0xEuXbAtFJYm9iFWZoLqteM2a/rShYBJE2recV+OXuk6lXWVvIK6nb8ZvZbMzOvdv7mi2OoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:10:36.519804Z","bundle_sha256":"7cf14f26d44007cfbc6f54a816f2d0f3380fd84f01e25ea5905dde06032b330c"}}