{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EIRSEQSK7D2STB5LMFK2CJX6WC","short_pith_number":"pith:EIRSEQSK","schema_version":"1.0","canonical_sha256":"222322424af8f52987ab6155a126feb0841f5dc264c04df4a21ca624e1b2d99f","source":{"kind":"arxiv","id":"1209.5123","version":1},"attestation_state":"computed","paper":{"title":"An n-in-a-row Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2012-09-23T23:03:45Z","abstract_excerpt":"The usual $n$-in-a-row game is a positional game in which two player alternately claim points in $\\bb{Z}^2$ with the winner being the first player to claim $n$ consecutive points in a line. We consider a variant of the game, suggested by Croft, where the number of points claimed increases by 1 each turn, and so on turn $t$ a player claims $t$ points. Croft asked how long it takes to win this game. We show that, perhaps surprisingly, the time needed to win this game is $(1-o(1))n$."},"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":"1209.5123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-23T23:03:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c87cb36b7ed9ac5c243ee218db84a8072fd96546c16a318e3569cefd5bf2b2dc","abstract_canon_sha256":"cae35b224174b4163b4995ecb5cc7e453afafb8d146ae99a73b733d6dcb685ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:59.152040Z","signature_b64":"ryTaljlLTATNRBa+CowttaPNhVKnlLwNdbL2Fz5ujS3OhKx4bq2bx2XdRqyiZSin4GGcan6TPOv0ykyE4h6eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"222322424af8f52987ab6155a126feb0841f5dc264c04df4a21ca624e1b2d99f","last_reissued_at":"2026-05-18T03:44:59.150951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:59.150951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An n-in-a-row Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2012-09-23T23:03:45Z","abstract_excerpt":"The usual $n$-in-a-row game is a positional game in which two player alternately claim points in $\\bb{Z}^2$ with the winner being the first player to claim $n$ consecutive points in a line. We consider a variant of the game, suggested by Croft, where the number of points claimed increases by 1 each turn, and so on turn $t$ a player claims $t$ points. Croft asked how long it takes to win this game. We show that, perhaps surprisingly, the time needed to win this game is $(1-o(1))n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5123","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":"1209.5123","created_at":"2026-05-18T03:44:59.151105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5123v1","created_at":"2026-05-18T03:44:59.151105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5123","created_at":"2026-05-18T03:44:59.151105+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIRSEQSK7D2S","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIRSEQSK7D2STB5L","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIRSEQSK","created_at":"2026-05-18T12:27:04.183437+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/EIRSEQSK7D2STB5LMFK2CJX6WC","json":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC.json","graph_json":"https://pith.science/api/pith-number/EIRSEQSK7D2STB5LMFK2CJX6WC/graph.json","events_json":"https://pith.science/api/pith-number/EIRSEQSK7D2STB5LMFK2CJX6WC/events.json","paper":"https://pith.science/paper/EIRSEQSK"},"agent_actions":{"view_html":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC","download_json":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC.json","view_paper":"https://pith.science/paper/EIRSEQSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5123&json=true","fetch_graph":"https://pith.science/api/pith-number/EIRSEQSK7D2STB5LMFK2CJX6WC/graph.json","fetch_events":"https://pith.science/api/pith-number/EIRSEQSK7D2STB5LMFK2CJX6WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC/action/storage_attestation","attest_author":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC/action/author_attestation","sign_citation":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC/action/citation_signature","submit_replication":"https://pith.science/pith/EIRSEQSK7D2STB5LMFK2CJX6WC/action/replication_record"}},"created_at":"2026-05-18T03:44:59.151105+00:00","updated_at":"2026-05-18T03:44:59.151105+00:00"}