{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RBCOQGON2YJYTJS75PGTJNAZU4","short_pith_number":"pith:RBCOQGON","canonical_record":{"source":{"id":"1211.3444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T22:05:09Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"2e36b7117675eb12f3def63056fb363c12dae5dea58ae00dee14dadadf6a0ca1","abstract_canon_sha256":"d5de50041c27685202a7b458e9bb7ffd1a023e664569888e88b2b93a51d7e15f"},"schema_version":"1.0"},"canonical_sha256":"8844e819cdd61389a65febcd34b419a7178fdd10d2420913c26e26af6e5c9050","source":{"kind":"arxiv","id":"1211.3444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3444","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3444v1","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3444","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"RBCOQGON2YJY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RBCOQGON2YJYTJS7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RBCOQGON","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RBCOQGON2YJYTJS75PGTJNAZU4","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T22:05:09Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"2e36b7117675eb12f3def63056fb363c12dae5dea58ae00dee14dadadf6a0ca1","abstract_canon_sha256":"d5de50041c27685202a7b458e9bb7ffd1a023e664569888e88b2b93a51d7e15f"},"schema_version":"1.0"},"canonical_sha256":"8844e819cdd61389a65febcd34b419a7178fdd10d2420913c26e26af6e5c9050","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:48.767642Z","signature_b64":"HITm4BCM8W3fY9NLhYfqJNqPBgtg4g1JopizcriucA/f9tZncuhUwoZmkei4Uc6Musu1YRK9EU9TtvYXekBvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8844e819cdd61389a65febcd34b419a7178fdd10d2420913c26e26af6e5c9050","last_reissued_at":"2026-05-18T03:40:48.766948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:48.766948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3444","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-18T03:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BqlCJzhRj11KF04Z5OBd5iuR7fFnf/trR2SgIMeO/ZHRbCb+0QAcpBYNPZ308D6LZB7fvr78RdBA90bvHsfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:37:21.911021Z"},"content_sha256":"8d67607e0ae80075d3d3eaebb4916c08f1bc24e70f8a7eed015209b3b15e52eb","schema_version":"1.0","event_id":"sha256:8d67607e0ae80075d3d3eaebb4916c08f1bc24e70f8a7eed015209b3b15e52eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RBCOQGON2YJYTJS75PGTJNAZU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"A. Thompson, B. Cung, C. Boutsidis, D. Needell, J. Ramirez, T. Jin","submitted_at":"2012-11-14T22:05:09Z","abstract_excerpt":"Clustering is the problem of separating a set of objects into groups (called clusters) so that objects within the same cluster are more similar to each other than to those in different clusters. Spectral clustering is a now well-known method for clustering which utilizes the spectrum of the data similarity matrix to perform this separation. Since the method relies on solving an eigenvector problem, it is computationally expensive for large datasets. To overcome this constraint, approximation methods have been developed which aim to reduce running time while maintaining accurate classification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3444","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-18T03:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsNCmdMsKR628KTv++4JHIRV+MuYqEODoB1yFAGB2gV+7aQSceIjPDtN+i9jO/o0lpIm1YrBJK4OAvA34P4fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:37:21.911712Z"},"content_sha256":"11c93fc12141c5d7ba33b45ff01e1d77a911c2a7b801b888e3ae554536ea575a","schema_version":"1.0","event_id":"sha256:11c93fc12141c5d7ba33b45ff01e1d77a911c2a7b801b888e3ae554536ea575a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBCOQGON2YJYTJS75PGTJNAZU4/bundle.json","state_url":"https://pith.science/pith/RBCOQGON2YJYTJS75PGTJNAZU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBCOQGON2YJYTJS75PGTJNAZU4/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-25T22:37:21Z","links":{"resolver":"https://pith.science/pith/RBCOQGON2YJYTJS75PGTJNAZU4","bundle":"https://pith.science/pith/RBCOQGON2YJYTJS75PGTJNAZU4/bundle.json","state":"https://pith.science/pith/RBCOQGON2YJYTJS75PGTJNAZU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBCOQGON2YJYTJS75PGTJNAZU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RBCOQGON2YJYTJS75PGTJNAZU4","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":"d5de50041c27685202a7b458e9bb7ffd1a023e664569888e88b2b93a51d7e15f","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T22:05:09Z","title_canon_sha256":"2e36b7117675eb12f3def63056fb363c12dae5dea58ae00dee14dadadf6a0ca1"},"schema_version":"1.0","source":{"id":"1211.3444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3444","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3444v1","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3444","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"RBCOQGON2YJY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RBCOQGON2YJYTJS7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RBCOQGON","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:11c93fc12141c5d7ba33b45ff01e1d77a911c2a7b801b888e3ae554536ea575a","target":"graph","created_at":"2026-05-18T03:40:48Z","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":"Clustering is the problem of separating a set of objects into groups (called clusters) so that objects within the same cluster are more similar to each other than to those in different clusters. Spectral clustering is a now well-known method for clustering which utilizes the spectrum of the data similarity matrix to perform this separation. Since the method relies on solving an eigenvector problem, it is computationally expensive for large datasets. To overcome this constraint, approximation methods have been developed which aim to reduce running time while maintaining accurate classification.","authors_text":"A. Thompson, B. Cung, C. Boutsidis, D. Needell, J. Ramirez, T. Jin","cross_cats":["math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T22:05:09Z","title":"Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3444","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:8d67607e0ae80075d3d3eaebb4916c08f1bc24e70f8a7eed015209b3b15e52eb","target":"record","created_at":"2026-05-18T03:40:48Z","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":"d5de50041c27685202a7b458e9bb7ffd1a023e664569888e88b2b93a51d7e15f","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T22:05:09Z","title_canon_sha256":"2e36b7117675eb12f3def63056fb363c12dae5dea58ae00dee14dadadf6a0ca1"},"schema_version":"1.0","source":{"id":"1211.3444","kind":"arxiv","version":1}},"canonical_sha256":"8844e819cdd61389a65febcd34b419a7178fdd10d2420913c26e26af6e5c9050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8844e819cdd61389a65febcd34b419a7178fdd10d2420913c26e26af6e5c9050","first_computed_at":"2026-05-18T03:40:48.766948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:48.766948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HITm4BCM8W3fY9NLhYfqJNqPBgtg4g1JopizcriucA/f9tZncuhUwoZmkei4Uc6Musu1YRK9EU9TtvYXekBvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:48.767642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d67607e0ae80075d3d3eaebb4916c08f1bc24e70f8a7eed015209b3b15e52eb","sha256:11c93fc12141c5d7ba33b45ff01e1d77a911c2a7b801b888e3ae554536ea575a"],"state_sha256":"123e0055952a60491b7ab436177ac33fdf86157653b7d7c394c3a30f221e89af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InGLs9oZJb6hIJXvaDSZ/y3dkzNXCeZmngH7EfXmDtWdY8O4WcZWQp1mzcol6tbux+exIyI6Wa2Fx2zetTDDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:37:21.915614Z","bundle_sha256":"2288070123676694008cb3c1869c25fd02a8a73bc4a5395d568678e9874ae436"}}