{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NUHRB5LV7ME2XUT4IIZBU65JCY","short_pith_number":"pith:NUHRB5LV","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"},"canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","source":{"kind":"arxiv","id":"1301.0282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0282","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0282v1","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0282","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"pith_short_12","alias_value":"NUHRB5LV7ME2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NUHRB5LV7ME2XUT4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NUHRB5LV","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NUHRB5LV7ME2XUT4IIZBU65JCY","target":"record","payload":{"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"},"canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","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"},"source_kind":"arxiv","source_id":"1301.0282","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhNsqKhVzXDtrLAMzdzszAmOpN+hCNDuKnWVuwbRXvup0TC3JuQ7Wd0AI+k9bdlLblwIxrHN8gxZ+HwtvL62Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:16:38.293872Z"},"content_sha256":"031524b3a59e88e06529b6bf36f45a49bc639bf1b551690d1dc1bd7b5eed5ae7","schema_version":"1.0","event_id":"sha256:031524b3a59e88e06529b6bf36f45a49bc639bf1b551690d1dc1bd7b5eed5ae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NUHRB5LV7ME2XUT4IIZBU65JCY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYNgvj0hz2wxm9hOiNNbW2vgFlp3j54QqZbBXPB8aLf9zscunDCjLywrojtE2LacvThCYjV4zPUMGKkY49u0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:16:38.294560Z"},"content_sha256":"35a82321a0f5f80d1ec225dc8bbb77f7aaffee67a5fe90721b2924d63570a716","schema_version":"1.0","event_id":"sha256:35a82321a0f5f80d1ec225dc8bbb77f7aaffee67a5fe90721b2924d63570a716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/bundle.json","state_url":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T20:16:38Z","links":{"resolver":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY","bundle":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/bundle.json","state":"https://pith.science/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUHRB5LV7ME2XUT4IIZBU65JCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NUHRB5LV7ME2XUT4IIZBU65JCY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1e2f660d79974c6118d66a01d702ab3af6c46c2d9d70995f439d72ae968539e0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T17:54:46Z","title_canon_sha256":"056e67ffa085d4fb5684ef3b516179385e3db1dba903a4e59430833f35e9bce1"},"schema_version":"1.0","source":{"id":"1301.0282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0282","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0282v1","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0282","created_at":"2026-05-18T03:37:27Z"},{"alias_kind":"pith_short_12","alias_value":"NUHRB5LV7ME2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NUHRB5LV7ME2XUT4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NUHRB5LV","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:35a82321a0f5f80d1ec225dc8bbb77f7aaffee67a5fe90721b2924d63570a716","target":"graph","created_at":"2026-05-18T03:37:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alon Naor, Rani Hod","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T17:54:46Z","title":"Component Games on Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0282","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:031524b3a59e88e06529b6bf36f45a49bc639bf1b551690d1dc1bd7b5eed5ae7","target":"record","created_at":"2026-05-18T03:37:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1e2f660d79974c6118d66a01d702ab3af6c46c2d9d70995f439d72ae968539e0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T17:54:46Z","title_canon_sha256":"056e67ffa085d4fb5684ef3b516179385e3db1dba903a4e59430833f35e9bce1"},"schema_version":"1.0","source":{"id":"1301.0282","kind":"arxiv","version":1}},"canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d0f10f575fb09abd27c42321a7ba9161cc32ae4aa3d0c035337b69ba44b19ae","first_computed_at":"2026-05-18T03:37:27.349831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:27.349831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGqtCu8l8yicRM2MhgK+S4Y/2GUB+pbKExAB+ZTwtD5y6W4edo0kYxMvOYAv8tU/G3ujWoQPRNm1KZg8MwPGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:27.350454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:031524b3a59e88e06529b6bf36f45a49bc639bf1b551690d1dc1bd7b5eed5ae7","sha256:35a82321a0f5f80d1ec225dc8bbb77f7aaffee67a5fe90721b2924d63570a716"],"state_sha256":"76d8b574cca21c24073c9d70ed033bd308ac26d24a158eedc8be1b22758be2f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF8LbqRlVxSWqZvZ7HvWDSN2Tia0MFbWfSYlpbYzYhD6i491cNqRIM2v3vS5UcgOS4J2FtndD4oySy2UFsQeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:16:38.298205Z","bundle_sha256":"29c5c6b24398299d2118c4fba3a1ad1dcc4f9cb803f8f9ab207476a5d3cd367c"}}