{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4SUIXY7LWTTXWXBCEVXNA5QB2B","short_pith_number":"pith:4SUIXY7L","schema_version":"1.0","canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","source":{"kind":"arxiv","id":"1405.5737","version":2},"attestation_state":"computed","paper":{"title":"Semi-supervised Spectral Clustering for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ajmal S. Mian, Arif Mahmood","submitted_at":"2014-05-22T13:05:27Z","abstract_excerpt":"We propose a Classification Via Clustering (CVC) algorithm which enables existing clustering methods to be efficiently employed in classification problems. In CVC, training and test data are co-clustered and class-cluster distributions are used to find the label of the test data. To determine an efficient number of clusters, a Semi-supervised Hierarchical Clustering (SHC) algorithm is proposed. Clusters are obtained by hierarchically applying two-way NCut by using signs of the Fiedler vector of the normalized graph Laplacian. To this end, a Direct Fiedler Vector Computation algorithm is propos"},"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":"1405.5737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-22T13:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"1c8ba89793935fdaefcd9363f7d3b392f794cdb2ab8ec1ef4f9b4ebfc30a0df5","abstract_canon_sha256":"8d133fa879ec485533a6943fbbb69f9b9fa84a433a66cabf1e726c85ab4aeeb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:53.090643Z","signature_b64":"aPUnqZ7zy/eMlIEewKRikwuX/YLqpic9aI4iUx9d1g82mYfv5PLsidDLHPxhKtN14DRRxR/pgPN1Y21TKz9rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","last_reissued_at":"2026-05-18T02:41:53.089967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:53.089967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Spectral Clustering for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ajmal S. Mian, Arif Mahmood","submitted_at":"2014-05-22T13:05:27Z","abstract_excerpt":"We propose a Classification Via Clustering (CVC) algorithm which enables existing clustering methods to be efficiently employed in classification problems. In CVC, training and test data are co-clustered and class-cluster distributions are used to find the label of the test data. To determine an efficient number of clusters, a Semi-supervised Hierarchical Clustering (SHC) algorithm is proposed. Clusters are obtained by hierarchically applying two-way NCut by using signs of the Fiedler vector of the normalized graph Laplacian. To this end, a Direct Fiedler Vector Computation algorithm is propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5737","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":"1405.5737","created_at":"2026-05-18T02:41:53.090054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5737v2","created_at":"2026-05-18T02:41:53.090054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5737","created_at":"2026-05-18T02:41:53.090054+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SUIXY7LWTTX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SUIXY7LWTTXWXBC","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SUIXY7L","created_at":"2026-05-18T12:28:14.216126+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/4SUIXY7LWTTXWXBCEVXNA5QB2B","json":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B.json","graph_json":"https://pith.science/api/pith-number/4SUIXY7LWTTXWXBCEVXNA5QB2B/graph.json","events_json":"https://pith.science/api/pith-number/4SUIXY7LWTTXWXBCEVXNA5QB2B/events.json","paper":"https://pith.science/paper/4SUIXY7L"},"agent_actions":{"view_html":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B","download_json":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B.json","view_paper":"https://pith.science/paper/4SUIXY7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5737&json=true","fetch_graph":"https://pith.science/api/pith-number/4SUIXY7LWTTXWXBCEVXNA5QB2B/graph.json","fetch_events":"https://pith.science/api/pith-number/4SUIXY7LWTTXWXBCEVXNA5QB2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/action/storage_attestation","attest_author":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/action/author_attestation","sign_citation":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/action/citation_signature","submit_replication":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/action/replication_record"}},"created_at":"2026-05-18T02:41:53.090054+00:00","updated_at":"2026-05-18T02:41:53.090054+00:00"}