{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TN6PNNGKVEK7FLYG2VSVAPSYJY","short_pith_number":"pith:TN6PNNGK","schema_version":"1.0","canonical_sha256":"9b7cf6b4caa915f2af06d565503e584e0452eef5c7eefcb5b4072c78e7fac8ac","source":{"kind":"arxiv","id":"1804.08991","version":2},"attestation_state":"computed","paper":{"title":"Domination game and minimal edge cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Sandi Klav\\v{z}ar","submitted_at":"2018-04-24T12:38:07Z","abstract_excerpt":"In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if $C$ a minimum edge cut of a connected graph $G$, then $\\gamma_g(G) \\le \\gamma_g(G\\setminus C) + 2\\kappa'(G)$. Double-Staller graphs are introduced in order to show that this upper bound can be attained for graphs with a bridge. The obtained results are used to extend the family of known traceable graphs whose game domination numbers are at most one-half t"},"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":"1804.08991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-24T12:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"0ef9a71df08b7227e2cfd61b10319423e9e80d24f3c80292012b3b2a86a96c1e","abstract_canon_sha256":"777b2702a5b57069487ab9153622552f8f7a65e990f58e0675a4715eda0f77f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:25.203608Z","signature_b64":"xO5+IvUTIMXUXSIrhAUeEiRfxrpZ19Es/aZBVJ77zrNUFY3mZsUsTSHc/baoql+ZEovliNNEGGFWiqQqzVcYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7cf6b4caa915f2af06d565503e584e0452eef5c7eefcb5b4072c78e7fac8ac","last_reissued_at":"2026-05-18T00:02:25.202855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:25.202855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination game and minimal edge cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Sandi Klav\\v{z}ar","submitted_at":"2018-04-24T12:38:07Z","abstract_excerpt":"In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if $C$ a minimum edge cut of a connected graph $G$, then $\\gamma_g(G) \\le \\gamma_g(G\\setminus C) + 2\\kappa'(G)$. Double-Staller graphs are introduced in order to show that this upper bound can be attained for graphs with a bridge. The obtained results are used to extend the family of known traceable graphs whose game domination numbers are at most one-half t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08991","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":"1804.08991","created_at":"2026-05-18T00:02:25.202961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08991v2","created_at":"2026-05-18T00:02:25.202961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08991","created_at":"2026-05-18T00:02:25.202961+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN6PNNGKVEK7","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN6PNNGKVEK7FLYG","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN6PNNGK","created_at":"2026-05-18T12:32:53.628368+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/TN6PNNGKVEK7FLYG2VSVAPSYJY","json":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY.json","graph_json":"https://pith.science/api/pith-number/TN6PNNGKVEK7FLYG2VSVAPSYJY/graph.json","events_json":"https://pith.science/api/pith-number/TN6PNNGKVEK7FLYG2VSVAPSYJY/events.json","paper":"https://pith.science/paper/TN6PNNGK"},"agent_actions":{"view_html":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY","download_json":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY.json","view_paper":"https://pith.science/paper/TN6PNNGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08991&json=true","fetch_graph":"https://pith.science/api/pith-number/TN6PNNGKVEK7FLYG2VSVAPSYJY/graph.json","fetch_events":"https://pith.science/api/pith-number/TN6PNNGKVEK7FLYG2VSVAPSYJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY/action/storage_attestation","attest_author":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY/action/author_attestation","sign_citation":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY/action/citation_signature","submit_replication":"https://pith.science/pith/TN6PNNGKVEK7FLYG2VSVAPSYJY/action/replication_record"}},"created_at":"2026-05-18T00:02:25.202961+00:00","updated_at":"2026-05-18T00:02:25.202961+00:00"}