{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4O3CYXZ6MRS2JYXJ7CQDHMDEMR","short_pith_number":"pith:4O3CYXZ6","canonical_record":{"source":{"id":"1301.5584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T17:49:05Z","cross_cats_sorted":["cs.DM","math.CO","math.SP","stat.ML"],"title_canon_sha256":"c8efceb2a35151b45068c709f6e614e4476f5d8d1e12e9dba90bc14c289ca428","abstract_canon_sha256":"fb6f981ebb76527d321af69fd2f7ac3381728b7ddc023eb79b0ef3025d5efec1"},"schema_version":"1.0"},"canonical_sha256":"e3b62c5f3e6465a4e2e9f8a033b064647da8aa9f40cd73b82d300c7c30973684","source":{"kind":"arxiv","id":"1301.5584","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5584","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5584v1","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5584","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"4O3CYXZ6MRS2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4O3CYXZ6MRS2JYXJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4O3CYXZ6","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4O3CYXZ6MRS2JYXJ7CQDHMDEMR","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T17:49:05Z","cross_cats_sorted":["cs.DM","math.CO","math.SP","stat.ML"],"title_canon_sha256":"c8efceb2a35151b45068c709f6e614e4476f5d8d1e12e9dba90bc14c289ca428","abstract_canon_sha256":"fb6f981ebb76527d321af69fd2f7ac3381728b7ddc023eb79b0ef3025d5efec1"},"schema_version":"1.0"},"canonical_sha256":"e3b62c5f3e6465a4e2e9f8a033b064647da8aa9f40cd73b82d300c7c30973684","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:39.325701Z","signature_b64":"kcqdWAwGyjOOUOwGZcQQOEJQXhTkB5DB9ihLmhC3o8HaP4X8iMh+tbq1KeOj0ZNPHC3VCAMBwgEmUbAeMF+/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b62c5f3e6465a4e2e9f8a033b064647da8aa9f40cd73b82d300c7c30973684","last_reissued_at":"2026-05-18T03:35:39.324969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:39.324969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5584","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0O67/rDkyUjqKWoAopG/KO+tMACdISWqipPKHqBIsBG5qzJb7QKoPuRdYWA1uWqXJoQpyQvSBrOIVT3VtVMiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:07:03.857365Z"},"content_sha256":"1196a21cb71728a871ce634f01f1b7c09bc79718c08021f691571d77305cfc0d","schema_version":"1.0","event_id":"sha256:1196a21cb71728a871ce634f01f1b7c09bc79718c08021f691571d77305cfc0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4O3CYXZ6MRS2JYXJ7CQDHMDEMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.SP","stat.ML"],"primary_cat":"cs.DS","authors_text":"Lap Chi Lau, Luca Trevisan, Shayan Oveis Gharan, Tsz Chiu Kwok, Yin Tat Lee","submitted_at":"2013-01-23T17:49:05Z","abstract_excerpt":"Let \\phi(G) be the minimum conductance of an undirected graph G, and let 0=\\lambda_1 <= \\lambda_2 <=... <= \\lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2,\n  \\phi(G) = O(k) \\lambda_2 / \\sqrt{\\lambda_k},\nand this performance guarantee is achieved by the spectral partitioning algorithm. This improves Cheeger's inequality, and the bound is optimal up to a constant factor for any k. Our result shows that the spectral partitioning algorithm is a constant factor approximation algorithm for finding a sparse cut if \\lambda_k$ is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5584","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiCvaK1mRMvX94WZS9/WD8k/6k/XWLvkFx582py3/c08oaGT6F/3bkQxRrqpxhRl6Rp4ALGaD84I9lpzVHlAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:07:03.858025Z"},"content_sha256":"b3684e61fd69cb2793d76873ce2d556c6e4e3d08246928ab7d34a8d1427e4dca","schema_version":"1.0","event_id":"sha256:b3684e61fd69cb2793d76873ce2d556c6e4e3d08246928ab7d34a8d1427e4dca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/bundle.json","state_url":"https://pith.science/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/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-30T18:07:03Z","links":{"resolver":"https://pith.science/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR","bundle":"https://pith.science/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/bundle.json","state":"https://pith.science/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O3CYXZ6MRS2JYXJ7CQDHMDEMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4O3CYXZ6MRS2JYXJ7CQDHMDEMR","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":"fb6f981ebb76527d321af69fd2f7ac3381728b7ddc023eb79b0ef3025d5efec1","cross_cats_sorted":["cs.DM","math.CO","math.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T17:49:05Z","title_canon_sha256":"c8efceb2a35151b45068c709f6e614e4476f5d8d1e12e9dba90bc14c289ca428"},"schema_version":"1.0","source":{"id":"1301.5584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5584","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5584v1","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5584","created_at":"2026-05-18T03:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"4O3CYXZ6MRS2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4O3CYXZ6MRS2JYXJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4O3CYXZ6","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:b3684e61fd69cb2793d76873ce2d556c6e4e3d08246928ab7d34a8d1427e4dca","target":"graph","created_at":"2026-05-18T03:35:39Z","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":"Let \\phi(G) be the minimum conductance of an undirected graph G, and let 0=\\lambda_1 <= \\lambda_2 <=... <= \\lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2,\n  \\phi(G) = O(k) \\lambda_2 / \\sqrt{\\lambda_k},\nand this performance guarantee is achieved by the spectral partitioning algorithm. This improves Cheeger's inequality, and the bound is optimal up to a constant factor for any k. Our result shows that the spectral partitioning algorithm is a constant factor approximation algorithm for finding a sparse cut if \\lambda_k$ is a","authors_text":"Lap Chi Lau, Luca Trevisan, Shayan Oveis Gharan, Tsz Chiu Kwok, Yin Tat Lee","cross_cats":["cs.DM","math.CO","math.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T17:49:05Z","title":"Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5584","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:1196a21cb71728a871ce634f01f1b7c09bc79718c08021f691571d77305cfc0d","target":"record","created_at":"2026-05-18T03:35:39Z","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":"fb6f981ebb76527d321af69fd2f7ac3381728b7ddc023eb79b0ef3025d5efec1","cross_cats_sorted":["cs.DM","math.CO","math.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T17:49:05Z","title_canon_sha256":"c8efceb2a35151b45068c709f6e614e4476f5d8d1e12e9dba90bc14c289ca428"},"schema_version":"1.0","source":{"id":"1301.5584","kind":"arxiv","version":1}},"canonical_sha256":"e3b62c5f3e6465a4e2e9f8a033b064647da8aa9f40cd73b82d300c7c30973684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3b62c5f3e6465a4e2e9f8a033b064647da8aa9f40cd73b82d300c7c30973684","first_computed_at":"2026-05-18T03:35:39.324969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:39.324969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcqdWAwGyjOOUOwGZcQQOEJQXhTkB5DB9ihLmhC3o8HaP4X8iMh+tbq1KeOj0ZNPHC3VCAMBwgEmUbAeMF+/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:39.325701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1196a21cb71728a871ce634f01f1b7c09bc79718c08021f691571d77305cfc0d","sha256:b3684e61fd69cb2793d76873ce2d556c6e4e3d08246928ab7d34a8d1427e4dca"],"state_sha256":"dd2831521a7bbe6d9d1e81a6f0311f12450412e4d0ced48f39cf86658837e2c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDj0o2GXQb40TMqyXMsSe9q8JNSbPsBJfWrclRp5uZea+cphUgxJB5pdKy96rY1ZzUNXO+hpC0Ep9pI4svLbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:07:03.861296Z","bundle_sha256":"6675bf975017c79d19d043cb54481f82e79650afe6f727af0cf46fe1d6b69a7c"}}