{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VNTWAJNCUQDLHHPPHDELS354GL","short_pith_number":"pith:VNTWAJNC","schema_version":"1.0","canonical_sha256":"ab676025a2a406b39def38c8b96fbc32ede17c7f3d6ee1cb7485548c3dbdaaeb","source":{"kind":"arxiv","id":"1610.07018","version":1},"attestation_state":"computed","paper":{"title":"P_3-Games on Chordal Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2016-10-22T08:58:07Z","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"},"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":"1610.07018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-22T08:58:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3f77abe685aca15890e37f3b9e3d7a6a7259c01c4fa44c63c498b017f3d7b542","abstract_canon_sha256":"e8016ec1bfca9a5490887947996ebfaf791e14dd1f9e34e98b6db292d4f6fd23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.661672Z","signature_b64":"1whQOoNxPPkb4NLekd5/HKeneM1Tf8/Nl+Am5uVwCUjvniac/XYBqNLxvTLAmcssYlC6LnvT7x64Aw0BHfGBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab676025a2a406b39def38c8b96fbc32ede17c7f3d6ee1cb7485548c3dbdaaeb","last_reissued_at":"2026-05-18T01:01:30.661182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.661182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"P_3-Games on Chordal Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2016-10-22T08:58:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07018","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.07018","created_at":"2026-05-18T01:01:30.661240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07018v1","created_at":"2026-05-18T01:01:30.661240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07018","created_at":"2026-05-18T01:01:30.661240+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNTWAJNCUQDL","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNTWAJNCUQDLHHPP","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNTWAJNC","created_at":"2026-05-18T12:30:48.956258+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/VNTWAJNCUQDLHHPPHDELS354GL","json":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL.json","graph_json":"https://pith.science/api/pith-number/VNTWAJNCUQDLHHPPHDELS354GL/graph.json","events_json":"https://pith.science/api/pith-number/VNTWAJNCUQDLHHPPHDELS354GL/events.json","paper":"https://pith.science/paper/VNTWAJNC"},"agent_actions":{"view_html":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL","download_json":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL.json","view_paper":"https://pith.science/paper/VNTWAJNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07018&json=true","fetch_graph":"https://pith.science/api/pith-number/VNTWAJNCUQDLHHPPHDELS354GL/graph.json","fetch_events":"https://pith.science/api/pith-number/VNTWAJNCUQDLHHPPHDELS354GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL/action/storage_attestation","attest_author":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL/action/author_attestation","sign_citation":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL/action/citation_signature","submit_replication":"https://pith.science/pith/VNTWAJNCUQDLHHPPHDELS354GL/action/replication_record"}},"created_at":"2026-05-18T01:01:30.661240+00:00","updated_at":"2026-05-18T01:01:30.661240+00:00"}