{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B7OH2L2BDPGD56N63HICRFFR2I","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":"cb8413dcf1a2fdd529b2e052f017acbbabe72b81b19e2c0e79ff15c22bc02a93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T09:03:10Z","title_canon_sha256":"14ac7fde8ab163cb455fdd084ee6137c06c8b0231a79506dd4275a00032a06a2"},"schema_version":"1.0","source":{"id":"1406.2111","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2111","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2111v3","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2111","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"B7OH2L2BDPGD","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B7OH2L2BDPGD56N6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B7OH2L2B","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:cf04675447900c3e93d8105db8711cc8e17b7bf7f6d0b96ee17e3db1061dacaa","target":"graph","created_at":"2026-05-18T02:00:59Z","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":"A graph $G = (V,E)$ is said to be saturated with respect to a monotone increasing graph property ${\\mathcal P}$, if $G \\notin {\\mathcal P}$ but $G \\cup \\{e\\} \\in {\\mathcal P}$ for every $e \\in \\binom{V}{2} \\setminus E$. The saturation game $(n, {\\mathcal P})$ is played as follows. Two players, called Mini and Max, progressively build a graph $G \\subseteq K_n$, which does not satisfy ${\\mathcal P}$. Starting with the empty graph on $n$ vertices, the two players take turns adding edges $e \\in \\binom{V(K_n)}{2} \\setminus E(G)$, for which $G \\cup \\{e\\} \\notin {\\mathcal P}$, until no such edge exis","authors_text":"Alon Naor, Dan Hefetz, Michael Krivelevich, Milo\\v{s} Stojakovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T09:03:10Z","title":"On saturation games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2111","kind":"arxiv","version":3},"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:a08de1bb2a4fb520eb34a953e430add5d9f2f8e77393e862a496a5304bbf6545","target":"record","created_at":"2026-05-18T02:00:59Z","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":"cb8413dcf1a2fdd529b2e052f017acbbabe72b81b19e2c0e79ff15c22bc02a93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T09:03:10Z","title_canon_sha256":"14ac7fde8ab163cb455fdd084ee6137c06c8b0231a79506dd4275a00032a06a2"},"schema_version":"1.0","source":{"id":"1406.2111","kind":"arxiv","version":3}},"canonical_sha256":"0fdc7d2f411bcc3ef9bed9d02894b1d2077ae27ba424739453b6cf8176b741e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fdc7d2f411bcc3ef9bed9d02894b1d2077ae27ba424739453b6cf8176b741e2","first_computed_at":"2026-05-18T02:00:59.041004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:59.041004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NxJ6cJb/zGlgJQJt69GSWUY71SI2QAB8/2lzhG2fof4anu8mfooszCNGz0z98zYfSvoejnowalWlIrh5pbYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:59.041517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2111","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a08de1bb2a4fb520eb34a953e430add5d9f2f8e77393e862a496a5304bbf6545","sha256:cf04675447900c3e93d8105db8711cc8e17b7bf7f6d0b96ee17e3db1061dacaa"],"state_sha256":"bd66c24f04b544f0a831e640803f1850227d38b61f82603ecc63ec762aa4fe64"}