{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UJUYI3HM3SGSI44IGVH3UKKVKA","short_pith_number":"pith:UJUYI3HM","canonical_record":{"source":{"id":"1603.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T11:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"44ee60bd63622a8ae5b9338858d22e6b64e187d2c496a3999cef26a97b5ad213","abstract_canon_sha256":"edf3dca941cfd62c3201a5f627a03a2e38cae953b3fb2144f957a253c179b37c"},"schema_version":"1.0"},"canonical_sha256":"a269846cecdc8d247388354fba295550192f90e0bbee735e3826c256176d3696","source":{"kind":"arxiv","id":"1603.05429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05429","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05429v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05429","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"UJUYI3HM3SGS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJUYI3HM3SGSI44I","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJUYI3HM","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UJUYI3HM3SGSI44IGVH3UKKVKA","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T11:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"44ee60bd63622a8ae5b9338858d22e6b64e187d2c496a3999cef26a97b5ad213","abstract_canon_sha256":"edf3dca941cfd62c3201a5f627a03a2e38cae953b3fb2144f957a253c179b37c"},"schema_version":"1.0"},"canonical_sha256":"a269846cecdc8d247388354fba295550192f90e0bbee735e3826c256176d3696","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.368865Z","signature_b64":"Th3B/t40Ld6SMw8oUL4xHG+9hS/tHmgk8FnujQ/vCfZZNjRNCVr0chzqIQyHrPP3rfedigTXGCYgZBFWNS4MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a269846cecdc8d247388354fba295550192f90e0bbee735e3826c256176d3696","last_reissued_at":"2026-05-18T01:18:56.368479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.368479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05429","source_version":1,"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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTnCB3uAQE7N7Z0I+TpGFX5Cju8ZnKBVEbOXMoEfULmjmYpS6+MBq3/t3J6+jDeW5Y1AX234t/dDNetDO2qkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:52:34.706794Z"},"content_sha256":"89f57fcbab97ad9ea68c434302ae884fe539dca033c38122ec7144095fa33aab","schema_version":"1.0","event_id":"sha256:89f57fcbab97ad9ea68c434302ae884fe539dca033c38122ec7144095fa33aab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UJUYI3HM3SGSI44IGVH3UKKVKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Client-Waiter games on complete and random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Oren Dean","submitted_at":"2016-03-17T11:07:56Z","abstract_excerpt":"For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q+1 unclaimed edges of G from which Client claims one, and the rest are claimed by Waiter. The game ends when all the edges have been claimed. If Client's graph has property P by the end of the game, then he wins the game, otherwise Waiter is the winner. In this paper we study several Client-Waiter games on the edge set of the complete graph, and the H-game on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05429","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"},"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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0wjyM1w64SgT+Tkiz9V994ZyOukB8AHTAz14YxQ+mz0O8L452VXLcIv7o2nPqx+IgitMxlp4tWXftX5lM8iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:52:34.707403Z"},"content_sha256":"3a335386a8d298e2e30882dbed03d7da1a890e33cb37e5391254a15e72c50bc1","schema_version":"1.0","event_id":"sha256:3a335386a8d298e2e30882dbed03d7da1a890e33cb37e5391254a15e72c50bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/bundle.json","state_url":"https://pith.science/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/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-06-06T08:52:34Z","links":{"resolver":"https://pith.science/pith/UJUYI3HM3SGSI44IGVH3UKKVKA","bundle":"https://pith.science/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/bundle.json","state":"https://pith.science/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJUYI3HM3SGSI44IGVH3UKKVKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UJUYI3HM3SGSI44IGVH3UKKVKA","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":"edf3dca941cfd62c3201a5f627a03a2e38cae953b3fb2144f957a253c179b37c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T11:07:56Z","title_canon_sha256":"44ee60bd63622a8ae5b9338858d22e6b64e187d2c496a3999cef26a97b5ad213"},"schema_version":"1.0","source":{"id":"1603.05429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05429","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05429v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05429","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"UJUYI3HM3SGS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJUYI3HM3SGSI44I","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJUYI3HM","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:3a335386a8d298e2e30882dbed03d7da1a890e33cb37e5391254a15e72c50bc1","target":"graph","created_at":"2026-05-18T01:18:56Z","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":"For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q+1 unclaimed edges of G from which Client claims one, and the rest are claimed by Waiter. The game ends when all the edges have been claimed. If Client's graph has property P by the end of the game, then he wins the game, otherwise Waiter is the winner. In this paper we study several Client-Waiter games on the edge set of the complete graph, and the H-game on the","authors_text":"Michael Krivelevich, Oren Dean","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T11:07:56Z","title":"Client-Waiter games on complete and random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05429","kind":"arxiv","version":1},"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:89f57fcbab97ad9ea68c434302ae884fe539dca033c38122ec7144095fa33aab","target":"record","created_at":"2026-05-18T01:18:56Z","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":"edf3dca941cfd62c3201a5f627a03a2e38cae953b3fb2144f957a253c179b37c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T11:07:56Z","title_canon_sha256":"44ee60bd63622a8ae5b9338858d22e6b64e187d2c496a3999cef26a97b5ad213"},"schema_version":"1.0","source":{"id":"1603.05429","kind":"arxiv","version":1}},"canonical_sha256":"a269846cecdc8d247388354fba295550192f90e0bbee735e3826c256176d3696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a269846cecdc8d247388354fba295550192f90e0bbee735e3826c256176d3696","first_computed_at":"2026-05-18T01:18:56.368479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:56.368479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Th3B/t40Ld6SMw8oUL4xHG+9hS/tHmgk8FnujQ/vCfZZNjRNCVr0chzqIQyHrPP3rfedigTXGCYgZBFWNS4MAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:56.368865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89f57fcbab97ad9ea68c434302ae884fe539dca033c38122ec7144095fa33aab","sha256:3a335386a8d298e2e30882dbed03d7da1a890e33cb37e5391254a15e72c50bc1"],"state_sha256":"2456a130618fc6f1ad951db1107540c75d52c4c5589603f9664078d6cbe0307a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoTQhhYgcHTghGruUq7YIOs+MWTMAoecShFc1kUP3HltlTfiqqOwNo1TBu7hLVqqZB64OqtlQbags8ulLwE3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:52:34.710554Z","bundle_sha256":"8c1de2d1091856c076dda335a000de881b902c6e77d0b07320cb25fcfd42a878"}}