{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VJM4I32XQN7Y3LS75NR4N52ZB2","short_pith_number":"pith:VJM4I32X","schema_version":"1.0","canonical_sha256":"aa59c46f57837f8dae5feb63c6f7590ea9ebf570074fbc884314227d0a3b21fe","source":{"kind":"arxiv","id":"2606.04824","version":1},"attestation_state":"computed","paper":{"title":"The minimum degree question for the Maker Breaker Domination Game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Georg Grasegger, Jakob F\\\"uhrer, Oliver Roche-Newton, Paul Hametner","submitted_at":"2026-06-03T12:46:11Z","abstract_excerpt":"The Maker Breaker Domination Game is a two player game played on a graph $G$ in which the players take turns to claim a vertex from the graph. The aim of the Dominator is to claim the vertices of a dominating set, and the aim of the Staller is to prevent this. In this paper, we consider the following problem: for a given integer $d$, what is the size of the smallest (with respect to the number of vertices) graph with minimum degree $d$ such that the Dominator loses going first? We write $\\beta(d)$ to denote the answer to this question. We determine the precise value of $\\beta(d)$ for $d\\leq 3$"},"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":"2606.04824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T12:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"b364612377e8c33763cdce0a8f424e42fb693ffa4757e2f563d2305f4bc71ba0","abstract_canon_sha256":"5169679509ec66376b912bea27b8d7d954587ee0990e63779cbe1e0cf2104ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:31.325410Z","signature_b64":"Bvxx6LY2KLlKsWE8cVBF3f2Yw+k+41sVB0eGA0QMZ5+02ltr7UWrj2VR50qHskXWCKmaNk0yUoAp6RB3VUs6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa59c46f57837f8dae5feb63c6f7590ea9ebf570074fbc884314227d0a3b21fe","last_reissued_at":"2026-06-04T01:09:31.324747Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:31.324747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum degree question for the Maker Breaker Domination Game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Georg Grasegger, Jakob F\\\"uhrer, Oliver Roche-Newton, Paul Hametner","submitted_at":"2026-06-03T12:46:11Z","abstract_excerpt":"The Maker Breaker Domination Game is a two player game played on a graph $G$ in which the players take turns to claim a vertex from the graph. The aim of the Dominator is to claim the vertices of a dominating set, and the aim of the Staller is to prevent this. In this paper, we consider the following problem: for a given integer $d$, what is the size of the smallest (with respect to the number of vertices) graph with minimum degree $d$ such that the Dominator loses going first? We write $\\beta(d)$ to denote the answer to this question. We determine the precise value of $\\beta(d)$ for $d\\leq 3$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04824","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.04824/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.04824","created_at":"2026-06-04T01:09:31.324842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04824v1","created_at":"2026-06-04T01:09:31.324842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04824","created_at":"2026-06-04T01:09:31.324842+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJM4I32XQN7Y","created_at":"2026-06-04T01:09:31.324842+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJM4I32XQN7Y3LS7","created_at":"2026-06-04T01:09:31.324842+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJM4I32X","created_at":"2026-06-04T01:09:31.324842+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/VJM4I32XQN7Y3LS75NR4N52ZB2","json":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2.json","graph_json":"https://pith.science/api/pith-number/VJM4I32XQN7Y3LS75NR4N52ZB2/graph.json","events_json":"https://pith.science/api/pith-number/VJM4I32XQN7Y3LS75NR4N52ZB2/events.json","paper":"https://pith.science/paper/VJM4I32X"},"agent_actions":{"view_html":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2","download_json":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2.json","view_paper":"https://pith.science/paper/VJM4I32X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04824&json=true","fetch_graph":"https://pith.science/api/pith-number/VJM4I32XQN7Y3LS75NR4N52ZB2/graph.json","fetch_events":"https://pith.science/api/pith-number/VJM4I32XQN7Y3LS75NR4N52ZB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2/action/storage_attestation","attest_author":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2/action/author_attestation","sign_citation":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2/action/citation_signature","submit_replication":"https://pith.science/pith/VJM4I32XQN7Y3LS75NR4N52ZB2/action/replication_record"}},"created_at":"2026-06-04T01:09:31.324842+00:00","updated_at":"2026-06-04T01:09:31.324842+00:00"}