{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E4FOPLCULYNQ3GB75JHSEUVAWX","short_pith_number":"pith:E4FOPLCU","schema_version":"1.0","canonical_sha256":"270ae7ac545e1b0d983fea4f2252a0b5c49bdefc6a625cfb88ae5eab36d3377b","source":{"kind":"arxiv","id":"1302.2555","version":3},"attestation_state":"computed","paper":{"title":"Avoider-Enforcer star games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alon Naor, Andrzej Grzesik, Bal\\'azs Patk\\'os, Fiona Skerman, Mirjana Mikala\\v{c}ki, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2013-02-11T18:06:22Z","abstract_excerpt":"In this paper, we study $(1 : b)$ Avoider-Enforcer games played on the edge set of the complete graph on $n$ vertices. For every constant $k\\geq 3$ we analyse the $k$-star game, where Avoider tries to avoid claiming $k$ edges incident to the same vertex. We analyse both versions of Avoider-Enforcer games -- the strict and the monotone -- and for each provide explicit winning strategies for both players. We determine the order of magnitude of the threshold biases $f^{mon}_\\mathcal{F}$, $f^-_\\mathcal{F}$ and $f^+_\\mathcal{F}$, where $\\mathcal{F}$ is the hypergraph of the game."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1302.2555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T18:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"ab92c3e15fc6fd61cc516b67bfdf3a08bca2cc57e759896b14f8d028722d99dc","abstract_canon_sha256":"22e77f0898031198afba9a62e130bdabb09dec1982c641370191e605defdd1f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.399818Z","signature_b64":"qlNsDsH1T03TWp2hzqqFbTERKh5oeQCxbOaL8c34Lp04e4b6k30O8BZUmiFJMqSIQClvfPNWsLoro8etMWQJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"270ae7ac545e1b0d983fea4f2252a0b5c49bdefc6a625cfb88ae5eab36d3377b","last_reissued_at":"2026-05-18T02:19:06.399248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.399248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoider-Enforcer star games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alon Naor, Andrzej Grzesik, Bal\\'azs Patk\\'os, Fiona Skerman, Mirjana Mikala\\v{c}ki, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2013-02-11T18:06:22Z","abstract_excerpt":"In this paper, we study $(1 : b)$ Avoider-Enforcer games played on the edge set of the complete graph on $n$ vertices. For every constant $k\\geq 3$ we analyse the $k$-star game, where Avoider tries to avoid claiming $k$ edges incident to the same vertex. We analyse both versions of Avoider-Enforcer games -- the strict and the monotone -- and for each provide explicit winning strategies for both players. We determine the order of magnitude of the threshold biases $f^{mon}_\\mathcal{F}$, $f^-_\\mathcal{F}$ and $f^+_\\mathcal{F}$, where $\\mathcal{F}$ is the hypergraph of the game."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2555","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2555","created_at":"2026-05-18T02:19:06.399341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2555v3","created_at":"2026-05-18T02:19:06.399341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2555","created_at":"2026-05-18T02:19:06.399341+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4FOPLCULYNQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4FOPLCULYNQ3GB7","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4FOPLCU","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX","json":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX.json","graph_json":"https://pith.science/api/pith-number/E4FOPLCULYNQ3GB75JHSEUVAWX/graph.json","events_json":"https://pith.science/api/pith-number/E4FOPLCULYNQ3GB75JHSEUVAWX/events.json","paper":"https://pith.science/paper/E4FOPLCU"},"agent_actions":{"view_html":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX","download_json":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX.json","view_paper":"https://pith.science/paper/E4FOPLCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2555&json=true","fetch_graph":"https://pith.science/api/pith-number/E4FOPLCULYNQ3GB75JHSEUVAWX/graph.json","fetch_events":"https://pith.science/api/pith-number/E4FOPLCULYNQ3GB75JHSEUVAWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX/action/storage_attestation","attest_author":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX/action/author_attestation","sign_citation":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX/action/citation_signature","submit_replication":"https://pith.science/pith/E4FOPLCULYNQ3GB75JHSEUVAWX/action/replication_record"}},"created_at":"2026-05-18T02:19:06.399341+00:00","updated_at":"2026-05-18T02:19:06.399341+00:00"}