{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B7OH2L2BDPGD56N63HICRFFR2I","short_pith_number":"pith:B7OH2L2B","canonical_record":{"source":{"id":"1406.2111","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T09:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"14ac7fde8ab163cb455fdd084ee6137c06c8b0231a79506dd4275a00032a06a2","abstract_canon_sha256":"cb8413dcf1a2fdd529b2e052f017acbbabe72b81b19e2c0e79ff15c22bc02a93"},"schema_version":"1.0"},"canonical_sha256":"0fdc7d2f411bcc3ef9bed9d02894b1d2077ae27ba424739453b6cf8176b741e2","source":{"kind":"arxiv","id":"1406.2111","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B7OH2L2BDPGD56N63HICRFFR2I","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2111","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T09:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"14ac7fde8ab163cb455fdd084ee6137c06c8b0231a79506dd4275a00032a06a2","abstract_canon_sha256":"cb8413dcf1a2fdd529b2e052f017acbbabe72b81b19e2c0e79ff15c22bc02a93"},"schema_version":"1.0"},"canonical_sha256":"0fdc7d2f411bcc3ef9bed9d02894b1d2077ae27ba424739453b6cf8176b741e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:59.041517Z","signature_b64":"/NxJ6cJb/zGlgJQJt69GSWUY71SI2QAB8/2lzhG2fof4anu8mfooszCNGz0z98zYfSvoejnowalWlIrh5pbYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdc7d2f411bcc3ef9bed9d02894b1d2077ae27ba424739453b6cf8176b741e2","last_reissued_at":"2026-05-18T02:00:59.041004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:59.041004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2111","source_version":3,"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buavEviP85nS5lVGmaC2GHn0z0iSK0ycH9OInUZd+f1Lv75bisI1WBPC4IN0XmdpeNc3J4N9O15PDJ8m4CPNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:34:35.101045Z"},"content_sha256":"a08de1bb2a4fb520eb34a953e430add5d9f2f8e77393e862a496a5304bbf6545","schema_version":"1.0","event_id":"sha256:a08de1bb2a4fb520eb34a953e430add5d9f2f8e77393e862a496a5304bbf6545"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B7OH2L2BDPGD56N63HICRFFR2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On saturation games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alon Naor, Dan Hefetz, Michael Krivelevich, Milo\\v{s} Stojakovi\\'c","submitted_at":"2014-06-09T09:03:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2111","kind":"arxiv","version":3},"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwvwOvpsnS4j/H0G7kVSqNopcgAvHBLZ1b2G6udCq3b+W/rXfO/cs/KZP9unTcnC1PHJjZg1U7T6kPlWwC1mDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:34:35.101852Z"},"content_sha256":"cf04675447900c3e93d8105db8711cc8e17b7bf7f6d0b96ee17e3db1061dacaa","schema_version":"1.0","event_id":"sha256:cf04675447900c3e93d8105db8711cc8e17b7bf7f6d0b96ee17e3db1061dacaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7OH2L2BDPGD56N63HICRFFR2I/bundle.json","state_url":"https://pith.science/pith/B7OH2L2BDPGD56N63HICRFFR2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7OH2L2BDPGD56N63HICRFFR2I/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-05-24T00:34:35Z","links":{"resolver":"https://pith.science/pith/B7OH2L2BDPGD56N63HICRFFR2I","bundle":"https://pith.science/pith/B7OH2L2BDPGD56N63HICRFFR2I/bundle.json","state":"https://pith.science/pith/B7OH2L2BDPGD56N63HICRFFR2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7OH2L2BDPGD56N63HICRFFR2I/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etK57MQXLikiV1CyaolU+bvUrKLx3jfRJlaCTHweWcDbkjKypGYEIvFo0apX4LL/MJOJiSoXvHoQwYcQ3mvbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:34:35.107298Z","bundle_sha256":"c66af8adb37a295a2d0f4086e282aae5d4414315fc5a06b98b85ae07ea1dc093"}}