{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BWGBMLA2O55GFFFPGNKSRPAQJ2","short_pith_number":"pith:BWGBMLA2","schema_version":"1.0","canonical_sha256":"0d8c162c1a777a6294af335528bc104e987aef1e9daf72139b8bcc383573928e","source":{"kind":"arxiv","id":"1501.04318","version":2},"attestation_state":"computed","paper":{"title":"Clustering based on the In-tree Graph Structure and Affinity Propagation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-01-18T15:34:19Z","abstract_excerpt":"A recently proposed clustering method, called the Nearest Descent (ND), can organize the whole dataset into a sparsely connected graph, called the In-tree. This ND-based Intree structure proves able to reveal the clustering structure underlying the dataset, except one imperfect place, that is, there are some undesired edges in this In-tree which require to be removed. Here, we propose an effective way to automatically remove the undesired edges in In-tree via an effective combination of the In-tree structure with affinity propagation (AP). The key for the combination is to add edges between th"},"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":"1501.04318","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T15:34:19Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"172204aa0be62f9aa4cdf559f2f3aa19b68aa7550e2bf03e6061da2e5d087935","abstract_canon_sha256":"aeeb1e85e1ab2a5125131bb26f6a734791f3897f26cc5af9a59f9319f1be0026"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.479579Z","signature_b64":"yp5NYtFEujhDZRzTWKpyOxAUwMmVtKJL6lcpsv/Ub/YY+o/fO9YpRR2l5LHdj1ZihC3TviBTUtB4yPX1A20cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8c162c1a777a6294af335528bc104e987aef1e9daf72139b8bcc383573928e","last_reissued_at":"2026-05-18T00:25:02.479187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.479187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering based on the In-tree Graph Structure and Affinity Propagation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-01-18T15:34:19Z","abstract_excerpt":"A recently proposed clustering method, called the Nearest Descent (ND), can organize the whole dataset into a sparsely connected graph, called the In-tree. This ND-based Intree structure proves able to reveal the clustering structure underlying the dataset, except one imperfect place, that is, there are some undesired edges in this In-tree which require to be removed. Here, we propose an effective way to automatically remove the undesired edges in In-tree via an effective combination of the In-tree structure with affinity propagation (AP). The key for the combination is to add edges between th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04318","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":"1501.04318","created_at":"2026-05-18T00:25:02.479250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04318v2","created_at":"2026-05-18T00:25:02.479250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04318","created_at":"2026-05-18T00:25:02.479250+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWGBMLA2O55G","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWGBMLA2O55GFFFP","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWGBMLA2","created_at":"2026-05-18T12:29:14.074870+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/BWGBMLA2O55GFFFPGNKSRPAQJ2","json":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2.json","graph_json":"https://pith.science/api/pith-number/BWGBMLA2O55GFFFPGNKSRPAQJ2/graph.json","events_json":"https://pith.science/api/pith-number/BWGBMLA2O55GFFFPGNKSRPAQJ2/events.json","paper":"https://pith.science/paper/BWGBMLA2"},"agent_actions":{"view_html":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2","download_json":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2.json","view_paper":"https://pith.science/paper/BWGBMLA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04318&json=true","fetch_graph":"https://pith.science/api/pith-number/BWGBMLA2O55GFFFPGNKSRPAQJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/BWGBMLA2O55GFFFPGNKSRPAQJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2/action/storage_attestation","attest_author":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2/action/author_attestation","sign_citation":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2/action/citation_signature","submit_replication":"https://pith.science/pith/BWGBMLA2O55GFFFPGNKSRPAQJ2/action/replication_record"}},"created_at":"2026-05-18T00:25:02.479250+00:00","updated_at":"2026-05-18T00:25:02.479250+00:00"}