{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:SBHJGP4VVMCYYTPGV2MHPWR7BN","short_pith_number":"pith:SBHJGP4V","canonical_record":{"source":{"id":"0711.0189","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-11-01T19:04:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65b1a9af3baa857eeb44c619909094d37428cea8f6016fb07d1b9419583d2b2b","abstract_canon_sha256":"5eb0f73a87f3af886d9fb302aa8b7fa00e5b601d3abf17491f064fc8d6d54832"},"schema_version":"1.0"},"canonical_sha256":"904e933f95ab058c4de6ae9877da3f0b45d4bffed439713f53df58b32cf2e252","source":{"kind":"arxiv","id":"0711.0189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.0189","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"0711.0189v1","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.0189","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"SBHJGP4VVMCY","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBHJGP4VVMCYYTPG","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBHJGP4V","created_at":"2026-07-04T15:05:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:SBHJGP4VVMCYYTPGV2MHPWR7BN","target":"record","payload":{"canonical_record":{"source":{"id":"0711.0189","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-11-01T19:04:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65b1a9af3baa857eeb44c619909094d37428cea8f6016fb07d1b9419583d2b2b","abstract_canon_sha256":"5eb0f73a87f3af886d9fb302aa8b7fa00e5b601d3abf17491f064fc8d6d54832"},"schema_version":"1.0"},"canonical_sha256":"904e933f95ab058c4de6ae9877da3f0b45d4bffed439713f53df58b32cf2e252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:20.793301Z","signature_b64":"dfOn9Ml7FBz6k6fYctHL7FN/GgQYNsR75ss4hLDQ3LYDFRd4NViEbfzm5Q574Tr4ZoU78Nrxp94w8yoV+xl9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"904e933f95ab058c4de6ae9877da3f0b45d4bffed439713f53df58b32cf2e252","last_reissued_at":"2026-07-04T15:05:20.792932Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:20.792932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0711.0189","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-07-04T15:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBDvWl03KqP5Chqc2KeJ12FVPRz+ai+PcK+R4hCaFi+FDJz4SImpB8tOSondpPlatzVEmRm2+S4ho6+NSRCyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:21:29.313160Z"},"content_sha256":"2e2877628fdabf6f0129c3904180c55496e30fc9b5321c5483e1dcce49cb9852","schema_version":"1.0","event_id":"sha256:2e2877628fdabf6f0129c3904180c55496e30fc9b5321c5483e1dcce49cb9852"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:SBHJGP4VVMCYYTPGV2MHPWR7BN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tutorial on Spectral Clustering","license":"","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ulrike von Luxburg","submitted_at":"2007-11-01T19:04:43Z","abstract_excerpt":"In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.0189","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0711.0189/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"},"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-07-04T15:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdxBytPPyare6KCcRHsr+0UlXv61EhKuDIQ4yM7YEAjUMFKJ8/2KvOOTR1pPDeosGqyvRphrCSDrmz0s0mTeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:21:29.313862Z"},"content_sha256":"8355b910ee99ba1350544b6f0378f9277ea587c108c69591623286e679418022","schema_version":"1.0","event_id":"sha256:8355b910ee99ba1350544b6f0378f9277ea587c108c69591623286e679418022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/bundle.json","state_url":"https://pith.science/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/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-08-10T23:21:29Z","links":{"resolver":"https://pith.science/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN","bundle":"https://pith.science/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/bundle.json","state":"https://pith.science/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBHJGP4VVMCYYTPGV2MHPWR7BN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:SBHJGP4VVMCYYTPGV2MHPWR7BN","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":"5eb0f73a87f3af886d9fb302aa8b7fa00e5b601d3abf17491f064fc8d6d54832","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-11-01T19:04:43Z","title_canon_sha256":"65b1a9af3baa857eeb44c619909094d37428cea8f6016fb07d1b9419583d2b2b"},"schema_version":"1.0","source":{"id":"0711.0189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.0189","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"0711.0189v1","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.0189","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"SBHJGP4VVMCY","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBHJGP4VVMCYYTPG","created_at":"2026-07-04T15:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBHJGP4V","created_at":"2026-07-04T15:05:20Z"}],"graph_snapshots":[{"event_id":"sha256:8355b910ee99ba1350544b6f0378f9277ea587c108c69591623286e679418022","target":"graph","created_at":"2026-07-04T15:05:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0711.0189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral c","authors_text":"Ulrike von Luxburg","cross_cats":["cs.LG"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2007-11-01T19:04:43Z","title":"A Tutorial on Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.0189","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:2e2877628fdabf6f0129c3904180c55496e30fc9b5321c5483e1dcce49cb9852","target":"record","created_at":"2026-07-04T15:05:20Z","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":"5eb0f73a87f3af886d9fb302aa8b7fa00e5b601d3abf17491f064fc8d6d54832","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-11-01T19:04:43Z","title_canon_sha256":"65b1a9af3baa857eeb44c619909094d37428cea8f6016fb07d1b9419583d2b2b"},"schema_version":"1.0","source":{"id":"0711.0189","kind":"arxiv","version":1}},"canonical_sha256":"904e933f95ab058c4de6ae9877da3f0b45d4bffed439713f53df58b32cf2e252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"904e933f95ab058c4de6ae9877da3f0b45d4bffed439713f53df58b32cf2e252","first_computed_at":"2026-07-04T15:05:20.792932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:05:20.792932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dfOn9Ml7FBz6k6fYctHL7FN/GgQYNsR75ss4hLDQ3LYDFRd4NViEbfzm5Q574Tr4ZoU78Nrxp94w8yoV+xl9CA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:05:20.793301Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.0189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2877628fdabf6f0129c3904180c55496e30fc9b5321c5483e1dcce49cb9852","sha256:8355b910ee99ba1350544b6f0378f9277ea587c108c69591623286e679418022"],"state_sha256":"922ad1794319d1d7c32b7932e65fe46a916c98b6e486f2e9dd575323b79beb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mxt6v9Y6SFtVLHWWP2TYUSeVINAVC/3Ue4SpBZ9A0oIxN+CJNUyvUhepZHAG3RX1zr2Q1JyIFpdqlWVN/cjpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T23:21:29.318488Z","bundle_sha256":"8c42b0caadb7f021de97ea4982264a264c7d0c5d8b01b3aef4045be84ef6956e"}}