{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IGRNZ7DAEE6MFL7MVERMGQMORA","short_pith_number":"pith:IGRNZ7DA","schema_version":"1.0","canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","source":{"kind":"arxiv","id":"1102.0127","version":1},"attestation_state":"computed","paper":{"title":"On the Connectivity of Bipartite Distance-Balanced Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2011-02-01T11:06:53Z","abstract_excerpt":"A connected graph $\\G$ is said to be {\\it distance-balanced} whenever for any pair of adjacent vertices $u,v$ of $\\G$ the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In [Bipartite graphs with balanced $(a,b)$-partitions, {\\em Ars Combin.} {\\bf 51} (1999), 113-119] Handa asked whether every bipartite distance-balanced graph, that is not a cycle, is 3-connected. In this paper the Handa question is answered in the negative. Moreover, we show that a minimal bipartite distance-balanced graph, that is not a cycle and is not 3-connected, "},"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":"1102.0127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-01T11:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"920360361835dce37123eb9983a858fd9845e19cb7f9c8d11eab0d70d0b62cd2","abstract_canon_sha256":"ad6d33e6bdcad57de1250810568ac1e513b801b67cffd4091fd2562f71a59aa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:13.145627Z","signature_b64":"j+7jPF9Sx5JdFbpsMn36LCIQPyJb/kVfcHKz6B22hQcD06K7/XS9FAFQoaq2x8rO50iQ37SRHq3t3QmPCK3qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","last_reissued_at":"2026-05-18T04:30:13.145175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:13.145175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Connectivity of Bipartite Distance-Balanced Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2011-02-01T11:06:53Z","abstract_excerpt":"A connected graph $\\G$ is said to be {\\it distance-balanced} whenever for any pair of adjacent vertices $u,v$ of $\\G$ the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In [Bipartite graphs with balanced $(a,b)$-partitions, {\\em Ars Combin.} {\\bf 51} (1999), 113-119] Handa asked whether every bipartite distance-balanced graph, that is not a cycle, is 3-connected. In this paper the Handa question is answered in the negative. Moreover, we show that a minimal bipartite distance-balanced graph, that is not a cycle and is not 3-connected, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0127","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":"1102.0127","created_at":"2026-05-18T04:30:13.145239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0127v1","created_at":"2026-05-18T04:30:13.145239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0127","created_at":"2026-05-18T04:30:13.145239+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGRNZ7DAEE6M","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGRNZ7DAEE6MFL7M","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGRNZ7DA","created_at":"2026-05-18T12:26:30.835961+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/IGRNZ7DAEE6MFL7MVERMGQMORA","json":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA.json","graph_json":"https://pith.science/api/pith-number/IGRNZ7DAEE6MFL7MVERMGQMORA/graph.json","events_json":"https://pith.science/api/pith-number/IGRNZ7DAEE6MFL7MVERMGQMORA/events.json","paper":"https://pith.science/paper/IGRNZ7DA"},"agent_actions":{"view_html":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA","download_json":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA.json","view_paper":"https://pith.science/paper/IGRNZ7DA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0127&json=true","fetch_graph":"https://pith.science/api/pith-number/IGRNZ7DAEE6MFL7MVERMGQMORA/graph.json","fetch_events":"https://pith.science/api/pith-number/IGRNZ7DAEE6MFL7MVERMGQMORA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/action/storage_attestation","attest_author":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/action/author_attestation","sign_citation":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/action/citation_signature","submit_replication":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/action/replication_record"}},"created_at":"2026-05-18T04:30:13.145239+00:00","updated_at":"2026-05-18T04:30:13.145239+00:00"}