{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6O6LHDM3N4EHAAMZ7QBDQGHHI4","short_pith_number":"pith:6O6LHDM3","schema_version":"1.0","canonical_sha256":"f3bcb38d9b6f08700199fc023818e747348fc7dff6d83f75d71f6a4f0edb1a29","source":{"kind":"arxiv","id":"2006.10039","version":1},"attestation_state":"computed","paper":{"title":"LSD-C: Linearly Separable Deep Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Andrew Zisserman, Kai Han, Sebastien Ehrhardt, Sylvestre-Alvise Rebuffi","submitted_at":"2020-06-17T17:58:10Z","abstract_excerpt":"We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our algorithm first establishes pairwise connections in the feature space between the samples of the minibatch based on a similarity metric. Then it regroups in clusters the connected samples and enforces a linear separation between clusters. This is achieved by using the pairwise connections as targets together with a binary cross-entropy loss on the predictions that the associated pairs of samples belong to the same cluster. This way, the feature representation of the network will evolve such that similar samples "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2006.10039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-17T17:58:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac26a0548ddde8f6fd95771ab0c807a048959f03bb01d6f1c69b83354ef34035","abstract_canon_sha256":"117b99e7ea7da0a626ad7221c445c9a067b01a7d97cccc57d7fa502bb4e35acd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:07.551221Z","signature_b64":"VVcTwhuvGwUYBogZBe1efcUqDQvuyITBO/l+frsSqoAckEQRis7GHSos9ZGxhvv2p06cM2jrgurJb19MVRxiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bcb38d9b6f08700199fc023818e747348fc7dff6d83f75d71f6a4f0edb1a29","last_reissued_at":"2026-07-05T01:11:07.550760Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:07.550760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSD-C: Linearly Separable Deep Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Andrew Zisserman, Kai Han, Sebastien Ehrhardt, Sylvestre-Alvise Rebuffi","submitted_at":"2020-06-17T17:58:10Z","abstract_excerpt":"We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our algorithm first establishes pairwise connections in the feature space between the samples of the minibatch based on a similarity metric. Then it regroups in clusters the connected samples and enforces a linear separation between clusters. This is achieved by using the pairwise connections as targets together with a binary cross-entropy loss on the predictions that the associated pairs of samples belong to the same cluster. This way, the feature representation of the network will evolve such that similar samples "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10039","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.10039/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.10039","created_at":"2026-07-05T01:11:07.550814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.10039v1","created_at":"2026-07-05T01:11:07.550814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10039","created_at":"2026-07-05T01:11:07.550814+00:00"},{"alias_kind":"pith_short_12","alias_value":"6O6LHDM3N4EH","created_at":"2026-07-05T01:11:07.550814+00:00"},{"alias_kind":"pith_short_16","alias_value":"6O6LHDM3N4EHAAMZ","created_at":"2026-07-05T01:11:07.550814+00:00"},{"alias_kind":"pith_short_8","alias_value":"6O6LHDM3","created_at":"2026-07-05T01:11:07.550814+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4","json":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4.json","graph_json":"https://pith.science/api/pith-number/6O6LHDM3N4EHAAMZ7QBDQGHHI4/graph.json","events_json":"https://pith.science/api/pith-number/6O6LHDM3N4EHAAMZ7QBDQGHHI4/events.json","paper":"https://pith.science/paper/6O6LHDM3"},"agent_actions":{"view_html":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4","download_json":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4.json","view_paper":"https://pith.science/paper/6O6LHDM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.10039&json=true","fetch_graph":"https://pith.science/api/pith-number/6O6LHDM3N4EHAAMZ7QBDQGHHI4/graph.json","fetch_events":"https://pith.science/api/pith-number/6O6LHDM3N4EHAAMZ7QBDQGHHI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4/action/storage_attestation","attest_author":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4/action/author_attestation","sign_citation":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4/action/citation_signature","submit_replication":"https://pith.science/pith/6O6LHDM3N4EHAAMZ7QBDQGHHI4/action/replication_record"}},"created_at":"2026-07-05T01:11:07.550814+00:00","updated_at":"2026-07-05T01:11:07.550814+00:00"}