{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7TRXVBMTJK76LQL2WFIKFSVF6B","short_pith_number":"pith:7TRXVBMT","schema_version":"1.0","canonical_sha256":"fce37a85934abfe5c17ab150a2caa5f05998435f9a1fa7c7a53e8621a6c9cb16","source":{"kind":"arxiv","id":"1412.6147","version":1},"attestation_state":"computed","paper":{"title":"Maximizing algebraic connectivity for certain families of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.SP"],"primary_cat":"cs.DM","authors_text":"Theodore Kolokolnikov","submitted_at":"2014-12-17T18:49:49Z","abstract_excerpt":"We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded above by $2(d-2) \\frac{1}{n}+O(\\frac{\\ln n}{n^{2}}) .$ We then investigate upper bounds on algebraic connectivity for cubic graphs. We show that algebraic connectivity of a cubic graph of girth $g$ is bounded above by $3-2^{3/2}\\cos(\\pi/\\lfloor g/2\\rfloor) ,$ which is an improvement over the bound found by Nilli [A. Nilli, Electron. J. Combin., 11(9), 2004]"},"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":"1412.6147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-12-17T18:49:49Z","cross_cats_sorted":["math.CO","math.SP"],"title_canon_sha256":"2b255f5cb1d807241f8ea3ffcb5690f290c9ef9408f565419cdcbe6b013d5384","abstract_canon_sha256":"ffaf5bf9a170e4f0aea4930d7b806b3016d3ea8daeb9f924a9ad19f5ce6266a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.278954Z","signature_b64":"8EjfbWutYjD9fWS0M/FX+09qGIhqwas/y7FSlZss7igjwx++PwxPrVdV6CuGIjWfvQZobxeObu58R+UjPIM9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce37a85934abfe5c17ab150a2caa5f05998435f9a1fa7c7a53e8621a6c9cb16","last_reissued_at":"2026-05-18T02:30:54.278432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.278432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing algebraic connectivity for certain families of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.SP"],"primary_cat":"cs.DM","authors_text":"Theodore Kolokolnikov","submitted_at":"2014-12-17T18:49:49Z","abstract_excerpt":"We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded above by $2(d-2) \\frac{1}{n}+O(\\frac{\\ln n}{n^{2}}) .$ We then investigate upper bounds on algebraic connectivity for cubic graphs. We show that algebraic connectivity of a cubic graph of girth $g$ is bounded above by $3-2^{3/2}\\cos(\\pi/\\lfloor g/2\\rfloor) ,$ which is an improvement over the bound found by Nilli [A. Nilli, Electron. J. Combin., 11(9), 2004]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6147","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6147","created_at":"2026-05-18T02:30:54.278513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6147v1","created_at":"2026-05-18T02:30:54.278513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6147","created_at":"2026-05-18T02:30:54.278513+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TRXVBMTJK76","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TRXVBMTJK76LQL2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TRXVBMT","created_at":"2026-05-18T12:28:19.803747+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/7TRXVBMTJK76LQL2WFIKFSVF6B","json":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B.json","graph_json":"https://pith.science/api/pith-number/7TRXVBMTJK76LQL2WFIKFSVF6B/graph.json","events_json":"https://pith.science/api/pith-number/7TRXVBMTJK76LQL2WFIKFSVF6B/events.json","paper":"https://pith.science/paper/7TRXVBMT"},"agent_actions":{"view_html":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B","download_json":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B.json","view_paper":"https://pith.science/paper/7TRXVBMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6147&json=true","fetch_graph":"https://pith.science/api/pith-number/7TRXVBMTJK76LQL2WFIKFSVF6B/graph.json","fetch_events":"https://pith.science/api/pith-number/7TRXVBMTJK76LQL2WFIKFSVF6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B/action/storage_attestation","attest_author":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B/action/author_attestation","sign_citation":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B/action/citation_signature","submit_replication":"https://pith.science/pith/7TRXVBMTJK76LQL2WFIKFSVF6B/action/replication_record"}},"created_at":"2026-05-18T02:30:54.278513+00:00","updated_at":"2026-05-18T02:30:54.278513+00:00"}