{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4VZXHYQE2WZLEDBNEXID2NWHMN","short_pith_number":"pith:4VZXHYQE","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"},"canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","source":{"kind":"arxiv","id":"1604.08934","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08934","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08934v2","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08934","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"4VZXHYQE2WZL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VZXHYQE2WZLEDBN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VZXHYQE","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4VZXHYQE2WZLEDBNEXID2NWHMN","target":"record","payload":{"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"},"canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","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"},"source_kind":"arxiv","source_id":"1604.08934","source_version":2,"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDQH75C5Wslbb+hkxwj4Kxr8ZSOeIwp9X9WGuuRNOxWBaAOpyXiK84KBXJhhjMxtvdLmFuFJiq7HR1jAQyb2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:13:29.517275Z"},"content_sha256":"83cd7be218cb8d67e85ac2aa5a2c0ad0044e10f278f0cb816f5f12c559f5e4d5","schema_version":"1.0","event_id":"sha256:83cd7be218cb8d67e85ac2aa5a2c0ad0044e10f278f0cb816f5f12c559f5e4d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4VZXHYQE2WZLEDBNEXID2NWHMN","target":"graph","payload":{"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"},"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1F6pOmhM5cCDzOsPcDPKSuLBDQLda6DT50XqTHUH3Vh6uBPTW3oqCjPwnhUW4RpW1f6KTGgLFRmxHDejHCr8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:13:29.517649Z"},"content_sha256":"37c77eca6812265ea04ee7767afe233ff833d0cc1440ff6a7146f298b72252f0","schema_version":"1.0","event_id":"sha256:37c77eca6812265ea04ee7767afe233ff833d0cc1440ff6a7146f298b72252f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/bundle.json","state_url":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/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-01T00:13:29Z","links":{"resolver":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN","bundle":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/bundle.json","state":"https://pith.science/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VZXHYQE2WZLEDBNEXID2NWHMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4VZXHYQE2WZLEDBNEXID2NWHMN","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":"47ea28203ac448f5df7f36ba798300a61988b67486c24e4c80f11a622a157fb5","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-29T18:48:53Z","title_canon_sha256":"b94c9866a2e9dee605691a8d8e4eec5fbcf48dcb43f2b30ef0e2be74e5bf54ac"},"schema_version":"1.0","source":{"id":"1604.08934","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08934","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08934v2","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08934","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"4VZXHYQE2WZL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VZXHYQE2WZLEDBN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VZXHYQE","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:37c77eca6812265ea04ee7767afe233ff833d0cc1440ff6a7146f298b72252f0","target":"graph","created_at":"2026-05-18T00:34:10Z","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 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 ","authors_text":"Hendrik Blockeel, Sebastijan Dumancic","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-29T18:48:53Z","title":"An expressive dissimilarity measure for relational clustering using neighbourhood trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08934","kind":"arxiv","version":2},"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:83cd7be218cb8d67e85ac2aa5a2c0ad0044e10f278f0cb816f5f12c559f5e4d5","target":"record","created_at":"2026-05-18T00:34:10Z","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":"47ea28203ac448f5df7f36ba798300a61988b67486c24e4c80f11a622a157fb5","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-29T18:48:53Z","title_canon_sha256":"b94c9866a2e9dee605691a8d8e4eec5fbcf48dcb43f2b30ef0e2be74e5bf54ac"},"schema_version":"1.0","source":{"id":"1604.08934","kind":"arxiv","version":2}},"canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e57373e204d5b2b20c2d25d03d36c76367193b53041b9e8de433ff761713ca1d","first_computed_at":"2026-05-18T00:34:10.448184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:10.448184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40bHs6ObEdCsJ9df2EEZRfe9E831Ol2GufSqHlxRQ3SZUOJ1XIFmJfqlBOcALgaxOLWMUWA1clNSrq9rWZA9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:10.448916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08934","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83cd7be218cb8d67e85ac2aa5a2c0ad0044e10f278f0cb816f5f12c559f5e4d5","sha256:37c77eca6812265ea04ee7767afe233ff833d0cc1440ff6a7146f298b72252f0"],"state_sha256":"66bc0157819788388d491fd9f926e57ac82e81e8816fdfb6f476eb0397ca6348"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kyc5/vVhFkdEnwJku7yi3LPH57kPX4MmRoMxQF7vlL7Ye2Gd9icAAkmJHBQJdbEAltMern0aVKXDoOBLjOF+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:13:29.519662Z","bundle_sha256":"1216d8e4d0ab9e6994b65a44b4566b0249e6754701dca463653e5e8cd45fcc65"}}