{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7ZZXJW6HCAJM6BCHZ7EWZZOXGU","short_pith_number":"pith:7ZZXJW6H","canonical_record":{"source":{"id":"1605.05443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T05:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"1461db522ca27c5d983160c8dbfe2bfd31a95c66c75a257096483b992f64ffab","abstract_canon_sha256":"cc54a479a8c6c5a3192cbeaef70dcf29d732a32e3a285979c6d7e096bf6dbae4"},"schema_version":"1.0"},"canonical_sha256":"fe7374dbc71012cf0447cfc96ce5d735314d2c5813b5518c7536ba790210f146","source":{"kind":"arxiv","id":"1605.05443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05443","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05443v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05443","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"7ZZXJW6HCAJM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZZXJW6HCAJM6BCH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZZXJW6H","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7ZZXJW6HCAJM6BCHZ7EWZZOXGU","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T05:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"1461db522ca27c5d983160c8dbfe2bfd31a95c66c75a257096483b992f64ffab","abstract_canon_sha256":"cc54a479a8c6c5a3192cbeaef70dcf29d732a32e3a285979c6d7e096bf6dbae4"},"schema_version":"1.0"},"canonical_sha256":"fe7374dbc71012cf0447cfc96ce5d735314d2c5813b5518c7536ba790210f146","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.455680Z","signature_b64":"0weRXS1YXvwjDQu9H84Xu/lQecRsTEiI0hg/AR4lF90SwYCevRTlLZnGZCegJ0kzqNPK/J3QkdaD+k2b+thaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7374dbc71012cf0447cfc96ce5d735314d2c5813b5518c7536ba790210f146","last_reissued_at":"2026-05-18T01:13:39.454977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.454977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05443","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4ppBXDXIiJnEULVE4wxw9obS0MfHtfdt+lNRjmRAQuPyaUrbE0k/jWZcEEWYLCZs+72/LBWCUoU1agbbV+NCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:04:25.629309Z"},"content_sha256":"090b3daceff4fe061b1b001c552c07fe4ad0da9c0cdf50c0bb86f31d3aaf3499","schema_version":"1.0","event_id":"sha256:090b3daceff4fe061b1b001c552c07fe4ad0da9c0cdf50c0bb86f31d3aaf3499"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7ZZXJW6HCAJM6BCHZ7EWZZOXGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Ramsey Games: Drawing on an infinite board","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Amir Sarid, Christopher Kusch, Cl\\'ement Requil\\'e, Dan Hefetz, Lothar Narins","submitted_at":"2016-05-18T05:38:54Z","abstract_excerpt":"We consider the strong Ramsey-type game $\\mathcal{R}^{(k)}(\\mathcal{H}, \\aleph_0)$, played on the edge set of the infinite complete $k$-uniform hypergraph $K^k_{\\mathbb{N}}$. Two players, called FP (the first player) and SP (the second player), take turns claiming edges of $K^k_{\\mathbb{N}}$ with the goal of building a copy of some finite predetermined $k$-uniform hypergraph $\\mathcal{H}$. The first player to build a copy of $\\mathcal{H}$ wins. If no player has a strategy to ensure his win in finitely many moves, then the game is declared a draw.\n  In this paper, we construct a $5$-uniform hyp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05443","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYNjhctj7/LY0BthvlA3WNJWA1ftlh9U/r0PS/u3MDxGKyFPirw13T1DUwSnOtbvenY5FXaf2rM5FVM6glITAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:04:25.629915Z"},"content_sha256":"3f2f1dfb5b7f35758036c0462e454f3f3729462a79bdbc8934e28aa987d48590","schema_version":"1.0","event_id":"sha256:3f2f1dfb5b7f35758036c0462e454f3f3729462a79bdbc8934e28aa987d48590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/bundle.json","state_url":"https://pith.science/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/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-30T16:04:25Z","links":{"resolver":"https://pith.science/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU","bundle":"https://pith.science/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/bundle.json","state":"https://pith.science/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZZXJW6HCAJM6BCHZ7EWZZOXGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7ZZXJW6HCAJM6BCHZ7EWZZOXGU","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":"cc54a479a8c6c5a3192cbeaef70dcf29d732a32e3a285979c6d7e096bf6dbae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T05:38:54Z","title_canon_sha256":"1461db522ca27c5d983160c8dbfe2bfd31a95c66c75a257096483b992f64ffab"},"schema_version":"1.0","source":{"id":"1605.05443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05443","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05443v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05443","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"7ZZXJW6HCAJM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZZXJW6HCAJM6BCH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZZXJW6H","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:3f2f1dfb5b7f35758036c0462e454f3f3729462a79bdbc8934e28aa987d48590","target":"graph","created_at":"2026-05-18T01:13: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":"We consider the strong Ramsey-type game $\\mathcal{R}^{(k)}(\\mathcal{H}, \\aleph_0)$, played on the edge set of the infinite complete $k$-uniform hypergraph $K^k_{\\mathbb{N}}$. Two players, called FP (the first player) and SP (the second player), take turns claiming edges of $K^k_{\\mathbb{N}}$ with the goal of building a copy of some finite predetermined $k$-uniform hypergraph $\\mathcal{H}$. The first player to build a copy of $\\mathcal{H}$ wins. If no player has a strategy to ensure his win in finitely many moves, then the game is declared a draw.\n  In this paper, we construct a $5$-uniform hyp","authors_text":"Alexey Pokrovskiy, Amir Sarid, Christopher Kusch, Cl\\'ement Requil\\'e, Dan Hefetz, Lothar Narins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T05:38:54Z","title":"Strong Ramsey Games: Drawing on an infinite board"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05443","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:090b3daceff4fe061b1b001c552c07fe4ad0da9c0cdf50c0bb86f31d3aaf3499","target":"record","created_at":"2026-05-18T01:13: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":"cc54a479a8c6c5a3192cbeaef70dcf29d732a32e3a285979c6d7e096bf6dbae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T05:38:54Z","title_canon_sha256":"1461db522ca27c5d983160c8dbfe2bfd31a95c66c75a257096483b992f64ffab"},"schema_version":"1.0","source":{"id":"1605.05443","kind":"arxiv","version":2}},"canonical_sha256":"fe7374dbc71012cf0447cfc96ce5d735314d2c5813b5518c7536ba790210f146","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe7374dbc71012cf0447cfc96ce5d735314d2c5813b5518c7536ba790210f146","first_computed_at":"2026-05-18T01:13:39.454977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.454977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0weRXS1YXvwjDQu9H84Xu/lQecRsTEiI0hg/AR4lF90SwYCevRTlLZnGZCegJ0kzqNPK/J3QkdaD+k2b+thaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.455680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:090b3daceff4fe061b1b001c552c07fe4ad0da9c0cdf50c0bb86f31d3aaf3499","sha256:3f2f1dfb5b7f35758036c0462e454f3f3729462a79bdbc8934e28aa987d48590"],"state_sha256":"08fa12a8c875a78e790382514c1cff207355bbca3d6fe63875330a8b879161a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekx9INAEdvPCWvFHYyRZDJFcIqaGk5qzY/j9+lQknXXAM3eNNHqMq1A5950sJfGPSYA7yqUiBgO2HV3+IkU1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:04:25.633687Z","bundle_sha256":"bc8c66ea6da241545b1e92fa2cbab49b83406596f2403090cf950f7b76d8ee4e"}}