{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CG4XB7WRQOOIKO5PDRO7FEWSZZ","short_pith_number":"pith:CG4XB7WR","schema_version":"1.0","canonical_sha256":"11b970fed1839c853baf1c5df292d2ce715b230c1d975a9fbe6306e63fc1e12d","source":{"kind":"arxiv","id":"1111.5629","version":3},"attestation_state":"computed","paper":{"title":"An improved upper bound for the bondage number of graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Huang","submitted_at":"2011-11-23T21:21:56Z","abstract_excerpt":"The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\\Delta(G)$ and embeddable on an orientable surface of genus $h$ and a non-orientable surface of genus $k$, $b(G)\\leq\\min\\{\\Delta(G)+h+2,\\Delta+k+1\\}$. They also gave examples showing that adjustments of their proofs implicitly provide better results for larger values of $h$ and $k$. In this paper we establish an improved explicit upper bound for $b(G)$, using the Euler c"},"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":"1111.5629","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-23T21:21:56Z","cross_cats_sorted":[],"title_canon_sha256":"203fb0f0ab4f90325d2d9ac78b6c152527ca60d7adf949192122bc17445346ac","abstract_canon_sha256":"4c93422fbed30df2c628b4c0906c5162b8299fbfe74f8cf1b6900cf0383b6a72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.985306Z","signature_b64":"F0bbk50nbZlANiPG6GzecbGyDmtCyCsCJiQfN9JMTvGSTB+GqdjCg2uiwDYIRt2J8/GQSuyA0IOnX0pLHVwBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b970fed1839c853baf1c5df292d2ce715b230c1d975a9fbe6306e63fc1e12d","last_reissued_at":"2026-05-18T03:42:23.984811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.984811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved upper bound for the bondage number of graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Huang","submitted_at":"2011-11-23T21:21:56Z","abstract_excerpt":"The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\\Delta(G)$ and embeddable on an orientable surface of genus $h$ and a non-orientable surface of genus $k$, $b(G)\\leq\\min\\{\\Delta(G)+h+2,\\Delta+k+1\\}$. They also gave examples showing that adjustments of their proofs implicitly provide better results for larger values of $h$ and $k$. In this paper we establish an improved explicit upper bound for $b(G)$, using the Euler c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5629","kind":"arxiv","version":3},"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":"1111.5629","created_at":"2026-05-18T03:42:23.984871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5629v3","created_at":"2026-05-18T03:42:23.984871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5629","created_at":"2026-05-18T03:42:23.984871+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG4XB7WRQOOI","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG4XB7WRQOOIKO5P","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG4XB7WR","created_at":"2026-05-18T12:26:26.731475+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/CG4XB7WRQOOIKO5PDRO7FEWSZZ","json":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ.json","graph_json":"https://pith.science/api/pith-number/CG4XB7WRQOOIKO5PDRO7FEWSZZ/graph.json","events_json":"https://pith.science/api/pith-number/CG4XB7WRQOOIKO5PDRO7FEWSZZ/events.json","paper":"https://pith.science/paper/CG4XB7WR"},"agent_actions":{"view_html":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ","download_json":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ.json","view_paper":"https://pith.science/paper/CG4XB7WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5629&json=true","fetch_graph":"https://pith.science/api/pith-number/CG4XB7WRQOOIKO5PDRO7FEWSZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CG4XB7WRQOOIKO5PDRO7FEWSZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ/action/storage_attestation","attest_author":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ/action/author_attestation","sign_citation":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ/action/citation_signature","submit_replication":"https://pith.science/pith/CG4XB7WRQOOIKO5PDRO7FEWSZZ/action/replication_record"}},"created_at":"2026-05-18T03:42:23.984871+00:00","updated_at":"2026-05-18T03:42:23.984871+00:00"}