{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZFQMQJ7352D3TDNAXIXEKUZWL4","short_pith_number":"pith:ZFQMQJ73","canonical_record":{"source":{"id":"1803.11060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-29T13:52:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3e8e55426bbc5a9ea8b2cff6853d18dee55beb8aedb375c619d2ec725a557707","abstract_canon_sha256":"cc56b1a8d4f51b65e6d0f955d88ecde553cac8b5deab793a332c8ac3f2c1a28e"},"schema_version":"1.0"},"canonical_sha256":"c960c827fbee87b98da0ba2e4553365f0cda7b38040f809ea091bcdd12148251","source":{"kind":"arxiv","id":"1803.11060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11060","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11060v1","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11060","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"ZFQMQJ7352D3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFQMQJ7352D3TDNA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFQMQJ73","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZFQMQJ7352D3TDNAXIXEKUZWL4","target":"record","payload":{"canonical_record":{"source":{"id":"1803.11060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-29T13:52:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3e8e55426bbc5a9ea8b2cff6853d18dee55beb8aedb375c619d2ec725a557707","abstract_canon_sha256":"cc56b1a8d4f51b65e6d0f955d88ecde553cac8b5deab793a332c8ac3f2c1a28e"},"schema_version":"1.0"},"canonical_sha256":"c960c827fbee87b98da0ba2e4553365f0cda7b38040f809ea091bcdd12148251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:48.683421Z","signature_b64":"EKy+dW/+j0UBDUflZWSEXS5cYnpeiLPmGAO0OeYKqudR5bwxxMUFSHlaZ3AQwGMwGgvCMJ9gS7QCIFnhEeT8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c960c827fbee87b98da0ba2e4553365f0cda7b38040f809ea091bcdd12148251","last_reissued_at":"2026-05-18T00:19:48.682696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:48.682696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.11060","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:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqXpydEckffDepfPZMWcfSnYq1bMd4FZW1Bywww79EBeQMDE5jelWOlaoddekxsY7Txzqtyx7iR8OsvXUxj7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:27:31.476005Z"},"content_sha256":"3d1cd6c8dcf8ec0d30f744b3969a9f26f928e0760f257e8e93f21afe19f3ee94","schema_version":"1.0","event_id":"sha256:3d1cd6c8dcf8ec0d30f744b3969a9f26f928e0760f257e8e93f21afe19f3ee94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZFQMQJ7352D3TDNAXIXEKUZWL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"COBRAS: Fast, Iterative, Active Clustering with Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elia Van Wolputte, Hendrik Blockeel, Sebastijan Duman\\v{c}i\\'c, Toon Van Craenendonck","submitted_at":"2018-03-29T13:52:59Z","abstract_excerpt":"Constraint-based clustering algorithms exploit background knowledge to construct clusterings that are aligned with the interests of a particular user. This background knowledge is often obtained by allowing the clustering system to pose pairwise queries to the user: should these two elements be in the same cluster or not? Active clustering methods aim to minimize the number of queries needed to obtain a good clustering by querying the most informative pairs first. Ideally, a user should be able to answer a couple of these queries, inspect the resulting clustering, and repeat these two steps un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11060","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:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEhP7ByB+VmD6+eA/OBB0TR9REqOfEidvYTA+IdN9CsAuABKa+xaJI+hGJlREEmcIpZZ8xA95ZGrsx5Sk9WTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:27:31.476667Z"},"content_sha256":"b73df8cdbbc53a65261d61693afb86002edb0e373bddc447682fafa539bfdb0f","schema_version":"1.0","event_id":"sha256:b73df8cdbbc53a65261d61693afb86002edb0e373bddc447682fafa539bfdb0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/bundle.json","state_url":"https://pith.science/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/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-31T11:27:31Z","links":{"resolver":"https://pith.science/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4","bundle":"https://pith.science/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/bundle.json","state":"https://pith.science/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFQMQJ7352D3TDNAXIXEKUZWL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZFQMQJ7352D3TDNAXIXEKUZWL4","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":"cc56b1a8d4f51b65e6d0f955d88ecde553cac8b5deab793a332c8ac3f2c1a28e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-29T13:52:59Z","title_canon_sha256":"3e8e55426bbc5a9ea8b2cff6853d18dee55beb8aedb375c619d2ec725a557707"},"schema_version":"1.0","source":{"id":"1803.11060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11060","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11060v1","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11060","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"ZFQMQJ7352D3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFQMQJ7352D3TDNA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFQMQJ73","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:b73df8cdbbc53a65261d61693afb86002edb0e373bddc447682fafa539bfdb0f","target":"graph","created_at":"2026-05-18T00:19:48Z","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":"Constraint-based clustering algorithms exploit background knowledge to construct clusterings that are aligned with the interests of a particular user. This background knowledge is often obtained by allowing the clustering system to pose pairwise queries to the user: should these two elements be in the same cluster or not? Active clustering methods aim to minimize the number of queries needed to obtain a good clustering by querying the most informative pairs first. Ideally, a user should be able to answer a couple of these queries, inspect the resulting clustering, and repeat these two steps un","authors_text":"Elia Van Wolputte, Hendrik Blockeel, Sebastijan Duman\\v{c}i\\'c, Toon Van Craenendonck","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-29T13:52:59Z","title":"COBRAS: Fast, Iterative, Active Clustering with Pairwise Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11060","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:3d1cd6c8dcf8ec0d30f744b3969a9f26f928e0760f257e8e93f21afe19f3ee94","target":"record","created_at":"2026-05-18T00:19:48Z","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":"cc56b1a8d4f51b65e6d0f955d88ecde553cac8b5deab793a332c8ac3f2c1a28e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-29T13:52:59Z","title_canon_sha256":"3e8e55426bbc5a9ea8b2cff6853d18dee55beb8aedb375c619d2ec725a557707"},"schema_version":"1.0","source":{"id":"1803.11060","kind":"arxiv","version":1}},"canonical_sha256":"c960c827fbee87b98da0ba2e4553365f0cda7b38040f809ea091bcdd12148251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c960c827fbee87b98da0ba2e4553365f0cda7b38040f809ea091bcdd12148251","first_computed_at":"2026-05-18T00:19:48.682696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:48.682696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKy+dW/+j0UBDUflZWSEXS5cYnpeiLPmGAO0OeYKqudR5bwxxMUFSHlaZ3AQwGMwGgvCMJ9gS7QCIFnhEeT8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:48.683421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d1cd6c8dcf8ec0d30f744b3969a9f26f928e0760f257e8e93f21afe19f3ee94","sha256:b73df8cdbbc53a65261d61693afb86002edb0e373bddc447682fafa539bfdb0f"],"state_sha256":"5580ae4d2b3124507f83d8949d284b0f504234ac2de01b76ec3d98b7a3c6f973"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CE4rC+/divAO4E7hVrLC5Dh0K+WYtShCj0Uar/davVmgPoyD/2tX1yY20INVGDY6oewDibh4TUPSADJ013mnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:27:31.480629Z","bundle_sha256":"527c03e28d65ea7ff09c45b7802b404a5c529f7b5d8ef134b06bb49d006b4375"}}