{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T3K6PMB7JJX5M3NEOPJFDLNB7V","short_pith_number":"pith:T3K6PMB7","canonical_record":{"source":{"id":"1402.2786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-02-12T11:05:03Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"59daeed0dfd638ce5734266d802baa4894bec36ccf33c54ae3b5eaf548cd9ba9","abstract_canon_sha256":"5a07fa93f541da8ebf74291f2d3ceed968a2c6265fc46b304079b00d068f91ab"},"schema_version":"1.0"},"canonical_sha256":"9ed5e7b03f4a6fd66da473d251ada1fd79c9c95526854f29173e2577df2c4466","source":{"kind":"arxiv","id":"1402.2786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2786","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2786v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2786","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"T3K6PMB7JJX5","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T3K6PMB7JJX5M3NE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T3K6PMB7","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T3K6PMB7JJX5M3NEOPJFDLNB7V","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-02-12T11:05:03Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"59daeed0dfd638ce5734266d802baa4894bec36ccf33c54ae3b5eaf548cd9ba9","abstract_canon_sha256":"5a07fa93f541da8ebf74291f2d3ceed968a2c6265fc46b304079b00d068f91ab"},"schema_version":"1.0"},"canonical_sha256":"9ed5e7b03f4a6fd66da473d251ada1fd79c9c95526854f29173e2577df2c4466","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.311690Z","signature_b64":"FAoQCskTyToplNEDCXRIAhF+DS6O+WzK62b0BdQi5QL1kEi5HJChxN0XxO8ao2rpU+zzzcKznT/mk0C/rxyqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed5e7b03f4a6fd66da473d251ada1fd79c9c95526854f29173e2577df2c4466","last_reissued_at":"2026-05-18T02:59:17.310993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.310993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2786","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-18T02:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acBAfbMmusgyJ6k5LpQnO1XgEBqlc8gQ7C+PYTvNEo4aG+zJGcRlX+6ZbEv+ZffVZTP5Fm9IQSJxQJBnCg5pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:09.467603Z"},"content_sha256":"41b555fb8b179fa560ec373c63a1e20033c53302372f3b2663894099776e3279","schema_version":"1.0","event_id":"sha256:41b555fb8b179fa560ec373c63a1e20033c53302372f3b2663894099776e3279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T3K6PMB7JJX5M3NEOPJFDLNB7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The deepest point for distributions in infinite dimensional spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Anirvan Chakraborty, India), Kolkata, Probal Chaudhuri (Indian Statistical Institute","submitted_at":"2014-02-12T11:05:03Z","abstract_excerpt":"Identification of the center of a data cloud is one of the basic problems in statistics. One popular choice for such a center is the median, and several versions of median in finite dimensional spaces have been studied in the literature. In particular, medians based on different notions of data depth have been extensively studied by many researchers, who defined median as the point, where the depth function attains its maximum value. In other words, the median is the deepest point in the sample space according to that definition. In this paper, we investigate the deepest point for probability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2786","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-18T02:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bLjCzY7BX9+15j5UHF0RZG/U/152Ex4ra7U9HwHbG+5RBKfLBftNDDmXyDnbmBAnVckl857I4TmZiDvOne3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:09.468341Z"},"content_sha256":"92691573ea6399866a79002277b879fbfc1aac03427a5a607501f0b5a271dd82","schema_version":"1.0","event_id":"sha256:92691573ea6399866a79002277b879fbfc1aac03427a5a607501f0b5a271dd82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/bundle.json","state_url":"https://pith.science/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/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-28T20:29:09Z","links":{"resolver":"https://pith.science/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V","bundle":"https://pith.science/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/bundle.json","state":"https://pith.science/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3K6PMB7JJX5M3NEOPJFDLNB7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T3K6PMB7JJX5M3NEOPJFDLNB7V","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":"5a07fa93f541da8ebf74291f2d3ceed968a2c6265fc46b304079b00d068f91ab","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-02-12T11:05:03Z","title_canon_sha256":"59daeed0dfd638ce5734266d802baa4894bec36ccf33c54ae3b5eaf548cd9ba9"},"schema_version":"1.0","source":{"id":"1402.2786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2786","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2786v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2786","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"T3K6PMB7JJX5","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T3K6PMB7JJX5M3NE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T3K6PMB7","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:92691573ea6399866a79002277b879fbfc1aac03427a5a607501f0b5a271dd82","target":"graph","created_at":"2026-05-18T02:59:17Z","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":"Identification of the center of a data cloud is one of the basic problems in statistics. One popular choice for such a center is the median, and several versions of median in finite dimensional spaces have been studied in the literature. In particular, medians based on different notions of data depth have been extensively studied by many researchers, who defined median as the point, where the depth function attains its maximum value. In other words, the median is the deepest point in the sample space according to that definition. In this paper, we investigate the deepest point for probability ","authors_text":"Anirvan Chakraborty, India), Kolkata, Probal Chaudhuri (Indian Statistical Institute","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-02-12T11:05:03Z","title":"The deepest point for distributions in infinite dimensional spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2786","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:41b555fb8b179fa560ec373c63a1e20033c53302372f3b2663894099776e3279","target":"record","created_at":"2026-05-18T02:59:17Z","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":"5a07fa93f541da8ebf74291f2d3ceed968a2c6265fc46b304079b00d068f91ab","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-02-12T11:05:03Z","title_canon_sha256":"59daeed0dfd638ce5734266d802baa4894bec36ccf33c54ae3b5eaf548cd9ba9"},"schema_version":"1.0","source":{"id":"1402.2786","kind":"arxiv","version":1}},"canonical_sha256":"9ed5e7b03f4a6fd66da473d251ada1fd79c9c95526854f29173e2577df2c4466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed5e7b03f4a6fd66da473d251ada1fd79c9c95526854f29173e2577df2c4466","first_computed_at":"2026-05-18T02:59:17.310993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:17.310993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FAoQCskTyToplNEDCXRIAhF+DS6O+WzK62b0BdQi5QL1kEi5HJChxN0XxO8ao2rpU+zzzcKznT/mk0C/rxyqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:17.311690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41b555fb8b179fa560ec373c63a1e20033c53302372f3b2663894099776e3279","sha256:92691573ea6399866a79002277b879fbfc1aac03427a5a607501f0b5a271dd82"],"state_sha256":"687bc1af69922f1f77067caed727d19d5ce28191a1f0a99879b1ca749e9d9f51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiOhvALc57qA/r2zFv4Xf2dXD4otdfMBarRm3vF3KBzQu26JNGyLXGDTTXHTIP7+suKZ680P9dptVikI/BZXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:29:09.471911Z","bundle_sha256":"264b6920322194c2314c62382097c41d012f1e06bcefc2c7ba3254e66fae9b8e"}}