{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FNRRHW3G2Z7HUYSA7CARHMP7GQ","short_pith_number":"pith:FNRRHW3G","schema_version":"1.0","canonical_sha256":"2b6313db66d67e7a6240f88113b1ff34341f7a61300847016df37d00e11fe17a","source":{"kind":"arxiv","id":"1702.03801","version":2},"attestation_state":"computed","paper":{"title":"On the connectivity of graphs in association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brian G. Kodalen, William J. Martin","submitted_at":"2017-02-13T15:04:53Z","abstract_excerpt":"Let $(X,\\mathcal{R})$ be a commutative association scheme and let $\\Gamma=(X,R\\cup R^\\top)$ be a connected undirected graph where $R\\in \\mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex connectivity) of $\\Gamma$ is equal to its valency. In this paper, we prove that the deletion of the neighborhood of any vertex leaves behind at most one non-singleton component. Two vertices $a,b\\in X$ are called \"twins\" in $\\Gamma$ if they have identical neighborhoods: $\\Gamma(a)=\\Gamma(b)$. We characterize twins in polynomial association schemes and show that, in the "},"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":"1702.03801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-13T15:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"34902c3e63110e53a6b9b9a5a485788a20da92533ac1185a3ef6492070a8119d","abstract_canon_sha256":"8ed03df42e73eb2c949a634bd4a54da5cc004aaea8fac740a4b961ae57985179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:35.119416Z","signature_b64":"TLpNGGOHv49FqLBk7B4BLtLrVqtELUEoct2T5+Dl3sLn/otKq3THfr19Xdz6VNCk1ZPiRft/48UWnBDttfpmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6313db66d67e7a6240f88113b1ff34341f7a61300847016df37d00e11fe17a","last_reissued_at":"2026-05-18T00:34:35.118930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:35.118930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the connectivity of graphs in association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brian G. Kodalen, William J. Martin","submitted_at":"2017-02-13T15:04:53Z","abstract_excerpt":"Let $(X,\\mathcal{R})$ be a commutative association scheme and let $\\Gamma=(X,R\\cup R^\\top)$ be a connected undirected graph where $R\\in \\mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex connectivity) of $\\Gamma$ is equal to its valency. In this paper, we prove that the deletion of the neighborhood of any vertex leaves behind at most one non-singleton component. Two vertices $a,b\\in X$ are called \"twins\" in $\\Gamma$ if they have identical neighborhoods: $\\Gamma(a)=\\Gamma(b)$. We characterize twins in polynomial association schemes and show that, in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03801","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":"1702.03801","created_at":"2026-05-18T00:34:35.119001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03801v2","created_at":"2026-05-18T00:34:35.119001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03801","created_at":"2026-05-18T00:34:35.119001+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNRRHW3G2Z7H","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNRRHW3G2Z7HUYSA","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNRRHW3G","created_at":"2026-05-18T12:31:15.632608+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/FNRRHW3G2Z7HUYSA7CARHMP7GQ","json":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ.json","graph_json":"https://pith.science/api/pith-number/FNRRHW3G2Z7HUYSA7CARHMP7GQ/graph.json","events_json":"https://pith.science/api/pith-number/FNRRHW3G2Z7HUYSA7CARHMP7GQ/events.json","paper":"https://pith.science/paper/FNRRHW3G"},"agent_actions":{"view_html":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ","download_json":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ.json","view_paper":"https://pith.science/paper/FNRRHW3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03801&json=true","fetch_graph":"https://pith.science/api/pith-number/FNRRHW3G2Z7HUYSA7CARHMP7GQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FNRRHW3G2Z7HUYSA7CARHMP7GQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ/action/storage_attestation","attest_author":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ/action/author_attestation","sign_citation":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ/action/citation_signature","submit_replication":"https://pith.science/pith/FNRRHW3G2Z7HUYSA7CARHMP7GQ/action/replication_record"}},"created_at":"2026-05-18T00:34:35.119001+00:00","updated_at":"2026-05-18T00:34:35.119001+00:00"}