{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XBJD2C3MLMPTAJU75P5KEIW3VO","short_pith_number":"pith:XBJD2C3M","schema_version":"1.0","canonical_sha256":"b8523d0b6c5b1f30269febfaa222dbaba0b0150ff7b5d5574282c566901930a8","source":{"kind":"arxiv","id":"1506.06068","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.06068","created_at":"2026-05-18T01:42:46.348886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06068v1","created_at":"2026-05-18T01:42:46.348886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06068","created_at":"2026-05-18T01:42:46.348886+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBJD2C3MLMPT","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBJD2C3MLMPTAJU7","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBJD2C3M","created_at":"2026-05-18T12:29:50.041715+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/XBJD2C3MLMPTAJU75P5KEIW3VO","json":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO.json","graph_json":"https://pith.science/api/pith-number/XBJD2C3MLMPTAJU75P5KEIW3VO/graph.json","events_json":"https://pith.science/api/pith-number/XBJD2C3MLMPTAJU75P5KEIW3VO/events.json","paper":"https://pith.science/paper/XBJD2C3M"},"agent_actions":{"view_html":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO","download_json":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO.json","view_paper":"https://pith.science/paper/XBJD2C3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06068&json=true","fetch_graph":"https://pith.science/api/pith-number/XBJD2C3MLMPTAJU75P5KEIW3VO/graph.json","fetch_events":"https://pith.science/api/pith-number/XBJD2C3MLMPTAJU75P5KEIW3VO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/action/storage_attestation","attest_author":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/action/author_attestation","sign_citation":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/action/citation_signature","submit_replication":"https://pith.science/pith/XBJD2C3MLMPTAJU75P5KEIW3VO/action/replication_record"}},"created_at":"2026-05-18T01:42:46.348886+00:00","updated_at":"2026-05-18T01:42:46.348886+00:00"}