{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SBR6LTPNZLU3QON4AMGJQDD5SC","short_pith_number":"pith:SBR6LTPN","schema_version":"1.0","canonical_sha256":"9063e5cdedcae9b839bc030c980c7d909b26043799f81ce9e96547944da7c58f","source":{"kind":"arxiv","id":"1607.02258","version":1},"attestation_state":"computed","paper":{"title":"Waiter-Client and Client-Waiter colourability games on a $k$-uniform hypergraph and the $k$-SAT game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei En Tan","submitted_at":"2016-07-08T07:29:25Z","abstract_excerpt":"Waiter-Client and Client-Waiter games are two-player, perfect information games, with no chance moves, played on a finite set (board) with special subsets known as the winning sets. Each round of the biased $(1:q)$ game begins with Waiter offering $q+1$ previously unclaimed elements of the board to Client, who claims one. The $q$ elements remaining are then claimed by Waiter. If Client fully claims a winning set by the time all board elements have been offered, he wins in the Client-Waiter game and loses in the Waiter-Client game. We give an estimate for the threshold bias of the $(1:q)$ Waite"},"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":"1607.02258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-08T07:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"774cfea06a795b407d95825ff7ea76a27f50916b1067d45e1c732f8ed7faaaee","abstract_canon_sha256":"1a7020a3c901022feda3794819106045a5ed5b809ba734f888156a64ea915423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.798631Z","signature_b64":"OTY8IXYi8MRZHmhtx4yaKIr/nBYqLeKoxu8RHDLGkugc9xry3pEb5U2WiTn7lEe9JVmjnoMUPdXeNjCZhcrvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9063e5cdedcae9b839bc030c980c7d909b26043799f81ce9e96547944da7c58f","last_reissued_at":"2026-05-18T01:11:20.797981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.797981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Waiter-Client and Client-Waiter colourability games on a $k$-uniform hypergraph and the $k$-SAT game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei En Tan","submitted_at":"2016-07-08T07:29:25Z","abstract_excerpt":"Waiter-Client and Client-Waiter games are two-player, perfect information games, with no chance moves, played on a finite set (board) with special subsets known as the winning sets. Each round of the biased $(1:q)$ game begins with Waiter offering $q+1$ previously unclaimed elements of the board to Client, who claims one. The $q$ elements remaining are then claimed by Waiter. If Client fully claims a winning set by the time all board elements have been offered, he wins in the Client-Waiter game and loses in the Waiter-Client game. We give an estimate for the threshold bias of the $(1:q)$ Waite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02258","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":"1607.02258","created_at":"2026-05-18T01:11:20.798082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02258v1","created_at":"2026-05-18T01:11:20.798082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02258","created_at":"2026-05-18T01:11:20.798082+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBR6LTPNZLU3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBR6LTPNZLU3QON4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBR6LTPN","created_at":"2026-05-18T12:30:44.179134+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/SBR6LTPNZLU3QON4AMGJQDD5SC","json":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC.json","graph_json":"https://pith.science/api/pith-number/SBR6LTPNZLU3QON4AMGJQDD5SC/graph.json","events_json":"https://pith.science/api/pith-number/SBR6LTPNZLU3QON4AMGJQDD5SC/events.json","paper":"https://pith.science/paper/SBR6LTPN"},"agent_actions":{"view_html":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC","download_json":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC.json","view_paper":"https://pith.science/paper/SBR6LTPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02258&json=true","fetch_graph":"https://pith.science/api/pith-number/SBR6LTPNZLU3QON4AMGJQDD5SC/graph.json","fetch_events":"https://pith.science/api/pith-number/SBR6LTPNZLU3QON4AMGJQDD5SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC/action/storage_attestation","attest_author":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC/action/author_attestation","sign_citation":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC/action/citation_signature","submit_replication":"https://pith.science/pith/SBR6LTPNZLU3QON4AMGJQDD5SC/action/replication_record"}},"created_at":"2026-05-18T01:11:20.798082+00:00","updated_at":"2026-05-18T01:11:20.798082+00:00"}