{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KZVV6KKQMUOXIBMEZZ4G26BBZL","short_pith_number":"pith:KZVV6KKQ","schema_version":"1.0","canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","source":{"kind":"arxiv","id":"1907.08477","version":1},"attestation_state":"computed","paper":{"title":"A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Mariapia Moscatiello, Pablo Spiga","submitted_at":"2019-07-19T12:12:46Z","abstract_excerpt":"We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of degree $n$ has at most $an^{3/2}$ maximal systems of imprimitivity. When $G$ is soluble, generalizing a classic result of Tim Wall, we prove a much stroger bound, that is, the number of maximal subgroups of $G$ containing $H$ is at most $|G:H|-1$."},"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":"1907.08477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-19T12:12:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"18387cc0135b26b70631c251db5ddcc3080ef538b54569d054b0fe59a22d2490","abstract_canon_sha256":"f4c0a87391c2fc8e3c17dc0ecd77b5e826aa8cf879796722f5a5ea52a368ce99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.727505Z","signature_b64":"p66r9E1dzSqgTLkKIjCwKfBkZPCInnioWtEnlTrVu1sMn5o5PxfmahIgD0HV8Q7Cf7GOqrE5q5I26/QyferaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","last_reissued_at":"2026-05-17T23:40:09.726780Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.726780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Mariapia Moscatiello, Pablo Spiga","submitted_at":"2019-07-19T12:12:46Z","abstract_excerpt":"We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of degree $n$ has at most $an^{3/2}$ maximal systems of imprimitivity. When $G$ is soluble, generalizing a classic result of Tim Wall, we prove a much stroger bound, that is, the number of maximal subgroups of $G$ containing $H$ is at most $|G:H|-1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08477","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":"1907.08477","created_at":"2026-05-17T23:40:09.726899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08477v1","created_at":"2026-05-17T23:40:09.726899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08477","created_at":"2026-05-17T23:40:09.726899+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZVV6KKQMUOX","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZVV6KKQMUOXIBME","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZVV6KKQ","created_at":"2026-05-18T12:33:21.387695+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/KZVV6KKQMUOXIBMEZZ4G26BBZL","json":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL.json","graph_json":"https://pith.science/api/pith-number/KZVV6KKQMUOXIBMEZZ4G26BBZL/graph.json","events_json":"https://pith.science/api/pith-number/KZVV6KKQMUOXIBMEZZ4G26BBZL/events.json","paper":"https://pith.science/paper/KZVV6KKQ"},"agent_actions":{"view_html":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL","download_json":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL.json","view_paper":"https://pith.science/paper/KZVV6KKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08477&json=true","fetch_graph":"https://pith.science/api/pith-number/KZVV6KKQMUOXIBMEZZ4G26BBZL/graph.json","fetch_events":"https://pith.science/api/pith-number/KZVV6KKQMUOXIBMEZZ4G26BBZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/action/storage_attestation","attest_author":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/action/author_attestation","sign_citation":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/action/citation_signature","submit_replication":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/action/replication_record"}},"created_at":"2026-05-17T23:40:09.726899+00:00","updated_at":"2026-05-17T23:40:09.726899+00:00"}