{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SSFW4YRLIL4AFEEHHH3MGFV7HM","short_pith_number":"pith:SSFW4YRL","schema_version":"1.0","canonical_sha256":"948b6e622b42f802908739f6c316bf3b31d32315c8654fad8b7c9f9e371221bf","source":{"kind":"arxiv","id":"2310.14647","version":2},"attestation_state":"computed","paper":{"title":"Indicated domination game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Csilla Bujt\\'as, Douglas F. Rall, Vesna Ir\\v{s}i\\v{c}, Zsolt Tuza","submitted_at":"2023-10-23T07:40:19Z","abstract_excerpt":"Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$ by two players, Dominator and Staller, where Dominator wants to finish the game in as few rounds as possible while Staller wants just the opposite. In each round, Dominator indicates a vertex $u$ of $G$ that has not been dominated by previous selections of Staller, which, by the rules of the game, forces Staller to select a vertex in the closed neighborhood"},"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":"2310.14647","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-23T07:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"3eeaf520470d2029dd4f84c6314137157e55597d687cdd07f1afda899c9c18eb","abstract_canon_sha256":"e26f057a5cc13f686170a83cc306e19ab14e4e0f6a4d72fe04d35fa62a7561e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:16.315129Z","signature_b64":"Cc5JdnipjefDNebMehnUFogyaGfIKOlqNNB5DERX1u/7aK1Po4LYeDiGb7kvnjBudeartPW91RdKnJI0uaQ5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948b6e622b42f802908739f6c316bf3b31d32315c8654fad8b7c9f9e371221bf","last_reissued_at":"2026-07-05T08:01:16.314665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:16.314665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indicated domination game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Csilla Bujt\\'as, Douglas F. Rall, Vesna Ir\\v{s}i\\v{c}, Zsolt Tuza","submitted_at":"2023-10-23T07:40:19Z","abstract_excerpt":"Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$ by two players, Dominator and Staller, where Dominator wants to finish the game in as few rounds as possible while Staller wants just the opposite. In each round, Dominator indicates a vertex $u$ of $G$ that has not been dominated by previous selections of Staller, which, by the rules of the game, forces Staller to select a vertex in the closed neighborhood"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14647","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.14647/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":"2310.14647","created_at":"2026-07-05T08:01:16.314721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.14647v2","created_at":"2026-07-05T08:01:16.314721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14647","created_at":"2026-07-05T08:01:16.314721+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSFW4YRLIL4A","created_at":"2026-07-05T08:01:16.314721+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSFW4YRLIL4AFEEH","created_at":"2026-07-05T08:01:16.314721+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSFW4YRL","created_at":"2026-07-05T08:01:16.314721+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/SSFW4YRLIL4AFEEHHH3MGFV7HM","json":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM.json","graph_json":"https://pith.science/api/pith-number/SSFW4YRLIL4AFEEHHH3MGFV7HM/graph.json","events_json":"https://pith.science/api/pith-number/SSFW4YRLIL4AFEEHHH3MGFV7HM/events.json","paper":"https://pith.science/paper/SSFW4YRL"},"agent_actions":{"view_html":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM","download_json":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM.json","view_paper":"https://pith.science/paper/SSFW4YRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.14647&json=true","fetch_graph":"https://pith.science/api/pith-number/SSFW4YRLIL4AFEEHHH3MGFV7HM/graph.json","fetch_events":"https://pith.science/api/pith-number/SSFW4YRLIL4AFEEHHH3MGFV7HM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM/action/storage_attestation","attest_author":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM/action/author_attestation","sign_citation":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM/action/citation_signature","submit_replication":"https://pith.science/pith/SSFW4YRLIL4AFEEHHH3MGFV7HM/action/replication_record"}},"created_at":"2026-07-05T08:01:16.314721+00:00","updated_at":"2026-07-05T08:01:16.314721+00:00"}