{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EVMXYPQ67V3OQNGI75WQ57AC2B","short_pith_number":"pith:EVMXYPQ6","canonical_record":{"source":{"id":"1207.5437","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-23T16:20:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d2530ea48d3b6454f5d3d54c9e1582776d371530c4897bcb35ba7c0901b380b3","abstract_canon_sha256":"33b4e9eda8daafebc47a5ad64285d1b19c60acbbd5bb0030e9798358a5176512"},"schema_version":"1.0"},"canonical_sha256":"25597c3e1efd76e834c8ff6d0efc02d04b52d9003fe31a2443ef6940fcd136ed","source":{"kind":"arxiv","id":"1207.5437","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5437","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5437v2","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5437","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"EVMXYPQ67V3O","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EVMXYPQ67V3OQNGI","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EVMXYPQ6","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EVMXYPQ67V3OQNGI75WQ57AC2B","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5437","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-23T16:20:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d2530ea48d3b6454f5d3d54c9e1582776d371530c4897bcb35ba7c0901b380b3","abstract_canon_sha256":"33b4e9eda8daafebc47a5ad64285d1b19c60acbbd5bb0030e9798358a5176512"},"schema_version":"1.0"},"canonical_sha256":"25597c3e1efd76e834c8ff6d0efc02d04b52d9003fe31a2443ef6940fcd136ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:41.967210Z","signature_b64":"zqsy7jO4zT4sbcJmezPLrmcLZ0EmAIwD35Ky9c0NSEG7rtN4j982CoGp+7ex2S/RVGWevALY1OslQeq4/nEuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25597c3e1efd76e834c8ff6d0efc02d04b52d9003fe31a2443ef6940fcd136ed","last_reissued_at":"2026-05-18T03:30:41.966464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:41.966464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5437","source_version":2,"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-18T03:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ36pGvKqShSgxddgQPeL4+nMnvAlHQ6SKw72/Bu+Cj9lzFz4uz29KX1DYEKW18Zj9VWs0G0zo4kxIXEHjM4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:46:50.268580Z"},"content_sha256":"46979632d93b051430c035d60524e54ec11d41de3b915bce3c0ae0c3cc20e4f1","schema_version":"1.0","event_id":"sha256:46979632d93b051430c035d60524e54ec11d41de3b915bce3c0ae0c3cc20e4f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EVMXYPQ67V3OQNGI75WQ57AC2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalization Bounds for Metric and Similarity Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Qiong Cao, Yiming Ying, Zheng-Chu Guo","submitted_at":"2012-07-23T16:20:05Z","abstract_excerpt":"Recently, metric learning and similarity learning have attracted a large amount of interest. Many models and optimisation algorithms have been proposed. However, there is relatively little work on the generalization analysis of such methods. In this paper, we derive novel generalization bounds of metric and similarity learning. In particular, we first show that the generalization analysis reduces to the estimation of the Rademacher average over \"sums-of-i.i.d.\" sample-blocks related to the specific matrix norm. Then, we derive generalization bounds for metric/similarity learning with different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5437","kind":"arxiv","version":2},"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-18T03:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIbppDWFWjUmC0xAgf5LzZiuern/5T2xdNMm/5BBs4+ePPChvNRWQrcbxOPj5ci/Tvp/9u1/62h3BBfvkqJhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:46:50.268936Z"},"content_sha256":"6334fc9ac8c57675db7e1f7958dab128bc565231390f729ce466a1801cf4974f","schema_version":"1.0","event_id":"sha256:6334fc9ac8c57675db7e1f7958dab128bc565231390f729ce466a1801cf4974f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/bundle.json","state_url":"https://pith.science/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/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-04T02:46:50Z","links":{"resolver":"https://pith.science/pith/EVMXYPQ67V3OQNGI75WQ57AC2B","bundle":"https://pith.science/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/bundle.json","state":"https://pith.science/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVMXYPQ67V3OQNGI75WQ57AC2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EVMXYPQ67V3OQNGI75WQ57AC2B","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":"33b4e9eda8daafebc47a5ad64285d1b19c60acbbd5bb0030e9798358a5176512","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-23T16:20:05Z","title_canon_sha256":"d2530ea48d3b6454f5d3d54c9e1582776d371530c4897bcb35ba7c0901b380b3"},"schema_version":"1.0","source":{"id":"1207.5437","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5437","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5437v2","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5437","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"EVMXYPQ67V3O","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EVMXYPQ67V3OQNGI","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EVMXYPQ6","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:6334fc9ac8c57675db7e1f7958dab128bc565231390f729ce466a1801cf4974f","target":"graph","created_at":"2026-05-18T03:30:41Z","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":"Recently, metric learning and similarity learning have attracted a large amount of interest. Many models and optimisation algorithms have been proposed. However, there is relatively little work on the generalization analysis of such methods. In this paper, we derive novel generalization bounds of metric and similarity learning. In particular, we first show that the generalization analysis reduces to the estimation of the Rademacher average over \"sums-of-i.i.d.\" sample-blocks related to the specific matrix norm. Then, we derive generalization bounds for metric/similarity learning with different","authors_text":"Qiong Cao, Yiming Ying, Zheng-Chu Guo","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-23T16:20:05Z","title":"Generalization Bounds for Metric and Similarity Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5437","kind":"arxiv","version":2},"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:46979632d93b051430c035d60524e54ec11d41de3b915bce3c0ae0c3cc20e4f1","target":"record","created_at":"2026-05-18T03:30:41Z","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":"33b4e9eda8daafebc47a5ad64285d1b19c60acbbd5bb0030e9798358a5176512","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-23T16:20:05Z","title_canon_sha256":"d2530ea48d3b6454f5d3d54c9e1582776d371530c4897bcb35ba7c0901b380b3"},"schema_version":"1.0","source":{"id":"1207.5437","kind":"arxiv","version":2}},"canonical_sha256":"25597c3e1efd76e834c8ff6d0efc02d04b52d9003fe31a2443ef6940fcd136ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25597c3e1efd76e834c8ff6d0efc02d04b52d9003fe31a2443ef6940fcd136ed","first_computed_at":"2026-05-18T03:30:41.966464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:41.966464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqsy7jO4zT4sbcJmezPLrmcLZ0EmAIwD35Ky9c0NSEG7rtN4j982CoGp+7ex2S/RVGWevALY1OslQeq4/nEuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:41.967210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5437","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46979632d93b051430c035d60524e54ec11d41de3b915bce3c0ae0c3cc20e4f1","sha256:6334fc9ac8c57675db7e1f7958dab128bc565231390f729ce466a1801cf4974f"],"state_sha256":"c814ea5c6b7b281cc9864644aa0b778c4f877db17a95546d3feb09688e7b39bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK0PmH+x7Utt1vDfklHCElS6MzzeDCcn4IPBTy77uax+AumbF/ZAxvplUUQXD1M8GtaEjgOiy3FvaKKBu/IMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:46:50.270990Z","bundle_sha256":"0e2d78aa6452f65486c859c32974f3a38ac53af621bb9073cd885a1b33356000"}}