{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4SUIXY7LWTTXWXBCEVXNA5QB2B","short_pith_number":"pith:4SUIXY7L","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"},"canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","source":{"kind":"arxiv","id":"1405.5737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5737","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5737v2","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5737","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"4SUIXY7LWTTX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SUIXY7LWTTXWXBC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SUIXY7L","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4SUIXY7LWTTXWXBCEVXNA5QB2B","target":"record","payload":{"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"},"canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","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"},"source_kind":"arxiv","source_id":"1405.5737","source_version":2,"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-18T02:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yherwPqgrTiL4fYEL+Pxp2xm5Fz6XfjoxmId3cAbbhzgbghI2tbduw12zhFxT4ZjqZ9jC05arqynlC6mMX3+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:47:11.044974Z"},"content_sha256":"6c174057abe4f7bb4a12a701e3d812c94bf31770d4c9e8245a37d2aa89399a8c","schema_version":"1.0","event_id":"sha256:6c174057abe4f7bb4a12a701e3d812c94bf31770d4c9e8245a37d2aa89399a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4SUIXY7LWTTXWXBCEVXNA5QB2B","target":"graph","payload":{"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"},"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-18T02:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivse8DcDntWtsG2mDFb/AebBa/7I+Y91iCYyi3vQttnemqeS47xwL6WByTKU09YtSC9nflVLPYCK1J/FdQBwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:47:11.045337Z"},"content_sha256":"e8ac75ad39f911ef2db1a338d548e00f6637b14ffc242520a8a46de296b73e22","schema_version":"1.0","event_id":"sha256:e8ac75ad39f911ef2db1a338d548e00f6637b14ffc242520a8a46de296b73e22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/bundle.json","state_url":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/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-06-22T12:47:11Z","links":{"resolver":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B","bundle":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/bundle.json","state":"https://pith.science/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SUIXY7LWTTXWXBCEVXNA5QB2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4SUIXY7LWTTXWXBCEVXNA5QB2B","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":"8d133fa879ec485533a6943fbbb69f9b9fa84a433a66cabf1e726c85ab4aeeb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-22T13:05:27Z","title_canon_sha256":"1c8ba89793935fdaefcd9363f7d3b392f794cdb2ab8ec1ef4f9b4ebfc30a0df5"},"schema_version":"1.0","source":{"id":"1405.5737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5737","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5737v2","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5737","created_at":"2026-05-18T02:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"4SUIXY7LWTTX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SUIXY7LWTTXWXBC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SUIXY7L","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:e8ac75ad39f911ef2db1a338d548e00f6637b14ffc242520a8a46de296b73e22","target":"graph","created_at":"2026-05-18T02:41:53Z","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 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","authors_text":"Ajmal S. Mian, Arif Mahmood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-22T13:05:27Z","title":"Semi-supervised Spectral Clustering for Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5737","kind":"arxiv","version":2},"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:6c174057abe4f7bb4a12a701e3d812c94bf31770d4c9e8245a37d2aa89399a8c","target":"record","created_at":"2026-05-18T02:41:53Z","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":"8d133fa879ec485533a6943fbbb69f9b9fa84a433a66cabf1e726c85ab4aeeb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-22T13:05:27Z","title_canon_sha256":"1c8ba89793935fdaefcd9363f7d3b392f794cdb2ab8ec1ef4f9b4ebfc30a0df5"},"schema_version":"1.0","source":{"id":"1405.5737","kind":"arxiv","version":2}},"canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4a88be3ebb4e77b5c22256ed07601d053ad8176ecbd779d81442fac67157b77","first_computed_at":"2026-05-18T02:41:53.089967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:53.089967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aPUnqZ7zy/eMlIEewKRikwuX/YLqpic9aI4iUx9d1g82mYfv5PLsidDLHPxhKtN14DRRxR/pgPN1Y21TKz9rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:53.090643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c174057abe4f7bb4a12a701e3d812c94bf31770d4c9e8245a37d2aa89399a8c","sha256:e8ac75ad39f911ef2db1a338d548e00f6637b14ffc242520a8a46de296b73e22"],"state_sha256":"f4acea37604f473434bf3b47f2ed18de0947c5328f32882a8836124c4f71f53c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bog0YZEIr/t7ByN33zEKkzEIqqKDgnwrcXujdad1bkA9ECxQ7QkNhvgX2vvohnL2xjnE2AM9JMZkPdnRcFD2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:47:11.047392Z","bundle_sha256":"ccd1b1f92e6635ffad5edf57c5aea75465e387da5317583d2b88d446374b4957"}}