{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T2WFTW4OJOV2PVPRBVBU5QUWTU","short_pith_number":"pith:T2WFTW4O","schema_version":"1.0","canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","source":{"kind":"arxiv","id":"1306.2102","version":1},"attestation_state":"computed","paper":{"title":"Discriminative k-means clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ognjen Arandjelovic","submitted_at":"2013-06-10T04:59:05Z","abstract_excerpt":"The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper we are inspired by these appealing properties of k-means in the development of a clustering algorithm which accepts the notion of \"positively\" and \"negatively\" labelled data. The goal is to discover the cluster structure of both positive and negative data in a manner which allows for the discrimination between the two sets. The usefulness of this idea is demo"},"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":"1306.2102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-06-10T04:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"16d7636b5f6d98c7551d07d449cab477f66b669a835006ab1bc597853c592eab","abstract_canon_sha256":"e035b8321bbf1a4d394d424e599dca3fd9226f5237d6af50c6ae1e232ce1f6e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.373706Z","signature_b64":"AAAj6tpwcUrMS9LLwkjX6M1YHBu4uv+thkFah7QDagw7qJXpowk5J/eSNxJvfKFUo9ZVKWqpvgttaIcBcgzFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","last_reissued_at":"2026-05-18T03:21:22.373003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.373003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discriminative k-means clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ognjen Arandjelovic","submitted_at":"2013-06-10T04:59:05Z","abstract_excerpt":"The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper we are inspired by these appealing properties of k-means in the development of a clustering algorithm which accepts the notion of \"positively\" and \"negatively\" labelled data. The goal is to discover the cluster structure of both positive and negative data in a manner which allows for the discrimination between the two sets. The usefulness of this idea is demo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2102","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.2102","created_at":"2026-05-18T03:21:22.373125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2102v1","created_at":"2026-05-18T03:21:22.373125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2102","created_at":"2026-05-18T03:21:22.373125+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2WFTW4OJOV2","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2WFTW4OJOV2PVPR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2WFTW4O","created_at":"2026-05-18T12:27:59.945178+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/T2WFTW4OJOV2PVPRBVBU5QUWTU","json":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU.json","graph_json":"https://pith.science/api/pith-number/T2WFTW4OJOV2PVPRBVBU5QUWTU/graph.json","events_json":"https://pith.science/api/pith-number/T2WFTW4OJOV2PVPRBVBU5QUWTU/events.json","paper":"https://pith.science/paper/T2WFTW4O"},"agent_actions":{"view_html":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU","download_json":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU.json","view_paper":"https://pith.science/paper/T2WFTW4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2102&json=true","fetch_graph":"https://pith.science/api/pith-number/T2WFTW4OJOV2PVPRBVBU5QUWTU/graph.json","fetch_events":"https://pith.science/api/pith-number/T2WFTW4OJOV2PVPRBVBU5QUWTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/action/storage_attestation","attest_author":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/action/author_attestation","sign_citation":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/action/citation_signature","submit_replication":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/action/replication_record"}},"created_at":"2026-05-18T03:21:22.373125+00:00","updated_at":"2026-05-18T03:21:22.373125+00:00"}