{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A6KWCNC5QPDAPP452U356AGVHB","short_pith_number":"pith:A6KWCNC5","schema_version":"1.0","canonical_sha256":"079561345d83c607bf9dd537df00d538781fcdd234414d060d6e025b0a0e8ddd","source":{"kind":"arxiv","id":"1503.01531","version":1},"attestation_state":"computed","paper":{"title":"Spectral Clustering by Ellipsoid and Its Connection to Separable Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tomohiko Mizutani","submitted_at":"2015-03-05T04:07:46Z","abstract_excerpt":"This paper proposes a variant of the normalized cut algorithm for spectral clustering. Although the normalized cut algorithm applies the K-means algorithm to the eigenvectors of a normalized graph Laplacian for finding clusters, our algorithm instead uses a minimum volume enclosing ellipsoid for them. We show that the algorithm shares similarity with the ellipsoidal rounding algorithm for separable nonnegative matrix factorization. Our theoretical insight implies that the algorithm can serve as a bridge between spectral clustering and separable NMF. The K-means algorithm has the issues in that"},"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":"1503.01531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-05T04:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"4393e2fc4e1df3a1e83adb467577d85d5594f68324a18e1642dbb490270a4189","abstract_canon_sha256":"d2333ff90e7e5f3da5d5c28da30d52e283836d7265853f700aa883caeebc348f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:33.450099Z","signature_b64":"Ji4V6hhZ9/GA0LHja8r41NBybvUrdCSlpCjKXM4NeD6tj3n0Tm7WJqLhtt9gWjsnNobhz01DCjjRSmR6P8ErDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079561345d83c607bf9dd537df00d538781fcdd234414d060d6e025b0a0e8ddd","last_reissued_at":"2026-05-18T02:25:33.449638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:33.449638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Clustering by Ellipsoid and Its Connection to Separable Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tomohiko Mizutani","submitted_at":"2015-03-05T04:07:46Z","abstract_excerpt":"This paper proposes a variant of the normalized cut algorithm for spectral clustering. Although the normalized cut algorithm applies the K-means algorithm to the eigenvectors of a normalized graph Laplacian for finding clusters, our algorithm instead uses a minimum volume enclosing ellipsoid for them. We show that the algorithm shares similarity with the ellipsoidal rounding algorithm for separable nonnegative matrix factorization. Our theoretical insight implies that the algorithm can serve as a bridge between spectral clustering and separable NMF. The K-means algorithm has the issues in that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01531","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":"1503.01531","created_at":"2026-05-18T02:25:33.449709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01531v1","created_at":"2026-05-18T02:25:33.449709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01531","created_at":"2026-05-18T02:25:33.449709+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6KWCNC5QPDA","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6KWCNC5QPDAPP45","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6KWCNC5","created_at":"2026-05-18T12:29:10.953037+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/A6KWCNC5QPDAPP452U356AGVHB","json":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB.json","graph_json":"https://pith.science/api/pith-number/A6KWCNC5QPDAPP452U356AGVHB/graph.json","events_json":"https://pith.science/api/pith-number/A6KWCNC5QPDAPP452U356AGVHB/events.json","paper":"https://pith.science/paper/A6KWCNC5"},"agent_actions":{"view_html":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB","download_json":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB.json","view_paper":"https://pith.science/paper/A6KWCNC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01531&json=true","fetch_graph":"https://pith.science/api/pith-number/A6KWCNC5QPDAPP452U356AGVHB/graph.json","fetch_events":"https://pith.science/api/pith-number/A6KWCNC5QPDAPP452U356AGVHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB/action/storage_attestation","attest_author":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB/action/author_attestation","sign_citation":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB/action/citation_signature","submit_replication":"https://pith.science/pith/A6KWCNC5QPDAPP452U356AGVHB/action/replication_record"}},"created_at":"2026-05-18T02:25:33.449709+00:00","updated_at":"2026-05-18T02:25:33.449709+00:00"}