{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G2NQ4675XFVN2MJWZITM745MM3","short_pith_number":"pith:G2NQ4675","schema_version":"1.0","canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","source":{"kind":"arxiv","id":"1405.2834","version":2},"attestation_state":"computed","paper":{"title":"The Game Saturation Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Douglas B. West, James M. Carraher, William B. Kinnersley","submitted_at":"2014-05-12T16:55:16Z","abstract_excerpt":"Given a family ${\\mathcal F}$ and a host graph $H$, a graph $G\\subseteq H$ is ${\\mathcal F}$-saturated relative to $H$ if no subgraph of $G$ lies in ${\\mathcal F}$ but adding any edge from $E(H)-E(G)$ to $G$ creates such a subgraph. In the ${\\mathcal F}$-saturation game on $H$, players Max and Min alternately add edges of $H$ to $G$, avoiding subgraphs in ${\\mathcal F}$, until $G$ becomes ${\\mathcal F}$-saturated relative to $H$. They aim to maximize or minimize the length of the game, respectively; $\\textrm{sat}_g({\\mathcal F};H)$ denotes the length under optimal play (when Max starts).\n  Let"},"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":"1405.2834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-12T16:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"b56d4aa2fb81cb5f1fa9b4798eb7b497f3c1acac9398f4bff4cec679c9d91038","abstract_canon_sha256":"3f79435bcace9dce6da869b8ed64897e1f8aa353d5143ee7c76e914c575c5829"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:54.494221Z","signature_b64":"PhgwIY5ajalht6V0MQHi87/RUwfEwUnn/Yk6v8soDvmkJy346pdz//6CU/tq8rpnyPz9QWTDG/Q6p+y0IyQiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","last_reissued_at":"2026-05-18T02:49:54.493680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:54.493680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Game Saturation Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Douglas B. West, James M. Carraher, William B. Kinnersley","submitted_at":"2014-05-12T16:55:16Z","abstract_excerpt":"Given a family ${\\mathcal F}$ and a host graph $H$, a graph $G\\subseteq H$ is ${\\mathcal F}$-saturated relative to $H$ if no subgraph of $G$ lies in ${\\mathcal F}$ but adding any edge from $E(H)-E(G)$ to $G$ creates such a subgraph. In the ${\\mathcal F}$-saturation game on $H$, players Max and Min alternately add edges of $H$ to $G$, avoiding subgraphs in ${\\mathcal F}$, until $G$ becomes ${\\mathcal F}$-saturated relative to $H$. They aim to maximize or minimize the length of the game, respectively; $\\textrm{sat}_g({\\mathcal F};H)$ denotes the length under optimal play (when Max starts).\n  Let"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2834","kind":"arxiv","version":2},"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":"1405.2834","created_at":"2026-05-18T02:49:54.493766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2834v2","created_at":"2026-05-18T02:49:54.493766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2834","created_at":"2026-05-18T02:49:54.493766+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2NQ4675XFVN","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2NQ4675XFVN2MJW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2NQ4675","created_at":"2026-05-18T12:28:28.263976+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/G2NQ4675XFVN2MJWZITM745MM3","json":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3.json","graph_json":"https://pith.science/api/pith-number/G2NQ4675XFVN2MJWZITM745MM3/graph.json","events_json":"https://pith.science/api/pith-number/G2NQ4675XFVN2MJWZITM745MM3/events.json","paper":"https://pith.science/paper/G2NQ4675"},"agent_actions":{"view_html":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3","download_json":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3.json","view_paper":"https://pith.science/paper/G2NQ4675","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2834&json=true","fetch_graph":"https://pith.science/api/pith-number/G2NQ4675XFVN2MJWZITM745MM3/graph.json","fetch_events":"https://pith.science/api/pith-number/G2NQ4675XFVN2MJWZITM745MM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/action/storage_attestation","attest_author":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/action/author_attestation","sign_citation":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/action/citation_signature","submit_replication":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/action/replication_record"}},"created_at":"2026-05-18T02:49:54.493766+00:00","updated_at":"2026-05-18T02:49:54.493766+00:00"}