{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:UXSJ4YSUTFPMSG7FJT5WKPVH37","short_pith_number":"pith:UXSJ4YSU","canonical_record":{"source":{"id":"cs/0011032","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2000-11-21T21:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"afeb47f307c46f140f0334fc158e507318ce94cf76bd70a038ef62d70bdaaa08","abstract_canon_sha256":"87bff655ffd90bbf258817ad4c2db08d14a65146398580e7fbc18ea8260f813e"},"schema_version":"1.0"},"canonical_sha256":"a5e49e6254995ec91be54cfb653ea7dff1699f4676e03c6b901724227fe914a2","source":{"kind":"arxiv","id":"cs/0011032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0011032","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0011032v1","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0011032","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"UXSJ4YSUTFPM","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_16","alias_value":"UXSJ4YSUTFPMSG7F","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_8","alias_value":"UXSJ4YSU","created_at":"2026-07-04T14:24:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:UXSJ4YSUTFPMSG7FJT5WKPVH37","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0011032","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2000-11-21T21:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"afeb47f307c46f140f0334fc158e507318ce94cf76bd70a038ef62d70bdaaa08","abstract_canon_sha256":"87bff655ffd90bbf258817ad4c2db08d14a65146398580e7fbc18ea8260f813e"},"schema_version":"1.0"},"canonical_sha256":"a5e49e6254995ec91be54cfb653ea7dff1699f4676e03c6b901724227fe914a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:06.040879Z","signature_b64":"hfnaVC6bGZKNaXjLoi1BswfO6su9o6CSVCQP8pNyDag/2UdgQV/1s4R2RItx9N+R6oVrPvbVo44vG1FjtBJsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5e49e6254995ec91be54cfb653ea7dff1699f4676e03c6b901724227fe914a2","last_reissued_at":"2026-07-04T14:24:06.040464Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:06.040464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0011032","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-07-04T14:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsB19iTjcgGw/aOzuMZMkUGcDpgMeDRIZUcAH+SethJZ7p7P7LkiYTH/VIp2jXGqV68UBldK6eiXCmXP7dGjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:37:02.243297Z"},"content_sha256":"04b1fd4d27693ca84d899f1cff71215ebb645b8770e0b393f4a5c4c0f4d6bf33","schema_version":"1.0","event_id":"sha256:04b1fd4d27693ca84d899f1cff71215ebb645b8770e0b393f4a5c4c0f4d6bf33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:UXSJ4YSUTFPMSG7FJT5WKPVH37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-down induction of clustering trees","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hendrik Blockeel, Jan Ramon, Luc De Raedt","submitted_at":"2000-11-21T21:51:01Z","abstract_excerpt":"An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the TIC (Top down Induction of Clustering trees) system for first order clustering. The TIC system employs the first order logical decision tree representation of the inductive logic programming system Tilde. Various experiments with TIC are presented, in both propositional and relational domains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0011032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0011032/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTq1tGRIiITeRfLE/Wi19SqVpHz8drWDEkbLuyyLM1IRG/KAfuinV8SZpf3N2LwnzK4F1r4df9F/l0V67vcoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:37:02.243844Z"},"content_sha256":"97ebee45a71a4b5ef8d68205fcd65c77ec40ce14db23a70c241276fe9735730c","schema_version":"1.0","event_id":"sha256:97ebee45a71a4b5ef8d68205fcd65c77ec40ce14db23a70c241276fe9735730c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/bundle.json","state_url":"https://pith.science/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/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-08-04T05:37:02Z","links":{"resolver":"https://pith.science/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37","bundle":"https://pith.science/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/bundle.json","state":"https://pith.science/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXSJ4YSUTFPMSG7FJT5WKPVH37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:UXSJ4YSUTFPMSG7FJT5WKPVH37","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":"87bff655ffd90bbf258817ad4c2db08d14a65146398580e7fbc18ea8260f813e","cross_cats_sorted":[],"license":"","primary_cat":"cs.LG","submitted_at":"2000-11-21T21:51:01Z","title_canon_sha256":"afeb47f307c46f140f0334fc158e507318ce94cf76bd70a038ef62d70bdaaa08"},"schema_version":"1.0","source":{"id":"cs/0011032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0011032","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0011032v1","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0011032","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"UXSJ4YSUTFPM","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_16","alias_value":"UXSJ4YSUTFPMSG7F","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_8","alias_value":"UXSJ4YSU","created_at":"2026-07-04T14:24:06Z"}],"graph_snapshots":[{"event_id":"sha256:97ebee45a71a4b5ef8d68205fcd65c77ec40ce14db23a70c241276fe9735730c","target":"graph","created_at":"2026-07-04T14:24:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0011032/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the TIC (Top down Induction of Clustering trees) system for first order clustering. The TIC system employs the first order logical decision tree representation of the inductive logic programming system Tilde. Various experiments with TIC are presented, in both propositional and relational domains.","authors_text":"Hendrik Blockeel, Jan Ramon, Luc De Raedt","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LG","submitted_at":"2000-11-21T21:51:01Z","title":"Top-down induction of clustering trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0011032","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:04b1fd4d27693ca84d899f1cff71215ebb645b8770e0b393f4a5c4c0f4d6bf33","target":"record","created_at":"2026-07-04T14:24:06Z","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":"87bff655ffd90bbf258817ad4c2db08d14a65146398580e7fbc18ea8260f813e","cross_cats_sorted":[],"license":"","primary_cat":"cs.LG","submitted_at":"2000-11-21T21:51:01Z","title_canon_sha256":"afeb47f307c46f140f0334fc158e507318ce94cf76bd70a038ef62d70bdaaa08"},"schema_version":"1.0","source":{"id":"cs/0011032","kind":"arxiv","version":1}},"canonical_sha256":"a5e49e6254995ec91be54cfb653ea7dff1699f4676e03c6b901724227fe914a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5e49e6254995ec91be54cfb653ea7dff1699f4676e03c6b901724227fe914a2","first_computed_at":"2026-07-04T14:24:06.040464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:06.040464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hfnaVC6bGZKNaXjLoi1BswfO6su9o6CSVCQP8pNyDag/2UdgQV/1s4R2RItx9N+R6oVrPvbVo44vG1FjtBJsDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:06.040879Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0011032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b1fd4d27693ca84d899f1cff71215ebb645b8770e0b393f4a5c4c0f4d6bf33","sha256:97ebee45a71a4b5ef8d68205fcd65c77ec40ce14db23a70c241276fe9735730c"],"state_sha256":"e49f815b4fc7977bbedeee29e082c3aa98f75ecea93c2f221c5db237e11d7c0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/sHaLxtu3aZ/NXJqwaUg2N6yh7Jgkr/Sbgds7kDfN4ArYKha95TogJHe+je/c47LBRzMVpA0ITOCP1Hr5x3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:37:02.249043Z","bundle_sha256":"8b80f13cc84ed887beab6f8d222a6bd9d720e20bd13561aef7481f11f84bb3eb"}}