{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UOIBKNRCSCAJU57GJ6M74WQNLN","short_pith_number":"pith:UOIBKNRC","schema_version":"1.0","canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","source":{"kind":"arxiv","id":"1702.04739","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ramin Javadi, Saleh Ashkboos","submitted_at":"2017-02-15T19:14:54Z","abstract_excerpt":"We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our algorithm with other related ones which demonstrates the general superiority of this parallel algorithm over other competing algorithms in terms of accuracy and speed."},"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":"1702.04739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T19:14:54Z","cross_cats_sorted":[],"title_canon_sha256":"2826d2a41e0fc30c51ef6d4b77a7ee2bd5acc10f98011e6c31e80581885bb825","abstract_canon_sha256":"49d3b9ba58514379e2c6ee9b9ddbfdf69b968fc324d36c56849b9dc034ac5517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.216869Z","signature_b64":"M6BeU4k7s6wLPeGzx3aTgRKGLXmy5HhryC4l3b3sEN+JXFhaC5CHQ4KKFnhtOaRh27YiVjyLpvaJtu+1POJ4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","last_reissued_at":"2026-05-18T00:50:37.216281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.216281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ramin Javadi, Saleh Ashkboos","submitted_at":"2017-02-15T19:14:54Z","abstract_excerpt":"We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our algorithm with other related ones which demonstrates the general superiority of this parallel algorithm over other competing algorithms in terms of accuracy and speed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04739","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":"1702.04739","created_at":"2026-05-18T00:50:37.216383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04739v1","created_at":"2026-05-18T00:50:37.216383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04739","created_at":"2026-05-18T00:50:37.216383+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOIBKNRCSCAJ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOIBKNRCSCAJU57G","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOIBKNRC","created_at":"2026-05-18T12:31:46.661854+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/UOIBKNRCSCAJU57GJ6M74WQNLN","json":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN.json","graph_json":"https://pith.science/api/pith-number/UOIBKNRCSCAJU57GJ6M74WQNLN/graph.json","events_json":"https://pith.science/api/pith-number/UOIBKNRCSCAJU57GJ6M74WQNLN/events.json","paper":"https://pith.science/paper/UOIBKNRC"},"agent_actions":{"view_html":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN","download_json":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN.json","view_paper":"https://pith.science/paper/UOIBKNRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04739&json=true","fetch_graph":"https://pith.science/api/pith-number/UOIBKNRCSCAJU57GJ6M74WQNLN/graph.json","fetch_events":"https://pith.science/api/pith-number/UOIBKNRCSCAJU57GJ6M74WQNLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/action/storage_attestation","attest_author":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/action/author_attestation","sign_citation":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/action/citation_signature","submit_replication":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/action/replication_record"}},"created_at":"2026-05-18T00:50:37.216383+00:00","updated_at":"2026-05-18T00:50:37.216383+00:00"}