{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVBPOFZZPCGIM4N3YYGSVCYMCS","short_pith_number":"pith:JVBPOFZZ","schema_version":"1.0","canonical_sha256":"4d42f71739788c8671bbc60d2a8b0c14ad75c98cef1378c429a2b1925b96b5d0","source":{"kind":"arxiv","id":"1312.2247","version":1},"attestation_state":"computed","paper":{"title":"The spectrum and toughness of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sebastian M. Cioab\\u{a}, Wiseley Wong","submitted_at":"2013-12-08T19:34:00Z","abstract_excerpt":"In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\\lambda-2$, where $\\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this lower bound to $k/\\lambda-1$ and that many graphs (especially graphs attaining equality in the Hoffman ratio bound for the independence number) have toughness equal to $k/\\lambda$. In this paper, we improve Brouwer's spectral bound when the toughness is small and we determine the exact value of the toughness for many strongly regular graphs attaining equality "},"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":"1312.2247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-08T19:34:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1a817a3c928724537fe9b6ccbc63bdca1f35ee266dd7316bb97686f31585397e","abstract_canon_sha256":"1730dd4b2a51e9c6bfde17ee30c868a8be7f62933c3e2c573f38fe8af40b1deb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.832484Z","signature_b64":"SLkuAZY/ySSOcQeQ8tD0PE026mpmvbKFkOftGEXvLp6aBnYE04Je7oUBgGo5vwM4RsmDLYaiHZdxOSyiDFtrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d42f71739788c8671bbc60d2a8b0c14ad75c98cef1378c429a2b1925b96b5d0","last_reissued_at":"2026-05-18T03:05:10.831664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.831664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spectrum and toughness of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sebastian M. Cioab\\u{a}, Wiseley Wong","submitted_at":"2013-12-08T19:34:00Z","abstract_excerpt":"In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\\lambda-2$, where $\\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this lower bound to $k/\\lambda-1$ and that many graphs (especially graphs attaining equality in the Hoffman ratio bound for the independence number) have toughness equal to $k/\\lambda$. In this paper, we improve Brouwer's spectral bound when the toughness is small and we determine the exact value of the toughness for many strongly regular graphs attaining equality "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2247","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":"1312.2247","created_at":"2026-05-18T03:05:10.831801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2247v1","created_at":"2026-05-18T03:05:10.831801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2247","created_at":"2026-05-18T03:05:10.831801+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVBPOFZZPCGI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVBPOFZZPCGIM4N3","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVBPOFZZ","created_at":"2026-05-18T12:27:49.015174+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/JVBPOFZZPCGIM4N3YYGSVCYMCS","json":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS.json","graph_json":"https://pith.science/api/pith-number/JVBPOFZZPCGIM4N3YYGSVCYMCS/graph.json","events_json":"https://pith.science/api/pith-number/JVBPOFZZPCGIM4N3YYGSVCYMCS/events.json","paper":"https://pith.science/paper/JVBPOFZZ"},"agent_actions":{"view_html":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS","download_json":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS.json","view_paper":"https://pith.science/paper/JVBPOFZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2247&json=true","fetch_graph":"https://pith.science/api/pith-number/JVBPOFZZPCGIM4N3YYGSVCYMCS/graph.json","fetch_events":"https://pith.science/api/pith-number/JVBPOFZZPCGIM4N3YYGSVCYMCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS/action/storage_attestation","attest_author":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS/action/author_attestation","sign_citation":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS/action/citation_signature","submit_replication":"https://pith.science/pith/JVBPOFZZPCGIM4N3YYGSVCYMCS/action/replication_record"}},"created_at":"2026-05-18T03:05:10.831801+00:00","updated_at":"2026-05-18T03:05:10.831801+00:00"}