{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E6HW56MRW62UHBBNQLAZZILC7G","short_pith_number":"pith:E6HW56MR","schema_version":"1.0","canonical_sha256":"278f6ef991b7b543842d82c19ca162f9859d457fff480a82d8996a0f0b15aa30","source":{"kind":"arxiv","id":"1203.4204","version":1},"attestation_state":"computed","paper":{"title":"Clustering Using Isoperimetric Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir Daneshgar, Basir Shariat Razavi, Ramin Javadi","submitted_at":"2012-03-19T19:15:25Z","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"},"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":"1203.4204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-19T19:15:25Z","cross_cats_sorted":[],"title_canon_sha256":"18d61df1b7e481a80c0ba47eac28f75061a48008b332e62bc47eeddd59ff1799","abstract_canon_sha256":"7ac59826ec1f980d66b0506c757709b7bf5ea35189a8b85659f16094be0af392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.117070Z","signature_b64":"zCEA5jgjkBm4SBJCaPRE9G2SuK+fD/OnSU+TJhbM8d1+K85Km+jiBMiP7N6dTjukZgKZSKy6fYlh1SW/2AGKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"278f6ef991b7b543842d82c19ca162f9859d457fff480a82d8996a0f0b15aa30","last_reissued_at":"2026-05-18T03:59:48.116626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.116626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering Using Isoperimetric Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir Daneshgar, Basir Shariat Razavi, Ramin Javadi","submitted_at":"2012-03-19T19:15:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4204","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":"1203.4204","created_at":"2026-05-18T03:59:48.116691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4204v1","created_at":"2026-05-18T03:59:48.116691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4204","created_at":"2026-05-18T03:59:48.116691+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6HW56MRW62U","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6HW56MRW62UHBBN","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6HW56MR","created_at":"2026-05-18T12:27:04.183437+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/E6HW56MRW62UHBBNQLAZZILC7G","json":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G.json","graph_json":"https://pith.science/api/pith-number/E6HW56MRW62UHBBNQLAZZILC7G/graph.json","events_json":"https://pith.science/api/pith-number/E6HW56MRW62UHBBNQLAZZILC7G/events.json","paper":"https://pith.science/paper/E6HW56MR"},"agent_actions":{"view_html":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G","download_json":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G.json","view_paper":"https://pith.science/paper/E6HW56MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4204&json=true","fetch_graph":"https://pith.science/api/pith-number/E6HW56MRW62UHBBNQLAZZILC7G/graph.json","fetch_events":"https://pith.science/api/pith-number/E6HW56MRW62UHBBNQLAZZILC7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G/action/storage_attestation","attest_author":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G/action/author_attestation","sign_citation":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G/action/citation_signature","submit_replication":"https://pith.science/pith/E6HW56MRW62UHBBNQLAZZILC7G/action/replication_record"}},"created_at":"2026-05-18T03:59:48.116691+00:00","updated_at":"2026-05-18T03:59:48.116691+00:00"}