{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MUV4NPDRBQELNVOBUSNGVUTVKC","short_pith_number":"pith:MUV4NPDR","schema_version":"1.0","canonical_sha256":"652bc6bc710c08b6d5c1a49a6ad275509c29c3c3f6a66a10b62a1f512b1ce55e","source":{"kind":"arxiv","id":"1503.08467","version":1},"attestation_state":"computed","paper":{"title":"Selective strong screenability and a game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GN","authors_text":"Liljana Babinkostova, Marion Scheepers","submitted_at":"2015-03-29T18:07:59Z","abstract_excerpt":"Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify sufficient conditions for ONE to have a winning strategy, and necessary conditions for TWO to have a winning strategy in the selective strong screenability game"},"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":"1503.08467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2015-03-29T18:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"6a7470acdacebc0e1b333f1428aee83a28bc9501e5c225d6e034477754d789a8","abstract_canon_sha256":"30fee64199a50127784550f354a5e85b24d7f5231b6094a3de36d297e3351908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:01.712544Z","signature_b64":"KFDWK01HSI7m6wHIgW7TZctxZHym75lw/TrZhVNdlzLqq8v7M4skGMthk2ryIeVOM7V7f1yhlEwLTRhELsLAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652bc6bc710c08b6d5c1a49a6ad275509c29c3c3f6a66a10b62a1f512b1ce55e","last_reissued_at":"2026-05-18T02:20:01.711740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:01.711740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selective strong screenability and a game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GN","authors_text":"Liljana Babinkostova, Marion Scheepers","submitted_at":"2015-03-29T18:07:59Z","abstract_excerpt":"Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify sufficient conditions for ONE to have a winning strategy, and necessary conditions for TWO to have a winning strategy in the selective strong screenability game"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08467","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.08467","created_at":"2026-05-18T02:20:01.711870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08467v1","created_at":"2026-05-18T02:20:01.711870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08467","created_at":"2026-05-18T02:20:01.711870+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUV4NPDRBQEL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUV4NPDRBQELNVOB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUV4NPDR","created_at":"2026-05-18T12:29:32.376354+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/MUV4NPDRBQELNVOBUSNGVUTVKC","json":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC.json","graph_json":"https://pith.science/api/pith-number/MUV4NPDRBQELNVOBUSNGVUTVKC/graph.json","events_json":"https://pith.science/api/pith-number/MUV4NPDRBQELNVOBUSNGVUTVKC/events.json","paper":"https://pith.science/paper/MUV4NPDR"},"agent_actions":{"view_html":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC","download_json":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC.json","view_paper":"https://pith.science/paper/MUV4NPDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08467&json=true","fetch_graph":"https://pith.science/api/pith-number/MUV4NPDRBQELNVOBUSNGVUTVKC/graph.json","fetch_events":"https://pith.science/api/pith-number/MUV4NPDRBQELNVOBUSNGVUTVKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC/action/storage_attestation","attest_author":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC/action/author_attestation","sign_citation":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC/action/citation_signature","submit_replication":"https://pith.science/pith/MUV4NPDRBQELNVOBUSNGVUTVKC/action/replication_record"}},"created_at":"2026-05-18T02:20:01.711870+00:00","updated_at":"2026-05-18T02:20:01.711870+00:00"}