{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X2BYTBIAALJDTGZ3DGQLG36NAW","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":"e1b609f59ca54953d01aeb1b991cdaf16fd7bfa787b71021a88db8d00180b692","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-10-02T00:50:35Z","title_canon_sha256":"b41c6dc51c0b63c6e09867724eee6f21b48cebc5e9284cdb0e1768f6c01b6f99"},"schema_version":"1.0","source":{"id":"1710.00445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00445","created_at":"2026-05-18T00:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00445v2","created_at":"2026-05-18T00:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00445","created_at":"2026-05-18T00:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"X2BYTBIAALJD","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X2BYTBIAALJDTGZ3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X2BYTBIA","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:adb896e4fe322f12c5c2a02456885ac028cbc21e09483628d72587a42ec8f443","target":"graph","created_at":"2026-05-18T00:19:58Z","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":"In 2008, Borovik and Cherlin posed the problem of showing that the degree of generic transitivity of an infinite permutation group of finite Morley rank $(X,G)$ is at most $n+2$ where $n$ is the Morley rank of $X$. Moreover, they conjectured that the bound is only achieved (assuming transitivity) by $\\operatorname{PGL}_{n+1}(\\mathbb{F})$ acting naturally on projective $n$-space. We solve the problem under the two additional hypotheses that (1) $(X,G)$ is $2$-transitive, and (2) $(X-\\{x\\},G_x)$ has a definable quotient equivalent to $(\\mathbb{P}^{n-1}(\\mathbb{F}),\\operatorname{PGL}_{n}(\\mathbb{","authors_text":"Joshua Wiscons, Tuna Alt{\\i}nel","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-10-02T00:50:35Z","title":"Towards the recognition of $\\operatorname{PGL}_n$ via a high degree of generic transitivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00445","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:ddbce93c73f1564969f03c0e877c53bb228d5870cd814cb3b1101362bca16786","target":"record","created_at":"2026-05-18T00:19:58Z","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":"e1b609f59ca54953d01aeb1b991cdaf16fd7bfa787b71021a88db8d00180b692","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-10-02T00:50:35Z","title_canon_sha256":"b41c6dc51c0b63c6e09867724eee6f21b48cebc5e9284cdb0e1768f6c01b6f99"},"schema_version":"1.0","source":{"id":"1710.00445","kind":"arxiv","version":2}},"canonical_sha256":"be8389850002d2399b3b19a0b36fcd0592fed0f093aa7c04cb738b77c695f8d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be8389850002d2399b3b19a0b36fcd0592fed0f093aa7c04cb738b77c695f8d3","first_computed_at":"2026-05-18T00:19:58.900342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:58.900342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x53x2bTOBOEa5eF1jtcTVpv4r1HWMHDfgwN52yw9gKXILGaE2ASZ26ZXh6wVBpWcME1KCxnl1GH/8AA+hzUyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:58.900807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddbce93c73f1564969f03c0e877c53bb228d5870cd814cb3b1101362bca16786","sha256:adb896e4fe322f12c5c2a02456885ac028cbc21e09483628d72587a42ec8f443"],"state_sha256":"a617afeb81403607e5ea5726f33b9eb5e52ce2b09a18f912b035b3f83523c7a7"}