{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WXJ256YB4M4MP2NXF5AVMLUX7J","short_pith_number":"pith:WXJ256YB","canonical_record":{"source":{"id":"1505.02729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-11T18:55:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"cc9dfdf2fff7a786560d90b74d386eb9639b4814522cead46889192ba811f5fd","abstract_canon_sha256":"23030e1cbabdb516df2ca71c23019c5942c3ba146d691f3332f121727a0c62f0"},"schema_version":"1.0"},"canonical_sha256":"b5d3aefb01e338c7e9b72f41562e97fa5f82e36b9016c38401b8ce955cb736e3","source":{"kind":"arxiv","id":"1505.02729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02729","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02729v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02729","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"WXJ256YB4M4M","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXJ256YB4M4MP2NX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXJ256YB","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WXJ256YB4M4MP2NXF5AVMLUX7J","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-11T18:55:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"cc9dfdf2fff7a786560d90b74d386eb9639b4814522cead46889192ba811f5fd","abstract_canon_sha256":"23030e1cbabdb516df2ca71c23019c5942c3ba146d691f3332f121727a0c62f0"},"schema_version":"1.0"},"canonical_sha256":"b5d3aefb01e338c7e9b72f41562e97fa5f82e36b9016c38401b8ce955cb736e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:11.753366Z","signature_b64":"3iNllU2soYXIwwn9Fq6UJC2iUtyPCLEABVz2ybW++7ksWgwOkobDJ9A4ivroRG7vxlBCQPLhRuI3Kt/+sQpRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5d3aefb01e338c7e9b72f41562e97fa5f82e36b9016c38401b8ce955cb736e3","last_reissued_at":"2026-05-18T02:16:11.752794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:11.752794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02729","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:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63BsNZyJRdzkCOW2oSf7IZPUH02sXhCFiKE0uxXRNW8hPUUX9xwZcvmC3jBXj/OwlYtJpBDuiH9ZXRa0cqejBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:12:34.673648Z"},"content_sha256":"2e8a95e55d387830e260f7971e20f3aaecd49bef115abd1cd5b44b9b447a039d","schema_version":"1.0","event_id":"sha256:2e8a95e55d387830e260f7971e20f3aaecd49bef115abd1cd5b44b9b447a039d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WXJ256YB4M4MP2NXF5AVMLUX7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample complexity of learning Mahalanobis distance metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kristin Branson, Nakul Verma","submitted_at":"2015-05-11T18:55:42Z","abstract_excerpt":"Metric learning seeks a transformation of the feature space that enhances prediction quality for the given task at hand. In this work we provide PAC-style sample complexity rates for supervised metric learning. We give matching lower- and upper-bounds showing that the sample complexity scales with the representation dimension when no assumptions are made about the underlying data distribution. However, by leveraging the structure of the data distribution, we show that one can achieve rates that are fine-tuned to a specific notion of intrinsic complexity for a given dataset. Our analysis reveal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02729","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:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYu3DA1vrn4Pp4ajxBtztDsiNNqYL2G9hVuse2OhsE6G6C0Vy35YY7d1Ts4b/WPxdLIQNsp3flDC3MlhFNpMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:12:34.674002Z"},"content_sha256":"79dd37b39d75c9b4ad89165dda3dd5bce0930210a5accc66db9e0d55f9cc6c82","schema_version":"1.0","event_id":"sha256:79dd37b39d75c9b4ad89165dda3dd5bce0930210a5accc66db9e0d55f9cc6c82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/bundle.json","state_url":"https://pith.science/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/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-06-02T01:12:34Z","links":{"resolver":"https://pith.science/pith/WXJ256YB4M4MP2NXF5AVMLUX7J","bundle":"https://pith.science/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/bundle.json","state":"https://pith.science/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXJ256YB4M4MP2NXF5AVMLUX7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WXJ256YB4M4MP2NXF5AVMLUX7J","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":"23030e1cbabdb516df2ca71c23019c5942c3ba146d691f3332f121727a0c62f0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-11T18:55:42Z","title_canon_sha256":"cc9dfdf2fff7a786560d90b74d386eb9639b4814522cead46889192ba811f5fd"},"schema_version":"1.0","source":{"id":"1505.02729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02729","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02729v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02729","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"WXJ256YB4M4M","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXJ256YB4M4MP2NX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXJ256YB","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:79dd37b39d75c9b4ad89165dda3dd5bce0930210a5accc66db9e0d55f9cc6c82","target":"graph","created_at":"2026-05-18T02:16:11Z","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 seeks a transformation of the feature space that enhances prediction quality for the given task at hand. In this work we provide PAC-style sample complexity rates for supervised metric learning. We give matching lower- and upper-bounds showing that the sample complexity scales with the representation dimension when no assumptions are made about the underlying data distribution. However, by leveraging the structure of the data distribution, we show that one can achieve rates that are fine-tuned to a specific notion of intrinsic complexity for a given dataset. Our analysis reveal","authors_text":"Kristin Branson, Nakul Verma","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-11T18:55:42Z","title":"Sample complexity of learning Mahalanobis distance metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02729","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:2e8a95e55d387830e260f7971e20f3aaecd49bef115abd1cd5b44b9b447a039d","target":"record","created_at":"2026-05-18T02:16:11Z","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":"23030e1cbabdb516df2ca71c23019c5942c3ba146d691f3332f121727a0c62f0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-11T18:55:42Z","title_canon_sha256":"cc9dfdf2fff7a786560d90b74d386eb9639b4814522cead46889192ba811f5fd"},"schema_version":"1.0","source":{"id":"1505.02729","kind":"arxiv","version":1}},"canonical_sha256":"b5d3aefb01e338c7e9b72f41562e97fa5f82e36b9016c38401b8ce955cb736e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5d3aefb01e338c7e9b72f41562e97fa5f82e36b9016c38401b8ce955cb736e3","first_computed_at":"2026-05-18T02:16:11.752794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:11.752794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3iNllU2soYXIwwn9Fq6UJC2iUtyPCLEABVz2ybW++7ksWgwOkobDJ9A4ivroRG7vxlBCQPLhRuI3Kt/+sQpRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:11.753366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e8a95e55d387830e260f7971e20f3aaecd49bef115abd1cd5b44b9b447a039d","sha256:79dd37b39d75c9b4ad89165dda3dd5bce0930210a5accc66db9e0d55f9cc6c82"],"state_sha256":"cc69721da2bab506d34b7056396b03e3123003ebff642eba07727b94509dea2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXFIrsaSYOgT9qhnkqDz7zumYE1RXbRwMAd/JqTh/quoYKp8X7o0Ueo162RPYkTC/4h5MXoEP+GIraiYfgUBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:12:34.675995Z","bundle_sha256":"478a4205707f3da99fb1ab1a7ba9ade2d16981765254089f6e39bfa352fe7079"}}