{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IGRNZ7DAEE6MFL7MVERMGQMORA","short_pith_number":"pith:IGRNZ7DA","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"},"canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","source":{"kind":"arxiv","id":"1102.0127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0127","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0127v1","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0127","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"IGRNZ7DAEE6M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IGRNZ7DAEE6MFL7M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IGRNZ7DA","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IGRNZ7DAEE6MFL7MVERMGQMORA","target":"record","payload":{"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"},"canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","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"},"source_kind":"arxiv","source_id":"1102.0127","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTeXydLhtklU2xZAnuI9UHpMjEBQjACZrkR4oemSbYVDF0qxXwIDdXXnd8srg4bNc+FgUvz4UFWW/SmWXJA9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:21:58.711135Z"},"content_sha256":"84c2ad53eec9c83985a6d1697da7be8ea9d457faf1f5b0d3088a68cbe1fdfd17","schema_version":"1.0","event_id":"sha256:84c2ad53eec9c83985a6d1697da7be8ea9d457faf1f5b0d3088a68cbe1fdfd17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IGRNZ7DAEE6MFL7MVERMGQMORA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRDVd17VW4Jrbcb3Vec3sYBe4qgA7Sw7Cr8bRySI2xgnVRvuPvfIECk57sw3JZVU5JLOYQfNJw2RS0d23NvKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:21:58.711491Z"},"content_sha256":"7f88c75bedceeb2dce1e53e37832e455511b01464713fb1177761d13fcb7f22f","schema_version":"1.0","event_id":"sha256:7f88c75bedceeb2dce1e53e37832e455511b01464713fb1177761d13fcb7f22f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/bundle.json","state_url":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:21:58Z","links":{"resolver":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA","bundle":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/bundle.json","state":"https://pith.science/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGRNZ7DAEE6MFL7MVERMGQMORA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IGRNZ7DAEE6MFL7MVERMGQMORA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad6d33e6bdcad57de1250810568ac1e513b801b67cffd4091fd2562f71a59aa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-01T11:06:53Z","title_canon_sha256":"920360361835dce37123eb9983a858fd9845e19cb7f9c8d11eab0d70d0b62cd2"},"schema_version":"1.0","source":{"id":"1102.0127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0127","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0127v1","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0127","created_at":"2026-05-18T04:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"IGRNZ7DAEE6M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IGRNZ7DAEE6MFL7M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IGRNZ7DA","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:7f88c75bedceeb2dce1e53e37832e455511b01464713fb1177761d13fcb7f22f","target":"graph","created_at":"2026-05-18T04:30:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","authors_text":"Primoz Sparl, Stefko Miklavic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-01T11:06:53Z","title":"On the Connectivity of Bipartite Distance-Balanced Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0127","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:84c2ad53eec9c83985a6d1697da7be8ea9d457faf1f5b0d3088a68cbe1fdfd17","target":"record","created_at":"2026-05-18T04:30:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad6d33e6bdcad57de1250810568ac1e513b801b67cffd4091fd2562f71a59aa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-01T11:06:53Z","title_canon_sha256":"920360361835dce37123eb9983a858fd9845e19cb7f9c8d11eab0d70d0b62cd2"},"schema_version":"1.0","source":{"id":"1102.0127","kind":"arxiv","version":1}},"canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41a2dcfc60213cc2afeca922c3418e88125bb40aa59aef2974df5b1e5d53abc5","first_computed_at":"2026-05-18T04:30:13.145175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:13.145175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+7jPF9Sx5JdFbpsMn36LCIQPyJb/kVfcHKz6B22hQcD06K7/XS9FAFQoaq2x8rO50iQ37SRHq3t3QmPCK3qCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:13.145627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c2ad53eec9c83985a6d1697da7be8ea9d457faf1f5b0d3088a68cbe1fdfd17","sha256:7f88c75bedceeb2dce1e53e37832e455511b01464713fb1177761d13fcb7f22f"],"state_sha256":"db4293b27b0dfd3835a2113abf6789f69e52b1f951130439dbd8b6e6d0f7ab2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYfkRksSxBdNpRZ2R7ns04G2zE/L2SSlSvaAi5BMPWsrBsKrUXwZR7Lgm/Fcg+mJ+9ErorW6yJHWW5G5bMAQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:21:58.713451Z","bundle_sha256":"a2a06d116d4a169eb6a87b6fb522e92b9da39a81dce7443c8af5774b87ae5ff6"}}