{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CN3LYNEDTJMP6HQSHVDV7ZRC7S","short_pith_number":"pith:CN3LYNED","schema_version":"1.0","canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","source":{"kind":"arxiv","id":"2608.07360","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.SP"],"primary_cat":"math.CO","authors_text":"Ji Liu, Jinzheng Li, Yuanjie Ren, Zeru Zhu","submitted_at":"2026-08-07T16:02:23Z","abstract_excerpt":"Kolokolnikov conjectured that, among finite simple graphs on $n$ vertices with exactly $2(n-2)$ edges, the complete bipartite graph $K_{2,n-2}$ maximizes algebraic connectivity. We prove the conjectured statement for every $n\\ge123$: every such graph has algebraic connectivity at most $2$, while $K_{2,n-2}$ attains $2$. The proof begins with explicit Rayleigh-quotient certificates that exclude several local configurations from a hypothetical counterexample. A global degree count then controls the number and total excess of vertices of degree at least $5$ and bounds the edge excess of the subgr"},"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":"2608.07360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T16:02:23Z","cross_cats_sorted":["cs.LO","math.SP"],"title_canon_sha256":"e79265e9a313546ec8997cc7d97d6552ff2c6dcf3571303ae0639dbe1af22e8b","abstract_canon_sha256":"7e8dda503d509f73e787353f66cb0491ab8d4070d193d509ce04cbae36782619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:15:08.701587Z","signature_b64":"McNlNzG8EYy7P30BXlOuudltA3K+2/MLfOFLrq0VebNOExjqt3UW41tze9M2tH0Fb6qnAQQOdZywzIIgQ4JpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1376bc34839a58ff1e123d475fe622fca3b9a907908a5431f88ac520ea112380","last_reissued_at":"2026-08-10T01:15:08.698558Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:15:08.698558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.SP"],"primary_cat":"math.CO","authors_text":"Ji Liu, Jinzheng Li, Yuanjie Ren, Zeru Zhu","submitted_at":"2026-08-07T16:02:23Z","abstract_excerpt":"Kolokolnikov conjectured that, among finite simple graphs on $n$ vertices with exactly $2(n-2)$ edges, the complete bipartite graph $K_{2,n-2}$ maximizes algebraic connectivity. We prove the conjectured statement for every $n\\ge123$: every such graph has algebraic connectivity at most $2$, while $K_{2,n-2}$ attains $2$. The proof begins with explicit Rayleigh-quotient certificates that exclude several local configurations from a hypothetical counterexample. A global degree count then controls the number and total excess of vertices of degree at least $5$ and bounds the edge excess of the subgr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07360","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/2608.07360/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.07360","created_at":"2026-08-10T01:15:08.699867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07360v1","created_at":"2026-08-10T01:15:08.699867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07360","created_at":"2026-08-10T01:15:08.699867+00:00"},{"alias_kind":"pith_short_12","alias_value":"CN3LYNEDTJMP","created_at":"2026-08-10T01:15:08.699867+00:00"},{"alias_kind":"pith_short_16","alias_value":"CN3LYNEDTJMP6HQS","created_at":"2026-08-10T01:15:08.699867+00:00"},{"alias_kind":"pith_short_8","alias_value":"CN3LYNED","created_at":"2026-08-10T01:15:08.699867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09822","citing_title":"On a conjecture of Kolokolnikov on algebraic connectivity","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S","json":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S.json","graph_json":"https://pith.science/api/pith-number/CN3LYNEDTJMP6HQSHVDV7ZRC7S/graph.json","events_json":"https://pith.science/api/pith-number/CN3LYNEDTJMP6HQSHVDV7ZRC7S/events.json","paper":"https://pith.science/paper/CN3LYNED"},"agent_actions":{"view_html":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S","download_json":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S.json","view_paper":"https://pith.science/paper/CN3LYNED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07360&json=true","fetch_graph":"https://pith.science/api/pith-number/CN3LYNEDTJMP6HQSHVDV7ZRC7S/graph.json","fetch_events":"https://pith.science/api/pith-number/CN3LYNEDTJMP6HQSHVDV7ZRC7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/action/storage_attestation","attest_author":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/action/author_attestation","sign_citation":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/action/citation_signature","submit_replication":"https://pith.science/pith/CN3LYNEDTJMP6HQSHVDV7ZRC7S/action/replication_record"}},"created_at":"2026-08-10T01:15:08.699867+00:00","updated_at":"2026-08-10T01:15:08.699867+00:00"}