{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BWF5YQIHKQVWPHC4M6CNZV2P66","short_pith_number":"pith:BWF5YQIH","canonical_record":{"source":{"id":"1704.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T18:40:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"80304ed7c0fc931cfc30e91b050f40bd60e7ec5bff70475d930beee1dc154ec7","abstract_canon_sha256":"25f0bdeb23920af37bf2d0b2fb952d84904051eeb8bedef54ea6e0bd1c9d279c"},"schema_version":"1.0"},"canonical_sha256":"0d8bdc4107542b679c5c6784dcd74ff7a5a7f7b856de7ea079bc1f3d2dd29ff2","source":{"kind":"arxiv","id":"1704.02345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02345","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02345v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02345","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"BWF5YQIHKQVW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BWF5YQIHKQVWPHC4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BWF5YQIH","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BWF5YQIHKQVWPHC4M6CNZV2P66","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T18:40:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"80304ed7c0fc931cfc30e91b050f40bd60e7ec5bff70475d930beee1dc154ec7","abstract_canon_sha256":"25f0bdeb23920af37bf2d0b2fb952d84904051eeb8bedef54ea6e0bd1c9d279c"},"schema_version":"1.0"},"canonical_sha256":"0d8bdc4107542b679c5c6784dcd74ff7a5a7f7b856de7ea079bc1f3d2dd29ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.904012Z","signature_b64":"Syi7lZGphPadDoE5xeb8xEPPxW0rs8KDLMCovPmvBjANLWOW/955Ai/o2EwyXXGsGms1as6pD/vynoLhVajGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8bdc4107542b679c5c6784dcd74ff7a5a7f7b856de7ea079bc1f3d2dd29ff2","last_reissued_at":"2026-05-18T00:46:45.903288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.903288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02345","source_version":1,"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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSRxR+E+T8nCeIPokA3d8a8DnnWwW8pmRvYSlzIrx2uY6useklw+aDKWdlwW/ZX8pzg6flbfshhy50xzqMczDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:11:38.731128Z"},"content_sha256":"d0a7ddd622fea38ce3fd52f7dbf51cec7ddb35c61917b2d10959f27758afc302","schema_version":"1.0","event_id":"sha256:d0a7ddd622fea38ce3fd52f7dbf51cec7ddb35c61917b2d10959f27758afc302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BWF5YQIHKQVWPHC4M6CNZV2P66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Spectral Clustering Using Autoencoders and Landmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Ghodsi, Ershad Banijamali","submitted_at":"2017-04-07T18:40:52Z","abstract_excerpt":"In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To build this matrix, we only consider a limited number of points, called landmarks, and compute the similarity of all data points with the landmarks. Then, we present a definition of the Laplacian matrix of the graph that enable us to perform eigen decomposition efficiently, using a d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02345","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"},"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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6R9MxbjPDGn9FM5b/YFlohWqTcJ0x7EOwEIs7FGC9QaKXTokkRuClbbPjvlAE8GV8/fVPJbLe0zVgUAQp1EIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:11:38.731876Z"},"content_sha256":"a5906dec61d5cb030348757bfe2ddf2969a40263d0b4a279c3997f5a11be036a","schema_version":"1.0","event_id":"sha256:a5906dec61d5cb030348757bfe2ddf2969a40263d0b4a279c3997f5a11be036a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/bundle.json","state_url":"https://pith.science/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/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-08T15:11:38Z","links":{"resolver":"https://pith.science/pith/BWF5YQIHKQVWPHC4M6CNZV2P66","bundle":"https://pith.science/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/bundle.json","state":"https://pith.science/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWF5YQIHKQVWPHC4M6CNZV2P66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BWF5YQIHKQVWPHC4M6CNZV2P66","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":"25f0bdeb23920af37bf2d0b2fb952d84904051eeb8bedef54ea6e0bd1c9d279c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T18:40:52Z","title_canon_sha256":"80304ed7c0fc931cfc30e91b050f40bd60e7ec5bff70475d930beee1dc154ec7"},"schema_version":"1.0","source":{"id":"1704.02345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02345","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02345v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02345","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"BWF5YQIHKQVW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BWF5YQIHKQVWPHC4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BWF5YQIH","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:a5906dec61d5cb030348757bfe2ddf2969a40263d0b4a279c3997f5a11be036a","target":"graph","created_at":"2026-05-18T00:46:45Z","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":"In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To build this matrix, we only consider a limited number of points, called landmarks, and compute the similarity of all data points with the landmarks. Then, we present a definition of the Laplacian matrix of the graph that enable us to perform eigen decomposition efficiently, using a d","authors_text":"Ali Ghodsi, Ershad Banijamali","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T18:40:52Z","title":"Fast Spectral Clustering Using Autoencoders and Landmarks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02345","kind":"arxiv","version":1},"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:d0a7ddd622fea38ce3fd52f7dbf51cec7ddb35c61917b2d10959f27758afc302","target":"record","created_at":"2026-05-18T00:46:45Z","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":"25f0bdeb23920af37bf2d0b2fb952d84904051eeb8bedef54ea6e0bd1c9d279c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T18:40:52Z","title_canon_sha256":"80304ed7c0fc931cfc30e91b050f40bd60e7ec5bff70475d930beee1dc154ec7"},"schema_version":"1.0","source":{"id":"1704.02345","kind":"arxiv","version":1}},"canonical_sha256":"0d8bdc4107542b679c5c6784dcd74ff7a5a7f7b856de7ea079bc1f3d2dd29ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d8bdc4107542b679c5c6784dcd74ff7a5a7f7b856de7ea079bc1f3d2dd29ff2","first_computed_at":"2026-05-18T00:46:45.903288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:45.903288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Syi7lZGphPadDoE5xeb8xEPPxW0rs8KDLMCovPmvBjANLWOW/955Ai/o2EwyXXGsGms1as6pD/vynoLhVajGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:45.904012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0a7ddd622fea38ce3fd52f7dbf51cec7ddb35c61917b2d10959f27758afc302","sha256:a5906dec61d5cb030348757bfe2ddf2969a40263d0b4a279c3997f5a11be036a"],"state_sha256":"8d0fa7cd900bbdcb43a64d737c228bf3ce2f0e5b875b2445776d89c3d62d374a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj87AI4pqv0q7pI49evtDErk+gzlW6HTNatcoJz583XgythCyXG2KcXimi9xLbRnQVipbi0H4iT/D0uxIAQJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:11:38.735818Z","bundle_sha256":"439b5b162484b359acc88a531e1c2ff1efe309bc6cfc760071c53d9c4a830f94"}}