{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G2NQ4675XFVN2MJWZITM745MM3","short_pith_number":"pith:G2NQ4675","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"},"canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","source":{"kind":"arxiv","id":"1405.2834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2834","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2834v2","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2834","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"G2NQ4675XFVN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G2NQ4675XFVN2MJW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G2NQ4675","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G2NQ4675XFVN2MJWZITM745MM3","target":"record","payload":{"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"},"canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","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"},"source_kind":"arxiv","source_id":"1405.2834","source_version":2,"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-18T02:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RmeYzgkLUngxci9ddewNdOUvJMgJ86GF9K4VdmtDIK/wdzuV0rOjNCYViQpUAcUepnG6dsD4xDRX05zjq1NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:45:56.907362Z"},"content_sha256":"afb245f5e6daf1df0f250cbee173abd6f4494030ca00e16933f171f92845f229","schema_version":"1.0","event_id":"sha256:afb245f5e6daf1df0f250cbee173abd6f4494030ca00e16933f171f92845f229"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G2NQ4675XFVN2MJWZITM745MM3","target":"graph","payload":{"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"},"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-18T02:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mrF1BIv+NmFyecy7m9Jh4b71qKGnnJiQ2Z43Sqfza4hgzd9umqFSQ1PCKxg7nL0BpCNQSKsAfe9gPzZ+nBtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:45:56.907714Z"},"content_sha256":"25ea02e5904e65ccb18066ab8e4d1f842023b21e24e308b1dbb2243192669a5b","schema_version":"1.0","event_id":"sha256:25ea02e5904e65ccb18066ab8e4d1f842023b21e24e308b1dbb2243192669a5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/bundle.json","state_url":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2NQ4675XFVN2MJWZITM745MM3/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-06-02T15:45:56Z","links":{"resolver":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3","bundle":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/bundle.json","state":"https://pith.science/pith/G2NQ4675XFVN2MJWZITM745MM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2NQ4675XFVN2MJWZITM745MM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G2NQ4675XFVN2MJWZITM745MM3","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":"3f79435bcace9dce6da869b8ed64897e1f8aa353d5143ee7c76e914c575c5829","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-12T16:55:16Z","title_canon_sha256":"b56d4aa2fb81cb5f1fa9b4798eb7b497f3c1acac9398f4bff4cec679c9d91038"},"schema_version":"1.0","source":{"id":"1405.2834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2834","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2834v2","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2834","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"G2NQ4675XFVN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G2NQ4675XFVN2MJW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G2NQ4675","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:25ea02e5904e65ccb18066ab8e4d1f842023b21e24e308b1dbb2243192669a5b","target":"graph","created_at":"2026-05-18T02:49: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":"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","authors_text":"Benjamin Reiniger, Douglas B. West, James M. Carraher, William B. Kinnersley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-12T16:55:16Z","title":"The Game Saturation Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2834","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:afb245f5e6daf1df0f250cbee173abd6f4494030ca00e16933f171f92845f229","target":"record","created_at":"2026-05-18T02:49: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":"3f79435bcace9dce6da869b8ed64897e1f8aa353d5143ee7c76e914c575c5829","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-12T16:55:16Z","title_canon_sha256":"b56d4aa2fb81cb5f1fa9b4798eb7b497f3c1acac9398f4bff4cec679c9d91038"},"schema_version":"1.0","source":{"id":"1405.2834","kind":"arxiv","version":2}},"canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"369b0e7bfdb96add3136ca26cff3ac66e632e7e14be23848e22569b7df67f74f","first_computed_at":"2026-05-18T02:49:54.493680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:54.493680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhgwIY5ajalht6V0MQHi87/RUwfEwUnn/Yk6v8soDvmkJy346pdz//6CU/tq8rpnyPz9QWTDG/Q6p+y0IyQiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:54.494221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afb245f5e6daf1df0f250cbee173abd6f4494030ca00e16933f171f92845f229","sha256:25ea02e5904e65ccb18066ab8e4d1f842023b21e24e308b1dbb2243192669a5b"],"state_sha256":"ca5430b2bc5a004675d48e2e3301d4922ca5bb04f8300a980b720e4e230655ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4xtOi0aKyFTEHQkwCTySHqD31oZHMkuMlb+BXcA2kJjPsp1leBq2FcASUaD0pJJjprx/lA1rzt563QXvVxdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:45:56.909627Z","bundle_sha256":"3a83a722d8ed0323dc38e6b74b5660142a89ce0b56e24cfd650faa45f6f3dcee"}}