{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P2O3H76MFRVRLEH3JTFV3IZUBD","short_pith_number":"pith:P2O3H76M","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"},"canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","source":{"kind":"arxiv","id":"1602.02018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02018","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02018v2","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02018","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"P2O3H76MFRVR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P2O3H76MFRVRLEH3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P2O3H76M","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P2O3H76MFRVRLEH3JTFV3IZUBD","target":"record","payload":{"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"},"canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","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"},"source_kind":"arxiv","source_id":"1602.02018","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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avbR6CoWXZsc3lLacWMmpFDf8P9cGWrLmEjLRgEHlbjF3B1lAfvMKh5XX8z2g0cNEGUYdkix3fhBzM6bAI1zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:50:57.089178Z"},"content_sha256":"a40f16084d9c1d85bc9469fb3b9b66d2602be98a1c16f4aa94ad5c999e432f64","schema_version":"1.0","event_id":"sha256:a40f16084d9c1d85bc9469fb3b9b66d2602be98a1c16f4aa94ad5c999e432f64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P2O3H76MFRVRLEH3JTFV3IZUBD","target":"graph","payload":{"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"},"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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qgLscNfFcq7qP9OBcMQXN4h9NrVSFDRRifMFsN8gRhLVuTem7JggE9P/D53SaGAoAtB9D/5C0cfFjHKlDdtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:50:57.089574Z"},"content_sha256":"167946812dec00ae3ad037af4eae0f144dd969f8aa0407eb2321ab20b020c868","schema_version":"1.0","event_id":"sha256:167946812dec00ae3ad037af4eae0f144dd969f8aa0407eb2321ab20b020c868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/bundle.json","state_url":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/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-05-27T05:50:57Z","links":{"resolver":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD","bundle":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/bundle.json","state":"https://pith.science/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2O3H76MFRVRLEH3JTFV3IZUBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P2O3H76MFRVRLEH3JTFV3IZUBD","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":"ad447d3aae9698b2f859996a1cf48c3ff3365fdb7773a866807f0f8bd4dc3aff","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T13:42:27Z","title_canon_sha256":"1620d58f5c311721ff10a77cf9bff3469772f6477fae155a579407cf2df23f6c"},"schema_version":"1.0","source":{"id":"1602.02018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02018","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02018v2","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02018","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"P2O3H76MFRVR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P2O3H76MFRVRLEH3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P2O3H76M","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:167946812dec00ae3ad037af4eae0f144dd969f8aa0407eb2321ab20b020c868","target":"graph","created_at":"2026-05-18T01:14:17Z","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":"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","authors_text":"Gilles Puy, Nicolas Tremblay, Pierre Vandergheynst, Remi Gribonval","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T13:42:27Z","title":"Compressive Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02018","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:a40f16084d9c1d85bc9469fb3b9b66d2602be98a1c16f4aa94ad5c999e432f64","target":"record","created_at":"2026-05-18T01:14:17Z","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":"ad447d3aae9698b2f859996a1cf48c3ff3365fdb7773a866807f0f8bd4dc3aff","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T13:42:27Z","title_canon_sha256":"1620d58f5c311721ff10a77cf9bff3469772f6477fae155a579407cf2df23f6c"},"schema_version":"1.0","source":{"id":"1602.02018","kind":"arxiv","version":2}},"canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e9db3ffcc2c6b1590fb4ccb5da33408d4e7e00df928302d8b4631e77f6589b6","first_computed_at":"2026-05-18T01:14:17.360355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:17.360355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmJMFqMhXBxiepKCJp/DkakqqgYRxL5z67zJXG00uBxHkjMBRwy+DQI+hulXPvAh4VsxA6eFnnD6c8A+7o15Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:17.361079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a40f16084d9c1d85bc9469fb3b9b66d2602be98a1c16f4aa94ad5c999e432f64","sha256:167946812dec00ae3ad037af4eae0f144dd969f8aa0407eb2321ab20b020c868"],"state_sha256":"fcd91b9245edfec90442f52ae4c6d1d750b199d6cd034275ad35d272091bd020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFb3T1i0r0dJpdV1vvY//Z5BtRXhqPdv4uzZHpdNDk/QHOUjJRKYEcfzz2j5Y9k5l1V5ZNlGEb7F6qiIXRqsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:50:57.092992Z","bundle_sha256":"ee9a0f5fca9563f89662fd71100da02d617a638417b41d90980e3e37877f2909"}}