{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5CWTKYSOVGTE235BKDWYMV376Y","short_pith_number":"pith:5CWTKYSO","canonical_record":{"source":{"id":"1801.09955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-30T12:30:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7643960ce3e51d376e937f77b6e5fc32a9bbf0b1ca2b82a02c91ae4b1f4c60b1","abstract_canon_sha256":"628ce5502e27f89cff1748ed0515efce107446107a11116d8383a6321bbfc4b2"},"schema_version":"1.0"},"canonical_sha256":"e8ad35624ea9a64d6fa150ed86577ff635f9b0295edd348978b3212fd426ea0d","source":{"kind":"arxiv","id":"1801.09955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09955","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09955v1","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09955","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"5CWTKYSOVGTE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5CWTKYSOVGTE235B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5CWTKYSO","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5CWTKYSOVGTE235BKDWYMV376Y","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-30T12:30:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7643960ce3e51d376e937f77b6e5fc32a9bbf0b1ca2b82a02c91ae4b1f4c60b1","abstract_canon_sha256":"628ce5502e27f89cff1748ed0515efce107446107a11116d8383a6321bbfc4b2"},"schema_version":"1.0"},"canonical_sha256":"e8ad35624ea9a64d6fa150ed86577ff635f9b0295edd348978b3212fd426ea0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:46.296655Z","signature_b64":"scBFYTINND2yTN5ef1n6ZupuHgtqYJkaWKyqNx7R4aesYY504XNw+MvGxJGZE0KtuDkHBvWEsf8TLc6ZWE9BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ad35624ea9a64d6fa150ed86577ff635f9b0295edd348978b3212fd426ea0d","last_reissued_at":"2026-05-18T00:24:46.295974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:46.295974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09955","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-18T00:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01sMfmNATfRRNgywzKQ+KTlbVjbZcArbop6W5qGYuLsh9bJDwTYvkzCmuBiUdlrTCEcGZmEjjTRi2HFa/k8MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:56:39.625581Z"},"content_sha256":"3d32acb1872bf7bf559092c4d1187917681521607e1dcdb45b66a43f7e7d1a01","schema_version":"1.0","event_id":"sha256:3d32acb1872bf7bf559092c4d1187917681521607e1dcdb45b66a43f7e7d1a01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5CWTKYSOVGTE235BKDWYMV376Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"COBRA: A Fast and Simple Method for Active Clustering with Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Hendrik Blockeel, Sebastijan Dumancic, Toon Van Craenendonck","submitted_at":"2018-01-30T12:30:50Z","abstract_excerpt":"Clustering is inherently ill-posed: there often exist multiple valid clusterings of a single dataset, and without any additional information a clustering system has no way of knowing which clustering it should produce. This motivates the use of constraints in clustering, as they allow users to communicate their interests to the clustering system. Active constraint-based clustering algorithms select the most useful constraints to query, aiming to produce a good clustering using as few constraints as possible. We propose COBRA, an active method that first over-clusters the data by running K-mean"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09955","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-18T00:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KI7/sXpx5q1365cSVLniPptoLyEPW+FxG9JJYEmf8Agn3skNiEKRDXRTtR2H0yu6exlwsVHU8d0pUipt5wsOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:56:39.625942Z"},"content_sha256":"56c77114d0243e59437a7f58882bb1b9d6e220c862e3f3586fe7c0ac339738e7","schema_version":"1.0","event_id":"sha256:56c77114d0243e59437a7f58882bb1b9d6e220c862e3f3586fe7c0ac339738e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CWTKYSOVGTE235BKDWYMV376Y/bundle.json","state_url":"https://pith.science/pith/5CWTKYSOVGTE235BKDWYMV376Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CWTKYSOVGTE235BKDWYMV376Y/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-01T12:56:39Z","links":{"resolver":"https://pith.science/pith/5CWTKYSOVGTE235BKDWYMV376Y","bundle":"https://pith.science/pith/5CWTKYSOVGTE235BKDWYMV376Y/bundle.json","state":"https://pith.science/pith/5CWTKYSOVGTE235BKDWYMV376Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CWTKYSOVGTE235BKDWYMV376Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5CWTKYSOVGTE235BKDWYMV376Y","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":"628ce5502e27f89cff1748ed0515efce107446107a11116d8383a6321bbfc4b2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-30T12:30:50Z","title_canon_sha256":"7643960ce3e51d376e937f77b6e5fc32a9bbf0b1ca2b82a02c91ae4b1f4c60b1"},"schema_version":"1.0","source":{"id":"1801.09955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09955","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09955v1","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09955","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"5CWTKYSOVGTE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5CWTKYSOVGTE235B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5CWTKYSO","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:56c77114d0243e59437a7f58882bb1b9d6e220c862e3f3586fe7c0ac339738e7","target":"graph","created_at":"2026-05-18T00:24:46Z","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":"Clustering is inherently ill-posed: there often exist multiple valid clusterings of a single dataset, and without any additional information a clustering system has no way of knowing which clustering it should produce. This motivates the use of constraints in clustering, as they allow users to communicate their interests to the clustering system. Active constraint-based clustering algorithms select the most useful constraints to query, aiming to produce a good clustering using as few constraints as possible. We propose COBRA, an active method that first over-clusters the data by running K-mean","authors_text":"Hendrik Blockeel, Sebastijan Dumancic, Toon Van Craenendonck","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-30T12:30:50Z","title":"COBRA: A Fast and Simple Method for Active Clustering with Pairwise Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09955","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:3d32acb1872bf7bf559092c4d1187917681521607e1dcdb45b66a43f7e7d1a01","target":"record","created_at":"2026-05-18T00:24:46Z","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":"628ce5502e27f89cff1748ed0515efce107446107a11116d8383a6321bbfc4b2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-30T12:30:50Z","title_canon_sha256":"7643960ce3e51d376e937f77b6e5fc32a9bbf0b1ca2b82a02c91ae4b1f4c60b1"},"schema_version":"1.0","source":{"id":"1801.09955","kind":"arxiv","version":1}},"canonical_sha256":"e8ad35624ea9a64d6fa150ed86577ff635f9b0295edd348978b3212fd426ea0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8ad35624ea9a64d6fa150ed86577ff635f9b0295edd348978b3212fd426ea0d","first_computed_at":"2026-05-18T00:24:46.295974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:46.295974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"scBFYTINND2yTN5ef1n6ZupuHgtqYJkaWKyqNx7R4aesYY504XNw+MvGxJGZE0KtuDkHBvWEsf8TLc6ZWE9BDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:46.296655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d32acb1872bf7bf559092c4d1187917681521607e1dcdb45b66a43f7e7d1a01","sha256:56c77114d0243e59437a7f58882bb1b9d6e220c862e3f3586fe7c0ac339738e7"],"state_sha256":"5f165fdd3cadecadde7658662733a81d3f7c538b5c1dc30c3636bc2e3d7db634"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuZqRKJ7sASQzDSKRxzr4pRgXMmhRUHxfUs+R20TDfWjQ2BCRcBpbsyPWLYMQFXo4HKobksHO+Cz1fH8OzWrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:56:39.627970Z","bundle_sha256":"602d2113af7ff41a3b237f9f065787db2d87ef46764d9c9939d472f6e956768e"}}