{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XBJD2C3MLMPTAJU75P5KEIW3VO","short_pith_number":"pith:XBJD2C3M","canonical_record":{"source":{"id":"1506.06068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-06-19T16:03:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"01dba735bcb2643deb45f227816dca555017a51d775bd83c1feed4394e0193f5","abstract_canon_sha256":"91e511ea6c9b4d578c27190c42b77f4be562a2ae7f0a7e89932a366b788b723c"},"schema_version":"1.0"},"canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","source":{"kind":"arxiv","id":"1506.06068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06068","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06068v1","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06068","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"XBJD2C3MLMPT","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XBJD2C3MLMPTAJU7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XBJD2C3M","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XBJD2C3MLMPTAJU75P5KEIW3VO","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-06-19T16:03:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"01dba735bcb2643deb45f227816dca555017a51d775bd83c1feed4394e0193f5","abstract_canon_sha256":"91e511ea6c9b4d578c27190c42b77f4be562a2ae7f0a7e89932a366b788b723c"},"schema_version":"1.0"},"canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:46.349420Z","signature_b64":"gd5MEnN3WB3hvbShPRdil1wVicESFCsVQCOCRtSaRpj44KQSdTTgXCKRZQoXQXG7wtsom6Ae7LkuuY3huCzqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","last_reissued_at":"2026-05-18T01:42:46.348806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:46.348806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06068","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-18T01:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAt7xOoB6lpuFeNU9iXKfJY0SzMxcDP1MiW7FeHozG/n/yxJxC4/xTfmg9pjOL12Mue3AJnGeU2yByDOCleMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:02:00.214611Z"},"content_sha256":"586bce9bf8469882c7085cc077064d769ff777055b90e1d2451f0d0a80a63fcc","schema_version":"1.0","event_id":"sha256:586bce9bf8469882c7085cc077064d769ff777055b90e1d2451f0d0a80a63fcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XBJD2C3MLMPTAJU75P5KEIW3VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general framework for the IT-based clustering methods","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-06-19T16:03:31Z","abstract_excerpt":"Previously, we proposed a physically inspired rule to organize the data points in a sparse yet effective structure, called the in-tree (IT) graph, which is able to capture a wide class of underlying cluster structures in the datasets, especially for the density-based datasets. Although there are some redundant edges or lines between clusters requiring to be removed by computer, this IT graph has a big advantage compared with the k-nearest-neighborhood (k-NN) or the minimal spanning tree (MST) graph, in that the redundant edges in the IT graph are much more distinguishable and thus can be easil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06068","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-18T01:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"radijLp4RyE1DRTbQIKp3rxa1xSHJ4lNYejM4bLDbMeTrEvLJmE2HLwFPs+Ja1f/+YAAVItbTucB2+QtiqMDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:02:00.214956Z"},"content_sha256":"aa5bdbad5a33abf3b726107289ba1aa98dc605ed11c353fcc1892cb4a59ec66d","schema_version":"1.0","event_id":"sha256:aa5bdbad5a33abf3b726107289ba1aa98dc605ed11c353fcc1892cb4a59ec66d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/bundle.json","state_url":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/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-29T02:02:00Z","links":{"resolver":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO","bundle":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/bundle.json","state":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XBJD2C3MLMPTAJU75P5KEIW3VO","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":"91e511ea6c9b4d578c27190c42b77f4be562a2ae7f0a7e89932a366b788b723c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-06-19T16:03:31Z","title_canon_sha256":"01dba735bcb2643deb45f227816dca555017a51d775bd83c1feed4394e0193f5"},"schema_version":"1.0","source":{"id":"1506.06068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06068","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06068v1","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06068","created_at":"2026-05-18T01:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"XBJD2C3MLMPT","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XBJD2C3MLMPTAJU7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XBJD2C3M","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:aa5bdbad5a33abf3b726107289ba1aa98dc605ed11c353fcc1892cb4a59ec66d","target":"graph","created_at":"2026-05-18T01:42: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":"Previously, we proposed a physically inspired rule to organize the data points in a sparse yet effective structure, called the in-tree (IT) graph, which is able to capture a wide class of underlying cluster structures in the datasets, especially for the density-based datasets. Although there are some redundant edges or lines between clusters requiring to be removed by computer, this IT graph has a big advantage compared with the k-nearest-neighborhood (k-NN) or the minimal spanning tree (MST) graph, in that the redundant edges in the IT graph are much more distinguishable and thus can be easil","authors_text":"Teng Qiu, Yongjie Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-06-19T16:03:31Z","title":"A general framework for the IT-based clustering methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06068","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:586bce9bf8469882c7085cc077064d769ff777055b90e1d2451f0d0a80a63fcc","target":"record","created_at":"2026-05-18T01:42: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":"91e511ea6c9b4d578c27190c42b77f4be562a2ae7f0a7e89932a366b788b723c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-06-19T16:03:31Z","title_canon_sha256":"01dba735bcb2643deb45f227816dca555017a51d775bd83c1feed4394e0193f5"},"schema_version":"1.0","source":{"id":"1506.06068","kind":"arxiv","version":1}},"canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","first_computed_at":"2026-05-18T01:42:46.348806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:46.348806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gd5MEnN3WB3hvbShPRdil1wVicESFCsVQCOCRtSaRpj44KQSdTTgXCKRZQoXQXG7wtsom6Ae7LkuuY3huCzqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:46.349420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:586bce9bf8469882c7085cc077064d769ff777055b90e1d2451f0d0a80a63fcc","sha256:aa5bdbad5a33abf3b726107289ba1aa98dc605ed11c353fcc1892cb4a59ec66d"],"state_sha256":"f219847ad2dcffc8ff740875ee8e1c7078d8070f42d6ea9f352590f241dbba7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmezHNfZf5ipAc9CN3TD5eRjq/gKz+NBJk5rQlXcOZhEhkp6W/T2zkjrCRppl44TFkbOfqu3494vL3tQaNWnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T02:02:00.216966Z","bundle_sha256":"86835980641130a9b41ac56577b853462df59b82d61557c9711f3a7cf2182b79"}}