{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KZVV6KKQMUOXIBMEZZ4G26BBZL","short_pith_number":"pith:KZVV6KKQ","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"},"canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","source":{"kind":"arxiv","id":"1907.08477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08477","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08477v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08477","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"KZVV6KKQMUOX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KZVV6KKQMUOXIBME","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KZVV6KKQ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KZVV6KKQMUOXIBMEZZ4G26BBZL","target":"record","payload":{"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"},"canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","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"},"source_kind":"arxiv","source_id":"1907.08477","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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tcwXKXPrT7P0NpJdMXRTFL9KpNJuedidAkrCbeX6iI4lJbA5CaKsUHul4uVmR+Ar5aizfV+AHjwOG8gj4z1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:23:46.798587Z"},"content_sha256":"3b2c7ac8b4ec435898e4769442fd318db975d8cda32f304ea25ad8f50058aa4a","schema_version":"1.0","event_id":"sha256:3b2c7ac8b4ec435898e4769442fd318db975d8cda32f304ea25ad8f50058aa4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KZVV6KKQMUOXIBMEZZ4G26BBZL","target":"graph","payload":{"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"},"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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVWLcRs/fWsQcJRZX81jI9TXp1I1EqNU0uEgBOrdAKF6BRKmSV7YzVczfN0a8/278TQQCfS9aoROKt6ro5AvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:23:46.799196Z"},"content_sha256":"762a149b86306cc657b514a86f54594dcdc32755a4e9cae0d344930500aa13db","schema_version":"1.0","event_id":"sha256:762a149b86306cc657b514a86f54594dcdc32755a4e9cae0d344930500aa13db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/bundle.json","state_url":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/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-05-27T03:23:46Z","links":{"resolver":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL","bundle":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/bundle.json","state":"https://pith.science/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZVV6KKQMUOXIBMEZZ4G26BBZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KZVV6KKQMUOXIBMEZZ4G26BBZL","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":"f4c0a87391c2fc8e3c17dc0ecd77b5e826aa8cf879796722f5a5ea52a368ce99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-19T12:12:46Z","title_canon_sha256":"18387cc0135b26b70631c251db5ddcc3080ef538b54569d054b0fe59a22d2490"},"schema_version":"1.0","source":{"id":"1907.08477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08477","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08477v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08477","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"KZVV6KKQMUOX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KZVV6KKQMUOXIBME","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KZVV6KKQ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:762a149b86306cc657b514a86f54594dcdc32755a4e9cae0d344930500aa13db","target":"graph","created_at":"2026-05-17T23:40:09Z","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 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$.","authors_text":"Andrea Lucchini, Mariapia Moscatiello, Pablo Spiga","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-19T12:12:46Z","title":"A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08477","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:3b2c7ac8b4ec435898e4769442fd318db975d8cda32f304ea25ad8f50058aa4a","target":"record","created_at":"2026-05-17T23:40:09Z","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":"f4c0a87391c2fc8e3c17dc0ecd77b5e826aa8cf879796722f5a5ea52a368ce99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-19T12:12:46Z","title_canon_sha256":"18387cc0135b26b70631c251db5ddcc3080ef538b54569d054b0fe59a22d2490"},"schema_version":"1.0","source":{"id":"1907.08477","kind":"arxiv","version":1}},"canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"566b5f2950651d740584ce786d7821cadd97cd9c8d846ad6fab239002888bc32","first_computed_at":"2026-05-17T23:40:09.726780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:09.726780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p66r9E1dzSqgTLkKIjCwKfBkZPCInnioWtEnlTrVu1sMn5o5PxfmahIgD0HV8Q7Cf7GOqrE5q5I26/QyferaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:09.727505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b2c7ac8b4ec435898e4769442fd318db975d8cda32f304ea25ad8f50058aa4a","sha256:762a149b86306cc657b514a86f54594dcdc32755a4e9cae0d344930500aa13db"],"state_sha256":"9c38539e4ef568b4830d704cf3c7b68bffbe9f5f4646780e5bd21affb4fb56c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYbs8mPJwgOBxHnmdt6eH2vkNTWmW6e+aIwC+O2PLBp4nIOG6fMZoWHFli8lKr0WFCbNIpuy9o6tJSG0XUL8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:23:46.802358Z","bundle_sha256":"245fd91e2ba0d236cab92ac58e1733581eb2be1a098891ca8b119af5b3039eea"}}