{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YO3PMJJRSSH7XDROK6XCKQ2RPS","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":"2b1a24b51a0f473bff1f4b6c9b53a1148d0ef6067c15d86c9fd641ef47cbadc3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-09T19:32:10Z","title_canon_sha256":"766b53ba13fd3d4a16686e020d7e8c26aa63151734ccf98d02940940d03322dc"},"schema_version":"1.0","source":{"id":"1011.2178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2178","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2178v2","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2178","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"pith_short_12","alias_value":"YO3PMJJRSSH7","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YO3PMJJRSSH7XDRO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YO3PMJJR","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:3634dc6da367ac7fbbe5d34347797b7b146206596cbe2b68b5c6a8c7cb340292","target":"graph","created_at":"2026-05-18T04:19:54Z","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 Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.","authors_text":"Heidi Gebauer","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-09T19:32:10Z","title":"Maker Can Construct a Sparse Graph on a Small Board"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2178","kind":"arxiv","version":2},"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:7fbe1c42ca25b014e194a2d952dae6c0a89c8880620e0250bec7d62e843587ef","target":"record","created_at":"2026-05-18T04:19:54Z","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":"2b1a24b51a0f473bff1f4b6c9b53a1148d0ef6067c15d86c9fd641ef47cbadc3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-09T19:32:10Z","title_canon_sha256":"766b53ba13fd3d4a16686e020d7e8c26aa63151734ccf98d02940940d03322dc"},"schema_version":"1.0","source":{"id":"1011.2178","kind":"arxiv","version":2}},"canonical_sha256":"c3b6f62531948ffb8e2e57ae2543517c8ca88a0f64585b332afece68c5881d85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3b6f62531948ffb8e2e57ae2543517c8ca88a0f64585b332afece68c5881d85","first_computed_at":"2026-05-18T04:19:54.711979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:54.711979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EL+PpZu9/AP+A2ZE84NvNlbqAnHgqW5sHivBTzex1CoPcoMfw6PRQaPedNSFHQeGi9XEJNuruBSZXFWWm9rnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:54.712644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fbe1c42ca25b014e194a2d952dae6c0a89c8880620e0250bec7d62e843587ef","sha256:3634dc6da367ac7fbbe5d34347797b7b146206596cbe2b68b5c6a8c7cb340292"],"state_sha256":"6ff5fd023ada7f0e73de25ea22465ab2e3c8be67401bfe9b3571acfd060512e2"}