{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2HAXOMPB4OFX7YY52D2OD5IJIQ","short_pith_number":"pith:2HAXOMPB","canonical_record":{"source":{"id":"1406.7372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T08:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"5c2026f77c891ffe0094fe4ac9f5084c008146d79f6b907a3d722f82b54dffea","abstract_canon_sha256":"4232ef073a509ddad597a593681a3d84d6b6bc17e808a14a8471396349197d8b"},"schema_version":"1.0"},"canonical_sha256":"d1c17731e1e38b7fe31dd0f4e1f509440309c26d6933498614622e3b43c55ff2","source":{"kind":"arxiv","id":"1406.7372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7372","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7372v1","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7372","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"2HAXOMPB4OFX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HAXOMPB4OFX7YY5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HAXOMPB","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2HAXOMPB4OFX7YY52D2OD5IJIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T08:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"5c2026f77c891ffe0094fe4ac9f5084c008146d79f6b907a3d722f82b54dffea","abstract_canon_sha256":"4232ef073a509ddad597a593681a3d84d6b6bc17e808a14a8471396349197d8b"},"schema_version":"1.0"},"canonical_sha256":"d1c17731e1e38b7fe31dd0f4e1f509440309c26d6933498614622e3b43c55ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:45.520239Z","signature_b64":"bInOxCq4IXh3oWaNlGnNfyHwDS8bbAJXLisn5N0twPwFXVhab3zdMvaAMflSrTbTF1Zekdjj/HRDYNBNjQ8jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c17731e1e38b7fe31dd0f4e1f509440309c26d6933498614622e3b43c55ff2","last_reissued_at":"2026-05-18T02:48:45.519536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:45.519536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7372","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eUgrLMbAnG/i+arYyhoxIU8rxskdnnlsRqhK/Ti4FwzjqRu75+8ENrsVU5fmkmKBmIkbobYzzipcI5cTrX+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:18.787128Z"},"content_sha256":"042b882089ef6b546b6f1ce54751a95cfd61e9a93b5ac6e43fa434a065d54edf","schema_version":"1.0","event_id":"sha256:042b882089ef6b546b6f1ce54751a95cfd61e9a93b5ac6e43fa434a065d54edf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2HAXOMPB4OFX7YY52D2OD5IJIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the game domination number of graphs with given minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as","submitted_at":"2014-06-28T08:19:01Z","abstract_excerpt":"In the domination game, introduced by Bre\\v{s}ar, Klav\\v{z}ar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$. A move is legal if the selected vertex $v$ dominates at least one new vertex -- that is, if we have a $u\\in N[v]$ for which no vertex from $N[u]$ was chosen up to this point of the game. The game ends when no more legal moves can be made, and its length equals the number of vertices selected. The goal of Dominator is to minimize whilst that of Staller is to maximize the length of the game. The game domination number $\\gamma_g(G)$ of $G$ is the length"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7372","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VrjSNoVZj0wXd8oS+c92SpUM0L2M6d1xKsNqaMljmBLQyfE9dLCaKtnaoxAd3a3DvKvRnENXCwsDDt5CVziDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:18.787876Z"},"content_sha256":"4235e5f077bfadf3017591f5c58963a6fb0a914c7d3f63f549c4396c2be9015d","schema_version":"1.0","event_id":"sha256:4235e5f077bfadf3017591f5c58963a6fb0a914c7d3f63f549c4396c2be9015d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/bundle.json","state_url":"https://pith.science/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/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-11T15:53:18Z","links":{"resolver":"https://pith.science/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ","bundle":"https://pith.science/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/bundle.json","state":"https://pith.science/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HAXOMPB4OFX7YY52D2OD5IJIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2HAXOMPB4OFX7YY52D2OD5IJIQ","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":"4232ef073a509ddad597a593681a3d84d6b6bc17e808a14a8471396349197d8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T08:19:01Z","title_canon_sha256":"5c2026f77c891ffe0094fe4ac9f5084c008146d79f6b907a3d722f82b54dffea"},"schema_version":"1.0","source":{"id":"1406.7372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7372","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7372v1","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7372","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"2HAXOMPB4OFX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HAXOMPB4OFX7YY5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HAXOMPB","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4235e5f077bfadf3017591f5c58963a6fb0a914c7d3f63f549c4396c2be9015d","target":"graph","created_at":"2026-05-18T02:48:45Z","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":"In the domination game, introduced by Bre\\v{s}ar, Klav\\v{z}ar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$. A move is legal if the selected vertex $v$ dominates at least one new vertex -- that is, if we have a $u\\in N[v]$ for which no vertex from $N[u]$ was chosen up to this point of the game. The game ends when no more legal moves can be made, and its length equals the number of vertices selected. The goal of Dominator is to minimize whilst that of Staller is to maximize the length of the game. The game domination number $\\gamma_g(G)$ of $G$ is the length","authors_text":"Csilla Bujt\\'as","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T08:19:01Z","title":"On the game domination number of graphs with given minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7372","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:042b882089ef6b546b6f1ce54751a95cfd61e9a93b5ac6e43fa434a065d54edf","target":"record","created_at":"2026-05-18T02:48:45Z","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":"4232ef073a509ddad597a593681a3d84d6b6bc17e808a14a8471396349197d8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-28T08:19:01Z","title_canon_sha256":"5c2026f77c891ffe0094fe4ac9f5084c008146d79f6b907a3d722f82b54dffea"},"schema_version":"1.0","source":{"id":"1406.7372","kind":"arxiv","version":1}},"canonical_sha256":"d1c17731e1e38b7fe31dd0f4e1f509440309c26d6933498614622e3b43c55ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c17731e1e38b7fe31dd0f4e1f509440309c26d6933498614622e3b43c55ff2","first_computed_at":"2026-05-18T02:48:45.519536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:45.519536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bInOxCq4IXh3oWaNlGnNfyHwDS8bbAJXLisn5N0twPwFXVhab3zdMvaAMflSrTbTF1Zekdjj/HRDYNBNjQ8jAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:45.520239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:042b882089ef6b546b6f1ce54751a95cfd61e9a93b5ac6e43fa434a065d54edf","sha256:4235e5f077bfadf3017591f5c58963a6fb0a914c7d3f63f549c4396c2be9015d"],"state_sha256":"2cc048c1059f8a0a0fe557d41d3f22a3a59239f22de85d3cf77ca5635594f84b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UndHcvkMHIbhziSbRb0Nr+4AUMfHdPnAfXI68FXVqbYOnXXGFRB5ip5g40twc31Fp/UsijqN/DfaMrK/MVocCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:53:18.791744Z","bundle_sha256":"fa14fb3281919ec6b6c8d633132715f627ced9c7ea917a52280fff364f20f8be"}}