{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LFDNTXUPXXV332N7SYXH5HN55E","short_pith_number":"pith:LFDNTXUP","canonical_record":{"source":{"id":"1402.5565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-23T00:26:48Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"82e7fc3fdc079319fb33e9649193ae61b2011e99d57dad14ff8643e6c81529ae","abstract_canon_sha256":"00d24f7598046dacbbf35a8bc04729becb50aaa7f812cf8c1edc39ddb4ee4c05"},"schema_version":"1.0"},"canonical_sha256":"5946d9de8fbdebbde9bf962e7e9dbde90b9d99acd6aa1c1eabaefd67cfaf4392","source":{"kind":"arxiv","id":"1402.5565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5565","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5565v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5565","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"LFDNTXUPXXV3","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFDNTXUPXXV332N7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFDNTXUP","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LFDNTXUPXXV332N7SYXH5HN55E","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-23T00:26:48Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"82e7fc3fdc079319fb33e9649193ae61b2011e99d57dad14ff8643e6c81529ae","abstract_canon_sha256":"00d24f7598046dacbbf35a8bc04729becb50aaa7f812cf8c1edc39ddb4ee4c05"},"schema_version":"1.0"},"canonical_sha256":"5946d9de8fbdebbde9bf962e7e9dbde90b9d99acd6aa1c1eabaefd67cfaf4392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:14.510053Z","signature_b64":"popUyxJjJXBwNCAG9pShUbTO2oKgNCTV22V2Y+w63BUxU6wdlM+5mDRC/r6d7/6yYdcsZjHcSBbMcprThuOjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5946d9de8fbdebbde9bf962e7e9dbde90b9d99acd6aa1c1eabaefd67cfaf4392","last_reissued_at":"2026-05-18T02:58:14.509402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:14.509402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5565","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gryy7MjYWBRkkvGRvpX+xKh/qLF6ceSlpgajM4M+aRPGGFWEfMt9NyqNtWp8WB5zVOnY2Mdf0ZnhSG//cM76BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:40:47.495941Z"},"content_sha256":"c949ba14b2b7a6b327b0b86eca65260536678476d6f8c08c4dbd19052f4e943b","schema_version":"1.0","event_id":"sha256:c949ba14b2b7a6b327b0b86eca65260536678476d6f8c08c4dbd19052f4e943b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LFDNTXUPXXV332N7SYXH5HN55E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Nonlinear Distance Metric Learning via Forests of Max-Margin Cluster Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Caiming Xiong, David M. Johnson, Jason J. Corso","submitted_at":"2014-02-23T00:26:48Z","abstract_excerpt":"Metric learning is a key problem for many data mining and machine learning applications, and has long been dominated by Mahalanobis methods. Recent advances in nonlinear metric learning have demonstrated the potential power of non-Mahalanobis distance functions, particularly tree-based functions. We propose a novel nonlinear metric learning method that uses an iterative, hierarchical variant of semi-supervised max-margin clustering to construct a forest of cluster hierarchies, where each individual hierarchy can be interpreted as a weak metric over the data. By introducing randomness during hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5565","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic6Ygu0cAR+qaz/f/dEOd0UhaKng2jeBeTFVdqFzL4jR5RZpysO4mWP2JoO471OqpjzcDtOGgzfDV80svBbZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:40:47.496283Z"},"content_sha256":"d212de97a1ed07332d1176ad8a68e5a9dcc8096be8830774bbb24cc4d2ad3a07","schema_version":"1.0","event_id":"sha256:d212de97a1ed07332d1176ad8a68e5a9dcc8096be8830774bbb24cc4d2ad3a07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFDNTXUPXXV332N7SYXH5HN55E/bundle.json","state_url":"https://pith.science/pith/LFDNTXUPXXV332N7SYXH5HN55E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFDNTXUPXXV332N7SYXH5HN55E/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-28T01:40:47Z","links":{"resolver":"https://pith.science/pith/LFDNTXUPXXV332N7SYXH5HN55E","bundle":"https://pith.science/pith/LFDNTXUPXXV332N7SYXH5HN55E/bundle.json","state":"https://pith.science/pith/LFDNTXUPXXV332N7SYXH5HN55E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFDNTXUPXXV332N7SYXH5HN55E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LFDNTXUPXXV332N7SYXH5HN55E","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":"00d24f7598046dacbbf35a8bc04729becb50aaa7f812cf8c1edc39ddb4ee4c05","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-23T00:26:48Z","title_canon_sha256":"82e7fc3fdc079319fb33e9649193ae61b2011e99d57dad14ff8643e6c81529ae"},"schema_version":"1.0","source":{"id":"1402.5565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5565","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5565v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5565","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"LFDNTXUPXXV3","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFDNTXUPXXV332N7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFDNTXUP","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:d212de97a1ed07332d1176ad8a68e5a9dcc8096be8830774bbb24cc4d2ad3a07","target":"graph","created_at":"2026-05-18T02:58:14Z","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":"Metric learning is a key problem for many data mining and machine learning applications, and has long been dominated by Mahalanobis methods. Recent advances in nonlinear metric learning have demonstrated the potential power of non-Mahalanobis distance functions, particularly tree-based functions. We propose a novel nonlinear metric learning method that uses an iterative, hierarchical variant of semi-supervised max-margin clustering to construct a forest of cluster hierarchies, where each individual hierarchy can be interpreted as a weak metric over the data. By introducing randomness during hi","authors_text":"Caiming Xiong, David M. Johnson, Jason J. Corso","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-23T00:26:48Z","title":"Semi-Supervised Nonlinear Distance Metric Learning via Forests of Max-Margin Cluster Hierarchies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5565","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:c949ba14b2b7a6b327b0b86eca65260536678476d6f8c08c4dbd19052f4e943b","target":"record","created_at":"2026-05-18T02:58:14Z","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":"00d24f7598046dacbbf35a8bc04729becb50aaa7f812cf8c1edc39ddb4ee4c05","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-23T00:26:48Z","title_canon_sha256":"82e7fc3fdc079319fb33e9649193ae61b2011e99d57dad14ff8643e6c81529ae"},"schema_version":"1.0","source":{"id":"1402.5565","kind":"arxiv","version":1}},"canonical_sha256":"5946d9de8fbdebbde9bf962e7e9dbde90b9d99acd6aa1c1eabaefd67cfaf4392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5946d9de8fbdebbde9bf962e7e9dbde90b9d99acd6aa1c1eabaefd67cfaf4392","first_computed_at":"2026-05-18T02:58:14.509402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:14.509402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"popUyxJjJXBwNCAG9pShUbTO2oKgNCTV22V2Y+w63BUxU6wdlM+5mDRC/r6d7/6yYdcsZjHcSBbMcprThuOjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:14.510053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c949ba14b2b7a6b327b0b86eca65260536678476d6f8c08c4dbd19052f4e943b","sha256:d212de97a1ed07332d1176ad8a68e5a9dcc8096be8830774bbb24cc4d2ad3a07"],"state_sha256":"27b2068d4bdfb6ff7ff3ad593572ed3046e27c23cbcc8d32ba821b27a7ab6554"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+R2Ys7z9PSwgD4778CYsarSPvn9deVA2wvvCggWs9+Wlv+oWvRpt2nt3DQjUZ31BggylGlD7+bY7InhhzqP1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:40:47.498240Z","bundle_sha256":"f1cce8df984645483ff2e5397c9b1ebc38d159fb47015f162300018ab6922084"}}