{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UFTV4IP2YZ4DA7R5NRSQYHXTCM","short_pith_number":"pith:UFTV4IP2","schema_version":"1.0","canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","source":{"kind":"arxiv","id":"1401.0489","version":1},"attestation_state":"computed","paper":{"title":"Element order versus minimal degree in permutation groups: an old lemma with new applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Akos Seress, L\\'aszl\\'o Babai","submitted_at":"2014-01-02T18:07:54Z","abstract_excerpt":"In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\\alpha}$ then some non-identity power of the permutation has support size less than $n/{\\alpha}$. The original version made an unnecessary additional assumption on the cycle structure of the permutation; the proof of the present cleaner version follows the original proof verbatim. Application areas include parallel and sequential algorithms for permutation groups, the diameter of C"},"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":"1401.0489","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"53144e24af30ba1e55c380dc2a1bea28887fb055e3ee9b820d95b56bd8c64f11","abstract_canon_sha256":"47911cfba57b6f0072c195185e26a58672ff50a2b11605187b5256ed660ed145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:23.088292Z","signature_b64":"imVj17XPqRUaPnPDzLeI6sjLKf6Ukx52/gIrcXvklGSegIpQI/LwIXMwO+U3cg3l2T76QNCH9/6T0s+et9QHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","last_reissued_at":"2026-05-18T03:03:23.087702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:23.087702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Element order versus minimal degree in permutation groups: an old lemma with new applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Akos Seress, L\\'aszl\\'o Babai","submitted_at":"2014-01-02T18:07:54Z","abstract_excerpt":"In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\\alpha}$ then some non-identity power of the permutation has support size less than $n/{\\alpha}$. The original version made an unnecessary additional assumption on the cycle structure of the permutation; the proof of the present cleaner version follows the original proof verbatim. Application areas include parallel and sequential algorithms for permutation groups, the diameter of C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0489","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":"1401.0489","created_at":"2026-05-18T03:03:23.087798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0489v1","created_at":"2026-05-18T03:03:23.087798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0489","created_at":"2026-05-18T03:03:23.087798+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFTV4IP2YZ4D","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFTV4IP2YZ4DA7R5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFTV4IP2","created_at":"2026-05-18T12:28:52.271510+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/UFTV4IP2YZ4DA7R5NRSQYHXTCM","json":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM.json","graph_json":"https://pith.science/api/pith-number/UFTV4IP2YZ4DA7R5NRSQYHXTCM/graph.json","events_json":"https://pith.science/api/pith-number/UFTV4IP2YZ4DA7R5NRSQYHXTCM/events.json","paper":"https://pith.science/paper/UFTV4IP2"},"agent_actions":{"view_html":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM","download_json":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM.json","view_paper":"https://pith.science/paper/UFTV4IP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0489&json=true","fetch_graph":"https://pith.science/api/pith-number/UFTV4IP2YZ4DA7R5NRSQYHXTCM/graph.json","fetch_events":"https://pith.science/api/pith-number/UFTV4IP2YZ4DA7R5NRSQYHXTCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/action/storage_attestation","attest_author":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/action/author_attestation","sign_citation":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/action/citation_signature","submit_replication":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/action/replication_record"}},"created_at":"2026-05-18T03:03:23.087798+00:00","updated_at":"2026-05-18T03:03:23.087798+00:00"}