{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U6F4QU5XVGDOVKWTHUYT53ZUHC","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":"ebf10212138a0005eb216c494d7f8be91c8f6ce18706fa176463d1676fd0ad3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-02-20T08:28:59Z","title_canon_sha256":"a33400529bc5440328f7a41a3e1dc179859ae4edf31f2468981e41a6876906a2"},"schema_version":"1.0","source":{"id":"2402.12811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.12811","created_at":"2026-07-05T07:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.12811v1","created_at":"2026-07-05T07:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12811","created_at":"2026-07-05T07:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"U6F4QU5XVGDO","created_at":"2026-07-05T07:47:16Z"},{"alias_kind":"pith_short_16","alias_value":"U6F4QU5XVGDOVKWT","created_at":"2026-07-05T07:47:16Z"},{"alias_kind":"pith_short_8","alias_value":"U6F4QU5X","created_at":"2026-07-05T07:47:16Z"}],"graph_snapshots":[{"event_id":"sha256:aa86fcbb7e2d6f33c14b4651991cb320ff9d46ffac0006dc8613afdc4c934f69","target":"graph","created_at":"2026-07-05T07:47:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.12811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G$ and $k \\in \\mathbb{N}$, we introduce the following game played in $G$. Each round, Alice colours an uncoloured vertex of $G$ red, and then Bob colours one blue (if any remain). Once every vertex is coloured, Alice wins if there is a connected red component of order at least $k$, and otherwise, Bob wins. This is a Maker-Breaker version of the Largest Connected Subgraph game introduced in [Bensmail et al. The Largest Connected Subgraph Game. {\\it Algorithmica}, 84(9):2533--2555, 2022]. We want to compute $c_g(G)$, which is the maximum $k$ such that Alice wins in $G$, regardless","authors_text":"Fionn Mc Inerney, Foivos Fioravantes, Julien Bensmail, Nacim Oijid, Nicolas Nisse","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-02-20T08:28:59Z","title":"The Maker-Breaker Largest Connected Subgraph Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12811","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:21967d4bef1ffef4c3b1832adab3ade115a4fc08467258e0f65e3e9ab36caae6","target":"record","created_at":"2026-07-05T07:47:16Z","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":"ebf10212138a0005eb216c494d7f8be91c8f6ce18706fa176463d1676fd0ad3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-02-20T08:28:59Z","title_canon_sha256":"a33400529bc5440328f7a41a3e1dc179859ae4edf31f2468981e41a6876906a2"},"schema_version":"1.0","source":{"id":"2402.12811","kind":"arxiv","version":1}},"canonical_sha256":"a78bc853b7a986eaaad33d313eef3438b36af3c0d82865942a333ed8f4991a08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a78bc853b7a986eaaad33d313eef3438b36af3c0d82865942a333ed8f4991a08","first_computed_at":"2026-07-05T07:47:16.829417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:47:16.829417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YlSksvuGI2gPsHOiRRCTqoPdSOT2lrP+cvD0sX7Yhah6trfnjZ5YpAKMUMM2t0trdyKrcEiihs+jx9yJoxxDCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:47:16.829815Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.12811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21967d4bef1ffef4c3b1832adab3ade115a4fc08467258e0f65e3e9ab36caae6","sha256:aa86fcbb7e2d6f33c14b4651991cb320ff9d46ffac0006dc8613afdc4c934f69"],"state_sha256":"537cc2f11d65604a792a25839f3659ed0ddf2cf9124a5b65849ed61cd6323fe0"}