{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:R5WHLNRF25Z7JMIHANZIZKPTSU","short_pith_number":"pith:R5WHLNRF","canonical_record":{"source":{"id":"0806.0280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-02T14:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"a24edcb9727773e8537316e49b03d5c0071131a73685a19dd9ecfc51e7fb3f09","abstract_canon_sha256":"babbe2a0fed5324610eee3349344933a3f81c7c7254e3010894e13ee26d7a93c"},"schema_version":"1.0"},"canonical_sha256":"8f6c75b625d773f4b10703728ca9f39536288e5e73713bdfebff9497711cccd1","source":{"kind":"arxiv","id":"0806.0280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0280","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0280v1","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0280","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"R5WHLNRF25Z7","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_16","alias_value":"R5WHLNRF25Z7JMIH","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_8","alias_value":"R5WHLNRF","created_at":"2026-07-04T15:11:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:R5WHLNRF25Z7JMIHANZIZKPTSU","target":"record","payload":{"canonical_record":{"source":{"id":"0806.0280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-02T14:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"a24edcb9727773e8537316e49b03d5c0071131a73685a19dd9ecfc51e7fb3f09","abstract_canon_sha256":"babbe2a0fed5324610eee3349344933a3f81c7c7254e3010894e13ee26d7a93c"},"schema_version":"1.0"},"canonical_sha256":"8f6c75b625d773f4b10703728ca9f39536288e5e73713bdfebff9497711cccd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:56.997611Z","signature_b64":"Oa9TQeIwqst76Cy/mY+N0Auc6Baz1i9NN6l1UkT5nSxJB2nhIhKYnVxJn0oayMX/AblFzNIfERTeG9OvM0njBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f6c75b625d773f4b10703728ca9f39536288e5e73713bdfebff9497711cccd1","last_reissued_at":"2026-07-04T15:11:56.997212Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:56.997212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.0280","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-07-04T15:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA1AlnalqtwjnO7e3DUQhgy7BpNROu6V6HZJ9tiMKyeQYWuiP5iMXBwsLVTdaQkAdbm4pQsfytVZxc549oiQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:51:50.444794Z"},"content_sha256":"f666289ced05b493d8229b60ce6ec5dd95e26a8acfce2ab51841d94a0c798e13","schema_version":"1.0","event_id":"sha256:f666289ced05b493d8229b60ce6ec5dd95e26a8acfce2ab51841d94a0c798e13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:R5WHLNRF25Z7JMIHANZIZKPTSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast winning strategies in Avoider-Enforcer games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Michael Krivelevich, Milo\\v{s} Stojakovi\\'c, Tibor Szab\\'o","submitted_at":"2008-06-02T14:11:54Z","abstract_excerpt":"In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\\em who} wins but rather {\\em how fast} can one win. These type of problems were studied earlier for Maker-Breaker games; here we initiate their study for unbiased Avoider-Enforcer games played on the edge set of the complete graph $K_n$ on $n$ vertices. For several games that are known to be an Enforcer's win, we estimate quite precisely the minimum number of moves Enforcer has to play in order to win. We consider the non-planarity game, the connectivity gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0280","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0806.0280/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Svf9ElUjmZmSlj21dskYM0Aa0wmJwwPG8HZQeN0k27ya2jtR/47okIALqWdWLo9mV8ncFHrvt0OGOln8SUNPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:51:50.445286Z"},"content_sha256":"e816a587ab6b25cada08871b3fc01a8fc288d8f66a5f91b834601680c542d711","schema_version":"1.0","event_id":"sha256:e816a587ab6b25cada08871b3fc01a8fc288d8f66a5f91b834601680c542d711"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/bundle.json","state_url":"https://pith.science/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/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-08-18T06:51:50Z","links":{"resolver":"https://pith.science/pith/R5WHLNRF25Z7JMIHANZIZKPTSU","bundle":"https://pith.science/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/bundle.json","state":"https://pith.science/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5WHLNRF25Z7JMIHANZIZKPTSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:R5WHLNRF25Z7JMIHANZIZKPTSU","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":"babbe2a0fed5324610eee3349344933a3f81c7c7254e3010894e13ee26d7a93c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-02T14:11:54Z","title_canon_sha256":"a24edcb9727773e8537316e49b03d5c0071131a73685a19dd9ecfc51e7fb3f09"},"schema_version":"1.0","source":{"id":"0806.0280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0280","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0280v1","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0280","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"R5WHLNRF25Z7","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_16","alias_value":"R5WHLNRF25Z7JMIH","created_at":"2026-07-04T15:11:56Z"},{"alias_kind":"pith_short_8","alias_value":"R5WHLNRF","created_at":"2026-07-04T15:11:56Z"}],"graph_snapshots":[{"event_id":"sha256:e816a587ab6b25cada08871b3fc01a8fc288d8f66a5f91b834601680c542d711","target":"graph","created_at":"2026-07-04T15:11: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0806.0280/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\\em who} wins but rather {\\em how fast} can one win. These type of problems were studied earlier for Maker-Breaker games; here we initiate their study for unbiased Avoider-Enforcer games played on the edge set of the complete graph $K_n$ on $n$ vertices. For several games that are known to be an Enforcer's win, we estimate quite precisely the minimum number of moves Enforcer has to play in order to win. We consider the non-planarity game, the connectivity gam","authors_text":"Dan Hefetz, Michael Krivelevich, Milo\\v{s} Stojakovi\\'c, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-02T14:11:54Z","title":"Fast winning strategies in Avoider-Enforcer games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0280","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:f666289ced05b493d8229b60ce6ec5dd95e26a8acfce2ab51841d94a0c798e13","target":"record","created_at":"2026-07-04T15:11: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":"babbe2a0fed5324610eee3349344933a3f81c7c7254e3010894e13ee26d7a93c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-02T14:11:54Z","title_canon_sha256":"a24edcb9727773e8537316e49b03d5c0071131a73685a19dd9ecfc51e7fb3f09"},"schema_version":"1.0","source":{"id":"0806.0280","kind":"arxiv","version":1}},"canonical_sha256":"8f6c75b625d773f4b10703728ca9f39536288e5e73713bdfebff9497711cccd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f6c75b625d773f4b10703728ca9f39536288e5e73713bdfebff9497711cccd1","first_computed_at":"2026-07-04T15:11:56.997212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:56.997212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oa9TQeIwqst76Cy/mY+N0Auc6Baz1i9NN6l1UkT5nSxJB2nhIhKYnVxJn0oayMX/AblFzNIfERTeG9OvM0njBA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:56.997611Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.0280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f666289ced05b493d8229b60ce6ec5dd95e26a8acfce2ab51841d94a0c798e13","sha256:e816a587ab6b25cada08871b3fc01a8fc288d8f66a5f91b834601680c542d711"],"state_sha256":"34f857c8d1afbdcd04e12c16679eef4886ce3ff5fcca8813cb5f6297863aeac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldHB5DsFFat3y9xpfkyO8CB80TV6sJdlr4fYknPjyARb5NL3DKx1sYLajcsvK5EBVYhh6bR/H/JsPtCK7+eIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:51:50.449280Z","bundle_sha256":"1ae9499d13ba960756a58b6f11c986103123cbf3740069f7747ab1b65d8542c6"}}