{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6BAJV63BQ2ESU5KUYOM5Z7LCPL","short_pith_number":"pith:6BAJV63B","canonical_record":{"source":{"id":"1209.1362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T18:34:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6709113367fb0bb183c2a46a6fb3dca4cc0f4c37bb0097820cd21aa307b9ade0","abstract_canon_sha256":"64a6e16a910e9da083567189d8a35a0391e6977cabf6fa8234db61eb0c50a80c"},"schema_version":"1.0"},"canonical_sha256":"f0409afb6186892a7554c399dcfd627adecf224679362cf4be067caaa3fa11d8","source":{"kind":"arxiv","id":"1209.1362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1362","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1362v1","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1362","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"6BAJV63BQ2ES","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6BAJV63BQ2ESU5KU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6BAJV63B","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6BAJV63BQ2ESU5KUYOM5Z7LCPL","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T18:34:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6709113367fb0bb183c2a46a6fb3dca4cc0f4c37bb0097820cd21aa307b9ade0","abstract_canon_sha256":"64a6e16a910e9da083567189d8a35a0391e6977cabf6fa8234db61eb0c50a80c"},"schema_version":"1.0"},"canonical_sha256":"f0409afb6186892a7554c399dcfd627adecf224679362cf4be067caaa3fa11d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.965326Z","signature_b64":"9g5q6xomQm1dnIEUj3zxg2/OaJkzLZe5n3+PqjLbmKkk/Fe1x/noszjDYBqJwcM+N3X8CjQluCN4UVkCwHPYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0409afb6186892a7554c399dcfd627adecf224679362cf4be067caaa3fa11d8","last_reissued_at":"2026-05-18T02:48:17.964848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.964848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1362","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZNY5kmhP7V4+TsW08Jk+OMjxl/WHxlGO4eJRpcskBd6P2l9iCDUhWCgp//Cy704XVNrQ4b+Ao5J+z3mjYaNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:04:36.781257Z"},"content_sha256":"4d5b25d60bd5654bcee181726554b26afbea2aef29f8b7ed028ffe04c23a2098","schema_version":"1.0","event_id":"sha256:4d5b25d60bd5654bcee181726554b26afbea2aef29f8b7ed028ffe04c23a2098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6BAJV63BQ2ESU5KUYOM5Z7LCPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The bondage number of graphs on topological surfaces and Teschner's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Gagarin, Vadim Zverovich","submitted_at":"2012-09-06T18:34:01Z","abstract_excerpt":"The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper bounds for the bondage number in terms of the maximum vertex degree and the orientable and non-orientable genera of the graph, and show tight lower bounds for the number of vertices of graphs 2-cell embeddable on topological surfaces of a given genus. Also, we provide stronger upper bounds for graphs with no triangles and graphs with the number of vertices la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1362","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAAHimDU1dq6vDs1axzwJaJdXmaCzsa7c2EZvQya03ctygSU6ni3fE/iHfS5/8qHQFZShoPMV3ng0vMohTHfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:04:36.781621Z"},"content_sha256":"31216ec82eeb000870a7c14ad7b85759feed6edbcff6da427cc7682c12b21436","schema_version":"1.0","event_id":"sha256:31216ec82eeb000870a7c14ad7b85759feed6edbcff6da427cc7682c12b21436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/bundle.json","state_url":"https://pith.science/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/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-22T16:04:36Z","links":{"resolver":"https://pith.science/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL","bundle":"https://pith.science/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/bundle.json","state":"https://pith.science/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BAJV63BQ2ESU5KUYOM5Z7LCPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6BAJV63BQ2ESU5KUYOM5Z7LCPL","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":"64a6e16a910e9da083567189d8a35a0391e6977cabf6fa8234db61eb0c50a80c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T18:34:01Z","title_canon_sha256":"6709113367fb0bb183c2a46a6fb3dca4cc0f4c37bb0097820cd21aa307b9ade0"},"schema_version":"1.0","source":{"id":"1209.1362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1362","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1362v1","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1362","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"6BAJV63BQ2ES","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6BAJV63BQ2ESU5KU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6BAJV63B","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:31216ec82eeb000870a7c14ad7b85759feed6edbcff6da427cc7682c12b21436","target":"graph","created_at":"2026-05-18T02:48:17Z","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":"The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper bounds for the bondage number in terms of the maximum vertex degree and the orientable and non-orientable genera of the graph, and show tight lower bounds for the number of vertices of graphs 2-cell embeddable on topological surfaces of a given genus. Also, we provide stronger upper bounds for graphs with no triangles and graphs with the number of vertices la","authors_text":"Andrei Gagarin, Vadim Zverovich","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T18:34:01Z","title":"The bondage number of graphs on topological surfaces and Teschner's conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1362","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:4d5b25d60bd5654bcee181726554b26afbea2aef29f8b7ed028ffe04c23a2098","target":"record","created_at":"2026-05-18T02:48:17Z","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":"64a6e16a910e9da083567189d8a35a0391e6977cabf6fa8234db61eb0c50a80c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-06T18:34:01Z","title_canon_sha256":"6709113367fb0bb183c2a46a6fb3dca4cc0f4c37bb0097820cd21aa307b9ade0"},"schema_version":"1.0","source":{"id":"1209.1362","kind":"arxiv","version":1}},"canonical_sha256":"f0409afb6186892a7554c399dcfd627adecf224679362cf4be067caaa3fa11d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0409afb6186892a7554c399dcfd627adecf224679362cf4be067caaa3fa11d8","first_computed_at":"2026-05-18T02:48:17.964848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:17.964848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9g5q6xomQm1dnIEUj3zxg2/OaJkzLZe5n3+PqjLbmKkk/Fe1x/noszjDYBqJwcM+N3X8CjQluCN4UVkCwHPYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:17.965326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d5b25d60bd5654bcee181726554b26afbea2aef29f8b7ed028ffe04c23a2098","sha256:31216ec82eeb000870a7c14ad7b85759feed6edbcff6da427cc7682c12b21436"],"state_sha256":"118408d8fea4dfc40a5bd4c6d909669a5c84640b4629e9380aea98f98388b802"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fMk2ScGuYjpoPFHafTs6kw9klLlVMnxpqhENYIol7rLr+Jk3dDBG3Bh6RWSEBzZ+sV0Jigh4Azt0ujZFLLhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:04:36.783624Z","bundle_sha256":"5eb8bfd15f9a8fadd6adb0384dcd02d33b77717f27db46a2111656e017a64ba9"}}