{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVPZHKLGRXV2U72PQGODROUH5R","short_pith_number":"pith:FVPZHKLG","canonical_record":{"source":{"id":"1806.04808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T00:53:56Z","cross_cats_sorted":["cs.AI","cs.DB","stat.ML"],"title_canon_sha256":"0ff4c909dd639246d9c4326e1b62b868384d4aebfadda0bc86e1be64e7ad0890","abstract_canon_sha256":"b12e9010269c045c98f5b3793602ff02bd59adec517967a2375a6d73b0a61e34"},"schema_version":"1.0"},"canonical_sha256":"2d5f93a9668debaa7f4f819c38ba87ec54b55278c8f09d9e895e1be817c70337","source":{"kind":"arxiv","id":"1806.04808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04808","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04808v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04808","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"FVPZHKLGRXV2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVPZHKLGRXV2U72P","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVPZHKLG","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVPZHKLGRXV2U72PQGODROUH5R","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T00:53:56Z","cross_cats_sorted":["cs.AI","cs.DB","stat.ML"],"title_canon_sha256":"0ff4c909dd639246d9c4326e1b62b868384d4aebfadda0bc86e1be64e7ad0890","abstract_canon_sha256":"b12e9010269c045c98f5b3793602ff02bd59adec517967a2375a6d73b0a61e34"},"schema_version":"1.0"},"canonical_sha256":"2d5f93a9668debaa7f4f819c38ba87ec54b55278c8f09d9e895e1be817c70337","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.837205Z","signature_b64":"4aBaiy7cnu4gFEeoUaYPM0nR0B0JLJnHj4Ac1Vn3BjWBCzCmUdletAT+xMYD8vIhIOwaIjjJTpa8yC/itH+HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d5f93a9668debaa7f4f819c38ba87ec54b55278c8f09d9e895e1be817c70337","last_reissued_at":"2026-05-18T00:13:20.836662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.836662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04808","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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWBDxEW1+ttiZT3nZzaaexaybKzksngYJ7wrkGNspTCbAdxgMghjBroaaqaz3M4byICsa+UK1RXWcaZ6CUc6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:31:20.709070Z"},"content_sha256":"9c035befe24913555273e46878fe7771622b9a0799b2ea0c07f70234ec08f55c","schema_version":"1.0","event_id":"sha256:9c035befe24913555273e46878fe7771622b9a0799b2ea0c07f70234ec08f55c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVPZHKLGRXV2U72PQGODROUH5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Representations of Ultrahigh-dimensional Data for Random Distance-based Outlier Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","stat.ML"],"primary_cat":"cs.LG","authors_text":"Guansong Pang, Huan Liu, Ling Chen, Longbing Cao","submitted_at":"2018-06-13T00:53:56Z","abstract_excerpt":"Learning expressive low-dimensional representations of ultrahigh-dimensional data, e.g., data with thousands/millions of features, has been a major way to enable learning methods to address the curse of dimensionality. However, existing unsupervised representation learning methods mainly focus on preserving the data regularity information and learning the representations independently of subsequent outlier detection methods, which can result in suboptimal and unstable performance of detecting irregularities (i.e., outliers).\n  This paper introduces a ranking model-based framework, called RAMOD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04808","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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVygG78XyfxPIkKszbcJ8iVCxv6EduU/3jCOrnsKgEiuaPrT18kiRKWiQ+WSmSN/FHernxIMNY68sVRs4xXSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:31:20.709740Z"},"content_sha256":"8597f493406d9a2b29d1b7bc25cd02d09bc9732f3e6fb198d41bb758b8ad085a","schema_version":"1.0","event_id":"sha256:8597f493406d9a2b29d1b7bc25cd02d09bc9732f3e6fb198d41bb758b8ad085a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVPZHKLGRXV2U72PQGODROUH5R/bundle.json","state_url":"https://pith.science/pith/FVPZHKLGRXV2U72PQGODROUH5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVPZHKLGRXV2U72PQGODROUH5R/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-31T02:31:20Z","links":{"resolver":"https://pith.science/pith/FVPZHKLGRXV2U72PQGODROUH5R","bundle":"https://pith.science/pith/FVPZHKLGRXV2U72PQGODROUH5R/bundle.json","state":"https://pith.science/pith/FVPZHKLGRXV2U72PQGODROUH5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVPZHKLGRXV2U72PQGODROUH5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVPZHKLGRXV2U72PQGODROUH5R","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":"b12e9010269c045c98f5b3793602ff02bd59adec517967a2375a6d73b0a61e34","cross_cats_sorted":["cs.AI","cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T00:53:56Z","title_canon_sha256":"0ff4c909dd639246d9c4326e1b62b868384d4aebfadda0bc86e1be64e7ad0890"},"schema_version":"1.0","source":{"id":"1806.04808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04808","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04808v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04808","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"FVPZHKLGRXV2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVPZHKLGRXV2U72P","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVPZHKLG","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:8597f493406d9a2b29d1b7bc25cd02d09bc9732f3e6fb198d41bb758b8ad085a","target":"graph","created_at":"2026-05-18T00:13:20Z","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":"Learning expressive low-dimensional representations of ultrahigh-dimensional data, e.g., data with thousands/millions of features, has been a major way to enable learning methods to address the curse of dimensionality. However, existing unsupervised representation learning methods mainly focus on preserving the data regularity information and learning the representations independently of subsequent outlier detection methods, which can result in suboptimal and unstable performance of detecting irregularities (i.e., outliers).\n  This paper introduces a ranking model-based framework, called RAMOD","authors_text":"Guansong Pang, Huan Liu, Ling Chen, Longbing Cao","cross_cats":["cs.AI","cs.DB","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T00:53:56Z","title":"Learning Representations of Ultrahigh-dimensional Data for Random Distance-based Outlier Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04808","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:9c035befe24913555273e46878fe7771622b9a0799b2ea0c07f70234ec08f55c","target":"record","created_at":"2026-05-18T00:13:20Z","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":"b12e9010269c045c98f5b3793602ff02bd59adec517967a2375a6d73b0a61e34","cross_cats_sorted":["cs.AI","cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T00:53:56Z","title_canon_sha256":"0ff4c909dd639246d9c4326e1b62b868384d4aebfadda0bc86e1be64e7ad0890"},"schema_version":"1.0","source":{"id":"1806.04808","kind":"arxiv","version":1}},"canonical_sha256":"2d5f93a9668debaa7f4f819c38ba87ec54b55278c8f09d9e895e1be817c70337","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d5f93a9668debaa7f4f819c38ba87ec54b55278c8f09d9e895e1be817c70337","first_computed_at":"2026-05-18T00:13:20.836662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:20.836662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4aBaiy7cnu4gFEeoUaYPM0nR0B0JLJnHj4Ac1Vn3BjWBCzCmUdletAT+xMYD8vIhIOwaIjjJTpa8yC/itH+HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:20.837205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c035befe24913555273e46878fe7771622b9a0799b2ea0c07f70234ec08f55c","sha256:8597f493406d9a2b29d1b7bc25cd02d09bc9732f3e6fb198d41bb758b8ad085a"],"state_sha256":"e55b7061403211222ee42476688ddcacc8ee21e743c7888542473ba8fd1bef74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrGR+1bHXCsDb16Bl5B6Km9BtLR98AQYAy+pteEGASysQgw/JKPJggc+qsx86z4SvivK3LB6Xr7vm6PdTl8+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:31:20.714276Z","bundle_sha256":"674e63cbe3262ab9eb4bd2cb827faada9d167f28e45c95886094b36b40784073"}}