{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C7QAQ4TQXOYAIM76YMBPMEDOT6","short_pith_number":"pith:C7QAQ4TQ","schema_version":"1.0","canonical_sha256":"17e0087270bbb00433fec302f6106e9fbc4c11165609ec8720ea6f45719087ad","source":{"kind":"arxiv","id":"1501.01741","version":2},"attestation_state":"computed","paper":{"title":"A linear k-fold Cheeger inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR","math.SP"],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Mary Radcliffe","submitted_at":"2015-01-08T06:31:31Z","abstract_excerpt":"Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality states that $2 \\lambda_1 \\le h_G \\le \\sqrt {2 \\lambda_1}$ where $\\lambda_1$ is the minimum nontrivial eigenvalue of the normalized Laplacian matrix.\n  Recent work has generalized the concept of the Cheeger constant when partitioning the vertices of a graph into $k > 2$ parts. While there are several approaches, recent results have shown these higher-order Ch"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.01741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T06:31:31Z","cross_cats_sorted":["cs.DM","cs.DS","math.PR","math.SP"],"title_canon_sha256":"2f7943844cfeeccfda61f18546eb23333386d3146be6d54d90a5396d32c611d6","abstract_canon_sha256":"d93973bbfcfcd1d09898e49ffe4add63547f929066981336e5041d622db62fe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.373754Z","signature_b64":"4u/Dg8/gPJgyvoENVBdEEhH7seMHu8Vs0JHEPd3XphtSw7lzu6Xr50iCu5FNL+cg8EoQLvt5XVX+INIxmsrZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e0087270bbb00433fec302f6106e9fbc4c11165609ec8720ea6f45719087ad","last_reissued_at":"2026-05-18T02:26:02.373348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.373348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A linear k-fold Cheeger inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR","math.SP"],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Mary Radcliffe","submitted_at":"2015-01-08T06:31:31Z","abstract_excerpt":"Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality states that $2 \\lambda_1 \\le h_G \\le \\sqrt {2 \\lambda_1}$ where $\\lambda_1$ is the minimum nontrivial eigenvalue of the normalized Laplacian matrix.\n  Recent work has generalized the concept of the Cheeger constant when partitioning the vertices of a graph into $k > 2$ parts. While there are several approaches, recent results have shown these higher-order Ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01741","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.01741","created_at":"2026-05-18T02:26:02.373411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01741v2","created_at":"2026-05-18T02:26:02.373411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01741","created_at":"2026-05-18T02:26:02.373411+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7QAQ4TQXOYA","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7QAQ4TQXOYAIM76","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7QAQ4TQ","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6","json":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6.json","graph_json":"https://pith.science/api/pith-number/C7QAQ4TQXOYAIM76YMBPMEDOT6/graph.json","events_json":"https://pith.science/api/pith-number/C7QAQ4TQXOYAIM76YMBPMEDOT6/events.json","paper":"https://pith.science/paper/C7QAQ4TQ"},"agent_actions":{"view_html":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6","download_json":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6.json","view_paper":"https://pith.science/paper/C7QAQ4TQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01741&json=true","fetch_graph":"https://pith.science/api/pith-number/C7QAQ4TQXOYAIM76YMBPMEDOT6/graph.json","fetch_events":"https://pith.science/api/pith-number/C7QAQ4TQXOYAIM76YMBPMEDOT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6/action/storage_attestation","attest_author":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6/action/author_attestation","sign_citation":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6/action/citation_signature","submit_replication":"https://pith.science/pith/C7QAQ4TQXOYAIM76YMBPMEDOT6/action/replication_record"}},"created_at":"2026-05-18T02:26:02.373411+00:00","updated_at":"2026-05-18T02:26:02.373411+00:00"}