{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VNTWAJNCUQDLHHPPHDELS354GL","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":"e8016ec1bfca9a5490887947996ebfaf791e14dd1f9e34e98b6db292d4f6fd23","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-22T08:58:07Z","title_canon_sha256":"3f77abe685aca15890e37f3b9e3d7a6a7259c01c4fa44c63c498b017f3d7b542"},"schema_version":"1.0","source":{"id":"1610.07018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07018","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07018v1","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07018","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"VNTWAJNCUQDL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VNTWAJNCUQDLHHPP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VNTWAJNC","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:bddefd301fbb08557d2a0cceb3eaa408db42e8f8a8939f811da85f1719f4d614","target":"graph","created_at":"2026-05-18T01:01:30Z","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":"Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\\U have at most one neighbor in U. Let sigma(W) denote the unique smallest convex set that contains W subseteq V. Two players play the following game. Consider a convex set U and call it the `playground.' Initially, U = emptyset. When U=V, the player to move loses the game. Otherwise, that player chooses a vertex x in V\\U which is at distance at most two from U. The effect of the move is that the playground U changes into sigma(U cup {x}) and the opponent is presented with this new playgrou","authors_text":"Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-22T08:58:07Z","title":"P_3-Games on Chordal Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07018","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:3751dcd903e7f8b234c85e1eefee49fea63a3be75e890500e0c4433d51a704ed","target":"record","created_at":"2026-05-18T01:01:30Z","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":"e8016ec1bfca9a5490887947996ebfaf791e14dd1f9e34e98b6db292d4f6fd23","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-22T08:58:07Z","title_canon_sha256":"3f77abe685aca15890e37f3b9e3d7a6a7259c01c4fa44c63c498b017f3d7b542"},"schema_version":"1.0","source":{"id":"1610.07018","kind":"arxiv","version":1}},"canonical_sha256":"ab676025a2a406b39def38c8b96fbc32ede17c7f3d6ee1cb7485548c3dbdaaeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab676025a2a406b39def38c8b96fbc32ede17c7f3d6ee1cb7485548c3dbdaaeb","first_computed_at":"2026-05-18T01:01:30.661182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:30.661182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1whQOoNxPPkb4NLekd5/HKeneM1Tf8/Nl+Am5uVwCUjvniac/XYBqNLxvTLAmcssYlC6LnvT7x64Aw0BHfGBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:30.661672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3751dcd903e7f8b234c85e1eefee49fea63a3be75e890500e0c4433d51a704ed","sha256:bddefd301fbb08557d2a0cceb3eaa408db42e8f8a8939f811da85f1719f4d614"],"state_sha256":"a131bdeaeb9673874b28e2d82b61e51cacce908b99a15a4fd03503be380e6d6e"}