{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4VZXHYQE2WZLEDBNEXID2NWHMN","short_pith_number":"pith:4VZXHYQE","schema_version":"1.0","canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","source":{"kind":"arxiv","id":"1604.08934","version":2},"attestation_state":"computed","paper":{"title":"An expressive dissimilarity measure for relational clustering using neighbourhood trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Hendrik Blockeel, Sebastijan Dumancic","submitted_at":"2016-04-29T18:48:53Z","abstract_excerpt":"Clustering is an underspecified task: there are no universal criteria for what makes a good clustering. This is especially true for relational data, where similarity can be based on the features of individuals, the relationships between them, or a mix of both. Existing methods for relational clustering have strong and often implicit biases in this respect. In this paper, we introduce a novel similarity measure for relational data. It is the first measure to incorporate a wide variety of types of similarity, including similarity of attributes, similarity of relational context, and proximity in "},"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":"1604.08934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-29T18:48:53Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b94c9866a2e9dee605691a8d8e4eec5fbcf48dcb43f2b30ef0e2be74e5bf54ac","abstract_canon_sha256":"47ea28203ac448f5df7f36ba798300a61988b67486c24e4c80f11a622a157fb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:10.448916Z","signature_b64":"40bHs6ObEdCsJ9df2EEZRfe9E831Ol2GufSqHlxRQ3SZUOJ1XIFmJfqlBOcALgaxOLWMUWA1clNSrq9rWZA9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","last_reissued_at":"2026-05-18T00:34:10.448184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:10.448184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An expressive dissimilarity measure for relational clustering using neighbourhood trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Hendrik Blockeel, Sebastijan Dumancic","submitted_at":"2016-04-29T18:48:53Z","abstract_excerpt":"Clustering is an underspecified task: there are no universal criteria for what makes a good clustering. This is especially true for relational data, where similarity can be based on the features of individuals, the relationships between them, or a mix of both. Existing methods for relational clustering have strong and often implicit biases in this respect. In this paper, we introduce a novel similarity measure for relational data. It is the first measure to incorporate a wide variety of types of similarity, including similarity of attributes, similarity of relational context, and proximity in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08934","kind":"arxiv","version":2},"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":"1604.08934","created_at":"2026-05-18T00:34:10.448288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08934v2","created_at":"2026-05-18T00:34:10.448288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08934","created_at":"2026-05-18T00:34:10.448288+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/4VZXHYQE2WZLEDBNEXID2NWHMN","json":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN.json","graph_json":"https://pith.science/api/pith-number/4VZXHYQE2WZLEDBNEXID2NWHMN/graph.json","events_json":"https://pith.science/api/pith-number/4VZXHYQE2WZLEDBNEXID2NWHMN/events.json","paper":"https://pith.science/paper/4VZXHYQE"},"agent_actions":{"view_html":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN","download_json":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN.json","view_paper":"https://pith.science/paper/4VZXHYQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08934&json=true","fetch_graph":"https://pith.science/api/pith-number/4VZXHYQE2WZLEDBNEXID2NWHMN/graph.json","fetch_events":"https://pith.science/api/pith-number/4VZXHYQE2WZLEDBNEXID2NWHMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/action/storage_attestation","attest_author":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/action/author_attestation","sign_citation":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/action/citation_signature","submit_replication":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/action/replication_record"}},"created_at":"2026-05-18T00:34:10.448288+00:00","updated_at":"2026-05-18T00:34:10.448288+00:00"}