{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K42FD72OIAH4LMHFXXYS2QPGI6","short_pith_number":"pith:K42FD72O","canonical_record":{"source":{"id":"1211.0589","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T02:03:41Z","cross_cats_sorted":["cs.DM","cs.DS","math.SP"],"title_canon_sha256":"1264681d05fc540b32bd3cf8e0ff6f869ef036b8095f8f7569d9c6e94458398e","abstract_canon_sha256":"0897ba54d1bac253154088889df2bfc8f5fc55bc96c81cb1915118d90bc360cb"},"schema_version":"1.0"},"canonical_sha256":"573451ff4e400fc5b0e5bdf12d41e647a5fde9f82230255d4c86bd38d343b8ab","source":{"kind":"arxiv","id":"1211.0589","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0589","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0589v3","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0589","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"K42FD72OIAH4","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K42FD72OIAH4LMHF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K42FD72O","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K42FD72OIAH4LMHFXXYS2QPGI6","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0589","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T02:03:41Z","cross_cats_sorted":["cs.DM","cs.DS","math.SP"],"title_canon_sha256":"1264681d05fc540b32bd3cf8e0ff6f869ef036b8095f8f7569d9c6e94458398e","abstract_canon_sha256":"0897ba54d1bac253154088889df2bfc8f5fc55bc96c81cb1915118d90bc360cb"},"schema_version":"1.0"},"canonical_sha256":"573451ff4e400fc5b0e5bdf12d41e647a5fde9f82230255d4c86bd38d343b8ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.201161Z","signature_b64":"oH5zGyok0p7dogrdLAPVpxgOKCqGQrOdefjaBpzQOW2vGQYDvxttIpfF7C98X9DklCVF6dGIr/d0zzuS3zLYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"573451ff4e400fc5b0e5bdf12d41e647a5fde9f82230255d4c86bd38d343b8ab","last_reissued_at":"2026-05-18T00:06:21.200807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.200807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0589","source_version":3,"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jpb00WnMYk1BUMBSbpkoYUKzYAVsNTile5EnWGZm5A7A77nPuVkZU6Jt67kSmYBOibjlpdOc4+bTunixJVFfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:10:37.918624Z"},"content_sha256":"48d0f391608d38afdc0b461f916cfca686045e289e2498e876600d3f196e7c68","schema_version":"1.0","event_id":"sha256:48d0f391608d38afdc0b461f916cfca686045e289e2498e876600d3f196e7c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K42FD72OIAH4LMHFXXYS2QPGI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.SP"],"primary_cat":"math.PR","authors_text":"Russell Lyons, Shayan Oveis Gharan","submitted_at":"2012-11-03T02:03:41Z","abstract_excerpt":"Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently, spectral embedding was studied from a theoretical perspective to prove higher order variants of Cheeger's inequality [LOT12,LRTV12].\n  We use spectral embedding to provide a unifying framework for bounding all the eigenvalues of graphs. For example, we show that for any finite graph with n vertices and all k >= 2, the k-th largest eigenvalue is at most 1-Omega(k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0589","kind":"arxiv","version":3},"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0XRRIcfqmoJurnnWdKvRdythw7blrF+8GRNzJc7st8J9aB80nYmgIsrsY8iAbOeooOhmFBilSXOlbkJGhcGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:10:37.918969Z"},"content_sha256":"ecbaa6a3be0a35351ab75700aded623a1d3a9a973a60dcf5f8f39f4c9358a78d","schema_version":"1.0","event_id":"sha256:ecbaa6a3be0a35351ab75700aded623a1d3a9a973a60dcf5f8f39f4c9358a78d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K42FD72OIAH4LMHFXXYS2QPGI6/bundle.json","state_url":"https://pith.science/pith/K42FD72OIAH4LMHFXXYS2QPGI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K42FD72OIAH4LMHFXXYS2QPGI6/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-02T12:10:37Z","links":{"resolver":"https://pith.science/pith/K42FD72OIAH4LMHFXXYS2QPGI6","bundle":"https://pith.science/pith/K42FD72OIAH4LMHFXXYS2QPGI6/bundle.json","state":"https://pith.science/pith/K42FD72OIAH4LMHFXXYS2QPGI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K42FD72OIAH4LMHFXXYS2QPGI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K42FD72OIAH4LMHFXXYS2QPGI6","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":"0897ba54d1bac253154088889df2bfc8f5fc55bc96c81cb1915118d90bc360cb","cross_cats_sorted":["cs.DM","cs.DS","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T02:03:41Z","title_canon_sha256":"1264681d05fc540b32bd3cf8e0ff6f869ef036b8095f8f7569d9c6e94458398e"},"schema_version":"1.0","source":{"id":"1211.0589","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0589","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0589v3","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0589","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"K42FD72OIAH4","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K42FD72OIAH4LMHF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K42FD72O","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ecbaa6a3be0a35351ab75700aded623a1d3a9a973a60dcf5f8f39f4c9358a78d","target":"graph","created_at":"2026-05-18T00:06:21Z","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 embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently, spectral embedding was studied from a theoretical perspective to prove higher order variants of Cheeger's inequality [LOT12,LRTV12].\n  We use spectral embedding to provide a unifying framework for bounding all the eigenvalues of graphs. For example, we show that for any finite graph with n vertices and all k >= 2, the k-th largest eigenvalue is at most 1-Omega(k","authors_text":"Russell Lyons, Shayan Oveis Gharan","cross_cats":["cs.DM","cs.DS","math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T02:03:41Z","title":"Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0589","kind":"arxiv","version":3},"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:48d0f391608d38afdc0b461f916cfca686045e289e2498e876600d3f196e7c68","target":"record","created_at":"2026-05-18T00:06:21Z","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":"0897ba54d1bac253154088889df2bfc8f5fc55bc96c81cb1915118d90bc360cb","cross_cats_sorted":["cs.DM","cs.DS","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T02:03:41Z","title_canon_sha256":"1264681d05fc540b32bd3cf8e0ff6f869ef036b8095f8f7569d9c6e94458398e"},"schema_version":"1.0","source":{"id":"1211.0589","kind":"arxiv","version":3}},"canonical_sha256":"573451ff4e400fc5b0e5bdf12d41e647a5fde9f82230255d4c86bd38d343b8ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"573451ff4e400fc5b0e5bdf12d41e647a5fde9f82230255d4c86bd38d343b8ab","first_computed_at":"2026-05-18T00:06:21.200807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.200807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oH5zGyok0p7dogrdLAPVpxgOKCqGQrOdefjaBpzQOW2vGQYDvxttIpfF7C98X9DklCVF6dGIr/d0zzuS3zLYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.201161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0589","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48d0f391608d38afdc0b461f916cfca686045e289e2498e876600d3f196e7c68","sha256:ecbaa6a3be0a35351ab75700aded623a1d3a9a973a60dcf5f8f39f4c9358a78d"],"state_sha256":"e14e3422d498bcea0a21a31d2ab3bdfa06d2464c45199b33ffdc562b9a7acc8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p05d3Rwiqn7vVZnGQU2e4I5KKP5258DgOlxvzzHR2MM8DEy3tqnU2CbRJdqvYFzPRZCtMuZ+P7lS7u9pviaRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:10:37.920875Z","bundle_sha256":"df79f7cfc02cb9ef2dfe69d73322524b0204a886b6b5fec1fd5d4a28212276ec"}}