{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4F4CHLPMYCQN7E5CLG3DNCBT2M","short_pith_number":"pith:4F4CHLPM","canonical_record":{"source":{"id":"1201.0610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-03T11:29:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a146a4045defcade361bc747dcb030f2139e7f9637080e5990302752b7fce477","abstract_canon_sha256":"98f63f274d25408ea8e4b0e6dcbe6dab09a8e51d5c6305ef7322d20e41605e38"},"schema_version":"1.0"},"canonical_sha256":"e17823adecc0a0df93a259b6368833d31737332850ad0db968e6e584ba2fb7b7","source":{"kind":"arxiv","id":"1201.0610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0610","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0610v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0610","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"4F4CHLPMYCQN","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4F4CHLPMYCQN7E5C","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4F4CHLPM","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4F4CHLPMYCQN7E5CLG3DNCBT2M","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-03T11:29:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a146a4045defcade361bc747dcb030f2139e7f9637080e5990302752b7fce477","abstract_canon_sha256":"98f63f274d25408ea8e4b0e6dcbe6dab09a8e51d5c6305ef7322d20e41605e38"},"schema_version":"1.0"},"canonical_sha256":"e17823adecc0a0df93a259b6368833d31737332850ad0db968e6e584ba2fb7b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:17.124056Z","signature_b64":"7n5f1JWRs/PPjYqXlnbYkbM0suBmxW1ZpEy5bu2axh5+rOoNLIOVFYG6bB/tM7oRi5SkEsxIJ+j87OmmbJYzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e17823adecc0a0df93a259b6368833d31737332850ad0db968e6e584ba2fb7b7","last_reissued_at":"2026-05-18T04:05:17.123403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:17.123403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0610","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-18T04:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4Jsf7C+GU6aLdFkZ/GHAhwt/6OGrnoPRjcx4sys3VTiO/EAtCTcwX1JeysgwMQqyXkFBnVBzmKAarbQZOsnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:42.420573Z"},"content_sha256":"c69ef7ffcaacf02d6f8e042030f7896aec9829a2694b4bc1420ba275cbd551de","schema_version":"1.0","event_id":"sha256:c69ef7ffcaacf02d6f8e042030f7896aec9829a2694b4bc1420ba275cbd551de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4F4CHLPMYCQN7E5CLG3DNCBT2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Forests for Metric Learning with Implicit Pairwise Position Dependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Caiming Xiong, David Johnson, Jason J. Corso, Ran Xu","submitted_at":"2012-01-03T11:29:17Z","abstract_excerpt":"Metric learning makes it plausible to learn distances for complex distributions of data from labeled data. However, to date, most metric learning methods are based on a single Mahalanobis metric, which cannot handle heterogeneous data well. Those that learn multiple metrics throughout the space have demonstrated superior accuracy, but at the cost of computational efficiency. Here, we take a new angle to the metric learning problem and learn a single metric that is able to implicitly adapt its distance function throughout the feature space. This metric adaptation is accomplished by using a rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0610","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-18T04:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjgXPOp0zsjx+z0iJB5vMZIWySP1zWp51PFMBxtY8hNBE25uGWJf39XgYwaPhDtzmykSXmWr5hFNR7+J8cZmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:42.421240Z"},"content_sha256":"1e308ae941130c0e218b65071c8a0f21bfa1c8881ddaf22971610c5e5f5d3785","schema_version":"1.0","event_id":"sha256:1e308ae941130c0e218b65071c8a0f21bfa1c8881ddaf22971610c5e5f5d3785"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/bundle.json","state_url":"https://pith.science/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/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-25T18:02:42Z","links":{"resolver":"https://pith.science/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M","bundle":"https://pith.science/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/bundle.json","state":"https://pith.science/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F4CHLPMYCQN7E5CLG3DNCBT2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4F4CHLPMYCQN7E5CLG3DNCBT2M","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":"98f63f274d25408ea8e4b0e6dcbe6dab09a8e51d5c6305ef7322d20e41605e38","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-03T11:29:17Z","title_canon_sha256":"a146a4045defcade361bc747dcb030f2139e7f9637080e5990302752b7fce477"},"schema_version":"1.0","source":{"id":"1201.0610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0610","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0610v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0610","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"4F4CHLPMYCQN","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4F4CHLPMYCQN7E5C","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4F4CHLPM","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:1e308ae941130c0e218b65071c8a0f21bfa1c8881ddaf22971610c5e5f5d3785","target":"graph","created_at":"2026-05-18T04:05: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":"Metric learning makes it plausible to learn distances for complex distributions of data from labeled data. However, to date, most metric learning methods are based on a single Mahalanobis metric, which cannot handle heterogeneous data well. Those that learn multiple metrics throughout the space have demonstrated superior accuracy, but at the cost of computational efficiency. Here, we take a new angle to the metric learning problem and learn a single metric that is able to implicitly adapt its distance function throughout the feature space. This metric adaptation is accomplished by using a rand","authors_text":"Caiming Xiong, David Johnson, Jason J. Corso, Ran Xu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-03T11:29:17Z","title":"Random Forests for Metric Learning with Implicit Pairwise Position Dependence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0610","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:c69ef7ffcaacf02d6f8e042030f7896aec9829a2694b4bc1420ba275cbd551de","target":"record","created_at":"2026-05-18T04:05: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":"98f63f274d25408ea8e4b0e6dcbe6dab09a8e51d5c6305ef7322d20e41605e38","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-03T11:29:17Z","title_canon_sha256":"a146a4045defcade361bc747dcb030f2139e7f9637080e5990302752b7fce477"},"schema_version":"1.0","source":{"id":"1201.0610","kind":"arxiv","version":1}},"canonical_sha256":"e17823adecc0a0df93a259b6368833d31737332850ad0db968e6e584ba2fb7b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e17823adecc0a0df93a259b6368833d31737332850ad0db968e6e584ba2fb7b7","first_computed_at":"2026-05-18T04:05:17.123403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:17.123403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7n5f1JWRs/PPjYqXlnbYkbM0suBmxW1ZpEy5bu2axh5+rOoNLIOVFYG6bB/tM7oRi5SkEsxIJ+j87OmmbJYzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:17.124056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c69ef7ffcaacf02d6f8e042030f7896aec9829a2694b4bc1420ba275cbd551de","sha256:1e308ae941130c0e218b65071c8a0f21bfa1c8881ddaf22971610c5e5f5d3785"],"state_sha256":"ecec265528b7b2cd784bb6a9cb73d4d888a51917132d623cfa2e4f5d624d7eda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+73rI/Lll3dS054psb4P4k/qh+Sq2zQOwi4eM/P42moIBXsc8I6Vo7hNJFchb88ShS+UioOEZiLTByfGbQTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:02:42.425085Z","bundle_sha256":"e34c4675f38b293c5c438106963dbc0285fd4e55e2d537367d1af571b08b0ac6"}}