{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A2MJG64CX2C46PMYPUMQOFLEEK","short_pith_number":"pith:A2MJG64C","schema_version":"1.0","canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","source":{"kind":"arxiv","id":"1509.05356","version":2},"attestation_state":"computed","paper":{"title":"Waiter-Client and Client-Waiter Hamiltonicity games on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Michael Krivelevich, Wei En Tan","submitted_at":"2015-09-17T18:19:32Z","abstract_excerpt":"We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph ${\\mathcal G}(n,p)$. In each round of the $(1 : q)$ Waiter-Client Hamiltonicity game, the first player, called Waiter, offers the second player, called Client, $q+1$ edges of ${\\mathcal G}(n,p)$ which have not been offered previously. Client then chooses one of these edges, which he claims, and the remaining $q$ edges go back to Waiter. Waiter wins this game if by the time every edge of ${\\mathcal G}(n,p)$ has been claimed by some player, the graph consisting of"},"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":"1509.05356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T18:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"98d6c57c48a4704524df8a96a3c9458ff29d73edcc0011a84b34d63678b68932","abstract_canon_sha256":"eab18ade2f2bd1a872c725736a26f13527644f0f3bc52b869f65a7ecc536b345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.556867Z","signature_b64":"mdfrdf2omqiDpw8b/wJfZPHaklWi7cNTTjV8RdtveOMUlzjyl0Nq0G0DuoSjToLEEtp6AafsghljZi0jwUGKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","last_reissued_at":"2026-05-18T00:50:40.556104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.556104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Waiter-Client and Client-Waiter Hamiltonicity games on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Michael Krivelevich, Wei En Tan","submitted_at":"2015-09-17T18:19:32Z","abstract_excerpt":"We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph ${\\mathcal G}(n,p)$. In each round of the $(1 : q)$ Waiter-Client Hamiltonicity game, the first player, called Waiter, offers the second player, called Client, $q+1$ edges of ${\\mathcal G}(n,p)$ which have not been offered previously. Client then chooses one of these edges, which he claims, and the remaining $q$ edges go back to Waiter. Waiter wins this game if by the time every edge of ${\\mathcal G}(n,p)$ has been claimed by some player, the graph consisting of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05356","kind":"arxiv","version":2},"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":"1509.05356","created_at":"2026-05-18T00:50:40.556213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05356v2","created_at":"2026-05-18T00:50:40.556213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05356","created_at":"2026-05-18T00:50:40.556213+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2MJG64CX2C4","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2MJG64CX2C46PMY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2MJG64C","created_at":"2026-05-18T12:29:10.953037+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/A2MJG64CX2C46PMYPUMQOFLEEK","json":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK.json","graph_json":"https://pith.science/api/pith-number/A2MJG64CX2C46PMYPUMQOFLEEK/graph.json","events_json":"https://pith.science/api/pith-number/A2MJG64CX2C46PMYPUMQOFLEEK/events.json","paper":"https://pith.science/paper/A2MJG64C"},"agent_actions":{"view_html":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK","download_json":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK.json","view_paper":"https://pith.science/paper/A2MJG64C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05356&json=true","fetch_graph":"https://pith.science/api/pith-number/A2MJG64CX2C46PMYPUMQOFLEEK/graph.json","fetch_events":"https://pith.science/api/pith-number/A2MJG64CX2C46PMYPUMQOFLEEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/action/storage_attestation","attest_author":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/action/author_attestation","sign_citation":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/action/citation_signature","submit_replication":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/action/replication_record"}},"created_at":"2026-05-18T00:50:40.556213+00:00","updated_at":"2026-05-18T00:50:40.556213+00:00"}