{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YEL35V6MM2I4U3ZPTFRW7LVDZG","short_pith_number":"pith:YEL35V6M","schema_version":"1.0","canonical_sha256":"c117bed7cc6691ca6f2f99636faea3c998428816d4983467ad7a0f067aa1af3c","source":{"kind":"arxiv","id":"1803.03793","version":2},"attestation_state":"computed","paper":{"title":"The Maker-Breaker Rado game on a random set of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert Hancock","submitted_at":"2018-03-10T11:34:09Z","abstract_excerpt":"Given an integer-valued matrix $A$ of dimension $\\ell \\times k$ and an integer-valued vector $b$ of dimension $\\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously unclaimed integers from $X$, and Maker's aim is to obtain a solution to the system $Ax=b$, whereas Breaker's aim is to prevent this. When $X$ is a random subset of $\\{1,\\dots,n\\}$ where each number is included with probability $p$ independently of all others, we determine the threshold probability $p_0$ for when the game is Maker or Breaker's win, for a lar"},"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":"1803.03793","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-10T11:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"918c5e5a11fce9b37925941850fb92dc760b461f01d0f9a21e97af23bd20d8c9","abstract_canon_sha256":"bad68ec69f1b85284836f10deb11eff32ad6c1428e1f1723dcd5ef9311d7ec9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.688783Z","signature_b64":"rxaxicKVuaNJDDVds7/NCnGw6+SzcaIjiCz3Y5DzWbxwhJEwNyPQRI6Q7eD1J8YxA1LGrG4srP5tJXzYg7tWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c117bed7cc6691ca6f2f99636faea3c998428816d4983467ad7a0f067aa1af3c","last_reissued_at":"2026-05-17T23:59:44.688419Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.688419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Maker-Breaker Rado game on a random set of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert Hancock","submitted_at":"2018-03-10T11:34:09Z","abstract_excerpt":"Given an integer-valued matrix $A$ of dimension $\\ell \\times k$ and an integer-valued vector $b$ of dimension $\\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously unclaimed integers from $X$, and Maker's aim is to obtain a solution to the system $Ax=b$, whereas Breaker's aim is to prevent this. When $X$ is a random subset of $\\{1,\\dots,n\\}$ where each number is included with probability $p$ independently of all others, we determine the threshold probability $p_0$ for when the game is Maker or Breaker's win, for a lar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03793","kind":"arxiv","version":2},"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":"1803.03793","created_at":"2026-05-17T23:59:44.688474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03793v2","created_at":"2026-05-17T23:59:44.688474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03793","created_at":"2026-05-17T23:59:44.688474+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEL35V6MM2I4","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEL35V6MM2I4U3ZP","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEL35V6M","created_at":"2026-05-18T12:33:04.347982+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/YEL35V6MM2I4U3ZPTFRW7LVDZG","json":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG.json","graph_json":"https://pith.science/api/pith-number/YEL35V6MM2I4U3ZPTFRW7LVDZG/graph.json","events_json":"https://pith.science/api/pith-number/YEL35V6MM2I4U3ZPTFRW7LVDZG/events.json","paper":"https://pith.science/paper/YEL35V6M"},"agent_actions":{"view_html":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG","download_json":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG.json","view_paper":"https://pith.science/paper/YEL35V6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03793&json=true","fetch_graph":"https://pith.science/api/pith-number/YEL35V6MM2I4U3ZPTFRW7LVDZG/graph.json","fetch_events":"https://pith.science/api/pith-number/YEL35V6MM2I4U3ZPTFRW7LVDZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG/action/storage_attestation","attest_author":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG/action/author_attestation","sign_citation":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG/action/citation_signature","submit_replication":"https://pith.science/pith/YEL35V6MM2I4U3ZPTFRW7LVDZG/action/replication_record"}},"created_at":"2026-05-17T23:59:44.688474+00:00","updated_at":"2026-05-17T23:59:44.688474+00:00"}