{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YHIR2BFBZVALXFXQB3PWQP56BC","short_pith_number":"pith:YHIR2BFB","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"},"canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","source":{"kind":"arxiv","id":"1510.05852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05852","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05852v1","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05852","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"YHIR2BFBZVAL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHIR2BFBZVALXFXQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHIR2BFB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YHIR2BFBZVALXFXQB3PWQP56BC","target":"record","payload":{"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"},"canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","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"},"source_kind":"arxiv","source_id":"1510.05852","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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9cHyVne6BjY3on8iLjdOUK9Vfr56pE9DoHgNnj3O/SoDqlYWO5AV9IvntV7S6OgTC7F1q8caM/HwWpxebEUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:37:43.422230Z"},"content_sha256":"d65cc318a2067c827077f6d329d2588366015f8e98c3da1f27c9f3ad609595b1","schema_version":"1.0","event_id":"sha256:d65cc318a2067c827077f6d329d2588366015f8e98c3da1f27c9f3ad609595b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YHIR2BFBZVALXFXQB3PWQP56BC","target":"graph","payload":{"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"},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSIQ1B7vyuaQVgiIJ0I4mXESKe29MpgCg+PiDM6Gij6tD5WJolbLsuqPgCLC+tX949+z7K6+QvUdg597SI1hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:37:43.422864Z"},"content_sha256":"f8b0b024cfaacdce3c1c18b80f66bc89a53aca2a7afa49d1e0cc684a5da38185","schema_version":"1.0","event_id":"sha256:f8b0b024cfaacdce3c1c18b80f66bc89a53aca2a7afa49d1e0cc684a5da38185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/bundle.json","state_url":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHIR2BFBZVALXFXQB3PWQP56BC/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-07T10:37:43Z","links":{"resolver":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC","bundle":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/bundle.json","state":"https://pith.science/pith/YHIR2BFBZVALXFXQB3PWQP56BC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHIR2BFBZVALXFXQB3PWQP56BC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YHIR2BFBZVALXFXQB3PWQP56BC","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":"64044715350a11d533685e859d6c64fe580f6e5259ea17ee76f02f49f8887383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-20T12:13:29Z","title_canon_sha256":"d926bcce38c280d0ac12ba89abecdccf69f3cacbaa157fb2fac57aa939f56cac"},"schema_version":"1.0","source":{"id":"1510.05852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05852","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05852v1","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05852","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"YHIR2BFBZVAL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHIR2BFBZVALXFXQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHIR2BFB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:f8b0b024cfaacdce3c1c18b80f66bc89a53aca2a7afa49d1e0cc684a5da38185","target":"graph","created_at":"2026-05-18T01:29:39Z","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":"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","authors_text":"Codru\\u{t} Grosu, Lothar Narins, Sylwia Antoniuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-20T12:13:29Z","title":"On the connectivity Waiter-Client game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05852","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:d65cc318a2067c827077f6d329d2588366015f8e98c3da1f27c9f3ad609595b1","target":"record","created_at":"2026-05-18T01:29:39Z","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":"64044715350a11d533685e859d6c64fe580f6e5259ea17ee76f02f49f8887383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-20T12:13:29Z","title_canon_sha256":"d926bcce38c280d0ac12ba89abecdccf69f3cacbaa157fb2fac57aa939f56cac"},"schema_version":"1.0","source":{"id":"1510.05852","kind":"arxiv","version":1}},"canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1d11d04a1cd40bb96f00edf683fbe088f96234ec9b3d5ec0a9d5b1f1e777df0","first_computed_at":"2026-05-18T01:29:39.532796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:39.532796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+9V2afs1QVkwMJVr+kNWwRfuYOXO36VJIfgViPyRiyBNkBKJysUIK0C1bA6/u8c+famTOtq/1QXSK7tOShscDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:39.533395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d65cc318a2067c827077f6d329d2588366015f8e98c3da1f27c9f3ad609595b1","sha256:f8b0b024cfaacdce3c1c18b80f66bc89a53aca2a7afa49d1e0cc684a5da38185"],"state_sha256":"8335f134ae7a094c4527b97a6f9530d22b050bc346c3344aa9ea990d307ebf0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99OrXlOwb8sEmLgZqkeofV0foqKea8rqeBqmz/w7IIkXLY2z5JjGlqTjMikwGGJaMcyDCgrgppeWVQ2HwcXQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:37:43.426141Z","bundle_sha256":"abb3a1677d26cd4220cda9c4b67426339d9cdb201b8d5b03d944860733396b8a"}}