{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YMIO7AWFKKCXD7JBFEV5BQUL3A","short_pith_number":"pith:YMIO7AWF","schema_version":"1.0","canonical_sha256":"c310ef82c5528571fd21292bd0c28bd80b9c53041eccda9120033258c08ed45e","source":{"kind":"arxiv","id":"2212.04527","version":2},"attestation_state":"computed","paper":{"title":"A proof of the 3/5-conjecture in the domination game","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leo Versteegen","submitted_at":"2022-12-08T19:21:24Z","abstract_excerpt":"The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each selected vertex must strictly increase the number of dominated vertices at the time of its selection, and the game ends once every vertex in $G$ is dominated. Dominator aims to keep the game as short as possible, while Staller tries to achieve the opposite. In this article, we prove that for any graph $G$ on $n$ vertices, Dominator has a strategy to end the gam"},"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":"2212.04527","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-08T19:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"ea4aed3909c0ea527a3ded70d4ba672229d0acfcd894bf7819825a3ba49fdc15","abstract_canon_sha256":"a62c73adb0f00c9caa0d1c82a4530b610392561cf28c646e60ec130f9c236c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:10.311388Z","signature_b64":"p2R+d1iWXFl7ElynjgCAdTlsR/EtU0IvMdk35rjsES2uAi8xCpEtMfitXLpbUtD0023T8wslUaTyt1GBKgFdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c310ef82c5528571fd21292bd0c28bd80b9c53041eccda9120033258c08ed45e","last_reissued_at":"2026-07-05T05:38:10.310920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:10.310920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of the 3/5-conjecture in the domination game","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leo Versteegen","submitted_at":"2022-12-08T19:21:24Z","abstract_excerpt":"The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each selected vertex must strictly increase the number of dominated vertices at the time of its selection, and the game ends once every vertex in $G$ is dominated. Dominator aims to keep the game as short as possible, while Staller tries to achieve the opposite. In this article, we prove that for any graph $G$ on $n$ vertices, Dominator has a strategy to end the gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04527","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/2212.04527/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":"2212.04527","created_at":"2026-07-05T05:38:10.310971+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.04527v2","created_at":"2026-07-05T05:38:10.310971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04527","created_at":"2026-07-05T05:38:10.310971+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMIO7AWFKKCX","created_at":"2026-07-05T05:38:10.310971+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMIO7AWFKKCXD7JB","created_at":"2026-07-05T05:38:10.310971+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMIO7AWF","created_at":"2026-07-05T05:38:10.310971+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/YMIO7AWFKKCXD7JBFEV5BQUL3A","json":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A.json","graph_json":"https://pith.science/api/pith-number/YMIO7AWFKKCXD7JBFEV5BQUL3A/graph.json","events_json":"https://pith.science/api/pith-number/YMIO7AWFKKCXD7JBFEV5BQUL3A/events.json","paper":"https://pith.science/paper/YMIO7AWF"},"agent_actions":{"view_html":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A","download_json":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A.json","view_paper":"https://pith.science/paper/YMIO7AWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.04527&json=true","fetch_graph":"https://pith.science/api/pith-number/YMIO7AWFKKCXD7JBFEV5BQUL3A/graph.json","fetch_events":"https://pith.science/api/pith-number/YMIO7AWFKKCXD7JBFEV5BQUL3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A/action/storage_attestation","attest_author":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A/action/author_attestation","sign_citation":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A/action/citation_signature","submit_replication":"https://pith.science/pith/YMIO7AWFKKCXD7JBFEV5BQUL3A/action/replication_record"}},"created_at":"2026-07-05T05:38:10.310971+00:00","updated_at":"2026-07-05T05:38:10.310971+00:00"}