{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X3IJTWZPOM5WLJHOTQ34M7M7YB","short_pith_number":"pith:X3IJTWZP","schema_version":"1.0","canonical_sha256":"bed099db2f733b65a4ee9c37c67d9fc05642ea01dcb9a63c1c7589eb11f127d0","source":{"kind":"arxiv","id":"1801.01587","version":6},"attestation_state":"computed","paper":{"title":"SpectralNet: Spectral Clustering using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Boaz Nadler, Henry Li, Kelly Stanton, Ronen Basri, Uri Shaham, Yuval Kluger","submitted_at":"2018-01-04T23:56:36Z","abstract_excerpt":"Spectral clustering is a leading and popular technique in unsupervised data analysis. Two of its major limitations are scalability and generalization of the spectral embedding (i.e., out-of-sample-extension). In this paper we introduce a deep learning approach to spectral clustering that overcomes the above shortcomings. Our network, which we call SpectralNet, learns a map that embeds input data points into the eigenspace of their associated graph Laplacian matrix and subsequently clusters them. We train SpectralNet using a procedure that involves constrained stochastic optimization. Stochasti"},"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":"1801.01587","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-04T23:56:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"416cb596d449c1ec3929025243c33647b5c5453a50f33253b542987e5df36ee3","abstract_canon_sha256":"d207810f39f47f254ed4aecff8bce16f3a42c5046bd21b94e8b1cc9b1eaa89f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:53.332719Z","signature_b64":"9FlofSTu9XPlsaIQTSAJZKPsC94BmvU8/SErweyKIwdz46UwAZJS06PlezfdBoBp4WNl5EqoUBneKnfDftYBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bed099db2f733b65a4ee9c37c67d9fc05642ea01dcb9a63c1c7589eb11f127d0","last_reissued_at":"2026-07-05T09:30:53.332162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:53.332162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SpectralNet: Spectral Clustering using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Boaz Nadler, Henry Li, Kelly Stanton, Ronen Basri, Uri Shaham, Yuval Kluger","submitted_at":"2018-01-04T23:56:36Z","abstract_excerpt":"Spectral clustering is a leading and popular technique in unsupervised data analysis. Two of its major limitations are scalability and generalization of the spectral embedding (i.e., out-of-sample-extension). In this paper we introduce a deep learning approach to spectral clustering that overcomes the above shortcomings. Our network, which we call SpectralNet, learns a map that embeds input data points into the eigenspace of their associated graph Laplacian matrix and subsequently clusters them. We train SpectralNet using a procedure that involves constrained stochastic optimization. Stochasti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01587","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1801.01587/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1801.01587","created_at":"2026-07-05T09:30:53.332225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01587v6","created_at":"2026-07-05T09:30:53.332225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01587","created_at":"2026-07-05T09:30:53.332225+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3IJTWZPOM5W","created_at":"2026-07-05T09:30:53.332225+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3IJTWZPOM5WLJHO","created_at":"2026-07-05T09:30:53.332225+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3IJTWZP","created_at":"2026-07-05T09:30:53.332225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21743","citing_title":"Cohort Organized Learning: Clustering Through Agreement","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25657","citing_title":"ARMA-C3: A Contrastive ARMA Convolutional Framework for Unsupervised and Semi-supervised Classification","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB","json":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB.json","graph_json":"https://pith.science/api/pith-number/X3IJTWZPOM5WLJHOTQ34M7M7YB/graph.json","events_json":"https://pith.science/api/pith-number/X3IJTWZPOM5WLJHOTQ34M7M7YB/events.json","paper":"https://pith.science/paper/X3IJTWZP"},"agent_actions":{"view_html":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB","download_json":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB.json","view_paper":"https://pith.science/paper/X3IJTWZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01587&json=true","fetch_graph":"https://pith.science/api/pith-number/X3IJTWZPOM5WLJHOTQ34M7M7YB/graph.json","fetch_events":"https://pith.science/api/pith-number/X3IJTWZPOM5WLJHOTQ34M7M7YB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB/action/storage_attestation","attest_author":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB/action/author_attestation","sign_citation":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB/action/citation_signature","submit_replication":"https://pith.science/pith/X3IJTWZPOM5WLJHOTQ34M7M7YB/action/replication_record"}},"created_at":"2026-07-05T09:30:53.332225+00:00","updated_at":"2026-07-05T09:30:53.332225+00:00"}