{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M3TS4MSL7FQUKCG3AQ5MJ6VFYF","short_pith_number":"pith:M3TS4MSL","canonical_record":{"source":{"id":"1603.09715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2016-03-31T18:50:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e4d71763d6eb90e130fa7f5e0bcd26961a2b7531dc86e6850c732e57a3a8d3e3","abstract_canon_sha256":"0c2beb9c9185555fb3825eb3725cc0fd98b7a7ed976de75a0757c2d0a2c0a86d"},"schema_version":"1.0"},"canonical_sha256":"66e72e324bf9614508db043ac4faa5c159b53135b0c5197fd7cf81a6f995193e","source":{"kind":"arxiv","id":"1603.09715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09715","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09715v1","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09715","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"M3TS4MSL7FQU","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3TS4MSL7FQUKCG3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3TS4MSL","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M3TS4MSL7FQUKCG3AQ5MJ6VFYF","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2016-03-31T18:50:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e4d71763d6eb90e130fa7f5e0bcd26961a2b7531dc86e6850c732e57a3a8d3e3","abstract_canon_sha256":"0c2beb9c9185555fb3825eb3725cc0fd98b7a7ed976de75a0757c2d0a2c0a86d"},"schema_version":"1.0"},"canonical_sha256":"66e72e324bf9614508db043ac4faa5c159b53135b0c5197fd7cf81a6f995193e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:57.847632Z","signature_b64":"iKxUKpNOWrcOQtrS7SRLgZ7QANQfQbuc6JeoDgUGLpRj5XOAG7MOYERuKDxcPYZ06Mff1xdVh2k4VNKIdFhYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e72e324bf9614508db043ac4faa5c159b53135b0c5197fd7cf81a6f995193e","last_reissued_at":"2026-05-18T01:17:57.846916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:57.846916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09715","source_version":1,"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-18T01:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSH8AQ+bjyUEPSLEMkVjoiGHLnrRrGUni7bzDhBLuuSVRuPLqUaJMeFFBchq11dtwop9o0NmvARY0qaIr3sPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:51:10.591989Z"},"content_sha256":"e47358e3a5fb7d5e391399e555c2ac4b4312c2265e8ab58c492be03d91602481","schema_version":"1.0","event_id":"sha256:e47358e3a5fb7d5e391399e555c2ac4b4312c2265e8ab58c492be03d91602481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M3TS4MSL7FQUKCG3AQ5MJ6VFYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selective game versions of countable tightness with bounded finite selections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GN","authors_text":"Angelo Bella, Leandro F. Aurichi, Rodrigo R. Dias","submitted_at":"2016-03-31T18:50:22Z","abstract_excerpt":"For a topological space $X$ and a point $x \\in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\\in\\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then the second player picks a point $a_n\\in A_n$; the second player is the winner if and only if $x\\in\\overline{\\{a_n:n\\in\\omega\\}}$.\n  In this work, we study variations of this game in which the second player is allowed to choose finitely many points per inning rather than one, but in which the number of points they are allowed to choose in each inning has been"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09715","kind":"arxiv","version":1},"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-18T01:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpbDr8pecWpQNfRBQKaRV2bJfjge/Vw4PF+kfrkzJ9D9wbtpOuu6C/W/msu6aeAdcUOseYsaIAkZQnIDD2r/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:51:10.592352Z"},"content_sha256":"9b0bf32cfd7d16d9df2ae0ddf95594a9646bb1ff623d4da1f48b68413c970a39","schema_version":"1.0","event_id":"sha256:9b0bf32cfd7d16d9df2ae0ddf95594a9646bb1ff623d4da1f48b68413c970a39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/bundle.json","state_url":"https://pith.science/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/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-01T06:51:10Z","links":{"resolver":"https://pith.science/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF","bundle":"https://pith.science/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/bundle.json","state":"https://pith.science/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3TS4MSL7FQUKCG3AQ5MJ6VFYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M3TS4MSL7FQUKCG3AQ5MJ6VFYF","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":"0c2beb9c9185555fb3825eb3725cc0fd98b7a7ed976de75a0757c2d0a2c0a86d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2016-03-31T18:50:22Z","title_canon_sha256":"e4d71763d6eb90e130fa7f5e0bcd26961a2b7531dc86e6850c732e57a3a8d3e3"},"schema_version":"1.0","source":{"id":"1603.09715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09715","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09715v1","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09715","created_at":"2026-05-18T01:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"M3TS4MSL7FQU","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3TS4MSL7FQUKCG3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3TS4MSL","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:9b0bf32cfd7d16d9df2ae0ddf95594a9646bb1ff623d4da1f48b68413c970a39","target":"graph","created_at":"2026-05-18T01:17:57Z","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":"For a topological space $X$ and a point $x \\in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\\in\\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then the second player picks a point $a_n\\in A_n$; the second player is the winner if and only if $x\\in\\overline{\\{a_n:n\\in\\omega\\}}$.\n  In this work, we study variations of this game in which the second player is allowed to choose finitely many points per inning rather than one, but in which the number of points they are allowed to choose in each inning has been","authors_text":"Angelo Bella, Leandro F. Aurichi, Rodrigo R. Dias","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2016-03-31T18:50:22Z","title":"Selective game versions of countable tightness with bounded finite selections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09715","kind":"arxiv","version":1},"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:e47358e3a5fb7d5e391399e555c2ac4b4312c2265e8ab58c492be03d91602481","target":"record","created_at":"2026-05-18T01:17:57Z","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":"0c2beb9c9185555fb3825eb3725cc0fd98b7a7ed976de75a0757c2d0a2c0a86d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2016-03-31T18:50:22Z","title_canon_sha256":"e4d71763d6eb90e130fa7f5e0bcd26961a2b7531dc86e6850c732e57a3a8d3e3"},"schema_version":"1.0","source":{"id":"1603.09715","kind":"arxiv","version":1}},"canonical_sha256":"66e72e324bf9614508db043ac4faa5c159b53135b0c5197fd7cf81a6f995193e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66e72e324bf9614508db043ac4faa5c159b53135b0c5197fd7cf81a6f995193e","first_computed_at":"2026-05-18T01:17:57.846916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:57.846916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKxUKpNOWrcOQtrS7SRLgZ7QANQfQbuc6JeoDgUGLpRj5XOAG7MOYERuKDxcPYZ06Mff1xdVh2k4VNKIdFhYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:57.847632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47358e3a5fb7d5e391399e555c2ac4b4312c2265e8ab58c492be03d91602481","sha256:9b0bf32cfd7d16d9df2ae0ddf95594a9646bb1ff623d4da1f48b68413c970a39"],"state_sha256":"46581ae3dbff643a5302d3e9e4711bd878e048786991a582626f1a35ec82a7f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z39YlRxp8QALF8PRdIGRdQzHR/ZxlUlS0IIEvmeYU0jbxFEMBuwCHPO1KT96vgD5SMs4xQ6MxEexq+Iz5sV/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:51:10.594476Z","bundle_sha256":"2f80712e05aaa4536a3b8b84180cf68450bf146c02413e4f150db3d2711f47f0"}}