{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2QWXCQ5PIL33QDJMOOF7222TPW","short_pith_number":"pith:2QWXCQ5P","canonical_record":{"source":{"id":"1608.04109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-14T14:44:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2eea2572aaafb1a49ca7b361ecfdae5dae9c81cf7d840e5cdfe3c2a0c713a64b","abstract_canon_sha256":"d425ffdc046be73d451fb93dbdb5008721a2b52e80cfbe746a73a4d75a7f6ac0"},"schema_version":"1.0"},"canonical_sha256":"d42d7143af42f7b80d2c738bfd6b537d94b4badacacb4bccb9b0390630c633fd","source":{"kind":"arxiv","id":"1608.04109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04109","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04109v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04109","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"2QWXCQ5PIL33","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QWXCQ5PIL33QDJM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QWXCQ5P","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2QWXCQ5PIL33QDJMOOF7222TPW","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-14T14:44:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2eea2572aaafb1a49ca7b361ecfdae5dae9c81cf7d840e5cdfe3c2a0c713a64b","abstract_canon_sha256":"d425ffdc046be73d451fb93dbdb5008721a2b52e80cfbe746a73a4d75a7f6ac0"},"schema_version":"1.0"},"canonical_sha256":"d42d7143af42f7b80d2c738bfd6b537d94b4badacacb4bccb9b0390630c633fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:04.237097Z","signature_b64":"nuxm+XWYdw85w0iUzrZ0HhPqfMbfXy1t0Ha/TdcS7OtekWMWH5fma+KLTuUTG1Mxq731pfTKYU7ij7EPlgk9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42d7143af42f7b80d2c738bfd6b537d94b4badacacb4bccb9b0390630c633fd","last_reissued_at":"2026-05-18T01:09:04.236643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:04.236643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04109","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:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJyMofbdpphxksi9Qb6TX6nB50STqIQukA+g8SZLJAeWNFp/on9tGSHKSjmfeX4jDnrgqRzWkT1yaaGRXQXeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:48:04.122639Z"},"content_sha256":"d8b3586f7b1b9e315ecb73245e07ade347155691d1f143985e7cbabaf9332e79","schema_version":"1.0","event_id":"sha256:d8b3586f7b1b9e315ecb73245e07ade347155691d1f143985e7cbabaf9332e79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2QWXCQ5PIL33QDJMOOF7222TPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth and depth-based classification with R-package ddalpha","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Oleksii Pokotylo, Pavlo Mozharovskyi, Rainer Dyckerhoff","submitted_at":"2016-08-14T14:44:17Z","abstract_excerpt":"Following the seminal idea of Tukey, data depth is a function that measures how close an arbitrary point of the space is located to an implicitly defined center of a data cloud. Having undergone theoretical and computational developments, it is now employed in numerous applications with classification being the most popular one. The R-package ddalpha is a software directed to fuse experience of the applicant with recent achievements in the area of data depth and depth-based classification.\n  ddalpha provides an implementation for exact and approximate computation of most reasonable and widely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04109","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:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h508OyHtQCjwHXvEZPGEF06Wg1JvW2+ijawriYz8V4APiYu8aQqK0bzVi83GNU5oPxzbLA9yJn8Mbhjf3oi2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:48:04.123393Z"},"content_sha256":"4e9359658d16b5fefdc005e49867cc13f758f2f7b726560751485809d14df25f","schema_version":"1.0","event_id":"sha256:4e9359658d16b5fefdc005e49867cc13f758f2f7b726560751485809d14df25f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QWXCQ5PIL33QDJMOOF7222TPW/bundle.json","state_url":"https://pith.science/pith/2QWXCQ5PIL33QDJMOOF7222TPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QWXCQ5PIL33QDJMOOF7222TPW/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-31T06:48:04Z","links":{"resolver":"https://pith.science/pith/2QWXCQ5PIL33QDJMOOF7222TPW","bundle":"https://pith.science/pith/2QWXCQ5PIL33QDJMOOF7222TPW/bundle.json","state":"https://pith.science/pith/2QWXCQ5PIL33QDJMOOF7222TPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QWXCQ5PIL33QDJMOOF7222TPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2QWXCQ5PIL33QDJMOOF7222TPW","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":"d425ffdc046be73d451fb93dbdb5008721a2b52e80cfbe746a73a4d75a7f6ac0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-14T14:44:17Z","title_canon_sha256":"2eea2572aaafb1a49ca7b361ecfdae5dae9c81cf7d840e5cdfe3c2a0c713a64b"},"schema_version":"1.0","source":{"id":"1608.04109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04109","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04109v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04109","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"2QWXCQ5PIL33","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QWXCQ5PIL33QDJM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QWXCQ5P","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:4e9359658d16b5fefdc005e49867cc13f758f2f7b726560751485809d14df25f","target":"graph","created_at":"2026-05-18T01:09:04Z","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":"Following the seminal idea of Tukey, data depth is a function that measures how close an arbitrary point of the space is located to an implicitly defined center of a data cloud. Having undergone theoretical and computational developments, it is now employed in numerous applications with classification being the most popular one. The R-package ddalpha is a software directed to fuse experience of the applicant with recent achievements in the area of data depth and depth-based classification.\n  ddalpha provides an implementation for exact and approximate computation of most reasonable and widely ","authors_text":"Oleksii Pokotylo, Pavlo Mozharovskyi, Rainer Dyckerhoff","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-14T14:44:17Z","title":"Depth and depth-based classification with R-package ddalpha"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04109","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:d8b3586f7b1b9e315ecb73245e07ade347155691d1f143985e7cbabaf9332e79","target":"record","created_at":"2026-05-18T01:09:04Z","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":"d425ffdc046be73d451fb93dbdb5008721a2b52e80cfbe746a73a4d75a7f6ac0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-14T14:44:17Z","title_canon_sha256":"2eea2572aaafb1a49ca7b361ecfdae5dae9c81cf7d840e5cdfe3c2a0c713a64b"},"schema_version":"1.0","source":{"id":"1608.04109","kind":"arxiv","version":1}},"canonical_sha256":"d42d7143af42f7b80d2c738bfd6b537d94b4badacacb4bccb9b0390630c633fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42d7143af42f7b80d2c738bfd6b537d94b4badacacb4bccb9b0390630c633fd","first_computed_at":"2026-05-18T01:09:04.236643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:04.236643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nuxm+XWYdw85w0iUzrZ0HhPqfMbfXy1t0Ha/TdcS7OtekWMWH5fma+KLTuUTG1Mxq731pfTKYU7ij7EPlgk9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:04.237097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b3586f7b1b9e315ecb73245e07ade347155691d1f143985e7cbabaf9332e79","sha256:4e9359658d16b5fefdc005e49867cc13f758f2f7b726560751485809d14df25f"],"state_sha256":"1ef5504aacd40c12fd212736833ba9b021928e5b9c7b92c957b9c5ff75df5944"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVjxznLvWWMdB1kWnpDFnHavALn8uhOT/GjA0405PfECIfRNY9rcXEWGXIOPNFzTh1H588m6wugjJCrRKdV2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:48:04.127951Z","bundle_sha256":"b287c212ab71ad50ccbb3c5dd9a0321b26c8944778d2bace2c58c18a152a37fd"}}