{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GAXHDEX7BU7XOT2RGDY5UB3KC7","short_pith_number":"pith:GAXHDEX7","canonical_record":{"source":{"id":"1307.5459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-07-20T20:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"797cf1d312dc5a7591c5f76b1ac9752e6835aa0a7def3d4ea6001e48d7235bd4","abstract_canon_sha256":"04c7f22098d97b0161235433fe6bb4c00421611cf98c56ce400a63a87ef6f28d"},"schema_version":"1.0"},"canonical_sha256":"302e7192ff0d3f774f5130f1da076a17d91297daaa61a3228532e63bd5dddace","source":{"kind":"arxiv","id":"1307.5459","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5459","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5459v2","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5459","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"GAXHDEX7BU7X","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAXHDEX7BU7XOT2R","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAXHDEX7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GAXHDEX7BU7XOT2RGDY5UB3KC7","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-07-20T20:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"797cf1d312dc5a7591c5f76b1ac9752e6835aa0a7def3d4ea6001e48d7235bd4","abstract_canon_sha256":"04c7f22098d97b0161235433fe6bb4c00421611cf98c56ce400a63a87ef6f28d"},"schema_version":"1.0"},"canonical_sha256":"302e7192ff0d3f774f5130f1da076a17d91297daaa61a3228532e63bd5dddace","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:32.999981Z","signature_b64":"rozswWIerPqAptkAFE83vnhlZ/iEMg9y4osqUZEpBKDJ1SjJIH1B+3Q6K4OoUn0YaVhVxMuesiNdjoJUvljGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"302e7192ff0d3f774f5130f1da076a17d91297daaa61a3228532e63bd5dddace","last_reissued_at":"2026-05-18T03:11:32.999332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:32.999332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5459","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:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnzwgSK679j7SlRrXaEDfxrrAE3XqpN9iqdGhCUiq/Bfph4nDvjJXLpIO6+VQzNiJjH2OOLI1Fy56OxLhYeOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:54:54.956899Z"},"content_sha256":"8c33dd36dcca99039b494eaf804f7d7f33d7c5ebf00409c5ab78e267f78d559d","schema_version":"1.0","event_id":"sha256:8c33dd36dcca99039b494eaf804f7d7f33d7c5ebf00409c5ab78e267f78d559d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GAXHDEX7BU7XOT2RGDY5UB3KC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Clustering via Optimal Mass Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Francesca P. Carli, Lipeng Ning, Tryphon T. Georgiou","submitted_at":"2013-07-20T20:38:40Z","abstract_excerpt":"We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we consider is that of approximating sample distributions by ones with sparse support. This provides a new viewpoint to clustering. We propose different relaxations of a cardinality function which penalizes the size of the support set. We establish that a certain relaxation provides the tightest convex lower approximation to the cardinality penalty. We compare the pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5459","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:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGRkIOsUqcdVEwUH2D2bpj27u6PoJwk72w/e4oCbgJ/le/vcdvmZv33Enz9/08Bzs5yR9lXXrbam7ldX6kQyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:54:54.957247Z"},"content_sha256":"ee637934c729bdeea208f7a57370645819926514f6189ab0b64f4fbf293ea9e7","schema_version":"1.0","event_id":"sha256:ee637934c729bdeea208f7a57370645819926514f6189ab0b64f4fbf293ea9e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/bundle.json","state_url":"https://pith.science/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/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-03T13:54:54Z","links":{"resolver":"https://pith.science/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7","bundle":"https://pith.science/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/bundle.json","state":"https://pith.science/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAXHDEX7BU7XOT2RGDY5UB3KC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GAXHDEX7BU7XOT2RGDY5UB3KC7","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":"04c7f22098d97b0161235433fe6bb4c00421611cf98c56ce400a63a87ef6f28d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-07-20T20:38:40Z","title_canon_sha256":"797cf1d312dc5a7591c5f76b1ac9752e6835aa0a7def3d4ea6001e48d7235bd4"},"schema_version":"1.0","source":{"id":"1307.5459","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5459","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5459v2","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5459","created_at":"2026-05-18T03:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"GAXHDEX7BU7X","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAXHDEX7BU7XOT2R","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAXHDEX7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:ee637934c729bdeea208f7a57370645819926514f6189ab0b64f4fbf293ea9e7","target":"graph","created_at":"2026-05-18T03:11:32Z","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":"We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we consider is that of approximating sample distributions by ones with sparse support. This provides a new viewpoint to clustering. We propose different relaxations of a cardinality function which penalizes the size of the support set. We establish that a certain relaxation provides the tightest convex lower approximation to the cardinality penalty. We compare the pe","authors_text":"Francesca P. Carli, Lipeng Ning, Tryphon T. Georgiou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-07-20T20:38:40Z","title":"Convex Clustering via Optimal Mass Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5459","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:8c33dd36dcca99039b494eaf804f7d7f33d7c5ebf00409c5ab78e267f78d559d","target":"record","created_at":"2026-05-18T03:11:32Z","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":"04c7f22098d97b0161235433fe6bb4c00421611cf98c56ce400a63a87ef6f28d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-07-20T20:38:40Z","title_canon_sha256":"797cf1d312dc5a7591c5f76b1ac9752e6835aa0a7def3d4ea6001e48d7235bd4"},"schema_version":"1.0","source":{"id":"1307.5459","kind":"arxiv","version":2}},"canonical_sha256":"302e7192ff0d3f774f5130f1da076a17d91297daaa61a3228532e63bd5dddace","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"302e7192ff0d3f774f5130f1da076a17d91297daaa61a3228532e63bd5dddace","first_computed_at":"2026-05-18T03:11:32.999332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:32.999332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rozswWIerPqAptkAFE83vnhlZ/iEMg9y4osqUZEpBKDJ1SjJIH1B+3Q6K4OoUn0YaVhVxMuesiNdjoJUvljGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:32.999981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5459","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c33dd36dcca99039b494eaf804f7d7f33d7c5ebf00409c5ab78e267f78d559d","sha256:ee637934c729bdeea208f7a57370645819926514f6189ab0b64f4fbf293ea9e7"],"state_sha256":"5bcfed8ccd9f02c67bbdd9ed4837a1635f4c3688670ee3052f16aecdab83fa21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxnWrX3lN/ch7mPsxn/ga+SizU30Cx81zFlwGilruTXw5lrU9GkQTqi1F5g08QPEKDpMGh1bNWSKiSPRBEgbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:54:54.959296Z","bundle_sha256":"fc5497da00354a96a7b1547cafc26abf79382aeacfda6d549b245b1deb954582"}}