{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3CIORN5VZJFK44AAZMHUV3RKDF","short_pith_number":"pith:3CIORN5V","schema_version":"1.0","canonical_sha256":"d890e8b7b5ca4aae7000cb0f4aee2a1941dff233d786db32792e11983b7d42b2","source":{"kind":"arxiv","id":"2608.09879","version":1},"attestation_state":"computed","paper":{"title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhay Jayarajan, M. Rajesh Kannan, Rahul Roy, Sebastian M. Cioab\\u{a}","submitted_at":"2026-08-10T17:32:53Z","abstract_excerpt":"The algebraic connectivity of a graph $G$ is a well studied graph invariant that is related to other properties of the graph such as connectivity and expansion. Given $n$ and $m$, $\\alpha(n,m)$ is the maximum algebraic connectivity of a graph with $n$ vertices with $m$ edges. In 2015, Kolokolnikov conjectured that $\\alpha(n,2n-4)=2$ for $n\\geq 3$, and verified this claim computationally for $n \\le 12$. In this paper, we prove Kolokolnikov's conjecture."},"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.09879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-10T17:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"83ca1c35a8b096c7307c246c1b5207d91a32ef61cf5f4fa238d991500c5395dd","abstract_canon_sha256":"9e5039f7e036e72369f23984c2e3519c9bee61e244ae940c3e7254eef21c21d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:25:19.433617Z","signature_b64":"9Y83y43udLULi6KKzZG2XJJq1vEP1oJlC1okKQCe4GFpRbpUMU9wfU+j3zLaX2HOKBzxYihGR8vQFaNbkR6RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d890e8b7b5ca4aae7000cb0f4aee2a1941dff233d786db32792e11983b7d42b2","last_reissued_at":"2026-08-11T02:25:19.432041Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:25:19.432041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhay Jayarajan, M. Rajesh Kannan, Rahul Roy, Sebastian M. Cioab\\u{a}","submitted_at":"2026-08-10T17:32:53Z","abstract_excerpt":"The algebraic connectivity of a graph $G$ is a well studied graph invariant that is related to other properties of the graph such as connectivity and expansion. Given $n$ and $m$, $\\alpha(n,m)$ is the maximum algebraic connectivity of a graph with $n$ vertices with $m$ edges. In 2015, Kolokolnikov conjectured that $\\alpha(n,2n-4)=2$ for $n\\geq 3$, and verified this claim computationally for $n \\le 12$. In this paper, we prove Kolokolnikov's conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09879","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.09879/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.09879","created_at":"2026-08-11T02:25:19.432671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09879v1","created_at":"2026-08-11T02:25:19.432671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09879","created_at":"2026-08-11T02:25:19.432671+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CIORN5VZJFK","created_at":"2026-08-11T02:25:19.432671+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CIORN5VZJFK44AA","created_at":"2026-08-11T02:25:19.432671+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CIORN5V","created_at":"2026-08-11T02:25:19.432671+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/3CIORN5VZJFK44AAZMHUV3RKDF","json":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF.json","graph_json":"https://pith.science/api/pith-number/3CIORN5VZJFK44AAZMHUV3RKDF/graph.json","events_json":"https://pith.science/api/pith-number/3CIORN5VZJFK44AAZMHUV3RKDF/events.json","paper":"https://pith.science/paper/3CIORN5V"},"agent_actions":{"view_html":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF","download_json":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF.json","view_paper":"https://pith.science/paper/3CIORN5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09879&json=true","fetch_graph":"https://pith.science/api/pith-number/3CIORN5VZJFK44AAZMHUV3RKDF/graph.json","fetch_events":"https://pith.science/api/pith-number/3CIORN5VZJFK44AAZMHUV3RKDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF/action/storage_attestation","attest_author":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF/action/author_attestation","sign_citation":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF/action/citation_signature","submit_replication":"https://pith.science/pith/3CIORN5VZJFK44AAZMHUV3RKDF/action/replication_record"}},"created_at":"2026-08-11T02:25:19.432671+00:00","updated_at":"2026-08-11T02:25:19.432671+00:00"}