{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EJS4QO44QT52JRP3LS4K4IO5LZ","short_pith_number":"pith:EJS4QO44","canonical_record":{"source":{"id":"1709.09065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-26T14:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"e9727b65f1b59494ede547872d0fc88111e2d4c5579cdacd6d56caf934e0afda","abstract_canon_sha256":"d42bb3a8c6bd481d0181d196c6475f1f444f1e2a6f6a44ef1a0608d5d5dd9188"},"schema_version":"1.0"},"canonical_sha256":"2265c83b9c84fba4c5fb5cb8ae21dd5e6d58254618d2152dec02e72c74938924","source":{"kind":"arxiv","id":"1709.09065","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09065","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09065v3","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09065","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"EJS4QO44QT52","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJS4QO44QT52JRP3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJS4QO44","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EJS4QO44QT52JRP3LS4K4IO5LZ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-26T14:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"e9727b65f1b59494ede547872d0fc88111e2d4c5579cdacd6d56caf934e0afda","abstract_canon_sha256":"d42bb3a8c6bd481d0181d196c6475f1f444f1e2a6f6a44ef1a0608d5d5dd9188"},"schema_version":"1.0"},"canonical_sha256":"2265c83b9c84fba4c5fb5cb8ae21dd5e6d58254618d2152dec02e72c74938924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:09.773282Z","signature_b64":"VZaMApiKpBKq0FZHS6+I1QGvqnESi9qOucMFoR2AETf/Ey2e7iX5u4RgIT+ZHRR9gPL1BnpKpUf/mPCy0POMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2265c83b9c84fba4c5fb5cb8ae21dd5e6d58254618d2152dec02e72c74938924","last_reissued_at":"2026-05-17T23:55:09.772841Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:09.772841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09065","source_version":3,"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-17T23:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guP0A5Zexjj3ZRA9cquKxEpY73iOBxjXSJcUlwZGUInzQQTfffE0HD52Ps4EYFpxC6KCUlkZRyfZKh9qx7c8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:02:25.627031Z"},"content_sha256":"aa1e27703062f6eee08744256fc8fb3182f28c78bd1ecd4efea4a61a93b24481","schema_version":"1.0","event_id":"sha256:aa1e27703062f6eee08744256fc8fb3182f28c78bd1ecd4efea4a61a93b24481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EJS4QO44QT52JRP3LS4K4IO5LZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the separation conjecture in Avoider-Enforcer games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Ma{\\l}gorzata Bednarska-Bzd\\c{e}ga, Omri Ben-Eliezer, Tuan Tran","submitted_at":"2017-09-26T14:49:07Z","abstract_excerpt":"Given a fixed graph $H$ with at least two edges and positive integers $n$ and $b$, the strict $(1 \\colon b)$ Avoider-Enforcer $H$-game, played on the edge set of $K_n$, has the following rules: In each turn Avoider picks exactly one edge, and then Enforcer picks exactly $b$ edges. Avoider wins if and only if the subgraph containing her/his edges is $H$-free after all edges of $K_n$ are taken.\n  The lower threshold of a graph $H$ with respect to $n$ is the largest $b_0$ for which Enforcer has a winning strategy for the $(1\\colon b)$ $H$-game played on $K_n$ for any $b \\leq b_0$, and the upper t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09065","kind":"arxiv","version":3},"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-17T23:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL4mBFDapo7j9myZD701JUq5hdaFsVATL8k5hX3kUZiAuz6DT+VBMFb352V/cwxMJvSW+QjNq8yTxdv+Vt0sBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:02:25.627414Z"},"content_sha256":"8c6e8fd9b91b12b01e637762899c7d27b1bb6e78b3a987e526831f32eb2c4f60","schema_version":"1.0","event_id":"sha256:8c6e8fd9b91b12b01e637762899c7d27b1bb6e78b3a987e526831f32eb2c4f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/bundle.json","state_url":"https://pith.science/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/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-08T13:02:25Z","links":{"resolver":"https://pith.science/pith/EJS4QO44QT52JRP3LS4K4IO5LZ","bundle":"https://pith.science/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/bundle.json","state":"https://pith.science/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJS4QO44QT52JRP3LS4K4IO5LZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EJS4QO44QT52JRP3LS4K4IO5LZ","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":"d42bb3a8c6bd481d0181d196c6475f1f444f1e2a6f6a44ef1a0608d5d5dd9188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-26T14:49:07Z","title_canon_sha256":"e9727b65f1b59494ede547872d0fc88111e2d4c5579cdacd6d56caf934e0afda"},"schema_version":"1.0","source":{"id":"1709.09065","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09065","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09065v3","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09065","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"EJS4QO44QT52","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJS4QO44QT52JRP3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJS4QO44","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:8c6e8fd9b91b12b01e637762899c7d27b1bb6e78b3a987e526831f32eb2c4f60","target":"graph","created_at":"2026-05-17T23:55:09Z","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":"Given a fixed graph $H$ with at least two edges and positive integers $n$ and $b$, the strict $(1 \\colon b)$ Avoider-Enforcer $H$-game, played on the edge set of $K_n$, has the following rules: In each turn Avoider picks exactly one edge, and then Enforcer picks exactly $b$ edges. Avoider wins if and only if the subgraph containing her/his edges is $H$-free after all edges of $K_n$ are taken.\n  The lower threshold of a graph $H$ with respect to $n$ is the largest $b_0$ for which Enforcer has a winning strategy for the $(1\\colon b)$ $H$-game played on $K_n$ for any $b \\leq b_0$, and the upper t","authors_text":"Lior Gishboliner, Ma{\\l}gorzata Bednarska-Bzd\\c{e}ga, Omri Ben-Eliezer, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-26T14:49:07Z","title":"On the separation conjecture in Avoider-Enforcer games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09065","kind":"arxiv","version":3},"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:aa1e27703062f6eee08744256fc8fb3182f28c78bd1ecd4efea4a61a93b24481","target":"record","created_at":"2026-05-17T23:55:09Z","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":"d42bb3a8c6bd481d0181d196c6475f1f444f1e2a6f6a44ef1a0608d5d5dd9188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-26T14:49:07Z","title_canon_sha256":"e9727b65f1b59494ede547872d0fc88111e2d4c5579cdacd6d56caf934e0afda"},"schema_version":"1.0","source":{"id":"1709.09065","kind":"arxiv","version":3}},"canonical_sha256":"2265c83b9c84fba4c5fb5cb8ae21dd5e6d58254618d2152dec02e72c74938924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2265c83b9c84fba4c5fb5cb8ae21dd5e6d58254618d2152dec02e72c74938924","first_computed_at":"2026-05-17T23:55:09.772841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:09.772841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZaMApiKpBKq0FZHS6+I1QGvqnESi9qOucMFoR2AETf/Ey2e7iX5u4RgIT+ZHRR9gPL1BnpKpUf/mPCy0POMDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:09.773282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09065","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa1e27703062f6eee08744256fc8fb3182f28c78bd1ecd4efea4a61a93b24481","sha256:8c6e8fd9b91b12b01e637762899c7d27b1bb6e78b3a987e526831f32eb2c4f60"],"state_sha256":"f28123a795173681ccce203e974b242c67611840626d5d110470b1efab93772d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdY2+2sJKK07pqPbM+2h4omm4LZSTapHoUtARjS2xb8FVbthMUWgIKjAloiamQohMtnXMI5IOAyrgsbB1ezQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:02:25.629302Z","bundle_sha256":"5499fabbdbbfc06ddf1d46da05c231f01b8e052d65a81161f3b823372a58fd0e"}}