{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A2MJG64CX2C46PMYPUMQOFLEEK","short_pith_number":"pith:A2MJG64C","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"},"canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","source":{"kind":"arxiv","id":"1509.05356","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05356","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05356v2","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05356","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"A2MJG64CX2C4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A2MJG64CX2C46PMY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A2MJG64C","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A2MJG64CX2C46PMYPUMQOFLEEK","target":"record","payload":{"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"},"canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","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"},"source_kind":"arxiv","source_id":"1509.05356","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3yYc2EPQuCm4sToCF9OK+cJU0EpW+VvGxAzVogCzgvFURyMoLw2C0VUN16vq7rQ5TwNxKOgUnz7g9owo2WlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:56.650352Z"},"content_sha256":"6ee442d46c643807549a7b9f8f6cfc8c4320a057108169f10642d553e9f8083f","schema_version":"1.0","event_id":"sha256:6ee442d46c643807549a7b9f8f6cfc8c4320a057108169f10642d553e9f8083f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A2MJG64CX2C46PMYPUMQOFLEEK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gd9L7Urb6n4A1hBfrLDvs6msHzQFPXPa4x5E61yj8qw6wNNVEybyf3twjNnmL13Qga2Y6ZDM2cM9PvM22ZkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:56.651057Z"},"content_sha256":"95d5563878d82a0ab29b675a790c7e71ae63ed4692c37c38cd9c4b0bf075d339","schema_version":"1.0","event_id":"sha256:95d5563878d82a0ab29b675a790c7e71ae63ed4692c37c38cd9c4b0bf075d339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/bundle.json","state_url":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2MJG64CX2C46PMYPUMQOFLEEK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T20:57:56Z","links":{"resolver":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK","bundle":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/bundle.json","state":"https://pith.science/pith/A2MJG64CX2C46PMYPUMQOFLEEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2MJG64CX2C46PMYPUMQOFLEEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A2MJG64CX2C46PMYPUMQOFLEEK","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":"eab18ade2f2bd1a872c725736a26f13527644f0f3bc52b869f65a7ecc536b345","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T18:19:32Z","title_canon_sha256":"98d6c57c48a4704524df8a96a3c9458ff29d73edcc0011a84b34d63678b68932"},"schema_version":"1.0","source":{"id":"1509.05356","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05356","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05356v2","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05356","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"A2MJG64CX2C4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A2MJG64CX2C46PMY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A2MJG64C","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:95d5563878d82a0ab29b675a790c7e71ae63ed4692c37c38cd9c4b0bf075d339","target":"graph","created_at":"2026-05-18T00:50:40Z","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":"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","authors_text":"Dan Hefetz, Michael Krivelevich, Wei En Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T18:19:32Z","title":"Waiter-Client and Client-Waiter Hamiltonicity games on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05356","kind":"arxiv","version":2},"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:6ee442d46c643807549a7b9f8f6cfc8c4320a057108169f10642d553e9f8083f","target":"record","created_at":"2026-05-18T00:50:40Z","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":"eab18ade2f2bd1a872c725736a26f13527644f0f3bc52b869f65a7ecc536b345","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T18:19:32Z","title_canon_sha256":"98d6c57c48a4704524df8a96a3c9458ff29d73edcc0011a84b34d63678b68932"},"schema_version":"1.0","source":{"id":"1509.05356","kind":"arxiv","version":2}},"canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0698937b82be85cf3d987d1907156422a8848664bd4fa0589385e1cf360b49a3","first_computed_at":"2026-05-18T00:50:40.556104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:40.556104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdfrdf2omqiDpw8b/wJfZPHaklWi7cNTTjV8RdtveOMUlzjyl0Nq0G0DuoSjToLEEtp6AafsghljZi0jwUGKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:40.556867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05356","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee442d46c643807549a7b9f8f6cfc8c4320a057108169f10642d553e9f8083f","sha256:95d5563878d82a0ab29b675a790c7e71ae63ed4692c37c38cd9c4b0bf075d339"],"state_sha256":"4858cc796e1fe24d32db2b89bb430816759833a2376d1ffbfa0b502bd29d8d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qGSOYu7Lm/JEdwUr3lv1YOeHG9Ebct4WVLTpKqKPzuRxL6f+MtNRGpSUDodI45TdYaapsRfSRZiYLf8y/vYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:57:56.654446Z","bundle_sha256":"f3a8fef7e0e3bdc6669906639c72829b015164588616db713c40ecccedb6fa0a"}}