{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SQ357P77CVTZH3LJKCSC6K2346","short_pith_number":"pith:SQ357P77","canonical_record":{"source":{"id":"1303.1280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-06T09:23:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"67175e9057fb15c25819a4df4dce73dc6bc08803344a1df58c90419832b5456c","abstract_canon_sha256":"e400c0b52ff44946c5e03ca1cf75bd4bef5e14cb20bd6a715dfa5c8bfbf120b6"},"schema_version":"1.0"},"canonical_sha256":"9437dfbfff156793ed6950a42f2b5be7b89f530e1e9749dda6fee8198cb91639","source":{"kind":"arxiv","id":"1303.1280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1280","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1280v1","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1280","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"SQ357P77CVTZ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQ357P77CVTZH3LJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQ357P77","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SQ357P77CVTZH3LJKCSC6K2346","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-06T09:23:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"67175e9057fb15c25819a4df4dce73dc6bc08803344a1df58c90419832b5456c","abstract_canon_sha256":"e400c0b52ff44946c5e03ca1cf75bd4bef5e14cb20bd6a715dfa5c8bfbf120b6"},"schema_version":"1.0"},"canonical_sha256":"9437dfbfff156793ed6950a42f2b5be7b89f530e1e9749dda6fee8198cb91639","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:43.996652Z","signature_b64":"K7PhfPQWsCt7gWLjau67KjV0vFA72Ym/YPx0jdcb7fXB0IaobaofhZeE8TQh2lwIzg1Troatr2csq6tXxdfnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9437dfbfff156793ed6950a42f2b5be7b89f530e1e9749dda6fee8198cb91639","last_reissued_at":"2026-05-18T03:31:43.995839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:43.995839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1280","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-18T03:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z73JTNSOFsyM/o/o/MbLwNgXF8nPjSoes4IzfYclZkAf6DILKUspb62DdADMFop2iFZbKlCVTQ2eAVCTBUIiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:52.303133Z"},"content_sha256":"6a1951913cf09385f858b2be9989506afd0f3444a163d632b5a3ad9093185def","schema_version":"1.0","event_id":"sha256:6a1951913cf09385f858b2be9989506afd0f3444a163d632b5a3ad9093185def"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SQ357P77CVTZH3LJKCSC6K2346","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Margin Metric Learning for Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS), R\\'emi Lajugie (LIENS), Sylvain Arlot (LIENS)","submitted_at":"2013-03-06T09:23:45Z","abstract_excerpt":"In this paper, we consider unsupervised partitioning problems, such as clustering, image segmentation, video segmentation and other change-point detection problems. We focus on partitioning problems based explicitly or implicitly on the minimization of Euclidean distortions, which include mean-based change-point detection, K-means, spectral clustering and normalized cuts. Our main goal is to learn a Mahalanobis metric for these unsupervised problems, leading to feature weighting and/or selection. This is done in a supervised way by assuming the availability of several potentially partially lab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1280","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-18T03:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1z4GDEqHJZjuc2GGv8t4TgvUeWRFgH2YjtIifdAgtPr48eCL4Jhclrqntef2PWUEbCTiib4pIOAr2vzsOkQ/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:52.303516Z"},"content_sha256":"c1da3ff029bc85164fcadec92360d7f284915457be41f9cd780fb03ae18c1f4e","schema_version":"1.0","event_id":"sha256:c1da3ff029bc85164fcadec92360d7f284915457be41f9cd780fb03ae18c1f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQ357P77CVTZH3LJKCSC6K2346/bundle.json","state_url":"https://pith.science/pith/SQ357P77CVTZH3LJKCSC6K2346/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQ357P77CVTZH3LJKCSC6K2346/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-01T19:02:52Z","links":{"resolver":"https://pith.science/pith/SQ357P77CVTZH3LJKCSC6K2346","bundle":"https://pith.science/pith/SQ357P77CVTZH3LJKCSC6K2346/bundle.json","state":"https://pith.science/pith/SQ357P77CVTZH3LJKCSC6K2346/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQ357P77CVTZH3LJKCSC6K2346/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SQ357P77CVTZH3LJKCSC6K2346","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":"e400c0b52ff44946c5e03ca1cf75bd4bef5e14cb20bd6a715dfa5c8bfbf120b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-06T09:23:45Z","title_canon_sha256":"67175e9057fb15c25819a4df4dce73dc6bc08803344a1df58c90419832b5456c"},"schema_version":"1.0","source":{"id":"1303.1280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1280","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1280v1","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1280","created_at":"2026-05-18T03:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"SQ357P77CVTZ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQ357P77CVTZH3LJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQ357P77","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:c1da3ff029bc85164fcadec92360d7f284915457be41f9cd780fb03ae18c1f4e","target":"graph","created_at":"2026-05-18T03:31:43Z","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":"In this paper, we consider unsupervised partitioning problems, such as clustering, image segmentation, video segmentation and other change-point detection problems. We focus on partitioning problems based explicitly or implicitly on the minimization of Euclidean distortions, which include mean-based change-point detection, K-means, spectral clustering and normalized cuts. Our main goal is to learn a Mahalanobis metric for these unsupervised problems, leading to feature weighting and/or selection. This is done in a supervised way by assuming the availability of several potentially partially lab","authors_text":"Francis Bach (LIENS), R\\'emi Lajugie (LIENS), Sylvain Arlot (LIENS)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-06T09:23:45Z","title":"Large-Margin Metric Learning for Partitioning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1280","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:6a1951913cf09385f858b2be9989506afd0f3444a163d632b5a3ad9093185def","target":"record","created_at":"2026-05-18T03:31:43Z","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":"e400c0b52ff44946c5e03ca1cf75bd4bef5e14cb20bd6a715dfa5c8bfbf120b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-06T09:23:45Z","title_canon_sha256":"67175e9057fb15c25819a4df4dce73dc6bc08803344a1df58c90419832b5456c"},"schema_version":"1.0","source":{"id":"1303.1280","kind":"arxiv","version":1}},"canonical_sha256":"9437dfbfff156793ed6950a42f2b5be7b89f530e1e9749dda6fee8198cb91639","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9437dfbfff156793ed6950a42f2b5be7b89f530e1e9749dda6fee8198cb91639","first_computed_at":"2026-05-18T03:31:43.995839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:43.995839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7PhfPQWsCt7gWLjau67KjV0vFA72Ym/YPx0jdcb7fXB0IaobaofhZeE8TQh2lwIzg1Troatr2csq6tXxdfnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:43.996652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a1951913cf09385f858b2be9989506afd0f3444a163d632b5a3ad9093185def","sha256:c1da3ff029bc85164fcadec92360d7f284915457be41f9cd780fb03ae18c1f4e"],"state_sha256":"1c7da6f994227708ca81779da2c4d356fb54c2beb34bc8b50fc0f7551677ef1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAtoqqBN7c4QjkPCMK6rTkNadziLJ7F8AQFnBxlcIw0wZcqf37k7NZxFk2hTfbS2ffjJryO9bijwHTgo8xPnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:02:52.305552Z","bundle_sha256":"2dca0a3bd369e017221d64a1922f0978ff9edf52700520832fc52ffb9e9c48d6"}}