{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IVPSSM3COL6M234LL5PYLY5IZN","short_pith_number":"pith:IVPSSM3C","canonical_record":{"source":{"id":"1111.4541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-19T08:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"b793da5b1a7293a899b70a482dbd48deed8ec9bccb6e67825a40d3e4746db697","abstract_canon_sha256":"0ebf3cb79f8941a2b24cf730a85c7c63d7bd93aa5113789ca4baf69e4b83fcf3"},"schema_version":"1.0"},"canonical_sha256":"455f29336272fccd6f8b5f5f85e3a8cb48d913d0aa2fea0afff301a18d177da4","source":{"kind":"arxiv","id":"1111.4541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4541","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4541v2","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4541","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"IVPSSM3COL6M","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IVPSSM3COL6M234L","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IVPSSM3C","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IVPSSM3COL6M234LL5PYLY5IZN","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-19T08:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"b793da5b1a7293a899b70a482dbd48deed8ec9bccb6e67825a40d3e4746db697","abstract_canon_sha256":"0ebf3cb79f8941a2b24cf730a85c7c63d7bd93aa5113789ca4baf69e4b83fcf3"},"schema_version":"1.0"},"canonical_sha256":"455f29336272fccd6f8b5f5f85e3a8cb48d913d0aa2fea0afff301a18d177da4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:35.487002Z","signature_b64":"vuE8B6GcV+HEhN3pREHqHahpzaJUM21qiudlrCzPxgzoR3NLFGIIqQt9qdmAgPgGXqiPZAoRnBwrsL1v7tBnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455f29336272fccd6f8b5f5f85e3a8cb48d913d0aa2fea0afff301a18d177da4","last_reissued_at":"2026-05-18T03:19:35.486589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:35.486589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4541","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-18T03:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WrjP9coFCHq6go2VO0fOUAVpmbTG4PJ9hg79PVWENHy84/q8JbpQvzx3hw27mgKLqcx+7SiS2YoYDfIt7J6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:03:49.166165Z"},"content_sha256":"1905efd38d3b28ea1b8b617037b64dc815eefb32d2172a66a02af126a7e71ae4","schema_version":"1.0","event_id":"sha256:1905efd38d3b28ea1b8b617037b64dc815eefb32d2172a66a02af126a7e71ae4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IVPSSM3COL6M234LL5PYLY5IZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Scale Spectral Clustering Using Approximate Commute Time Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nguyen Lu Dang Khoa, Sanjay Chawla","submitted_at":"2011-11-19T08:39:34Z","abstract_excerpt":"Spectral clustering is a novel clustering method which can detect complex shapes of data clusters. However, it requires the eigen decomposition of the graph Laplacian matrix, which is proportion to $O(n^3)$ and thus is not suitable for large scale systems. Recently, many methods have been proposed to accelerate the computational time of spectral clustering. These approximate methods usually involve sampling techniques by which a lot information of the original data may be lost. In this work, we propose a fast and accurate spectral clustering approach using an approximate commute time embedding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4541","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-18T03:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZNplQbnXxEoYKslEPo5oum634CgVOmrbxR9nzhWuaJ9n1JLXLPi+tOpbFNgXKUuRVkK3P+Be7lzmv/gZaKhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:03:49.166659Z"},"content_sha256":"98857f11a0098d191f88188c8b1206bbda8bad50774e642b544557477ab32201","schema_version":"1.0","event_id":"sha256:98857f11a0098d191f88188c8b1206bbda8bad50774e642b544557477ab32201"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVPSSM3COL6M234LL5PYLY5IZN/bundle.json","state_url":"https://pith.science/pith/IVPSSM3COL6M234LL5PYLY5IZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVPSSM3COL6M234LL5PYLY5IZN/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-07T10:03:49Z","links":{"resolver":"https://pith.science/pith/IVPSSM3COL6M234LL5PYLY5IZN","bundle":"https://pith.science/pith/IVPSSM3COL6M234LL5PYLY5IZN/bundle.json","state":"https://pith.science/pith/IVPSSM3COL6M234LL5PYLY5IZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVPSSM3COL6M234LL5PYLY5IZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IVPSSM3COL6M234LL5PYLY5IZN","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":"0ebf3cb79f8941a2b24cf730a85c7c63d7bd93aa5113789ca4baf69e4b83fcf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-19T08:39:34Z","title_canon_sha256":"b793da5b1a7293a899b70a482dbd48deed8ec9bccb6e67825a40d3e4746db697"},"schema_version":"1.0","source":{"id":"1111.4541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4541","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4541v2","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4541","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"IVPSSM3COL6M","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IVPSSM3COL6M234L","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IVPSSM3C","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:98857f11a0098d191f88188c8b1206bbda8bad50774e642b544557477ab32201","target":"graph","created_at":"2026-05-18T03:19:35Z","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 is a novel clustering method which can detect complex shapes of data clusters. However, it requires the eigen decomposition of the graph Laplacian matrix, which is proportion to $O(n^3)$ and thus is not suitable for large scale systems. Recently, many methods have been proposed to accelerate the computational time of spectral clustering. These approximate methods usually involve sampling techniques by which a lot information of the original data may be lost. In this work, we propose a fast and accurate spectral clustering approach using an approximate commute time embedding","authors_text":"Nguyen Lu Dang Khoa, Sanjay Chawla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-19T08:39:34Z","title":"Large Scale Spectral Clustering Using Approximate Commute Time Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4541","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:1905efd38d3b28ea1b8b617037b64dc815eefb32d2172a66a02af126a7e71ae4","target":"record","created_at":"2026-05-18T03:19:35Z","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":"0ebf3cb79f8941a2b24cf730a85c7c63d7bd93aa5113789ca4baf69e4b83fcf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-19T08:39:34Z","title_canon_sha256":"b793da5b1a7293a899b70a482dbd48deed8ec9bccb6e67825a40d3e4746db697"},"schema_version":"1.0","source":{"id":"1111.4541","kind":"arxiv","version":2}},"canonical_sha256":"455f29336272fccd6f8b5f5f85e3a8cb48d913d0aa2fea0afff301a18d177da4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455f29336272fccd6f8b5f5f85e3a8cb48d913d0aa2fea0afff301a18d177da4","first_computed_at":"2026-05-18T03:19:35.486589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:35.486589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vuE8B6GcV+HEhN3pREHqHahpzaJUM21qiudlrCzPxgzoR3NLFGIIqQt9qdmAgPgGXqiPZAoRnBwrsL1v7tBnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:35.487002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1905efd38d3b28ea1b8b617037b64dc815eefb32d2172a66a02af126a7e71ae4","sha256:98857f11a0098d191f88188c8b1206bbda8bad50774e642b544557477ab32201"],"state_sha256":"f72bf0b5081fc4cdff1144fd5d4ee3cd3300ab39d2df0b175a057586eccd367a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTbiZP941GzfH6qh8q4tTPqYpS4NTxIerGIE6ru6Wc20VJdCIVcpwWgfjaQaQbL0Fe+W7JG9BKMK+r7bVRehDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:03:49.169865Z","bundle_sha256":"c168794a924396d67b5d9b6b7887f60f7030cc3943cae753994ed843f79a755b"}}