{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7TXIHIW47AK2B2NE75DO5LECKF","short_pith_number":"pith:7TXIHIW4","schema_version":"1.0","canonical_sha256":"fcee83a2dcf815a0e9a4ff46eeac82517b71737665e72d323f3c5b99a24e032c","source":{"kind":"arxiv","id":"1703.02748","version":2},"attestation_state":"computed","paper":{"title":"Spectral Bounds for the Connectivity of Regular Graphs with Given Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aida Abiad, Boris Brimkov, Jingmei Zhang, O Suil, Xavier Martinez-Rivera","submitted_at":"2017-03-08T08:39:53Z","abstract_excerpt":"The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to connectivity attributes such as the vertex- and edge-connectivity, isoperimetric number, and characteristic path length. In this paper, we present two upper bounds for the second-largest eigenvalues of regular graphs and multigraphs of a given order which guarantee a desired vertex- or edge-connectivity. The given bounds are in terms of the order and degree o"},"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":"1703.02748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T08:39:53Z","cross_cats_sorted":[],"title_canon_sha256":"1f55d9267d75dda81fe28eb16374180e445a0024833d6b797f45c49756bfa5e2","abstract_canon_sha256":"73ef5a7ec5f8e33aaf500867e9105e08e5194fd68763a2ae093d8bcc9770ef9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:24.528335Z","signature_b64":"YGRVBw9hqh2w1elSuVXbVHwsSEl4w6AJwY2pBz431HWayeXa6RN6LFTdrTZRCMPvZkPLKAxzp27lWD/cuNoRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcee83a2dcf815a0e9a4ff46eeac82517b71737665e72d323f3c5b99a24e032c","last_reissued_at":"2026-05-18T00:10:24.527688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:24.527688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Bounds for the Connectivity of Regular Graphs with Given Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aida Abiad, Boris Brimkov, Jingmei Zhang, O Suil, Xavier Martinez-Rivera","submitted_at":"2017-03-08T08:39:53Z","abstract_excerpt":"The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to connectivity attributes such as the vertex- and edge-connectivity, isoperimetric number, and characteristic path length. In this paper, we present two upper bounds for the second-largest eigenvalues of regular graphs and multigraphs of a given order which guarantee a desired vertex- or edge-connectivity. The given bounds are in terms of the order and degree o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02748","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":"1703.02748","created_at":"2026-05-18T00:10:24.527771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02748v2","created_at":"2026-05-18T00:10:24.527771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02748","created_at":"2026-05-18T00:10:24.527771+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TXIHIW47AK2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TXIHIW47AK2B2NE","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TXIHIW4","created_at":"2026-05-18T12:31:05.417338+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/7TXIHIW47AK2B2NE75DO5LECKF","json":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF.json","graph_json":"https://pith.science/api/pith-number/7TXIHIW47AK2B2NE75DO5LECKF/graph.json","events_json":"https://pith.science/api/pith-number/7TXIHIW47AK2B2NE75DO5LECKF/events.json","paper":"https://pith.science/paper/7TXIHIW4"},"agent_actions":{"view_html":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF","download_json":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF.json","view_paper":"https://pith.science/paper/7TXIHIW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02748&json=true","fetch_graph":"https://pith.science/api/pith-number/7TXIHIW47AK2B2NE75DO5LECKF/graph.json","fetch_events":"https://pith.science/api/pith-number/7TXIHIW47AK2B2NE75DO5LECKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF/action/storage_attestation","attest_author":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF/action/author_attestation","sign_citation":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF/action/citation_signature","submit_replication":"https://pith.science/pith/7TXIHIW47AK2B2NE75DO5LECKF/action/replication_record"}},"created_at":"2026-05-18T00:10:24.527771+00:00","updated_at":"2026-05-18T00:10:24.527771+00:00"}