{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:T2WFTW4OJOV2PVPRBVBU5QUWTU","short_pith_number":"pith:T2WFTW4O","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"},"canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","source":{"kind":"arxiv","id":"1306.2102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2102","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2102v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2102","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"T2WFTW4OJOV2","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T2WFTW4OJOV2PVPR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T2WFTW4O","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:T2WFTW4OJOV2PVPRBVBU5QUWTU","target":"record","payload":{"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"},"canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","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"},"source_kind":"arxiv","source_id":"1306.2102","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLyHh3YuTl5MYbLHE10VYYN31QlOjZo/ccbWTVHTrTFZ6K0bQVCBGx/ygRMDxr18okpcFpwv9Qxhb8vdpAZBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:20:20.333920Z"},"content_sha256":"22fc36023efb5d31dc421bdb5f1899c000d656bb2716c0a2b8b7abb64ec25538","schema_version":"1.0","event_id":"sha256:22fc36023efb5d31dc421bdb5f1899c000d656bb2716c0a2b8b7abb64ec25538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:T2WFTW4OJOV2PVPRBVBU5QUWTU","target":"graph","payload":{"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"},"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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJdU84NIa8eaDKnebRyJzLqtjUd8AeQdMWDmDLoZpNAshxtU9c2/nyN4s2c0SWzuS/kst7oBPB1H4bCxpssVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:20:20.334276Z"},"content_sha256":"c24a98b1f9dea1b869225d5c9ecd6c908b39fb9a3f78270ef79854cda2fa2b47","schema_version":"1.0","event_id":"sha256:c24a98b1f9dea1b869225d5c9ecd6c908b39fb9a3f78270ef79854cda2fa2b47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/bundle.json","state_url":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/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-05-26T20:20:20Z","links":{"resolver":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU","bundle":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/bundle.json","state":"https://pith.science/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2WFTW4OJOV2PVPRBVBU5QUWTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T2WFTW4OJOV2PVPRBVBU5QUWTU","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":"e035b8321bbf1a4d394d424e599dca3fd9226f5237d6af50c6ae1e232ce1f6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-06-10T04:59:05Z","title_canon_sha256":"16d7636b5f6d98c7551d07d449cab477f66b669a835006ab1bc597853c592eab"},"schema_version":"1.0","source":{"id":"1306.2102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2102","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2102v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2102","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"T2WFTW4OJOV2","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T2WFTW4OJOV2PVPR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T2WFTW4O","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:c24a98b1f9dea1b869225d5c9ecd6c908b39fb9a3f78270ef79854cda2fa2b47","target":"graph","created_at":"2026-05-18T03:21:22Z","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":"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","authors_text":"Ognjen Arandjelovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-06-10T04:59:05Z","title":"Discriminative k-means clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2102","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:22fc36023efb5d31dc421bdb5f1899c000d656bb2716c0a2b8b7abb64ec25538","target":"record","created_at":"2026-05-18T03:21:22Z","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":"e035b8321bbf1a4d394d424e599dca3fd9226f5237d6af50c6ae1e232ce1f6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-06-10T04:59:05Z","title_canon_sha256":"16d7636b5f6d98c7551d07d449cab477f66b669a835006ab1bc597853c592eab"},"schema_version":"1.0","source":{"id":"1306.2102","kind":"arxiv","version":1}},"canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eac59db8e4baba7d5f10d434ec2969d072e1ef305e9db404e322ebc2190143d","first_computed_at":"2026-05-18T03:21:22.373003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.373003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AAAj6tpwcUrMS9LLwkjX6M1YHBu4uv+thkFah7QDagw7qJXpowk5J/eSNxJvfKFUo9ZVKWqpvgttaIcBcgzFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.373706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22fc36023efb5d31dc421bdb5f1899c000d656bb2716c0a2b8b7abb64ec25538","sha256:c24a98b1f9dea1b869225d5c9ecd6c908b39fb9a3f78270ef79854cda2fa2b47"],"state_sha256":"d2b92dfe96c9e50a0c9122dd3804b17432e06f8f595a906baff2fc3f585e0d47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivPDe5JK5hAA2xzWxi8RKCitVKXTiOJAreBDC1gLmDHuEsY2wP8tlndSYHBS0lTfE64nXkXawNcptPt8uY4EDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:20:20.336482Z","bundle_sha256":"a6270143152444d76681863bac7a482f5b5082e67d75f609d70621ae39189c65"}}