{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IZQWNXYLTCFI2FYMOAF5NW3ECU","short_pith_number":"pith:IZQWNXYL","canonical_record":{"source":{"id":"1211.7258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T14:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"7f67eb0e19c8f3cdede0f6de13956bbb4b51863c356a54407a23bc0310a916f8","abstract_canon_sha256":"66432f54bf25aefba839ae136b1f9adab51b788170bdb182b70b9e5e538fac75"},"schema_version":"1.0"},"canonical_sha256":"466166df0b988a8d170c700bd6db64150ab1a90f66b0600837be4f7c8eabf710","source":{"kind":"arxiv","id":"1211.7258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7258","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7258v2","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7258","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"IZQWNXYLTCFI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IZQWNXYLTCFI2FYM","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IZQWNXYL","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IZQWNXYLTCFI2FYMOAF5NW3ECU","target":"record","payload":{"canonical_record":{"source":{"id":"1211.7258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T14:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"7f67eb0e19c8f3cdede0f6de13956bbb4b51863c356a54407a23bc0310a916f8","abstract_canon_sha256":"66432f54bf25aefba839ae136b1f9adab51b788170bdb182b70b9e5e538fac75"},"schema_version":"1.0"},"canonical_sha256":"466166df0b988a8d170c700bd6db64150ab1a90f66b0600837be4f7c8eabf710","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.218239Z","signature_b64":"dAX6ijtWBXHuz29qJgv98M/Ra2ELqpi08ZHARW0gi7L1bsudxQH8exSe5ATKlA8nYW0KT+nnUQwzyZPRCHgLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"466166df0b988a8d170c700bd6db64150ab1a90f66b0600837be4f7c8eabf710","last_reissued_at":"2026-05-18T03:03:21.217741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.217741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.7258","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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIjLfb42NquGcPPydGXSN+iFj0sAstxnbNflv2DHGXnmGweIyM7B1YC1KJ605fGvaLZhYvgvQV4sTxCAnKXuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:05.166411Z"},"content_sha256":"dd8ad279307eb5b768481100b2c1e9704de32096ddbdf1cb385f1af6c570d1ba","schema_version":"1.0","event_id":"sha256:dd8ad279307eb5b768481100b2c1e9704de32096ddbdf1cb385f1af6c570d1ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IZQWNXYLTCFI2FYMOAF5NW3ECU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game saturation of intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Patkos, Mate Vizer","submitted_at":"2012-11-30T14:00:32Z","abstract_excerpt":"We consider the following combinatorial game: two players, Fast and Slow, claim $k$-element subsets of $[n]=\\{1,2,...,n\\}$ alternately, one at each turn, such that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed $k$-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone the game's end as long as possible. The game saturation number is the score of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7258","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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kCYM6lPxsaZ+myfZKjrZDYFyFUlI1CDXV60IblLADWczfIl7N/AiYOqTQtIUScHzlzhIRcbJVoHa6qjitkNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:05.167055Z"},"content_sha256":"f6d9946bfe9d04d14029d2d954a397fd6368facb89f7face0779ed4f1e0159e1","schema_version":"1.0","event_id":"sha256:f6d9946bfe9d04d14029d2d954a397fd6368facb89f7face0779ed4f1e0159e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/bundle.json","state_url":"https://pith.science/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/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-01T08:24:05Z","links":{"resolver":"https://pith.science/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU","bundle":"https://pith.science/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/bundle.json","state":"https://pith.science/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZQWNXYLTCFI2FYMOAF5NW3ECU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IZQWNXYLTCFI2FYMOAF5NW3ECU","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":"66432f54bf25aefba839ae136b1f9adab51b788170bdb182b70b9e5e538fac75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T14:00:32Z","title_canon_sha256":"7f67eb0e19c8f3cdede0f6de13956bbb4b51863c356a54407a23bc0310a916f8"},"schema_version":"1.0","source":{"id":"1211.7258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7258","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7258v2","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7258","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"IZQWNXYLTCFI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IZQWNXYLTCFI2FYM","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IZQWNXYL","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:f6d9946bfe9d04d14029d2d954a397fd6368facb89f7face0779ed4f1e0159e1","target":"graph","created_at":"2026-05-18T03:03:21Z","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":"We consider the following combinatorial game: two players, Fast and Slow, claim $k$-element subsets of $[n]=\\{1,2,...,n\\}$ alternately, one at each turn, such that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed $k$-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone the game's end as long as possible. The game saturation number is the score of the ","authors_text":"Balazs Patkos, Mate Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T14:00:32Z","title":"Game saturation of intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7258","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:dd8ad279307eb5b768481100b2c1e9704de32096ddbdf1cb385f1af6c570d1ba","target":"record","created_at":"2026-05-18T03:03:21Z","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":"66432f54bf25aefba839ae136b1f9adab51b788170bdb182b70b9e5e538fac75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T14:00:32Z","title_canon_sha256":"7f67eb0e19c8f3cdede0f6de13956bbb4b51863c356a54407a23bc0310a916f8"},"schema_version":"1.0","source":{"id":"1211.7258","kind":"arxiv","version":2}},"canonical_sha256":"466166df0b988a8d170c700bd6db64150ab1a90f66b0600837be4f7c8eabf710","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"466166df0b988a8d170c700bd6db64150ab1a90f66b0600837be4f7c8eabf710","first_computed_at":"2026-05-18T03:03:21.217741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.217741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAX6ijtWBXHuz29qJgv98M/Ra2ELqpi08ZHARW0gi7L1bsudxQH8exSe5ATKlA8nYW0KT+nnUQwzyZPRCHgLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.218239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.7258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd8ad279307eb5b768481100b2c1e9704de32096ddbdf1cb385f1af6c570d1ba","sha256:f6d9946bfe9d04d14029d2d954a397fd6368facb89f7face0779ed4f1e0159e1"],"state_sha256":"d2f4890323875b702b9e3cb2b6824c25a4762059f0d15da263ef650934f27635"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nGgDH0GdpN/q/0m+rfIH95FJshb//EyqgeCX7u0/pzc3hXB3i2XpCAtkhTV+Y/AussM4Xj9+F4OAiRBWLp0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:24:05.169915Z","bundle_sha256":"7ac0782da5eae5996860e6bb07f0b67a39f043f18d69ceb2882c0e2f302f6c07"}}