{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GVNELLQLJC7YB534CGVOQNDYP6","short_pith_number":"pith:GVNELLQL","canonical_record":{"source":{"id":"1902.10966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-28T09:22:46Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"29e0a293d7b4b50387f969ca8be5ddd09c045937527748816fe06460ec849468","abstract_canon_sha256":"39be0d4fe5ebaabf9a40af70b9e24e72a39cfdd76e8580d6930a9111056c2a4d"},"schema_version":"1.0"},"canonical_sha256":"355a45ae0b48bf80f77c11aae834787f926929d73a11310c0428adb42de8be75","source":{"kind":"arxiv","id":"1902.10966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10966","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10966v1","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10966","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"GVNELLQLJC7Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVNELLQLJC7YB534","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVNELLQL","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GVNELLQLJC7YB534CGVOQNDYP6","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-28T09:22:46Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"29e0a293d7b4b50387f969ca8be5ddd09c045937527748816fe06460ec849468","abstract_canon_sha256":"39be0d4fe5ebaabf9a40af70b9e24e72a39cfdd76e8580d6930a9111056c2a4d"},"schema_version":"1.0"},"canonical_sha256":"355a45ae0b48bf80f77c11aae834787f926929d73a11310c0428adb42de8be75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:21.240561Z","signature_b64":"tFxjEE7I9evefAkrrVY1s+GCTXuEJtupmVXe4/L73bJ8fsGeKPRfYUH3MJsm1Fxdyd11wHpCs9oFh6dzHm8MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"355a45ae0b48bf80f77c11aae834787f926929d73a11310c0428adb42de8be75","last_reissued_at":"2026-05-17T23:52:21.239844Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:21.239844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10966","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-17T23:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyegnhzkjlYBOz8Cdrzn30YJgCgyIHKl42MPQg2fNmh7bd2OWKH5f6iS54iCcNaDyO0fyEcihTWJvKEtZRanBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:12:12.551598Z"},"content_sha256":"904b1f7e9bd8e59daa0546b2c035f9014c2c3093160b505a9281abc78f7a3f95","schema_version":"1.0","event_id":"sha256:904b1f7e9bd8e59daa0546b2c035f9014c2c3093160b505a9281abc78f7a3f95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GVNELLQLJC7YB534CGVOQNDYP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic smallest enclosing ball in high dimensions via subgradient sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CG","authors_text":"Alexander Munteanu, Amer Krivo\\v{s}ija","submitted_at":"2019-02-28T09:22:46Z","abstract_excerpt":"We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is to improve the previously best algorithm for the pSEB problem by reducing its exponential dependence on the dimension to linear. This is achieved via a novel combination of sampling techniques for clustering problems in metric spaces with the framework of stochastic subgradient descent. As a result, the algorithm becomes applicable to shape fitting problems i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10966","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-17T23:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GacYc8A5AsKE9nOLTCOGv9XxeOgEOtiK7bMpYmtd35YgqGu21lewWCW5RSYNt3wOomMAiuoNIYicVoii2RkyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:12:12.552260Z"},"content_sha256":"1f3a0bc9c0cef74630cc1fde0d45feab079061c01d963a5fcb57d8dd63103912","schema_version":"1.0","event_id":"sha256:1f3a0bc9c0cef74630cc1fde0d45feab079061c01d963a5fcb57d8dd63103912"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVNELLQLJC7YB534CGVOQNDYP6/bundle.json","state_url":"https://pith.science/pith/GVNELLQLJC7YB534CGVOQNDYP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVNELLQLJC7YB534CGVOQNDYP6/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-06-09T22:12:12Z","links":{"resolver":"https://pith.science/pith/GVNELLQLJC7YB534CGVOQNDYP6","bundle":"https://pith.science/pith/GVNELLQLJC7YB534CGVOQNDYP6/bundle.json","state":"https://pith.science/pith/GVNELLQLJC7YB534CGVOQNDYP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVNELLQLJC7YB534CGVOQNDYP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GVNELLQLJC7YB534CGVOQNDYP6","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":"39be0d4fe5ebaabf9a40af70b9e24e72a39cfdd76e8580d6930a9111056c2a4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-28T09:22:46Z","title_canon_sha256":"29e0a293d7b4b50387f969ca8be5ddd09c045937527748816fe06460ec849468"},"schema_version":"1.0","source":{"id":"1902.10966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10966","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10966v1","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10966","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"GVNELLQLJC7Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVNELLQLJC7YB534","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVNELLQL","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:1f3a0bc9c0cef74630cc1fde0d45feab079061c01d963a5fcb57d8dd63103912","target":"graph","created_at":"2026-05-17T23:52:21Z","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":"We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is to improve the previously best algorithm for the pSEB problem by reducing its exponential dependence on the dimension to linear. This is achieved via a novel combination of sampling techniques for clustering problems in metric spaces with the framework of stochastic subgradient descent. As a result, the algorithm becomes applicable to shape fitting problems i","authors_text":"Alexander Munteanu, Amer Krivo\\v{s}ija","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-28T09:22:46Z","title":"Probabilistic smallest enclosing ball in high dimensions via subgradient sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10966","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:904b1f7e9bd8e59daa0546b2c035f9014c2c3093160b505a9281abc78f7a3f95","target":"record","created_at":"2026-05-17T23:52:21Z","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":"39be0d4fe5ebaabf9a40af70b9e24e72a39cfdd76e8580d6930a9111056c2a4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-28T09:22:46Z","title_canon_sha256":"29e0a293d7b4b50387f969ca8be5ddd09c045937527748816fe06460ec849468"},"schema_version":"1.0","source":{"id":"1902.10966","kind":"arxiv","version":1}},"canonical_sha256":"355a45ae0b48bf80f77c11aae834787f926929d73a11310c0428adb42de8be75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"355a45ae0b48bf80f77c11aae834787f926929d73a11310c0428adb42de8be75","first_computed_at":"2026-05-17T23:52:21.239844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:21.239844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFxjEE7I9evefAkrrVY1s+GCTXuEJtupmVXe4/L73bJ8fsGeKPRfYUH3MJsm1Fxdyd11wHpCs9oFh6dzHm8MBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:21.240561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904b1f7e9bd8e59daa0546b2c035f9014c2c3093160b505a9281abc78f7a3f95","sha256:1f3a0bc9c0cef74630cc1fde0d45feab079061c01d963a5fcb57d8dd63103912"],"state_sha256":"500e9e3c6bc7c7cf70ef2341b4785d50ebd4c647a295c90978240828fcb39b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fouruogUCQ0jnM58bEuAuBgV4Q24vFRAOJZEYXdsvYfQ2rQmqaYMVn0JxTSYvvZVRbQ0ZIXB4IPwSgTs9eItBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:12:12.556035Z","bundle_sha256":"ef666067ff5de761218dd211a9bf1f384812c2c89ae1a834bc719f1756a5e9b0"}}