{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NUHRB5LV7ME2XUT4IIZBU65JCY","short_pith_number":"pith:NUHRB5LV","schema_version":"1.0","canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","source":{"kind":"arxiv","id":"1301.0282","version":1},"attestation_state":"computed","paper":{"title":"Component Games on Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alon Naor, Rani Hod","submitted_at":"2013-01-02T17:54:46Z","abstract_excerpt":"We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim is to not let him do so. For all values of Breaker's bias b, we determine whether Breaker wins (on any d-regular graph) or Maker wins (on almost every d-regular graph) and provide explicit winning strategies for both players.\n  To this end, we prove an extension of a theorem by Gallai-Hasse-Roy-Vitaver about graph orientations without long directed simple paths."},"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":"1301.0282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T17:54:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"056e67ffa085d4fb5684ef3b516179385e3db1dba903a4e59430833f35e9bce1","abstract_canon_sha256":"1e2f660d79974c6118d66a01d702ab3af6c46c2d9d70995f439d72ae968539e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:27.350454Z","signature_b64":"dGqtCu8l8yicRM2MhgK+S4Y/2GUB+pbKExAB+ZTwtD5y6W4edo0kYxMvOYAv8tU/G3ujWoQPRNm1KZg8MwPGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","last_reissued_at":"2026-05-18T03:37:27.349831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:27.349831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Component Games on Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alon Naor, Rani Hod","submitted_at":"2013-01-02T17:54:46Z","abstract_excerpt":"We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim is to not let him do so. For all values of Breaker's bias b, we determine whether Breaker wins (on any d-regular graph) or Maker wins (on almost every d-regular graph) and provide explicit winning strategies for both players.\n  To this end, we prove an extension of a theorem by Gallai-Hasse-Roy-Vitaver about graph orientations without long directed simple paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0282","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":"1301.0282","created_at":"2026-05-18T03:37:27.349914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0282v1","created_at":"2026-05-18T03:37:27.349914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0282","created_at":"2026-05-18T03:37:27.349914+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUHRB5LV7ME2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUHRB5LV7ME2XUT4","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUHRB5LV","created_at":"2026-05-18T12:27:52.871228+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/NUHRB5LV7ME2XUT4IIZBU65JCY","json":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY.json","graph_json":"https://pith.science/api/pith-number/NUHRB5LV7ME2XUT4IIZBU65JCY/graph.json","events_json":"https://pith.science/api/pith-number/NUHRB5LV7ME2XUT4IIZBU65JCY/events.json","paper":"https://pith.science/paper/NUHRB5LV"},"agent_actions":{"view_html":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY","download_json":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY.json","view_paper":"https://pith.science/paper/NUHRB5LV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0282&json=true","fetch_graph":"https://pith.science/api/pith-number/NUHRB5LV7ME2XUT4IIZBU65JCY/graph.json","fetch_events":"https://pith.science/api/pith-number/NUHRB5LV7ME2XUT4IIZBU65JCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/action/storage_attestation","attest_author":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/action/author_attestation","sign_citation":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/action/citation_signature","submit_replication":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/action/replication_record"}},"created_at":"2026-05-18T03:37:27.349914+00:00","updated_at":"2026-05-18T03:37:27.349914+00:00"}