{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P2O3H76MFRVRLEH3JTFV3IZUBD","short_pith_number":"pith:P2O3H76M","schema_version":"1.0","canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","source":{"kind":"arxiv","id":"1602.02018","version":2},"attestation_state":"computed","paper":{"title":"Compressive Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Gilles Puy, Nicolas Tremblay, Pierre Vandergheynst, Remi Gribonval","submitted_at":"2016-02-05T13:42:27Z","abstract_excerpt":"Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a feature vector for each object, and run k-means on these features to separate objects into k classes. Each of these three steps becomes computationally intensive for large N and/or k. We propose to speed up the last two steps based on recent results in the emerging field of graph signal processing: graph filtering of random signals, and random s"},"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":"1602.02018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T13:42:27Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1620d58f5c311721ff10a77cf9bff3469772f6477fae155a579407cf2df23f6c","abstract_canon_sha256":"ad447d3aae9698b2f859996a1cf48c3ff3365fdb7773a866807f0f8bd4dc3aff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:17.361079Z","signature_b64":"CmJMFqMhXBxiepKCJp/DkakqqgYRxL5z67zJXG00uBxHkjMBRwy+DQI+hulXPvAh4VsxA6eFnnD6c8A+7o15Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","last_reissued_at":"2026-05-18T01:14:17.360355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:17.360355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Gilles Puy, Nicolas Tremblay, Pierre Vandergheynst, Remi Gribonval","submitted_at":"2016-02-05T13:42:27Z","abstract_excerpt":"Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a feature vector for each object, and run k-means on these features to separate objects into k classes. Each of these three steps becomes computationally intensive for large N and/or k. We propose to speed up the last two steps based on recent results in the emerging field of graph signal processing: graph filtering of random signals, and random s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02018","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":"1602.02018","created_at":"2026-05-18T01:14:17.360481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02018v2","created_at":"2026-05-18T01:14:17.360481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02018","created_at":"2026-05-18T01:14:17.360481+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2O3H76MFRVR","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2O3H76MFRVRLEH3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2O3H76M","created_at":"2026-05-18T12:30:36.002864+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/P2O3H76MFRVRLEH3JTFV3IZUBD","json":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD.json","graph_json":"https://pith.science/api/pith-number/P2O3H76MFRVRLEH3JTFV3IZUBD/graph.json","events_json":"https://pith.science/api/pith-number/P2O3H76MFRVRLEH3JTFV3IZUBD/events.json","paper":"https://pith.science/paper/P2O3H76M"},"agent_actions":{"view_html":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD","download_json":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD.json","view_paper":"https://pith.science/paper/P2O3H76M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02018&json=true","fetch_graph":"https://pith.science/api/pith-number/P2O3H76MFRVRLEH3JTFV3IZUBD/graph.json","fetch_events":"https://pith.science/api/pith-number/P2O3H76MFRVRLEH3JTFV3IZUBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/action/storage_attestation","attest_author":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/action/author_attestation","sign_citation":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/action/citation_signature","submit_replication":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/action/replication_record"}},"created_at":"2026-05-18T01:14:17.360481+00:00","updated_at":"2026-05-18T01:14:17.360481+00:00"}