{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:37CA3SUF2LGFR7MH4UO4LRIC2M","short_pith_number":"pith:37CA3SUF","schema_version":"1.0","canonical_sha256":"dfc40dca85d2cc58fd87e51dc5c502d32b18621f7177a216d3a8e08b75bf4bef","source":{"kind":"arxiv","id":"1401.4384","version":1},"attestation_state":"computed","paper":{"title":"On the threshold for the Maker-Breaker $H$-game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Milo\\v{s} Stojakovi\\'c, Rajko Nenadov","submitted_at":"2014-01-17T15:27:21Z","abstract_excerpt":"We study the Maker-Breaker $H$-game played on the edge set of the random graph $G_{n,p}$. In this game two players, Maker and Breaker, alternately claim unclaimed edges of $G_{n,p}$, until all the edges are claimed. Maker wins if he claims all the edges of a copy of a fixed graph $H$; Breaker wins otherwise. In this paper we show that, with the exception of trees and triangles, the threshold for an $H$-game is given by the threshold of the corresponding Ramsey property of $G_{n,p}$ with respect to the graph $H$."},"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":"1401.4384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T15:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"05edd4a58c362fd411b12b7837602aa6f80525280b761b366348bf2b28eb16d4","abstract_canon_sha256":"2df9b079bfc222224595af084eececa6a98f6c7ebc66b54cddef8854956a59b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:55.173572Z","signature_b64":"Lb6ytT7WgQajWmWnV5hd+zUJwN2lUJxQ5oPH2wadLaotcKepofbw4fTDQ2wEX/db2mI1f3jstPKU0mvg6GCtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc40dca85d2cc58fd87e51dc5c502d32b18621f7177a216d3a8e08b75bf4bef","last_reissued_at":"2026-05-18T03:01:55.173052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:55.173052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the threshold for the Maker-Breaker $H$-game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Milo\\v{s} Stojakovi\\'c, Rajko Nenadov","submitted_at":"2014-01-17T15:27:21Z","abstract_excerpt":"We study the Maker-Breaker $H$-game played on the edge set of the random graph $G_{n,p}$. In this game two players, Maker and Breaker, alternately claim unclaimed edges of $G_{n,p}$, until all the edges are claimed. Maker wins if he claims all the edges of a copy of a fixed graph $H$; Breaker wins otherwise. In this paper we show that, with the exception of trees and triangles, the threshold for an $H$-game is given by the threshold of the corresponding Ramsey property of $G_{n,p}$ with respect to the graph $H$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4384","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.4384","created_at":"2026-05-18T03:01:55.173118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4384v1","created_at":"2026-05-18T03:01:55.173118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4384","created_at":"2026-05-18T03:01:55.173118+00:00"},{"alias_kind":"pith_short_12","alias_value":"37CA3SUF2LGF","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"37CA3SUF2LGFR7MH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"37CA3SUF","created_at":"2026-05-18T12:28:11.866339+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/37CA3SUF2LGFR7MH4UO4LRIC2M","json":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M.json","graph_json":"https://pith.science/api/pith-number/37CA3SUF2LGFR7MH4UO4LRIC2M/graph.json","events_json":"https://pith.science/api/pith-number/37CA3SUF2LGFR7MH4UO4LRIC2M/events.json","paper":"https://pith.science/paper/37CA3SUF"},"agent_actions":{"view_html":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M","download_json":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M.json","view_paper":"https://pith.science/paper/37CA3SUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4384&json=true","fetch_graph":"https://pith.science/api/pith-number/37CA3SUF2LGFR7MH4UO4LRIC2M/graph.json","fetch_events":"https://pith.science/api/pith-number/37CA3SUF2LGFR7MH4UO4LRIC2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M/action/storage_attestation","attest_author":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M/action/author_attestation","sign_citation":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M/action/citation_signature","submit_replication":"https://pith.science/pith/37CA3SUF2LGFR7MH4UO4LRIC2M/action/replication_record"}},"created_at":"2026-05-18T03:01:55.173118+00:00","updated_at":"2026-05-18T03:01:55.173118+00:00"}