{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UOIBKNRCSCAJU57GJ6M74WQNLN","short_pith_number":"pith:UOIBKNRC","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"},"canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","source":{"kind":"arxiv","id":"1702.04739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04739","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04739v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04739","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"UOIBKNRCSCAJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOIBKNRCSCAJU57G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOIBKNRC","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UOIBKNRCSCAJU57GJ6M74WQNLN","target":"record","payload":{"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"},"canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","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"},"source_kind":"arxiv","source_id":"1702.04739","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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GqqnI/+MZ0eqWSW/H3qoSSwQD4eV5ciHz7m6QHqoud3RkRecYS94eUb0aBkPjyWmA99I5AxriVaKCADA9h3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:36.205779Z"},"content_sha256":"b88be495a0cf53379716bf04bb21b0c48343b77574a04b01c9baa2efdcd952f1","schema_version":"1.0","event_id":"sha256:b88be495a0cf53379716bf04bb21b0c48343b77574a04b01c9baa2efdcd952f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UOIBKNRCSCAJU57GJ6M74WQNLN","target":"graph","payload":{"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"},"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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arnFVgJa1nYMLvYRCPfQbPlPX5wDo4M2pS76fEt8mSn46nlpEXttizfZjAuemv7wbEvqQk58MwxEDqxRpUg7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:36.206394Z"},"content_sha256":"dcf7d7622008468ea1ce8dd55b5148d7c286f166737f4defee3f18dbba53fa2c","schema_version":"1.0","event_id":"sha256:dcf7d7622008468ea1ce8dd55b5148d7c286f166737f4defee3f18dbba53fa2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/bundle.json","state_url":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/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-05-31T14:52:36Z","links":{"resolver":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN","bundle":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/bundle.json","state":"https://pith.science/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOIBKNRCSCAJU57GJ6M74WQNLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UOIBKNRCSCAJU57GJ6M74WQNLN","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":"49d3b9ba58514379e2c6ee9b9ddbfdf69b968fc324d36c56849b9dc034ac5517","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T19:14:54Z","title_canon_sha256":"2826d2a41e0fc30c51ef6d4b77a7ee2bd5acc10f98011e6c31e80581885bb825"},"schema_version":"1.0","source":{"id":"1702.04739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04739","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04739v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04739","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"UOIBKNRCSCAJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOIBKNRCSCAJU57G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOIBKNRC","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:dcf7d7622008468ea1ce8dd55b5148d7c286f166737f4defee3f18dbba53fa2c","target":"graph","created_at":"2026-05-18T00:50:37Z","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":"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.","authors_text":"Ramin Javadi, Saleh Ashkboos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T19:14:54Z","title":"An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04739","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:b88be495a0cf53379716bf04bb21b0c48343b77574a04b01c9baa2efdcd952f1","target":"record","created_at":"2026-05-18T00:50:37Z","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":"49d3b9ba58514379e2c6ee9b9ddbfdf69b968fc324d36c56849b9dc034ac5517","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T19:14:54Z","title_canon_sha256":"2826d2a41e0fc30c51ef6d4b77a7ee2bd5acc10f98011e6c31e80581885bb825"},"schema_version":"1.0","source":{"id":"1702.04739","kind":"arxiv","version":1}},"canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a39015362290809a77e64f99fe5a0d5b50a7ec351083a5ca290433597ffeeaf4","first_computed_at":"2026-05-18T00:50:37.216281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.216281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M6BeU4k7s6wLPeGzx3aTgRKGLXmy5HhryC4l3b3sEN+JXFhaC5CHQ4KKFnhtOaRh27YiVjyLpvaJtu+1POJ4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.216869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b88be495a0cf53379716bf04bb21b0c48343b77574a04b01c9baa2efdcd952f1","sha256:dcf7d7622008468ea1ce8dd55b5148d7c286f166737f4defee3f18dbba53fa2c"],"state_sha256":"a8174befccbee2fa29c27e684df8490ef469fca217db000c3f69fc3c396d67a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCvpGKULQi9OchpXjoXWu1MmZ8EvLvRizYVxklWXXNMO/LziLaPGmcC2rADsF3AHjbyRQL4W6zzq0m93NphACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:52:36.209730Z","bundle_sha256":"55e9ac61f1f1c33d86aaa473fc76bc9c377e2163117db36a4e35a95e5c72cc07"}}