{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YHIR2BFBZVALXFXQB3PWQP56BC","short_pith_number":"pith:YHIR2BFB","schema_version":"1.0","canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","source":{"kind":"arxiv","id":"1510.05852","version":1},"attestation_state":"computed","paper":{"title":"On the connectivity Waiter-Client game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Codru\\u{t} Grosu, Lothar Narins, Sylwia Antoniuk","submitted_at":"2015-10-20T12:13:29Z","abstract_excerpt":"In this short note we consider a variation of the connectivity Waiter-Client game $WC(n,q,\\mathcal{A})$ played on an $n$-vertex graph $G$ which consists of $q+1$ disjoint spanning trees. In this game in each round Waiter offers Client $q+1$ edges of $G$ which have not yet been offered. Client chooses one edge and the remaining $q$ edges are discarded. The aim of Waiter is to force Client to build a connected graph. If this happens Waiter wins. Otherwise Client is the winner. We consider the case where $2 < q+1 < \\lfloor \\frac{n-1}{2}\\rfloor$ and show that for each such $q$ there exists a graph"},"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":"1510.05852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-20T12:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"d926bcce38c280d0ac12ba89abecdccf69f3cacbaa157fb2fac57aa939f56cac","abstract_canon_sha256":"64044715350a11d533685e859d6c64fe580f6e5259ea17ee76f02f49f8887383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:39.533395Z","signature_b64":"+9V2afs1QVkwMJVr+kNWwRfuYOXO36VJIfgViPyRiyBNkBKJysUIK0C1bA6/u8c+famTOtq/1QXSK7tOShscDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","last_reissued_at":"2026-05-18T01:29:39.532796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:39.532796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the connectivity Waiter-Client game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Codru\\u{t} Grosu, Lothar Narins, Sylwia Antoniuk","submitted_at":"2015-10-20T12:13:29Z","abstract_excerpt":"In this short note we consider a variation of the connectivity Waiter-Client game $WC(n,q,\\mathcal{A})$ played on an $n$-vertex graph $G$ which consists of $q+1$ disjoint spanning trees. In this game in each round Waiter offers Client $q+1$ edges of $G$ which have not yet been offered. Client chooses one edge and the remaining $q$ edges are discarded. The aim of Waiter is to force Client to build a connected graph. If this happens Waiter wins. Otherwise Client is the winner. We consider the case where $2 < q+1 < \\lfloor \\frac{n-1}{2}\\rfloor$ and show that for each such $q$ there exists a graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05852","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":"1510.05852","created_at":"2026-05-18T01:29:39.532901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05852v1","created_at":"2026-05-18T01:29:39.532901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05852","created_at":"2026-05-18T01:29:39.532901+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHIR2BFBZVAL","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHIR2BFBZVALXFXQ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHIR2BFB","created_at":"2026-05-18T12:29:50.041715+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/YHIR2BFBZVALXFXQB3PWQP56BC","json":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC.json","graph_json":"https://pith.science/api/pith-number/YHIR2BFBZVALXFXQB3PWQP56BC/graph.json","events_json":"https://pith.science/api/pith-number/YHIR2BFBZVALXFXQB3PWQP56BC/events.json","paper":"https://pith.science/paper/YHIR2BFB"},"agent_actions":{"view_html":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC","download_json":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC.json","view_paper":"https://pith.science/paper/YHIR2BFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05852&json=true","fetch_graph":"https://pith.science/api/pith-number/YHIR2BFBZVALXFXQB3PWQP56BC/graph.json","fetch_events":"https://pith.science/api/pith-number/YHIR2BFBZVALXFXQB3PWQP56BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/action/storage_attestation","attest_author":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/action/author_attestation","sign_citation":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/action/citation_signature","submit_replication":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/action/replication_record"}},"created_at":"2026-05-18T01:29:39.532901+00:00","updated_at":"2026-05-18T01:29:39.532901+00:00"}