{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E6HW56MRW62UHBBNQLAZZILC7G","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":"7ac59826ec1f980d66b0506c757709b7bf5ea35189a8b85659f16094be0af392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-19T19:15:25Z","title_canon_sha256":"18d61df1b7e481a80c0ba47eac28f75061a48008b332e62bc47eeddd59ff1799"},"schema_version":"1.0","source":{"id":"1203.4204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4204","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4204v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4204","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"E6HW56MRW62U","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E6HW56MRW62UHBBN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E6HW56MR","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:9fe7f2dbfd04375a891350d452025817e330750bd7a118606fc489332e7ccef1","target":"graph","created_at":"2026-05-18T03:59:48Z","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":"In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in $O(n \\log n)$ and with post-processing in $O(n^2)$ (worst case) time where $n$ is the size of the data set. We also show that our generalized graph model which also allows the use of potentials at vertices can be used to extract a more detailed pack of information as the {\\it outlier profile} of the data set. In this direction we show that our approach can be used to define","authors_text":"Amir Daneshgar, Basir Shariat Razavi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-19T19:15:25Z","title":"Clustering Using Isoperimetric Number of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4204","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:fc5949f73993bc5eb98dc14836bb46ec0d6087d39b466c0e770c71dd575cd9bc","target":"record","created_at":"2026-05-18T03:59:48Z","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":"7ac59826ec1f980d66b0506c757709b7bf5ea35189a8b85659f16094be0af392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-19T19:15:25Z","title_canon_sha256":"18d61df1b7e481a80c0ba47eac28f75061a48008b332e62bc47eeddd59ff1799"},"schema_version":"1.0","source":{"id":"1203.4204","kind":"arxiv","version":1}},"canonical_sha256":"278f6ef991b7b543842d82c19ca162f9859d457fff480a82d8996a0f0b15aa30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"278f6ef991b7b543842d82c19ca162f9859d457fff480a82d8996a0f0b15aa30","first_computed_at":"2026-05-18T03:59:48.116626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:48.116626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCEA5jgjkBm4SBJCaPRE9G2SuK+fD/OnSU+TJhbM8d1+K85Km+jiBMiP7N6dTjukZgKZSKy6fYlh1SW/2AGKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:48.117070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc5949f73993bc5eb98dc14836bb46ec0d6087d39b466c0e770c71dd575cd9bc","sha256:9fe7f2dbfd04375a891350d452025817e330750bd7a118606fc489332e7ccef1"],"state_sha256":"a5c3f6b00f6c25d443a54e7a2c1a66b93c44d157f39dc121b26c41d8921ee9be"}