{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H7O64JRNK376D2XYENYMFSMEJT","short_pith_number":"pith:H7O64JRN","canonical_record":{"source":{"id":"1803.08457","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T16:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"b82b120afa99594ff82a9d72ac21354ab7b3a21f22b8c09ed2f73f421a1a9750","abstract_canon_sha256":"861505e2bbc303e5d328a054b2f8546c7c20ac3ded64d9ca95a8ea0013cdc38d"},"schema_version":"1.0"},"canonical_sha256":"3fddee262d56ffe1eaf82370c2c9844ccd8f23aa9acf3f51f6990c5c40c5f196","source":{"kind":"arxiv","id":"1803.08457","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08457","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08457v5","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08457","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"H7O64JRNK376","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7O64JRNK376D2XY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7O64JRN","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H7O64JRNK376D2XYENYMFSMEJT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08457","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T16:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"b82b120afa99594ff82a9d72ac21354ab7b3a21f22b8c09ed2f73f421a1a9750","abstract_canon_sha256":"861505e2bbc303e5d328a054b2f8546c7c20ac3ded64d9ca95a8ea0013cdc38d"},"schema_version":"1.0"},"canonical_sha256":"3fddee262d56ffe1eaf82370c2c9844ccd8f23aa9acf3f51f6990c5c40c5f196","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.521578Z","signature_b64":"f4uBUREWD+NZuC9icd9QeM7h+A19Cd8W1prffMq3PdbRnhYPcqau9SvT4cY+fOVxLS26aPImwHebohzKSrfQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fddee262d56ffe1eaf82370c2c9844ccd8f23aa9acf3f51f6990c5c40c5f196","last_reissued_at":"2026-05-18T00:02:49.520930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.520930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08457","source_version":5,"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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TK5xXebiQLEuRP8jIeOF+t1l9/l+/D6LQBAxmYSiwZyjU9BjM/Nlbwq3NzWkkxV2kClr2Qg4/DgJDWmIjg/HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:43.936723Z"},"content_sha256":"cd7e2ce15f59559dd6affb1a281fc888994ffc9d418ddef65abb686b35eda55f","schema_version":"1.0","event_id":"sha256:cd7e2ce15f59559dd6affb1a281fc888994ffc9d418ddef65abb686b35eda55f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H7O64JRNK376D2XYENYMFSMEJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering-driven Deep Embedding with Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Cohen-Or, Hadar Averbuch-Elor, Jacov Goldberger, Sharon Fogel","submitted_at":"2018-03-22T16:58:06Z","abstract_excerpt":"Recently, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart from centroid-based models and suggest a new framework, called Clustering-driven deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering using a neural network. We present a clustering-driven embedding based on a Siamese network that encourages pairs of data points to output similar representations in the latent space. Our pair-based model allows augmenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08457","kind":"arxiv","version":5},"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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3areiGU5pciZWSV6J8VNdsdM3Q3b+nvq5HvRMQGlwaZgV3SyzlOXg+asK0M+Q8II9SKpaP1iesJoOx9nCabDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:43.937060Z"},"content_sha256":"8ce0d210c74a30a1a364fe52d20c64f0d4d58836b4e00b81cd226004e46fe291","schema_version":"1.0","event_id":"sha256:8ce0d210c74a30a1a364fe52d20c64f0d4d58836b4e00b81cd226004e46fe291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7O64JRNK376D2XYENYMFSMEJT/bundle.json","state_url":"https://pith.science/pith/H7O64JRNK376D2XYENYMFSMEJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7O64JRNK376D2XYENYMFSMEJT/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-03T06:30:43Z","links":{"resolver":"https://pith.science/pith/H7O64JRNK376D2XYENYMFSMEJT","bundle":"https://pith.science/pith/H7O64JRNK376D2XYENYMFSMEJT/bundle.json","state":"https://pith.science/pith/H7O64JRNK376D2XYENYMFSMEJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7O64JRNK376D2XYENYMFSMEJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H7O64JRNK376D2XYENYMFSMEJT","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":"861505e2bbc303e5d328a054b2f8546c7c20ac3ded64d9ca95a8ea0013cdc38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T16:58:06Z","title_canon_sha256":"b82b120afa99594ff82a9d72ac21354ab7b3a21f22b8c09ed2f73f421a1a9750"},"schema_version":"1.0","source":{"id":"1803.08457","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08457","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08457v5","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08457","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"H7O64JRNK376","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7O64JRNK376D2XY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7O64JRN","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:8ce0d210c74a30a1a364fe52d20c64f0d4d58836b4e00b81cd226004e46fe291","target":"graph","created_at":"2026-05-18T00:02:49Z","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, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart from centroid-based models and suggest a new framework, called Clustering-driven deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering using a neural network. We present a clustering-driven embedding based on a Siamese network that encourages pairs of data points to output similar representations in the latent space. Our pair-based model allows augmenti","authors_text":"Daniel Cohen-Or, Hadar Averbuch-Elor, Jacov Goldberger, Sharon Fogel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T16:58:06Z","title":"Clustering-driven Deep Embedding with Pairwise Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08457","kind":"arxiv","version":5},"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:cd7e2ce15f59559dd6affb1a281fc888994ffc9d418ddef65abb686b35eda55f","target":"record","created_at":"2026-05-18T00:02:49Z","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":"861505e2bbc303e5d328a054b2f8546c7c20ac3ded64d9ca95a8ea0013cdc38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T16:58:06Z","title_canon_sha256":"b82b120afa99594ff82a9d72ac21354ab7b3a21f22b8c09ed2f73f421a1a9750"},"schema_version":"1.0","source":{"id":"1803.08457","kind":"arxiv","version":5}},"canonical_sha256":"3fddee262d56ffe1eaf82370c2c9844ccd8f23aa9acf3f51f6990c5c40c5f196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fddee262d56ffe1eaf82370c2c9844ccd8f23aa9acf3f51f6990c5c40c5f196","first_computed_at":"2026-05-18T00:02:49.520930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:49.520930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4uBUREWD+NZuC9icd9QeM7h+A19Cd8W1prffMq3PdbRnhYPcqau9SvT4cY+fOVxLS26aPImwHebohzKSrfQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:49.521578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08457","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd7e2ce15f59559dd6affb1a281fc888994ffc9d418ddef65abb686b35eda55f","sha256:8ce0d210c74a30a1a364fe52d20c64f0d4d58836b4e00b81cd226004e46fe291"],"state_sha256":"44606480c0c096f33f9a40a92aef3730b490137c3d795806513f78169905e15b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYkkWNDduxRTBRstnVKGhv2+ciyTHXkAqD79OCpLflaF51NT5NIXnByXG704GWabGn3Cqfx0T4zfRW3H1YuYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:30:43.938963Z","bundle_sha256":"765ce58f56856cd6f80d36c57d6df0d0601fd18c1e47e4eccc2c06ff2f6aa5bf"}}