{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S6R6TQQA4TU5UG3HMWPT4O56NN","short_pith_number":"pith:S6R6TQQA","canonical_record":{"source":{"id":"1707.07193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-22T16:46:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6261b4b773363caab47b9cbc4124c2cc19332456c1094ae5496dd5ca9343f6e","abstract_canon_sha256":"1867f4322bf04fc79197443b87df6c2304624dd62d22721d815284f5b7e6858b"},"schema_version":"1.0"},"canonical_sha256":"97a3e9c200e4e9da1b67659f3e3bbe6b620417ed458bce6c23e885d9fe7afb18","source":{"kind":"arxiv","id":"1707.07193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07193","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07193v1","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07193","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"S6R6TQQA4TU5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6R6TQQA4TU5UG3H","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6R6TQQA","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S6R6TQQA4TU5UG3HMWPT4O56NN","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-22T16:46:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6261b4b773363caab47b9cbc4124c2cc19332456c1094ae5496dd5ca9343f6e","abstract_canon_sha256":"1867f4322bf04fc79197443b87df6c2304624dd62d22721d815284f5b7e6858b"},"schema_version":"1.0"},"canonical_sha256":"97a3e9c200e4e9da1b67659f3e3bbe6b620417ed458bce6c23e885d9fe7afb18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:45.039924Z","signature_b64":"tEIaK8+1N9KZan1D9eIE6TU99YS3rU3aK1UZBIL2F4CFJc6yrx/L0rp+4iYttnngrK7QE09VwdSYdmwnxMElAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a3e9c200e4e9da1b67659f3e3bbe6b620417ed458bce6c23e885d9fe7afb18","last_reissued_at":"2026-05-18T00:39:45.039271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:45.039271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07193","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-18T00:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vq0n+UXhdbY6Iu2KYzkDYL0c49J1OiOUhc97rNn4CyGhDoxVglnJ5sivfJZSwOo7h38L+KANY8OeLCQ+JDjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:24:08.905223Z"},"content_sha256":"67618b6aa0021a7cda17d0eee1ece3b70ee3703e9339b0050ea6779ef1a0b227","schema_version":"1.0","event_id":"sha256:67618b6aa0021a7cda17d0eee1ece3b70ee3703e9339b0050ea6779ef1a0b227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S6R6TQQA4TU5UG3HMWPT4O56NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The expected number of elements to generate a finite group with $d$-generated Sylow subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Mariapia Moscatiello","submitted_at":"2017-07-22T16:46:26Z","abstract_excerpt":"Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then $e(G)\\leq d+\\kappa$ with $\\kappa \\sim 2.75239495.$ The number $\\kappa$ is explicitly described in terms of the Riemann zeta function and is best possible. If $G$ is a permutation group of degree $n,$ then either $G=S_3$ and $e(G)=2.9$ or $e(G)\\leq \\lfloor n/2\\rfloor+\\kappa^*$ with $\\kappa^* \\sim 1.606695.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07193","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-18T00:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7d0cFJnhG8QeATfSzZMTqt13cCflROI4AXbi2lPJQCtuwyaY9u8BaPi6V3hFWT8Pgw1NFBr6OPyhJNWFwCJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:24:08.905599Z"},"content_sha256":"9e37909d2ac0465b5580431afce2029349504a7d80d26d7cb063f49910b9d62f","schema_version":"1.0","event_id":"sha256:9e37909d2ac0465b5580431afce2029349504a7d80d26d7cb063f49910b9d62f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/bundle.json","state_url":"https://pith.science/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/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-28T14:24:08Z","links":{"resolver":"https://pith.science/pith/S6R6TQQA4TU5UG3HMWPT4O56NN","bundle":"https://pith.science/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/bundle.json","state":"https://pith.science/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6R6TQQA4TU5UG3HMWPT4O56NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S6R6TQQA4TU5UG3HMWPT4O56NN","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":"1867f4322bf04fc79197443b87df6c2304624dd62d22721d815284f5b7e6858b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-22T16:46:26Z","title_canon_sha256":"f6261b4b773363caab47b9cbc4124c2cc19332456c1094ae5496dd5ca9343f6e"},"schema_version":"1.0","source":{"id":"1707.07193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07193","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07193v1","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07193","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"S6R6TQQA4TU5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6R6TQQA4TU5UG3H","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6R6TQQA","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:9e37909d2ac0465b5580431afce2029349504a7d80d26d7cb063f49910b9d62f","target":"graph","created_at":"2026-05-18T00:39:45Z","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":"Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then $e(G)\\leq d+\\kappa$ with $\\kappa \\sim 2.75239495.$ The number $\\kappa$ is explicitly described in terms of the Riemann zeta function and is best possible. If $G$ is a permutation group of degree $n,$ then either $G=S_3$ and $e(G)=2.9$ or $e(G)\\leq \\lfloor n/2\\rfloor+\\kappa^*$ with $\\kappa^* \\sim 1.606695.$","authors_text":"Andrea Lucchini, Mariapia Moscatiello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-22T16:46:26Z","title":"The expected number of elements to generate a finite group with $d$-generated Sylow subgroups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07193","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:67618b6aa0021a7cda17d0eee1ece3b70ee3703e9339b0050ea6779ef1a0b227","target":"record","created_at":"2026-05-18T00:39:45Z","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":"1867f4322bf04fc79197443b87df6c2304624dd62d22721d815284f5b7e6858b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-22T16:46:26Z","title_canon_sha256":"f6261b4b773363caab47b9cbc4124c2cc19332456c1094ae5496dd5ca9343f6e"},"schema_version":"1.0","source":{"id":"1707.07193","kind":"arxiv","version":1}},"canonical_sha256":"97a3e9c200e4e9da1b67659f3e3bbe6b620417ed458bce6c23e885d9fe7afb18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97a3e9c200e4e9da1b67659f3e3bbe6b620417ed458bce6c23e885d9fe7afb18","first_computed_at":"2026-05-18T00:39:45.039271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:45.039271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tEIaK8+1N9KZan1D9eIE6TU99YS3rU3aK1UZBIL2F4CFJc6yrx/L0rp+4iYttnngrK7QE09VwdSYdmwnxMElAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:45.039924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67618b6aa0021a7cda17d0eee1ece3b70ee3703e9339b0050ea6779ef1a0b227","sha256:9e37909d2ac0465b5580431afce2029349504a7d80d26d7cb063f49910b9d62f"],"state_sha256":"4083524720d61b45695ae44c75461cea660816109de528be668d4d9b63ac8134"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/GLku3S0984PEc/lX64x/YjgiR/aiaodjHCwmmBkvsHoQnMCTub7VIrXTCgYF/YyxrjqXYr+0sQj92G1s9ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:24:08.907575Z","bundle_sha256":"408e67ff1d4d452aef843d62d0d15e33697ebbbcf188e532bfb8aeef7a478d11"}}